./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 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-numeric/Binomial.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF --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.1-dev-53f42b1 [2021-11-20 06:26:42,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 06:26:42,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 06:26:42,557 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 06:26:42,558 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 06:26:42,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 06:26:42,566 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 06:26:42,572 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 06:26:42,575 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 06:26:42,585 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 06:26:42,587 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 06:26:42,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 06:26:42,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 06:26:42,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 06:26:42,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 06:26:42,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 06:26:42,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 06:26:42,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 06:26:42,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 06:26:42,624 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 06:26:42,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 06:26:42,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 06:26:42,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 06:26:42,634 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 06:26:42,647 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 06:26:42,647 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 06:26:42,648 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 06:26:42,649 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 06:26:42,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 06:26:42,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 06:26:42,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 06:26:42,653 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 06:26:42,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 06:26:42,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 06:26:42,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 06:26:42,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 06:26:42,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 06:26:42,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 06:26:42,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 06:26:42,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 06:26:42,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 06:26:42,666 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-11-20 06:26:42,726 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 06:26:42,728 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 06:26:42,729 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 06:26:42,730 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 06:26:42,731 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 06:26:42,733 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 06:26:42,733 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 06:26:42,733 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-11-20 06:26:42,734 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-11-20 06:26:42,734 INFO L138 SettingsManager]: * Use old map elimination=false [2021-11-20 06:26:42,736 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-11-20 06:26:42,736 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-11-20 06:26:42,736 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-11-20 06:26:42,737 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 06:26:42,737 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-20 06:26:42,737 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 06:26:42,737 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 06:26:42,738 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-11-20 06:26:42,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-11-20 06:26:42,738 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-11-20 06:26:42,738 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 06:26:42,739 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-11-20 06:26:42,739 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 06:26:42,739 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-11-20 06:26:42,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 06:26:42,740 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 06:26:42,742 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 06:26:42,742 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 06:26:42,743 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 06:26:42,744 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-11-20 06:26:42,744 INFO L138 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_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/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_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF 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 [2021-11-20 06:26:43,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 06:26:43,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 06:26:43,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 06:26:43,142 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 06:26:43,142 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 06:26:43,144 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/termination-numeric/Binomial.c [2021-11-20 06:26:43,243 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/data/251b7080e/d48c284bec384e5e84ac5ee7770da179/FLAG160e53438 [2021-11-20 06:26:43,756 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 06:26:43,757 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/sv-benchmarks/c/termination-numeric/Binomial.c [2021-11-20 06:26:43,764 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/data/251b7080e/d48c284bec384e5e84ac5ee7770da179/FLAG160e53438 [2021-11-20 06:26:44,119 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/data/251b7080e/d48c284bec384e5e84ac5ee7770da179 [2021-11-20 06:26:44,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 06:26:44,124 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 06:26:44,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 06:26:44,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 06:26:44,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 06:26:44,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:26:44" (1/1) ... [2021-11-20 06:26:44,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cbac467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:44, skipping insertion in model container [2021-11-20 06:26:44,136 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:26:44" (1/1) ... [2021-11-20 06:26:44,146 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 06:26:44,161 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 06:26:44,364 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:26:44,375 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 06:26:44,389 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:26:44,405 INFO L208 MainTranslator]: Completed translation [2021-11-20 06:26:44,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:44 WrapperNode [2021-11-20 06:26:44,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 06:26:44,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 06:26:44,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 06:26:44,408 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 06:26:44,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:44" (1/1) ... [2021-11-20 06:26:44,425 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:44" (1/1) ... [2021-11-20 06:26:44,451 INFO L137 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2021-11-20 06:26:44,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 06:26:44,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 06:26:44,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 06:26:44,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 06:26:44,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:44" (1/1) ... [2021-11-20 06:26:44,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:44" (1/1) ... [2021-11-20 06:26:44,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:44" (1/1) ... [2021-11-20 06:26:44,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:44" (1/1) ... [2021-11-20 06:26:44,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:44" (1/1) ... [2021-11-20 06:26:44,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:44" (1/1) ... [2021-11-20 06:26:44,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:44" (1/1) ... [2021-11-20 06:26:44,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 06:26:44,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 06:26:44,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 06:26:44,478 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 06:26:44,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:44" (1/1) ... [2021-11-20 06:26:44,489 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:26:44,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:44,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:26:44,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-11-20 06:26:44,556 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2021-11-20 06:26:44,556 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2021-11-20 06:26:44,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 06:26:44,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 06:26:44,630 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 06:26:44,632 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 06:26:44,861 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 06:26:44,871 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 06:26:44,871 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-20 06:26:44,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:26:44 BoogieIcfgContainer [2021-11-20 06:26:44,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 06:26:44,875 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-11-20 06:26:44,875 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-11-20 06:26:44,880 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-11-20 06:26:44,881 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-20 06:26:44,881 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 06:26:44" (1/3) ... [2021-11-20 06:26:44,883 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13401e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 06:26:44, skipping insertion in model container [2021-11-20 06:26:44,883 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-20 06:26:44,884 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:44" (2/3) ... [2021-11-20 06:26:44,884 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13401e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 06:26:44, skipping insertion in model container [2021-11-20 06:26:44,884 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-20 06:26:44,885 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:26:44" (3/3) ... [2021-11-20 06:26:44,886 INFO L388 chiAutomizerObserver]: Analyzing ICFG Binomial.c [2021-11-20 06:26:44,961 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-11-20 06:26:44,961 INFO L360 BuchiCegarLoop]: Hoare is false [2021-11-20 06:26:44,961 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-11-20 06:26:44,962 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-11-20 06:26:44,962 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-11-20 06:26:44,962 INFO L364 BuchiCegarLoop]: Difference is false [2021-11-20 06:26:44,962 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-11-20 06:26:44,962 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-11-20 06:26:45,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 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) [2021-11-20 06:26:45,070 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2021-11-20 06:26:45,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:26:45,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:26:45,079 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-11-20 06:26:45,080 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-20 06:26:45,080 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-11-20 06:26:45,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 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) [2021-11-20 06:26:45,088 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2021-11-20 06:26:45,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:26:45,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:26:45,091 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-11-20 06:26:45,091 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-20 06:26:45,099 INFO L791 eck$LassoCheckResult]: Stem: 19#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 10#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 18#L35true assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 28#L38true assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 14#L41-3true [2021-11-20 06:26:45,100 INFO L793 eck$LassoCheckResult]: Loop: 14#L41-3true assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 23#L42-3true assume !(main_~k~0#1 <= main_~x~0#1); 15#L41-2true main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 14#L41-3true [2021-11-20 06:26:45,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:45,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 1 times [2021-11-20 06:26:45,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:45,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598580892] [2021-11-20 06:26:45,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:45,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:26:45,235 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:26:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:26:45,281 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:26:45,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:45,286 INFO L85 PathProgramCache]: Analyzing trace with hash 57812, now seen corresponding path program 1 times [2021-11-20 06:26:45,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:45,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432544564] [2021-11-20 06:26:45,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:45,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:26:45,309 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:26:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:26:45,333 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:26:45,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:45,340 INFO L85 PathProgramCache]: Analyzing trace with hash 553673357, now seen corresponding path program 1 times [2021-11-20 06:26:45,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:45,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516288235] [2021-11-20 06:26:45,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:45,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:45,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:26:45,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:26:45,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516288235] [2021-11-20 06:26:45,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516288235] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:26:45,477 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:26:45,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 06:26:45,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156572921] [2021-11-20 06:26:45,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:26:45,582 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:26:45,584 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:26:45,585 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:26:45,585 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:26:45,585 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-11-20 06:26:45,586 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:26:45,586 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:26:45,587 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:26:45,587 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2021-11-20 06:26:45,587 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:26:45,588 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:26:45,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:26:45,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:26:45,696 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:26:45,697 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-11-20 06:26:45,699 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:26:45,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:45,703 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:26:45,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-11-20 06:26:45,707 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:26:45,709 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:26:45,737 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:26:45,738 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: [] [2021-11-20 06:26:45,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-11-20 06:26:45,781 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:26:45,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:45,783 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:26:45,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-11-20 06:26:45,787 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:26:45,794 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:26:45,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-11-20 06:26:45,847 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:26:45,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:45,848 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:26:45,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-11-20 06:26:45,850 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-11-20 06:26:45,851 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:26:46,141 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-11-20 06:26:46,147 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2021-11-20 06:26:46,148 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:26:46,148 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:26:46,148 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:26:46,148 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:26:46,149 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-20 06:26:46,149 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:26:46,149 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:26:46,149 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:26:46,149 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2021-11-20 06:26:46,149 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:26:46,149 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:26:46,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:26:46,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:26:46,234 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:26:46,240 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-20 06:26:46,241 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:26:46,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:46,252 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:26:46,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-11-20 06:26:46,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:26:46,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:26:46,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:26:46,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:26:46,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:26:46,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:26:46,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:26:46,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:26:46,285 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:26:46,327 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-11-20 06:26:46,328 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:26:46,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:46,341 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:26:46,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:26:46,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:26:46,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:26:46,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:26:46,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:26:46,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:26:46,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:26:46,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:26:46,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-11-20 06:26:46,389 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-20 06:26:46,399 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-11-20 06:26:46,399 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2021-11-20 06:26:46,401 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:26:46,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:46,403 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:26:46,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-11-20 06:26:46,430 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-20 06:26:46,430 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-11-20 06:26:46,430 INFO L513 LassoAnalysis]: Proved termination. [2021-11-20 06:26:46,431 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 [] [2021-11-20 06:26:46,480 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2021-11-20 06:26:46,483 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-11-20 06:26:46,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:46,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 06:26:46,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:26:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:46,548 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-20 06:26:46,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:26:46,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:26:46,678 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-11-20 06:26:46,680 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 28 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 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 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-11-20 06:26:46,796 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 28 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 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 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 73 states and 106 transitions. Complement of second has 11 states. [2021-11-20 06:26:46,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-11-20 06:26:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-11-20 06:26:46,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2021-11-20 06:26:46,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 3 letters. [2021-11-20 06:26:46,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:26:46,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 7 letters. Loop has 3 letters. [2021-11-20 06:26:46,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:26:46,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 6 letters. [2021-11-20 06:26:46,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:26:46,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 106 transitions. [2021-11-20 06:26:46,856 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2021-11-20 06:26:46,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 33 states and 48 transitions. [2021-11-20 06:26:46,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-11-20 06:26:46,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-11-20 06:26:46,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 48 transitions. [2021-11-20 06:26:46,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:26:46,868 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 48 transitions. [2021-11-20 06:26:46,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 48 transitions. [2021-11-20 06:26:46,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2021-11-20 06:26:46,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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) [2021-11-20 06:26:46,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2021-11-20 06:26:46,906 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 42 transitions. [2021-11-20 06:26:46,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:26:46,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 06:26:46,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 06:26:46,911 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-11-20 06:26:46,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:26:46,979 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2021-11-20 06:26:46,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 06:26:46,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2021-11-20 06:26:46,984 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2021-11-20 06:26:46,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 37 transitions. [2021-11-20 06:26:46,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-11-20 06:26:46,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2021-11-20 06:26:46,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2021-11-20 06:26:46,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:26:46,988 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-11-20 06:26:46,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2021-11-20 06:26:46,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2021-11-20 06:26:46,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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) [2021-11-20 06:26:46,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2021-11-20 06:26:46,994 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2021-11-20 06:26:46,994 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2021-11-20 06:26:46,994 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-11-20 06:26:46,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2021-11-20 06:26:46,996 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2021-11-20 06:26:46,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:26:46,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:26:46,998 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-11-20 06:26:46,998 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:26:46,998 INFO L791 eck$LassoCheckResult]: Stem: 242#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 233#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 234#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 241#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 237#L41-3 [2021-11-20 06:26:46,999 INFO L793 eck$LassoCheckResult]: Loop: 237#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 238#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 243#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; 224#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 220#factENTRY ~n := #in~n; 232#L25 assume ~n <= 0;#res := 1; 231#factFINAL assume true; 221#factEXIT >#68#return; 226#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 220#factENTRY ~n := #in~n; 232#L25 assume ~n <= 0;#res := 1; 231#factFINAL assume true; 221#factEXIT >#70#return; 222#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 220#factENTRY ~n := #in~n; 232#L25 assume ~n <= 0;#res := 1; 231#factFINAL assume true; 221#factEXIT >#72#return; 228#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; 239#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 236#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 244#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 240#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 237#L41-3 [2021-11-20 06:26:46,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:47,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 2 times [2021-11-20 06:26:47,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:47,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727850663] [2021-11-20 06:26:47,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:47,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:26:47,006 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:26:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:26:47,012 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:26:47,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:47,013 INFO L85 PathProgramCache]: Analyzing trace with hash -743603515, now seen corresponding path program 1 times [2021-11-20 06:26:47,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:47,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017380567] [2021-11-20 06:26:47,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:47,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:47,032 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:26:47,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [162712351] [2021-11-20 06:26:47,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:47,033 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:26:47,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:47,035 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:26:47,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-20 06:26:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:26:47,097 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:26:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:26:47,119 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:26:47,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:47,120 INFO L85 PathProgramCache]: Analyzing trace with hash 343305470, now seen corresponding path program 1 times [2021-11-20 06:26:47,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:47,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265697355] [2021-11-20 06:26:47,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:47,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:47,137 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:26:47,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [710988335] [2021-11-20 06:26:47,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:47,143 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:26:47,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:47,157 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:26:47,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-20 06:26:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:26:47,201 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:26:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:26:47,234 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:26:47,871 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:26:47,872 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:26:47,873 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:26:47,873 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:26:47,877 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-11-20 06:26:47,877 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:26:47,877 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:26:47,877 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:26:47,878 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration2_Loop [2021-11-20 06:26:47,878 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:26:47,878 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:26:47,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:26:47,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:26:47,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:26:47,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:26:47,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-11-20 06:26:47,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:26:47,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:26:47,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:26:47,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:26:48,094 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:26:48,094 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-11-20 06:26:48,095 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:26:48,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:48,096 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:26:48,102 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:26:48,102 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:26:48,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-11-20 06:26:48,114 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:26:48,114 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: [] [2021-11-20 06:26:48,155 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-11-20 06:26:48,155 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:26:48,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:48,156 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:26:48,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-11-20 06:26:48,160 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:26:48,160 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:26:48,179 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:26:48,179 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: [] [2021-11-20 06:26:48,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-11-20 06:26:48,207 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:26:48,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:48,209 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:26:48,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-11-20 06:26:48,214 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:26:48,214 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:26:48,223 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:26:48,223 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: [] [2021-11-20 06:26:48,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-11-20 06:26:48,245 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:26:48,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:48,247 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:26:48,248 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:26:48,248 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:26:48,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-11-20 06:26:48,258 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:26:48,258 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: [] [2021-11-20 06:26:48,282 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-11-20 06:26:48,282 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:26:48,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:48,284 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:26:48,286 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:26:48,286 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:26:48,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-11-20 06:26:48,296 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:26:48,296 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: [] [2021-11-20 06:26:48,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-11-20 06:26:48,325 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:26:48,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:48,326 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:26:48,328 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:26:48,328 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:26:48,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-11-20 06:26:48,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-11-20 06:26:48,409 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:26:48,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:48,410 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:26:48,417 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-11-20 06:26:48,417 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:26:48,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-11-20 06:26:49,033 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-11-20 06:26:49,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-11-20 06:26:49,038 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:26:49,038 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:26:49,038 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:26:49,038 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:26:49,038 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-20 06:26:49,039 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:26:49,039 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:26:49,039 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:26:49,039 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration2_Loop [2021-11-20 06:26:49,039 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:26:49,039 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:26:49,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:26:49,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:26:49,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:26:49,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:26:49,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:26:49,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:26:49,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:26:49,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:26:49,187 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:26:49,187 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-20 06:26:49,187 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:26:49,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:49,188 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:26:49,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-11-20 06:26:49,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:26:49,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:26:49,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:26:49,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:26:49,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:26:49,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:26:49,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:26:49,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:26:49,216 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:26:49,256 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2021-11-20 06:26:49,256 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:26:49,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:49,258 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:26:49,272 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:26:49,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-11-20 06:26:49,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:26:49,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:26:49,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:26:49,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:26:49,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:26:49,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:26:49,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:26:49,293 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:26:49,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-11-20 06:26:49,318 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:26:49,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:49,319 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:26:49,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-11-20 06:26:49,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:26:49,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:26:49,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:26:49,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:26:49,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:26:49,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:26:49,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:26:49,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:26:49,352 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:26:49,374 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-11-20 06:26:49,375 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:26:49,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:49,376 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:26:49,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-11-20 06:26:49,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:26:49,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:26:49,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:26:49,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:26:49,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:26:49,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:26:49,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:26:49,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:26:49,405 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:26:49,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-11-20 06:26:49,431 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:26:49,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:49,432 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:26:49,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-11-20 06:26:49,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:26:49,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:26:49,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:26:49,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:26:49,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:26:49,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:26:49,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:26:49,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:26:49,453 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:26:49,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-11-20 06:26:49,475 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:26:49,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:49,480 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:26:49,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:26:49,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:26:49,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:26:49,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:26:49,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:26:49,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:26:49,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-11-20 06:26:49,494 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:26:49,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:26:49,509 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:26:49,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-11-20 06:26:49,553 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:26:49,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:49,561 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:26:49,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:26:49,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:26:49,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:26:49,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:26:49,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:26:49,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:26:49,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:26:49,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:26:49,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-11-20 06:26:49,590 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:26:49,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-11-20 06:26:49,611 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:26:49,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:49,612 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:26:49,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-11-20 06:26:49,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:26:49,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:26:49,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:26:49,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:26:49,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:26:49,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:26:49,627 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:26:49,627 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:26:49,633 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-20 06:26:49,640 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-11-20 06:26:49,640 INFO L444 ModelExtractionUtils]: 5 out of 9 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-11-20 06:26:49,641 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:26:49,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:49,655 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:26:49,661 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-20 06:26:49,662 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-11-20 06:26:49,662 INFO L513 LassoAnalysis]: Proved termination. [2021-11-20 06:26:49,662 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 [] [2021-11-20 06:26:49,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-11-20 06:26:49,689 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-11-20 06:26:49,690 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-11-20 06:26:49,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:49,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 06:26:49,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:26:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:49,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-20 06:26:49,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:26:50,060 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-20 06:26:50,064 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2021-11-20 06:26:50,064 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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) [2021-11-20 06:26:50,421 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-11-20 06:26:50,558 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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 117 states and 182 transitions. Complement of second has 26 states. [2021-11-20 06:26:50,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2021-11-20 06:26:50,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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) [2021-11-20 06:26:50,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2021-11-20 06:26:50,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 74 transitions. Stem has 4 letters. Loop has 23 letters. [2021-11-20 06:26:50,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:26:50,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 74 transitions. Stem has 27 letters. Loop has 23 letters. [2021-11-20 06:26:50,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:26:50,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 74 transitions. Stem has 4 letters. Loop has 46 letters. [2021-11-20 06:26:50,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:26:50,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 182 transitions. [2021-11-20 06:26:50,594 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2021-11-20 06:26:50,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 116 states and 181 transitions. [2021-11-20 06:26:50,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2021-11-20 06:26:50,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2021-11-20 06:26:50,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 181 transitions. [2021-11-20 06:26:50,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:26:50,607 INFO L681 BuchiCegarLoop]: Abstraction has 116 states and 181 transitions. [2021-11-20 06:26:50,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 181 transitions. [2021-11-20 06:26:50,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 105. [2021-11-20 06:26:50,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 68 states have internal predecessors, (82), 30 states have call successors, (30), 6 states have call predecessors, (30), 8 states have return successors, (42), 30 states have call predecessors, (42), 30 states have call successors, (42) [2021-11-20 06:26:50,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 154 transitions. [2021-11-20 06:26:50,641 INFO L704 BuchiCegarLoop]: Abstraction has 105 states and 154 transitions. [2021-11-20 06:26:50,641 INFO L587 BuchiCegarLoop]: Abstraction has 105 states and 154 transitions. [2021-11-20 06:26:50,641 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-11-20 06:26:50,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 154 transitions. [2021-11-20 06:26:50,643 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 [2021-11-20 06:26:50,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:26:50,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:26:50,645 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-11-20 06:26:50,645 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:26:50,646 INFO L791 eck$LassoCheckResult]: Stem: 556#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 536#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 537#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 555#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 565#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 546#L42-3 [2021-11-20 06:26:50,646 INFO L793 eck$LassoCheckResult]: Loop: 546#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 560#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; 574#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 515#factENTRY ~n := #in~n; 580#L25 assume !(~n <= 0); 502#L26 call #t~ret0 := fact(~n - 1);< 542#factENTRY ~n := #in~n; 586#L25 assume ~n <= 0;#res := 1; 582#factFINAL assume true; 500#factEXIT >#66#return; 506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579#factFINAL assume true; 578#factEXIT >#68#return; 576#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 515#factENTRY ~n := #in~n; 580#L25 assume !(~n <= 0); 502#L26 call #t~ret0 := fact(~n - 1);< 542#factENTRY ~n := #in~n; 586#L25 assume ~n <= 0;#res := 1; 582#factFINAL assume true; 500#factEXIT >#66#return; 506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579#factFINAL assume true; 578#factEXIT >#70#return; 514#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 515#factENTRY ~n := #in~n; 580#L25 assume !(~n <= 0); 502#L26 call #t~ret0 := fact(~n - 1);< 542#factENTRY ~n := #in~n; 586#L25 assume ~n <= 0;#res := 1; 582#factFINAL assume true; 500#factEXIT >#66#return; 506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579#factFINAL assume true; 578#factEXIT >#72#return; 571#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; 569#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 567#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 566#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 553#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 545#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 546#L42-3 [2021-11-20 06:26:50,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:50,647 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 1 times [2021-11-20 06:26:50,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:50,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500870011] [2021-11-20 06:26:50,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:50,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:26:50,652 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:26:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:26:50,657 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:26:50,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:50,657 INFO L85 PathProgramCache]: Analyzing trace with hash 471779129, now seen corresponding path program 1 times [2021-11-20 06:26:50,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:50,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911480901] [2021-11-20 06:26:50,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:50,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:50,664 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:26:50,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1687637535] [2021-11-20 06:26:50,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:50,665 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:26:50,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:50,666 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:26:50,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-20 06:26:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:50,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-20 06:26:50,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:26:50,884 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-20 06:26:50,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:26:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-20 06:26:51,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:26:51,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911480901] [2021-11-20 06:26:51,250 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:26:51,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687637535] [2021-11-20 06:26:51,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687637535] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:26:51,250 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:26:51,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2021-11-20 06:26:51,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739943371] [2021-11-20 06:26:51,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:26:51,252 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 06:26:51,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:26:51,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 06:26:51,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-20 06:26:51,255 INFO L87 Difference]: Start difference. First operand 105 states and 154 transitions. cyclomatic complexity: 54 Second operand has 13 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2021-11-20 06:26:51,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:26:51,709 INFO L93 Difference]: Finished difference Result 307 states and 482 transitions. [2021-11-20 06:26:51,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 06:26:51,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 307 states and 482 transitions. [2021-11-20 06:26:51,741 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 112 [2021-11-20 06:26:51,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 307 states to 307 states and 482 transitions. [2021-11-20 06:26:51,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 151 [2021-11-20 06:26:51,769 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2021-11-20 06:26:51,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 307 states and 482 transitions. [2021-11-20 06:26:51,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:26:51,770 INFO L681 BuchiCegarLoop]: Abstraction has 307 states and 482 transitions. [2021-11-20 06:26:51,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states and 482 transitions. [2021-11-20 06:26:51,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 149. [2021-11-20 06:26:51,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 87 states have (on average 1.1724137931034482) internal successors, (102), 88 states have internal predecessors, (102), 46 states have call successors, (46), 10 states have call predecessors, (46), 16 states have return successors, (116), 50 states have call predecessors, (116), 46 states have call successors, (116) [2021-11-20 06:26:51,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 264 transitions. [2021-11-20 06:26:51,836 INFO L704 BuchiCegarLoop]: Abstraction has 149 states and 264 transitions. [2021-11-20 06:26:51,837 INFO L587 BuchiCegarLoop]: Abstraction has 149 states and 264 transitions. [2021-11-20 06:26:51,837 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-11-20 06:26:51,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 264 transitions. [2021-11-20 06:26:51,840 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 40 [2021-11-20 06:26:51,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:26:51,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:26:51,843 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-11-20 06:26:51,843 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:26:51,844 INFO L791 eck$LassoCheckResult]: Stem: 1233#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1210#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1211#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1232#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 1263#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1221#L42-3 [2021-11-20 06:26:51,844 INFO L793 eck$LassoCheckResult]: Loop: 1221#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1234#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; 1235#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1268#factENTRY ~n := #in~n; 1275#L25 assume !(~n <= 0); 1186#L26 call #t~ret0 := fact(~n - 1);< 1216#factENTRY ~n := #in~n; 1266#L25 assume !(~n <= 0); 1185#L26 call #t~ret0 := fact(~n - 1);< 1216#factENTRY ~n := #in~n; 1266#L25 assume ~n <= 0;#res := 1; 1200#factFINAL assume true; 1184#factEXIT >#66#return; 1188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1307#factFINAL assume true; 1305#factEXIT >#66#return; 1306#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1316#factFINAL assume true; 1278#factEXIT >#68#return; 1270#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1268#factENTRY ~n := #in~n; 1275#L25 assume ~n <= 0;#res := 1; 1256#factFINAL assume true; 1287#factEXIT >#70#return; 1272#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1268#factENTRY ~n := #in~n; 1275#L25 assume ~n <= 0;#res := 1; 1256#factFINAL assume true; 1287#factEXIT >#72#return; 1224#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; 1225#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1310#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1309#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1230#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1220#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1221#L42-3 [2021-11-20 06:26:51,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:51,846 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 2 times [2021-11-20 06:26:51,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:51,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568615611] [2021-11-20 06:26:51,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:51,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:26:51,871 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:26:51,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:26:51,875 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:26:51,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:51,876 INFO L85 PathProgramCache]: Analyzing trace with hash -2146445903, now seen corresponding path program 2 times [2021-11-20 06:26:51,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:51,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575549586] [2021-11-20 06:26:51,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:51,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:51,883 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:26:51,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [829701580] [2021-11-20 06:26:51,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:26:51,890 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:26:51,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:51,901 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:26:51,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-20 06:26:51,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:26:51,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:26:51,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-20 06:26:51,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:26:52,115 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-20 06:26:52,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:26:52,443 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-20 06:26:52,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:26:52,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575549586] [2021-11-20 06:26:52,444 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:26:52,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829701580] [2021-11-20 06:26:52,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829701580] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:26:52,444 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:26:52,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2021-11-20 06:26:52,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781859275] [2021-11-20 06:26:52,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:26:52,446 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 06:26:52,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:26:52,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 06:26:52,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-20 06:26:52,447 INFO L87 Difference]: Start difference. First operand 149 states and 264 transitions. cyclomatic complexity: 120 Second operand has 14 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2021-11-20 06:26:52,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:26:52,953 INFO L93 Difference]: Finished difference Result 377 states and 584 transitions. [2021-11-20 06:26:52,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-20 06:26:52,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 377 states and 584 transitions. [2021-11-20 06:26:52,961 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 123 [2021-11-20 06:26:52,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 377 states to 365 states and 564 transitions. [2021-11-20 06:26:52,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 178 [2021-11-20 06:26:52,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 178 [2021-11-20 06:26:52,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 365 states and 564 transitions. [2021-11-20 06:26:52,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:26:52,970 INFO L681 BuchiCegarLoop]: Abstraction has 365 states and 564 transitions. [2021-11-20 06:26:52,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states and 564 transitions. [2021-11-20 06:26:53,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 183. [2021-11-20 06:26:53,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 107 states have (on average 1.1401869158878504) internal successors, (122), 102 states have internal predecessors, (122), 60 states have call successors, (60), 20 states have call predecessors, (60), 16 states have return successors, (126), 60 states have call predecessors, (126), 60 states have call successors, (126) [2021-11-20 06:26:53,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 308 transitions. [2021-11-20 06:26:53,026 INFO L704 BuchiCegarLoop]: Abstraction has 183 states and 308 transitions. [2021-11-20 06:26:53,026 INFO L587 BuchiCegarLoop]: Abstraction has 183 states and 308 transitions. [2021-11-20 06:26:53,026 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-11-20 06:26:53,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 308 transitions. [2021-11-20 06:26:53,029 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 45 [2021-11-20 06:26:53,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:26:53,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:26:53,031 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-11-20 06:26:53,031 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:26:53,031 INFO L791 eck$LassoCheckResult]: Stem: 1997#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1972#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1973#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1996#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 2034#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1987#L42-3 [2021-11-20 06:26:53,032 INFO L793 eck$LassoCheckResult]: Loop: 1987#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1998#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; 2000#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2095#factENTRY ~n := #in~n; 2112#L25 assume !(~n <= 0); 1946#L26 call #t~ret0 := fact(~n - 1);< 1980#factENTRY ~n := #in~n; 2098#L25 assume !(~n <= 0); 1945#L26 call #t~ret0 := fact(~n - 1);< 1980#factENTRY ~n := #in~n; 2098#L25 assume ~n <= 0;#res := 1; 1964#factFINAL assume true; 1944#factEXIT >#66#return; 1948#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2087#factFINAL assume true; 2084#factEXIT >#66#return; 2081#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2082#factFINAL assume true; 2062#factEXIT >#74#return; 2009#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2095#factENTRY ~n := #in~n; 2112#L25 assume !(~n <= 0); 1946#L26 call #t~ret0 := fact(~n - 1);< 1980#factENTRY ~n := #in~n; 2098#L25 assume ~n <= 0;#res := 1; 1964#factFINAL assume true; 1944#factEXIT >#66#return; 1949#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2011#factFINAL assume true; 2059#factEXIT >#76#return; 2005#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2109#factENTRY ~n := #in~n; 2111#L25 assume !(~n <= 0); 1946#L26 call #t~ret0 := fact(~n - 1);< 1980#factENTRY ~n := #in~n; 2098#L25 assume ~n <= 0;#res := 1; 1964#factFINAL assume true; 1944#factEXIT >#66#return; 1949#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2011#factFINAL assume true; 2059#factEXIT >#78#return; 2060#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; 2116#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 2115#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2114#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1994#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1986#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1987#L42-3 [2021-11-20 06:26:53,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:53,033 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 3 times [2021-11-20 06:26:53,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:53,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844010840] [2021-11-20 06:26:53,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:53,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:26:53,040 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:26:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:26:53,045 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:26:53,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:53,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1703111285, now seen corresponding path program 1 times [2021-11-20 06:26:53,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:53,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839078856] [2021-11-20 06:26:53,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:53,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:53,056 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:26:53,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [775967706] [2021-11-20 06:26:53,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:53,059 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:26:53,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:53,074 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:26:53,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-11-20 06:26:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:26:53,124 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:26:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:26:53,153 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:26:53,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:26:53,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1023536866, now seen corresponding path program 1 times [2021-11-20 06:26:53,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:26:53,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116731565] [2021-11-20 06:26:53,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:53,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:26:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:53,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-20 06:26:53,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:26:53,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116731565] [2021-11-20 06:26:53,198 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2021-11-20 06:26:53,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411516169] [2021-11-20 06:26:53,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:26:53,199 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:26:53,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:26:53,206 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:26:53,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-11-20 06:26:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:26:53,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-20 06:26:53,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:26:53,415 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-11-20 06:26:53,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:26:53,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411516169] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:26:53,419 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:26:53,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 06:26:53,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069531005] [2021-11-20 06:26:53,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:27:18,133 WARN L227 SmtUtils]: Spent 24.31s on a formula simplification. DAG size of input: 77 DAG size of output: 72 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-20 06:27:18,549 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:27:18,549 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:27:18,549 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:27:18,549 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:27:18,549 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-11-20 06:27:18,549 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:18,549 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:27:18,549 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:27:18,549 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration5_Loop [2021-11-20 06:27:18,550 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:27:18,550 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:27:18,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:18,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:18,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:18,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:18,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:18,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:18,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:19,131 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:27:19,131 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-11-20 06:27:19,132 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:19,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:19,138 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:19,142 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:27:19,142 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:19,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-11-20 06:27:19,174 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:27:19,174 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: [] [2021-11-20 06:27:19,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:19,220 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:19,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:19,222 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:19,225 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:27:19,225 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:19,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-11-20 06:27:19,249 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:27:19,249 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: [] [2021-11-20 06:27:19,291 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:19,291 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:19,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:19,293 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:19,298 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:27:19,298 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:19,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-11-20 06:27:19,325 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:27:19,325 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: [] [2021-11-20 06:27:19,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:19,370 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:19,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:19,372 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:19,374 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:27:19,374 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:19,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-11-20 06:27:19,399 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:27:19,399 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: [] [2021-11-20 06:27:19,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:19,444 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:19,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:19,446 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:19,453 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:27:19,453 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:19,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-11-20 06:27:19,481 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:27:19,481 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: [] [2021-11-20 06:27:19,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:19,527 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:19,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:19,529 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:19,531 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:27:19,531 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:19,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-11-20 06:27:19,556 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:27:19,556 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: [] [2021-11-20 06:27:19,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:19,599 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:19,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:19,600 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:19,603 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:27:19,603 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:19,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-11-20 06:27:19,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:19,673 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:19,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:19,676 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:19,683 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-11-20 06:27:19,683 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:19,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-11-20 06:27:19,729 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-11-20 06:27:19,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:19,774 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:27:19,774 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:27:19,774 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:27:19,774 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:27:19,774 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-20 06:27:19,774 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:19,774 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:27:19,774 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:27:19,774 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration5_Loop [2021-11-20 06:27:19,774 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:27:19,774 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:27:19,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:19,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:19,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:19,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:19,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:19,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:19,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:20,246 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:27:20,247 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-20 06:27:20,247 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:20,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:20,257 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:20,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 [2021-11-20 06:27:20,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-11-20 06:27:20,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:27:20,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:27:20,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:27:20,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:27:20,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:27:20,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:27:20,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:27:20,288 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:27:20,326 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:20,327 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:20,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:20,329 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:20,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:27:20,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:27:20,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:27:20,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:27:20,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:27:20,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:27:20,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:27:20,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:27:20,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-11-20 06:27:20,357 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:27:20,405 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:20,406 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:20,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:20,407 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:20,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:27:20,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:27:20,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:27:20,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:27:20,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:27:20,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:27:20,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:27:20,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:27:20,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-11-20 06:27:20,437 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:27:20,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:20,476 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:20,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:20,477 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:20,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:27:20,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:27:20,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:27:20,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:27:20,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:27:20,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:27:20,492 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:27:20,492 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:27:20,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-11-20 06:27:20,504 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:27:20,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:20,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:20,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:20,553 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:20,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-11-20 06:27:20,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:27:20,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:27:20,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:27:20,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:27:20,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:27:20,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:27:20,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:27:20,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:27:20,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:27:20,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:20,625 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:20,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:20,626 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:20,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 [2021-11-20 06:27:20,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:27:20,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:27:20,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:27:20,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:27:20,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:27:20,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:27:20,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:27:20,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-11-20 06:27:20,654 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:27:20,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:20,698 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:20,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:20,700 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:20,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:27:20,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:27:20,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:27:20,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:27:20,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:27:20,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:27:20,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:27:20,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:27:20,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-11-20 06:27:20,741 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-20 06:27:20,752 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-11-20 06:27:20,752 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2021-11-20 06:27:20,752 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:20,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:20,755 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:20,756 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-20 06:27:20,756 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-11-20 06:27:20,756 INFO L513 LassoAnalysis]: Proved termination. [2021-11-20 06:27:20,756 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 [] [2021-11-20 06:27:20,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-11-20 06:27:20,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:20,803 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-11-20 06:27:20,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:20,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 06:27:20,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:20,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-20 06:27:20,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:20,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:21,244 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 7 proven. 36 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-11-20 06:27:21,245 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2021-11-20 06:27:21,246 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 183 states and 308 transitions. cyclomatic complexity: 130 Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-20 06:27:22,069 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 183 states and 308 transitions. cyclomatic complexity: 130. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Result 1079 states and 1673 transitions. Complement of second has 63 states. [2021-11-20 06:27:22,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2021-11-20 06:27:22,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-20 06:27:22,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 112 transitions. [2021-11-20 06:27:22,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 112 transitions. Stem has 5 letters. Loop has 47 letters. [2021-11-20 06:27:22,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:27:22,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 112 transitions. Stem has 52 letters. Loop has 47 letters. [2021-11-20 06:27:22,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:27:22,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 112 transitions. Stem has 5 letters. Loop has 94 letters. [2021-11-20 06:27:22,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:27:22,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1079 states and 1673 transitions. [2021-11-20 06:27:22,100 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 90 [2021-11-20 06:27:22,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1079 states to 744 states and 1158 transitions. [2021-11-20 06:27:22,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 310 [2021-11-20 06:27:22,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 311 [2021-11-20 06:27:22,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 744 states and 1158 transitions. [2021-11-20 06:27:22,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:27:22,120 INFO L681 BuchiCegarLoop]: Abstraction has 744 states and 1158 transitions. [2021-11-20 06:27:22,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states and 1158 transitions. [2021-11-20 06:27:22,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 652. [2021-11-20 06:27:22,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 378 states have (on average 1.1375661375661377) internal successors, (430), 374 states have internal predecessors, (430), 198 states have call successors, (198), 83 states have call predecessors, (198), 76 states have return successors, (395), 194 states have call predecessors, (395), 198 states have call successors, (395) [2021-11-20 06:27:22,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 1023 transitions. [2021-11-20 06:27:22,187 INFO L704 BuchiCegarLoop]: Abstraction has 652 states and 1023 transitions. [2021-11-20 06:27:22,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:27:22,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 06:27:22,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:27:22,189 INFO L87 Difference]: Start difference. First operand 652 states and 1023 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) [2021-11-20 06:27:22,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:27:22,243 INFO L93 Difference]: Finished difference Result 319 states and 538 transitions. [2021-11-20 06:27:22,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 06:27:22,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 319 states and 538 transitions. [2021-11-20 06:27:22,252 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 59 [2021-11-20 06:27:22,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 319 states to 317 states and 536 transitions. [2021-11-20 06:27:22,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 [2021-11-20 06:27:22,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2021-11-20 06:27:22,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 317 states and 536 transitions. [2021-11-20 06:27:22,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:27:22,262 INFO L681 BuchiCegarLoop]: Abstraction has 317 states and 536 transitions. [2021-11-20 06:27:22,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states and 536 transitions. [2021-11-20 06:27:22,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 285. [2021-11-20 06:27:22,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 167 states have (on average 1.125748502994012) internal successors, (188), 162 states have internal predecessors, (188), 88 states have call successors, (88), 36 states have call predecessors, (88), 30 states have return successors, (182), 86 states have call predecessors, (182), 88 states have call successors, (182) [2021-11-20 06:27:22,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 458 transitions. [2021-11-20 06:27:22,281 INFO L704 BuchiCegarLoop]: Abstraction has 285 states and 458 transitions. [2021-11-20 06:27:22,281 INFO L587 BuchiCegarLoop]: Abstraction has 285 states and 458 transitions. [2021-11-20 06:27:22,281 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-11-20 06:27:22,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 285 states and 458 transitions. [2021-11-20 06:27:22,285 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 49 [2021-11-20 06:27:22,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:27:22,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:27:22,286 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:27:22,286 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-20 06:27:22,286 INFO L791 eck$LassoCheckResult]: Stem: 4695#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4669#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4670#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 4694#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 4709#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 4776#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4771#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; 4649#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 4650#factENTRY ~n := #in~n; 4877#L25 assume !(~n <= 0); 4636#L26 call #t~ret0 := fact(~n - 1);< 4868#factENTRY [2021-11-20 06:27:22,286 INFO L793 eck$LassoCheckResult]: Loop: 4868#factENTRY ~n := #in~n; 4872#L25 assume !(~n <= 0); 4637#L26 call #t~ret0 := fact(~n - 1);< 4868#factENTRY [2021-11-20 06:27:22,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:22,287 INFO L85 PathProgramCache]: Analyzing trace with hash 271623377, now seen corresponding path program 1 times [2021-11-20 06:27:22,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:27:22,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569436647] [2021-11-20 06:27:22,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:22,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:27:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:22,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:27:22,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:27:22,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569436647] [2021-11-20 06:27:22,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569436647] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:27:22,329 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:27:22,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 06:27:22,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979367668] [2021-11-20 06:27:22,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:27:22,329 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 06:27:22,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:22,330 INFO L85 PathProgramCache]: Analyzing trace with hash 29980, now seen corresponding path program 1 times [2021-11-20 06:27:22,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:27:22,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695913233] [2021-11-20 06:27:22,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:22,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:27:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:27:22,333 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:27:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:27:22,336 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:27:22,381 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:27:22,382 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:27:22,382 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:27:22,382 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:27:22,382 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-11-20 06:27:22,382 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:22,382 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:27:22,382 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:27:22,383 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration6_Loop [2021-11-20 06:27:22,383 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:27:22,383 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:27:22,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:22,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:22,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:22,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:22,426 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:27:22,426 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-11-20 06:27:22,426 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:22,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:22,428 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:22,438 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:27:22,439 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:22,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-11-20 06:27:22,465 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:27:22,465 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#t~ret0=0} Honda state: {fact_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-11-20 06:27:22,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:22,503 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:22,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:22,505 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:22,508 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:27:22,508 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:22,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-11-20 06:27:22,545 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:27:22,545 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_~n=0} Honda state: {fact_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-11-20 06:27:22,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:22,593 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:22,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:22,595 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:22,598 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:27:22,599 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:22,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-11-20 06:27:22,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:22,658 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:22,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:22,659 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:22,666 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-11-20 06:27:22,666 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:22,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-11-20 06:27:22,749 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-11-20 06:27:22,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:22,753 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:27:22,753 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:27:22,753 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:27:22,753 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:27:22,753 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-20 06:27:22,753 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:22,753 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:27:22,753 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:27:22,753 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration6_Loop [2021-11-20 06:27:22,753 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:27:22,753 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:27:22,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:22,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:22,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:22,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:22,790 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:27:22,790 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-20 06:27:22,790 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:22,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:22,791 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:22,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-11-20 06:27:22,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:27:22,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:27:22,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:27:22,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:27:22,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:27:22,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:27:22,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:27:22,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:27:22,809 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-20 06:27:22,811 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2021-11-20 06:27:22,811 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-11-20 06:27:22,811 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:22,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:22,812 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:22,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-11-20 06:27:22,813 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-20 06:27:22,813 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-11-20 06:27:22,813 INFO L513 LassoAnalysis]: Proved termination. [2021-11-20 06:27:22,814 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2021-11-20 06:27:22,838 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2021-11-20 06:27:22,838 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-11-20 06:27:22,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:22,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-20 06:27:22,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:22,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-20 06:27:22,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:27:22,969 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-11-20 06:27:22,969 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 285 states and 458 transitions. cyclomatic complexity: 180 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) [2021-11-20 06:27:23,043 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 285 states and 458 transitions. cyclomatic complexity: 180. 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 425 states and 664 transitions. Complement of second has 13 states. [2021-11-20 06:27:23,045 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 [2021-11-20 06:27:23,049 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) [2021-11-20 06:27:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2021-11-20 06:27:23,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 11 letters. Loop has 3 letters. [2021-11-20 06:27:23,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:27:23,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 14 letters. Loop has 3 letters. [2021-11-20 06:27:23,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:27:23,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 11 letters. Loop has 6 letters. [2021-11-20 06:27:23,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:27:23,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 425 states and 664 transitions. [2021-11-20 06:27:23,059 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 57 [2021-11-20 06:27:23,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 425 states to 401 states and 640 transitions. [2021-11-20 06:27:23,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 187 [2021-11-20 06:27:23,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2021-11-20 06:27:23,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 401 states and 640 transitions. [2021-11-20 06:27:23,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:27:23,076 INFO L681 BuchiCegarLoop]: Abstraction has 401 states and 640 transitions. [2021-11-20 06:27:23,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states and 640 transitions. [2021-11-20 06:27:23,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 393. [2021-11-20 06:27:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 235 states have (on average 1.1659574468085105) internal successors, (274), 244 states have internal predecessors, (274), 112 states have call successors, (112), 52 states have call predecessors, (112), 46 states have return successors, (238), 96 states have call predecessors, (238), 112 states have call successors, (238) [2021-11-20 06:27:23,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 624 transitions. [2021-11-20 06:27:23,098 INFO L704 BuchiCegarLoop]: Abstraction has 393 states and 624 transitions. [2021-11-20 06:27:23,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:27:23,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:27:23,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:27:23,099 INFO L87 Difference]: Start difference. First operand 393 states and 624 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) [2021-11-20 06:27:23,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:27:23,182 INFO L93 Difference]: Finished difference Result 418 states and 676 transitions. [2021-11-20 06:27:23,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 06:27:23,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 418 states and 676 transitions. [2021-11-20 06:27:23,192 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 81 [2021-11-20 06:27:23,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 418 states to 418 states and 676 transitions. [2021-11-20 06:27:23,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 201 [2021-11-20 06:27:23,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 201 [2021-11-20 06:27:23,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 418 states and 676 transitions. [2021-11-20 06:27:23,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:27:23,204 INFO L681 BuchiCegarLoop]: Abstraction has 418 states and 676 transitions. [2021-11-20 06:27:23,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states and 676 transitions. [2021-11-20 06:27:23,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 399. [2021-11-20 06:27:23,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 235 states have (on average 1.1659574468085105) internal successors, (274), 246 states have internal predecessors, (274), 122 states have call successors, (122), 44 states have call predecessors, (122), 42 states have return successors, (256), 108 states have call predecessors, (256), 122 states have call successors, (256) [2021-11-20 06:27:23,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 652 transitions. [2021-11-20 06:27:23,246 INFO L704 BuchiCegarLoop]: Abstraction has 399 states and 652 transitions. [2021-11-20 06:27:23,246 INFO L587 BuchiCegarLoop]: Abstraction has 399 states and 652 transitions. [2021-11-20 06:27:23,246 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-11-20 06:27:23,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 399 states and 652 transitions. [2021-11-20 06:27:23,251 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 78 [2021-11-20 06:27:23,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:27:23,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:27:23,253 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:27:23,253 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:27:23,253 INFO L791 eck$LassoCheckResult]: Stem: 6281#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6254#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6255#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 6280#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 6268#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 6269#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 6282#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; 6283#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 6460#factENTRY ~n := #in~n; 6462#L25 assume ~n <= 0;#res := 1; 6461#factFINAL assume true; 6459#factEXIT >#68#return; 6262#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 6293#factENTRY ~n := #in~n; 6436#L25 assume ~n <= 0;#res := 1; 6434#factFINAL assume true; 6433#factEXIT >#70#return; 6261#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 6293#factENTRY ~n := #in~n; 6436#L25 assume !(~n <= 0); 6260#L26 call #t~ret0 := fact(~n - 1);< 6263#factENTRY ~n := #in~n; 6453#L25 assume ~n <= 0;#res := 1; 6456#factFINAL assume true; 6447#factEXIT >#66#return; 6446#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6445#factFINAL assume true; 6442#factEXIT >#72#return; 6278#L30-3 [2021-11-20 06:27:23,254 INFO L793 eck$LassoCheckResult]: Loop: 6278#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; 6273#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 6265#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 6291#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 6292#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; 6238#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 6243#factENTRY ~n := #in~n; 6250#L25 assume ~n <= 0;#res := 1; 6246#factFINAL assume true; 6237#factEXIT >#68#return; 6239#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 6400#factENTRY ~n := #in~n; 6401#L25 assume !(~n <= 0); 6347#L26 call #t~ret0 := fact(~n - 1);< 6363#factENTRY ~n := #in~n; 6397#L25 assume ~n <= 0;#res := 1; 6379#factFINAL assume true; 6364#factEXIT >#66#return; 6362#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6418#factFINAL assume true; 6402#factEXIT >#70#return; 6405#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 6411#factENTRY ~n := #in~n; 6413#L25 assume ~n <= 0;#res := 1; 6410#factFINAL assume true; 6409#factEXIT >#72#return; 6278#L30-3 [2021-11-20 06:27:23,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:23,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1888115960, now seen corresponding path program 1 times [2021-11-20 06:27:23,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:27:23,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908363192] [2021-11-20 06:27:23,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:23,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:27:23,264 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:27:23,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [531359654] [2021-11-20 06:27:23,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:23,265 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:27:23,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:23,269 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:27:23,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:23,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2021-11-20 06:27:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:23,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-20 06:27:23,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:23,451 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-20 06:27:23,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:27:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-20 06:27:23,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:27:23,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908363192] [2021-11-20 06:27:23,604 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:27:23,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531359654] [2021-11-20 06:27:23,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531359654] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:27:23,604 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:27:23,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-11-20 06:27:23,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730465435] [2021-11-20 06:27:23,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:27:23,605 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 06:27:23,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:23,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1064414184, now seen corresponding path program 1 times [2021-11-20 06:27:23,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:27:23,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088686119] [2021-11-20 06:27:23,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:23,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:27:23,609 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:27:23,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [621335054] [2021-11-20 06:27:23,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:23,610 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:27:23,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:23,611 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:27:23,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2021-11-20 06:27:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:23,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-20 06:27:23,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:23,787 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 06:27:23,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:27:23,978 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-20 06:27:23,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:27:23,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088686119] [2021-11-20 06:27:23,979 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:27:23,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621335054] [2021-11-20 06:27:23,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621335054] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:27:23,979 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:27:23,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-11-20 06:27:23,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994065695] [2021-11-20 06:27:23,980 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:27:23,981 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 06:27:23,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:27:23,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-20 06:27:23,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-11-20 06:27:23,982 INFO L87 Difference]: Start difference. First operand 399 states and 652 transitions. cyclomatic complexity: 268 Second operand has 11 states, 8 states have (on average 2.875) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-20 06:27:24,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:27:24,243 INFO L93 Difference]: Finished difference Result 459 states and 725 transitions. [2021-11-20 06:27:24,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 06:27:24,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 459 states and 725 transitions. [2021-11-20 06:27:24,254 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 106 [2021-11-20 06:27:24,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 459 states to 459 states and 725 transitions. [2021-11-20 06:27:24,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2021-11-20 06:27:24,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 223 [2021-11-20 06:27:24,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 459 states and 725 transitions. [2021-11-20 06:27:24,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:27:24,266 INFO L681 BuchiCegarLoop]: Abstraction has 459 states and 725 transitions. [2021-11-20 06:27:24,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states and 725 transitions. [2021-11-20 06:27:24,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 399. [2021-11-20 06:27:24,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 237 states have (on average 1.1645569620253164) internal successors, (276), 244 states have internal predecessors, (276), 122 states have call successors, (122), 46 states have call predecessors, (122), 40 states have return successors, (238), 108 states have call predecessors, (238), 122 states have call successors, (238) [2021-11-20 06:27:24,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 636 transitions. [2021-11-20 06:27:24,289 INFO L704 BuchiCegarLoop]: Abstraction has 399 states and 636 transitions. [2021-11-20 06:27:24,289 INFO L587 BuchiCegarLoop]: Abstraction has 399 states and 636 transitions. [2021-11-20 06:27:24,289 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-11-20 06:27:24,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 399 states and 636 transitions. [2021-11-20 06:27:24,309 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 79 [2021-11-20 06:27:24,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:27:24,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:27:24,310 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:27:24,310 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:27:24,311 INFO L791 eck$LassoCheckResult]: Stem: 7483#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 7458#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7459#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 7482#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 7471#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 7472#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 7484#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; 7444#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 7445#factENTRY ~n := #in~n; 7451#L25 assume ~n <= 0;#res := 1; 7490#factFINAL assume true; 7727#factEXIT >#68#return; 7495#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 7496#factENTRY ~n := #in~n; 7720#L25 assume ~n <= 0;#res := 1; 7629#factFINAL assume true; 7719#factEXIT >#70#return; 7436#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 7441#factENTRY ~n := #in~n; 7628#L25 assume !(~n <= 0); 7464#L26 call #t~ret0 := fact(~n - 1);< 7465#factENTRY ~n := #in~n; 7655#L25 assume ~n <= 0;#res := 1; 7653#factFINAL assume true; 7650#factEXIT >#66#return; 7487#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7447#factFINAL assume true; 7435#factEXIT >#72#return; 7437#L30-3 [2021-11-20 06:27:24,311 INFO L793 eck$LassoCheckResult]: Loop: 7437#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; 7476#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 7469#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 7625#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 7623#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; 7624#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 7627#factENTRY ~n := #in~n; 7631#L25 assume ~n <= 0;#res := 1; 7630#factFINAL assume true; 7626#factEXIT >#68#return; 7607#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 7619#factENTRY ~n := #in~n; 7621#L25 assume ~n <= 0;#res := 1; 7618#factFINAL assume true; 7605#factEXIT >#70#return; 7592#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 7610#factENTRY ~n := #in~n; 7622#L25 assume ~n <= 0;#res := 1; 7618#factFINAL assume true; 7605#factEXIT >#72#return; 7437#L30-3 [2021-11-20 06:27:24,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:24,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1888115960, now seen corresponding path program 2 times [2021-11-20 06:27:24,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:27:24,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303514034] [2021-11-20 06:27:24,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:24,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:27:24,322 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:27:24,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1812973229] [2021-11-20 06:27:24,323 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:27:24,323 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:27:24,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:24,330 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:27:24,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2021-11-20 06:27:24,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:27:24,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:27:24,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-20 06:27:24,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:24,512 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-20 06:27:24,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:27:24,666 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-20 06:27:24,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:27:24,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303514034] [2021-11-20 06:27:24,667 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:27:24,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812973229] [2021-11-20 06:27:24,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812973229] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:27:24,667 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:27:24,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-11-20 06:27:24,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811221861] [2021-11-20 06:27:24,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:27:24,668 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 06:27:24,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:24,669 INFO L85 PathProgramCache]: Analyzing trace with hash 467014384, now seen corresponding path program 1 times [2021-11-20 06:27:24,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:27:24,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428557593] [2021-11-20 06:27:24,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:24,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:27:24,672 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:27:24,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1399264277] [2021-11-20 06:27:24,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:24,673 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:27:24,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:24,678 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:27:24,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2021-11-20 06:27:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:27:24,713 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:27:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:27:24,747 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:27:25,670 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:27:25,670 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:27:25,670 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:27:25,670 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:27:25,670 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-11-20 06:27:25,670 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:25,671 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:27:25,671 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:27:25,671 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration8_Loop [2021-11-20 06:27:25,671 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:27:25,671 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:27:25,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:25,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:25,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:25,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:25,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:25,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:25,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:25,837 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:27:25,837 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-11-20 06:27:25,837 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:25,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:25,840 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:25,842 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:27:25,842 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:25,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2021-11-20 06:27:25,865 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:27:25,865 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=1} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-11-20 06:27:25,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:25,899 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:25,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:25,901 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:25,903 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:27:25,903 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:25,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-11-20 06:27:25,925 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:27:25,925 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: [] [2021-11-20 06:27:25,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:25,961 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:25,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:25,962 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:25,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-11-20 06:27:25,964 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:27:25,964 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:25,989 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:27:25,989 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: [] [2021-11-20 06:27:26,014 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2021-11-20 06:27:26,015 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:26,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:26,016 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:26,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2021-11-20 06:27:26,018 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:27:26,018 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:26,028 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:27:26,028 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: [] [2021-11-20 06:27:26,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:26,056 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:26,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:26,057 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:26,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2021-11-20 06:27:26,058 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:27:26,058 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:26,069 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:27:26,069 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: [] [2021-11-20 06:27:26,090 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2021-11-20 06:27:26,093 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:26,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:26,094 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:26,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2021-11-20 06:27:26,096 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:27:26,096 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:26,126 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2021-11-20 06:27:26,127 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:26,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:26,127 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:26,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2021-11-20 06:27:26,129 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-11-20 06:27:26,129 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:26,798 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-11-20 06:27:26,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:26,802 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:27:26,803 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:27:26,803 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:27:26,803 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:27:26,803 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-20 06:27:26,803 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:26,803 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:27:26,803 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:27:26,803 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration8_Loop [2021-11-20 06:27:26,803 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:27:26,803 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:27:26,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:26,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:26,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:26,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:26,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:26,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:26,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:26,949 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:27:26,950 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-20 06:27:26,950 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:26,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:26,953 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:26,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2021-11-20 06:27:26,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:27:26,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:27:26,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:27:26,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:27:26,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:27:26,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:27:26,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:27:26,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:27:26,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:27:27,021 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:27,022 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:27,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:27,023 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:27,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:27:27,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:27:27,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:27:27,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:27:27,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:27:27,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:27:27,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:27:27,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:27:27,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2021-11-20 06:27:27,061 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:27:27,080 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2021-11-20 06:27:27,080 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:27,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:27,081 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:27,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2021-11-20 06:27:27,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:27:27,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:27:27,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:27:27,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:27:27,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:27:27,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:27:27,092 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:27:27,092 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:27:27,093 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:27:27,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:27,119 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:27,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:27,119 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:27,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2021-11-20 06:27:27,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:27:27,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:27:27,130 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:27:27,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:27:27,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:27:27,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:27:27,131 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:27:27,131 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:27:27,165 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:27:27,208 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:27,208 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:27,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:27,209 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:27,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:27:27,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:27:27,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:27:27,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:27:27,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:27:27,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:27:27,227 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:27:27,227 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:27:27,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2021-11-20 06:27:27,241 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-20 06:27:27,248 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-11-20 06:27:27,249 INFO L444 ModelExtractionUtils]: 5 out of 9 variables were initially zero. Simplification set additionally 2 variables to zero. [2021-11-20 06:27:27,249 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:27,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:27,251 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:27,253 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-20 06:27:27,253 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-11-20 06:27:27,253 INFO L513 LassoAnalysis]: Proved termination. [2021-11-20 06:27:27,253 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 [] [2021-11-20 06:27:27,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2021-11-20 06:27:27,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:27,300 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-11-20 06:27:27,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:27,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-20 06:27:27,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:27,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-20 06:27:27,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:27,891 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-20 06:27:27,892 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2021-11-20 06:27:27,892 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 399 states and 636 transitions. cyclomatic complexity: 252 Second operand has 10 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-20 06:27:28,144 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 399 states and 636 transitions. cyclomatic complexity: 252. Second operand has 10 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Result 767 states and 1096 transitions. Complement of second has 35 states. [2021-11-20 06:27:28,144 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 [2021-11-20 06:27:28,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-20 06:27:28,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2021-11-20 06:27:28,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 62 transitions. Stem has 28 letters. Loop has 20 letters. [2021-11-20 06:27:28,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:27:28,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 62 transitions. Stem has 48 letters. Loop has 20 letters. [2021-11-20 06:27:28,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:27:28,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 62 transitions. Stem has 28 letters. Loop has 40 letters. [2021-11-20 06:27:28,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:27:28,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 767 states and 1096 transitions. [2021-11-20 06:27:28,162 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 68 [2021-11-20 06:27:28,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 767 states to 739 states and 1068 transitions. [2021-11-20 06:27:28,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 248 [2021-11-20 06:27:28,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 252 [2021-11-20 06:27:28,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 739 states and 1068 transitions. [2021-11-20 06:27:28,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:27:28,223 INFO L681 BuchiCegarLoop]: Abstraction has 739 states and 1068 transitions. [2021-11-20 06:27:28,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states and 1068 transitions. [2021-11-20 06:27:28,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 709. [2021-11-20 06:27:28,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 447 states have (on average 1.1543624161073827) internal successors, (516), 454 states have internal predecessors, (516), 172 states have call successors, (180), 102 states have call predecessors, (180), 90 states have return successors, (328), 152 states have call predecessors, (328), 172 states have call successors, (328) [2021-11-20 06:27:28,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1024 transitions. [2021-11-20 06:27:28,268 INFO L704 BuchiCegarLoop]: Abstraction has 709 states and 1024 transitions. [2021-11-20 06:27:28,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:27:28,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 06:27:28,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-11-20 06:27:28,269 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:28,274 INFO L87 Difference]: Start difference. First operand 709 states and 1024 transitions. Second operand has 10 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 9 states have internal predecessors, (19), 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) [2021-11-20 06:27:28,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:27:28,649 INFO L93 Difference]: Finished difference Result 807 states and 1176 transitions. [2021-11-20 06:27:28,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 06:27:28,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 807 states and 1176 transitions. [2021-11-20 06:27:28,666 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 100 [2021-11-20 06:27:28,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 807 states to 769 states and 1128 transitions. [2021-11-20 06:27:28,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 272 [2021-11-20 06:27:28,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 272 [2021-11-20 06:27:28,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 769 states and 1128 transitions. [2021-11-20 06:27:28,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:27:28,694 INFO L681 BuchiCegarLoop]: Abstraction has 769 states and 1128 transitions. [2021-11-20 06:27:28,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states and 1128 transitions. [2021-11-20 06:27:28,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 715. [2021-11-20 06:27:28,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 439 states have (on average 1.1548974943052392) internal successors, (507), 446 states have internal predecessors, (507), 194 states have call successors, (202), 96 states have call predecessors, (202), 82 states have return successors, (352), 172 states have call predecessors, (352), 190 states have call successors, (352) [2021-11-20 06:27:28,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1061 transitions. [2021-11-20 06:27:28,729 INFO L704 BuchiCegarLoop]: Abstraction has 715 states and 1061 transitions. [2021-11-20 06:27:28,729 INFO L587 BuchiCegarLoop]: Abstraction has 715 states and 1061 transitions. [2021-11-20 06:27:28,730 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-11-20 06:27:28,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 715 states and 1061 transitions. [2021-11-20 06:27:28,736 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 89 [2021-11-20 06:27:28,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:27:28,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:27:28,741 INFO L842 BuchiCegarLoop]: 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] [2021-11-20 06:27:28,741 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:27:28,742 INFO L791 eck$LassoCheckResult]: Stem: 10560#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 10530#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10531#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 10559#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 10580#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 10738#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 10737#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; 10506#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 10522#factENTRY ~n := #in~n; 10857#L25 assume ~n <= 0;#res := 1; 10854#factFINAL assume true; 10505#factEXIT >#68#return; 10507#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 10502#factENTRY ~n := #in~n; 10847#L25 assume ~n <= 0;#res := 1; 10846#factFINAL assume true; 10843#factEXIT >#70#return; 10501#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 10502#factENTRY ~n := #in~n; 10847#L25 assume ~n <= 0;#res := 1; 10846#factFINAL assume true; 10843#factEXIT >#72#return; 10837#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; 10809#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 10578#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 10571#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 10561#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; 10562#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 10777#factENTRY ~n := #in~n; 10774#L25 assume !(~n <= 0); 10567#L26 call #t~ret0 := fact(~n - 1);< 10759#factENTRY ~n := #in~n; 10771#L25 assume ~n <= 0;#res := 1; 10769#factFINAL assume true; 10757#factEXIT >#66#return; 10758#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10761#factFINAL assume true; 10749#factEXIT >#74#return; 10512#L30-6 [2021-11-20 06:27:28,742 INFO L793 eck$LassoCheckResult]: Loop: 10512#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 10498#factENTRY ~n := #in~n; 10861#L25 assume ~n <= 0;#res := 1; 10511#factFINAL assume true; 10514#factEXIT >#76#return; 10750#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 10762#factENTRY ~n := #in~n; 10782#L25 assume !(~n <= 0); 10538#L26 call #t~ret0 := fact(~n - 1);< 10539#factENTRY ~n := #in~n; 10779#L25 assume !(~n <= 0); 10536#L26 call #t~ret0 := fact(~n - 1);< 10539#factENTRY ~n := #in~n; 10779#L25 assume !(~n <= 0); 10536#L26 call #t~ret0 := fact(~n - 1);< 10539#factENTRY ~n := #in~n; 10779#L25 assume ~n <= 0;#res := 1; 10776#factFINAL assume true; 10767#factEXIT >#66#return; 10564#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10568#factFINAL assume true; 10765#factEXIT >#66#return; 10564#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10568#factFINAL assume true; 10765#factEXIT >#66#return; 10764#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10763#factFINAL assume true; 10760#factEXIT >#78#return; 10591#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; 10543#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 10544#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 10785#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 10781#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; 10497#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 10498#factENTRY ~n := #in~n; 10861#L25 assume !(~n <= 0); 10538#L26 call #t~ret0 := fact(~n - 1);< 10539#factENTRY ~n := #in~n; 10779#L25 assume ~n <= 0;#res := 1; 10776#factFINAL assume true; 10767#factEXIT >#66#return; 10758#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10761#factFINAL assume true; 10749#factEXIT >#74#return; 10512#L30-6 [2021-11-20 06:27:28,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:28,743 INFO L85 PathProgramCache]: Analyzing trace with hash -426322681, now seen corresponding path program 1 times [2021-11-20 06:27:28,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:27:28,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038989426] [2021-11-20 06:27:28,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:28,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:27:28,769 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:27:28,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [789372744] [2021-11-20 06:27:28,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:28,775 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:27:28,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:28,777 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:27:28,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2021-11-20 06:27:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:27:28,832 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:27:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:27:28,856 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:27:28,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:28,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1522549572, now seen corresponding path program 1 times [2021-11-20 06:27:28,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:27:28,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105302642] [2021-11-20 06:27:28,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:28,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:27:28,864 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:27:28,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1215470556] [2021-11-20 06:27:28,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:28,864 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:27:28,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:28,866 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:27:28,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2021-11-20 06:27:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:27:28,919 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:27:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:27:28,947 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:27:28,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:28,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1712314550, now seen corresponding path program 1 times [2021-11-20 06:27:28,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:27:28,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649094473] [2021-11-20 06:27:28,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:28,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:27:28,956 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:27:28,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1334856475] [2021-11-20 06:27:28,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:28,956 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:27:28,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:28,962 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:27:28,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2021-11-20 06:27:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:29,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-20 06:27:29,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:29,366 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 147 proven. 9 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-11-20 06:27:29,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:27:29,776 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 59 proven. 26 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2021-11-20 06:27:29,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:27:29,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649094473] [2021-11-20 06:27:29,777 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:27:29,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334856475] [2021-11-20 06:27:29,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334856475] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:27:29,777 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:27:29,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2021-11-20 06:27:29,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703125694] [2021-11-20 06:27:29,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:27:31,276 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:27:31,276 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:27:31,276 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:27:31,277 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:27:31,277 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-11-20 06:27:31,277 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:31,277 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:27:31,277 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:27:31,277 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration9_Loop [2021-11-20 06:27:31,277 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:27:31,277 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:27:31,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:31,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:31,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:31,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:31,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:31,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:31,429 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:27:31,429 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-11-20 06:27:31,429 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:31,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:31,430 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:31,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2021-11-20 06:27:31,433 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:27:31,433 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:31,441 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:27:31,441 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: [] [2021-11-20 06:27:31,462 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:31,462 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:31,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:31,463 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:31,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2021-11-20 06:27:31,465 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:27:31,465 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:31,473 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:27:31,473 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: [] [2021-11-20 06:27:31,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:31,503 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:31,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:31,504 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:31,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2021-11-20 06:27:31,510 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:27:31,510 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:31,543 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:31,544 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:31,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:31,545 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:31,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2021-11-20 06:27:31,546 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-11-20 06:27:31,546 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:32,740 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-11-20 06:27:32,745 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2021-11-20 06:27:32,745 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:27:32,745 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:27:32,745 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:27:32,745 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:27:32,746 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-20 06:27:32,746 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:32,746 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:27:32,746 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:27:32,746 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration9_Loop [2021-11-20 06:27:32,746 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:27:32,746 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:27:32,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:32,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:32,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:32,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:32,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:32,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:32,888 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:27:32,888 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-20 06:27:32,889 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:32,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:32,890 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:32,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2021-11-20 06:27:32,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:27:32,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:27:32,901 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:27:32,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:27:32,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:27:32,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:27:32,904 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:27:32,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:27:32,909 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-20 06:27:32,914 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-11-20 06:27:32,915 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-11-20 06:27:32,915 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:32,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:32,916 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:32,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2021-11-20 06:27:32,917 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-20 06:27:32,917 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-11-20 06:27:32,918 INFO L513 LassoAnalysis]: Proved termination. [2021-11-20 06:27:32,918 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 [] [2021-11-20 06:27:32,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:32,947 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-11-20 06:27:32,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:33,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-20 06:27:33,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:33,480 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:33,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-20 06:27:33,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:33,858 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-11-20 06:27:33,858 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2021-11-20 06:27:33,859 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 715 states and 1061 transitions. cyclomatic complexity: 370 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) [2021-11-20 06:27:34,320 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 715 states and 1061 transitions. cyclomatic complexity: 370. 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 2247 states and 3234 transitions. Complement of second has 43 states. [2021-11-20 06:27:34,321 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 [2021-11-20 06:27:34,322 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) [2021-11-20 06:27:34,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 89 transitions. [2021-11-20 06:27:34,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 89 transitions. Stem has 38 letters. Loop has 44 letters. [2021-11-20 06:27:34,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:27:34,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 89 transitions. Stem has 82 letters. Loop has 44 letters. [2021-11-20 06:27:34,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:27:34,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 89 transitions. Stem has 38 letters. Loop has 88 letters. [2021-11-20 06:27:34,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:27:34,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2247 states and 3234 transitions. [2021-11-20 06:27:34,359 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 151 [2021-11-20 06:27:34,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2247 states to 2001 states and 2895 transitions. [2021-11-20 06:27:34,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 552 [2021-11-20 06:27:34,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 557 [2021-11-20 06:27:34,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2001 states and 2895 transitions. [2021-11-20 06:27:34,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:27:34,395 INFO L681 BuchiCegarLoop]: Abstraction has 2001 states and 2895 transitions. [2021-11-20 06:27:34,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states and 2895 transitions. [2021-11-20 06:27:34,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1847. [2021-11-20 06:27:34,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1847 states, 1131 states have (on average 1.1282051282051282) internal successors, (1276), 1154 states have internal predecessors, (1276), 464 states have call successors, (504), 256 states have call predecessors, (504), 252 states have return successors, (850), 436 states have call predecessors, (850), 456 states have call successors, (850) [2021-11-20 06:27:34,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2630 transitions. [2021-11-20 06:27:34,522 INFO L704 BuchiCegarLoop]: Abstraction has 1847 states and 2630 transitions. [2021-11-20 06:27:34,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:27:34,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 06:27:34,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-20 06:27:34,523 INFO L87 Difference]: Start difference. First operand 1847 states and 2630 transitions. Second operand has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 14 states have internal predecessors, (46), 9 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2021-11-20 06:27:35,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:27:35,309 INFO L93 Difference]: Finished difference Result 2629 states and 4135 transitions. [2021-11-20 06:27:35,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-20 06:27:35,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2629 states and 4135 transitions. [2021-11-20 06:27:35,409 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 264 [2021-11-20 06:27:35,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2629 states to 2512 states and 3906 transitions. [2021-11-20 06:27:35,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 773 [2021-11-20 06:27:35,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 773 [2021-11-20 06:27:35,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2512 states and 3906 transitions. [2021-11-20 06:27:35,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:27:35,457 INFO L681 BuchiCegarLoop]: Abstraction has 2512 states and 3906 transitions. [2021-11-20 06:27:35,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states and 3906 transitions. [2021-11-20 06:27:35,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 2028. [2021-11-20 06:27:35,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2028 states, 1199 states have (on average 1.1384487072560467) internal successors, (1365), 1238 states have internal predecessors, (1365), 581 states have call successors, (633), 234 states have call predecessors, (633), 248 states have return successors, (1046), 555 states have call predecessors, (1046), 564 states have call successors, (1046) [2021-11-20 06:27:35,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 2028 states and 3044 transitions. [2021-11-20 06:27:35,578 INFO L704 BuchiCegarLoop]: Abstraction has 2028 states and 3044 transitions. [2021-11-20 06:27:35,578 INFO L587 BuchiCegarLoop]: Abstraction has 2028 states and 3044 transitions. [2021-11-20 06:27:35,578 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-11-20 06:27:35,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2028 states and 3044 transitions. [2021-11-20 06:27:35,594 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 203 [2021-11-20 06:27:35,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:27:35,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:27:35,616 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:27:35,616 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-20 06:27:35,616 INFO L791 eck$LassoCheckResult]: Stem: 18835#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 18805#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 18806#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 18834#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 18860#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 19435#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 19434#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; 18797#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 18798#factENTRY ~n := #in~n; 19429#L25 assume ~n <= 0;#res := 1; 19427#factFINAL assume true; 19426#factEXIT >#68#return; 18849#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 18850#factENTRY ~n := #in~n; 19695#L25 assume ~n <= 0;#res := 1; 19694#factFINAL assume true; 19687#factEXIT >#70#return; 19688#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 18850#factENTRY ~n := #in~n; 19695#L25 assume ~n <= 0;#res := 1; 19694#factFINAL assume true; 19687#factEXIT >#72#return; 19689#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; 18827#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 18828#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 19925#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 18836#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; 18776#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 18777#factENTRY ~n := #in~n; 19799#L25 assume !(~n <= 0); 19793#L26 call #t~ret0 := fact(~n - 1);< 19796#factENTRY ~n := #in~n; 19895#L25 assume ~n <= 0;#res := 1; 19934#factFINAL assume true; 19933#factEXIT >#66#return; 19932#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 19931#factFINAL assume true; 19930#factEXIT >#74#return; 18781#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 18856#factENTRY ~n := #in~n; 19824#L25 assume !(~n <= 0); 19808#L26 call #t~ret0 := fact(~n - 1);< 19853#factENTRY [2021-11-20 06:27:35,616 INFO L793 eck$LassoCheckResult]: Loop: 19853#factENTRY ~n := #in~n; 19898#L25 assume !(~n <= 0); 19806#L26 call #t~ret0 := fact(~n - 1);< 19853#factENTRY [2021-11-20 06:27:35,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:35,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1705579033, now seen corresponding path program 1 times [2021-11-20 06:27:35,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:27:35,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839426048] [2021-11-20 06:27:35,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:35,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:27:35,623 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:27:35,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1511398088] [2021-11-20 06:27:35,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:35,629 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:27:35,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:35,637 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:27:35,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2021-11-20 06:27:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:35,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-20 06:27:35,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:35,816 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-11-20 06:27:35,817 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:27:35,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:27:35,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839426048] [2021-11-20 06:27:35,817 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:27:35,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511398088] [2021-11-20 06:27:35,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511398088] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:27:35,818 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:27:35,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 06:27:35,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568552912] [2021-11-20 06:27:35,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:27:35,819 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 06:27:35,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:35,820 INFO L85 PathProgramCache]: Analyzing trace with hash 29980, now seen corresponding path program 2 times [2021-11-20 06:27:35,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:27:35,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8637735] [2021-11-20 06:27:35,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:35,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:27:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:27:35,826 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:27:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:27:35,835 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:27:35,881 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:27:35,881 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:27:35,881 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:27:35,881 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:27:35,881 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-11-20 06:27:35,881 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:35,881 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:27:35,881 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:27:35,881 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration10_Loop [2021-11-20 06:27:35,881 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:27:35,882 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:27:35,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:35,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:35,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:35,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:35,923 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:27:35,923 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-11-20 06:27:35,923 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:35,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:35,924 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:35,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2021-11-20 06:27:35,926 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:27:35,926 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:35,937 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:27:35,937 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_~n=0} Honda state: {fact_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-11-20 06:27:35,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:35,963 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:35,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:35,964 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:35,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2021-11-20 06:27:35,965 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:27:35,965 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:35,975 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:27:35,975 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#res=0} Honda state: {fact_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-11-20 06:27:36,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:36,000 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:36,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:36,001 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:36,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2021-11-20 06:27:36,003 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:27:36,003 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:36,013 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:27:36,013 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#t~ret0=0} Honda state: {fact_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-11-20 06:27:36,037 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:36,037 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:36,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:36,038 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:36,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2021-11-20 06:27:36,039 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:27:36,039 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:36,073 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2021-11-20 06:27:36,073 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:36,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:36,074 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:36,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2021-11-20 06:27:36,075 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-11-20 06:27:36,075 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:36,113 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-11-20 06:27:36,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:36,116 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:27:36,116 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:27:36,116 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:27:36,116 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:27:36,116 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-20 06:27:36,116 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:36,116 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:27:36,116 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:27:36,117 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration10_Loop [2021-11-20 06:27:36,117 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:27:36,117 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:27:36,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:36,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:36,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:36,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:36,155 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:27:36,155 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-20 06:27:36,155 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:36,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:36,156 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:36,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2021-11-20 06:27:36,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:27:36,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:27:36,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:27:36,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:27:36,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:27:36,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:27:36,168 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:27:36,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:27:36,169 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:27:36,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2021-11-20 06:27:36,194 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:36,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:36,195 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:36,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2021-11-20 06:27:36,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:27:36,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:27:36,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:27:36,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:27:36,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:27:36,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:27:36,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:27:36,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:27:36,213 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:27:36,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2021-11-20 06:27:36,237 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:36,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:36,238 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:36,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2021-11-20 06:27:36,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:27:36,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:27:36,249 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:27:36,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:27:36,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:27:36,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:27:36,250 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:27:36,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:27:36,251 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:27:36,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:36,281 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:36,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:36,282 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:36,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2021-11-20 06:27:36,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 [2021-11-20 06:27:36,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:27:36,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:27:36,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:27:36,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:27:36,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:27:36,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:27:36,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:27:36,324 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-20 06:27:36,327 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-11-20 06:27:36,327 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-11-20 06:27:36,327 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:36,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:36,334 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:36,336 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-20 06:27:36,336 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-11-20 06:27:36,336 INFO L513 LassoAnalysis]: Proved termination. [2021-11-20 06:27:36,336 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2021-11-20 06:27:36,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2021-11-20 06:27:36,377 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:36,377 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-11-20 06:27:36,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:36,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-20 06:27:36,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:36,730 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:36,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-20 06:27:36,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:36,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:27:36,966 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2021-11-20 06:27:36,966 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2028 states and 3044 transitions. cyclomatic complexity: 1061 Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 06:27:37,125 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2028 states and 3044 transitions. cyclomatic complexity: 1061. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 2130 states and 3158 transitions. Complement of second has 13 states. [2021-11-20 06:27:37,125 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 [2021-11-20 06:27:37,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 06:27:37,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2021-11-20 06:27:37,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 42 letters. Loop has 3 letters. [2021-11-20 06:27:37,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:27:37,128 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-11-20 06:27:37,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:37,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-20 06:27:37,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:37,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-20 06:27:37,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:37,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:27:37,642 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2021-11-20 06:27:37,642 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2028 states and 3044 transitions. cyclomatic complexity: 1061 Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 06:27:37,782 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2028 states and 3044 transitions. cyclomatic complexity: 1061. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 2130 states and 3158 transitions. Complement of second has 13 states. [2021-11-20 06:27:37,782 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 [2021-11-20 06:27:37,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 06:27:37,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2021-11-20 06:27:37,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 42 letters. Loop has 3 letters. [2021-11-20 06:27:37,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:27:37,784 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-11-20 06:27:37,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:37,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-20 06:27:37,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:38,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-20 06:27:38,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:27:38,300 INFO L152 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 [2021-11-20 06:27:38,300 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2028 states and 3044 transitions. cyclomatic complexity: 1061 Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 06:27:38,461 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2028 states and 3044 transitions. cyclomatic complexity: 1061. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 2386 states and 3456 transitions. Complement of second has 16 states. [2021-11-20 06:27:38,462 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 [2021-11-20 06:27:38,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 06:27:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2021-11-20 06:27:38,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 42 letters. Loop has 3 letters. [2021-11-20 06:27:38,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:27:38,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 45 letters. Loop has 3 letters. [2021-11-20 06:27:38,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:27:38,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 42 letters. Loop has 6 letters. [2021-11-20 06:27:38,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:27:38,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2386 states and 3456 transitions. [2021-11-20 06:27:38,502 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 191 [2021-11-20 06:27:38,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2386 states to 2117 states and 3157 transitions. [2021-11-20 06:27:38,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 583 [2021-11-20 06:27:38,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 597 [2021-11-20 06:27:38,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2117 states and 3157 transitions. [2021-11-20 06:27:38,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:27:38,545 INFO L681 BuchiCegarLoop]: Abstraction has 2117 states and 3157 transitions. [2021-11-20 06:27:38,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2117 states and 3157 transitions. [2021-11-20 06:27:38,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2117 to 2039. [2021-11-20 06:27:38,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2039 states, 1223 states have (on average 1.143908421913328) internal successors, (1399), 1256 states have internal predecessors, (1399), 558 states have call successors, (610), 242 states have call predecessors, (610), 258 states have return successors, (1018), 540 states have call predecessors, (1018), 558 states have call successors, (1018) [2021-11-20 06:27:38,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 3027 transitions. [2021-11-20 06:27:38,688 INFO L704 BuchiCegarLoop]: Abstraction has 2039 states and 3027 transitions. [2021-11-20 06:27:38,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:27:38,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:27:38,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:27:38,689 INFO L87 Difference]: Start difference. First operand 2039 states and 3027 transitions. Second operand has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-11-20 06:27:38,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:27:38,789 INFO L93 Difference]: Finished difference Result 2035 states and 2957 transitions. [2021-11-20 06:27:38,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 06:27:38,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2035 states and 2957 transitions. [2021-11-20 06:27:38,821 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 190 [2021-11-20 06:27:38,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2035 states to 1950 states and 2848 transitions. [2021-11-20 06:27:38,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 565 [2021-11-20 06:27:38,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 565 [2021-11-20 06:27:38,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1950 states and 2848 transitions. [2021-11-20 06:27:38,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:27:38,858 INFO L681 BuchiCegarLoop]: Abstraction has 1950 states and 2848 transitions. [2021-11-20 06:27:38,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states and 2848 transitions. [2021-11-20 06:27:38,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1918. [2021-11-20 06:27:38,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1918 states, 1158 states have (on average 1.1321243523316062) internal successors, (1311), 1178 states have internal predecessors, (1311), 519 states have call successors, (568), 239 states have call predecessors, (568), 241 states have return successors, (926), 500 states have call predecessors, (926), 519 states have call successors, (926) [2021-11-20 06:27:38,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 2805 transitions. [2021-11-20 06:27:38,963 INFO L704 BuchiCegarLoop]: Abstraction has 1918 states and 2805 transitions. [2021-11-20 06:27:38,963 INFO L587 BuchiCegarLoop]: Abstraction has 1918 states and 2805 transitions. [2021-11-20 06:27:38,963 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-11-20 06:27:38,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1918 states and 2805 transitions. [2021-11-20 06:27:38,991 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 190 [2021-11-20 06:27:38,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:27:38,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:27:38,992 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:27:38,993 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:27:38,993 INFO L791 eck$LassoCheckResult]: Stem: 32196#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 32166#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 32167#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 32195#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 32180#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 32182#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 33253#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; 33232#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 33252#factENTRY ~n := #in~n; 33235#L25 assume ~n <= 0;#res := 1; 33231#factFINAL assume true; 33233#factEXIT >#68#return; 33220#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 33221#factENTRY ~n := #in~n; 33234#L25 assume ~n <= 0;#res := 1; 33223#factFINAL assume true; 33224#factEXIT >#70#return; 33212#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 33214#factENTRY ~n := #in~n; 33228#L25 assume ~n <= 0;#res := 1; 33247#factFINAL assume true; 33211#factEXIT >#72#return; 33213#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; 33209#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 33208#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 32972#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 32970#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 32964#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 32896#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 32728#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; 32402#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 32424#factENTRY ~n := #in~n; 32616#L25 assume !(~n <= 0); 32447#L26 call #t~ret0 := fact(~n - 1);< 32491#factENTRY ~n := #in~n; 32508#L25 assume ~n <= 0;#res := 1; 32493#factFINAL assume true; 32489#factEXIT >#66#return; 32488#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 32487#factFINAL assume true; 32442#factEXIT >#68#return; 32407#L30-1 [2021-11-20 06:27:38,993 INFO L793 eck$LassoCheckResult]: Loop: 32407#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 32411#factENTRY ~n := #in~n; 32546#L25 assume ~n <= 0;#res := 1; 32543#factFINAL assume true; 32480#factEXIT >#70#return; 32401#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 32485#factENTRY ~n := #in~n; 32492#L25 assume !(~n <= 0); 32447#L26 call #t~ret0 := fact(~n - 1);< 32491#factENTRY ~n := #in~n; 32512#L25 assume !(~n <= 0); 32446#L26 call #t~ret0 := fact(~n - 1);< 32511#factENTRY ~n := #in~n; 32513#L25 assume ~n <= 0;#res := 1; 32527#factFINAL assume true; 32521#factEXIT >#66#return; 32450#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 32509#factFINAL assume true; 32443#factEXIT >#66#return; 32441#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 32423#factFINAL assume true; 32392#factEXIT >#72#return; 32241#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; 32235#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 32232#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 32223#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 32224#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 32760#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 32652#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 32651#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; 32400#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 32411#factENTRY ~n := #in~n; 32546#L25 assume !(~n <= 0); 32447#L26 call #t~ret0 := fact(~n - 1);< 32491#factENTRY ~n := #in~n; 32508#L25 assume ~n <= 0;#res := 1; 32493#factFINAL assume true; 32489#factEXIT >#66#return; 32488#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 32487#factFINAL assume true; 32442#factEXIT >#68#return; 32407#L30-1 [2021-11-20 06:27:38,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:38,994 INFO L85 PathProgramCache]: Analyzing trace with hash -537644758, now seen corresponding path program 1 times [2021-11-20 06:27:38,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:27:38,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305164366] [2021-11-20 06:27:38,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:38,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:27:39,001 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:27:39,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [989833478] [2021-11-20 06:27:39,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:39,002 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:27:39,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:39,003 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:27:39,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2021-11-20 06:27:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:39,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-20 06:27:39,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:39,225 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-20 06:27:39,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:27:39,384 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-20 06:27:39,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:27:39,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305164366] [2021-11-20 06:27:39,384 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:27:39,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989833478] [2021-11-20 06:27:39,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989833478] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:27:39,385 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:27:39,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-11-20 06:27:39,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77697646] [2021-11-20 06:27:39,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:27:39,386 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 06:27:39,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:39,386 INFO L85 PathProgramCache]: Analyzing trace with hash -894783275, now seen corresponding path program 3 times [2021-11-20 06:27:39,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:27:39,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124990056] [2021-11-20 06:27:39,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:39,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:27:39,392 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:27:39,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [232964715] [2021-11-20 06:27:39,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 06:27:39,392 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:27:39,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:39,397 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:27:39,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2021-11-20 06:27:39,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-11-20 06:27:39,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-20 06:27:39,455 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:27:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:27:39,478 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:27:40,612 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:27:40,612 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:27:40,612 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:27:40,612 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:27:40,612 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-11-20 06:27:40,613 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:40,613 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:27:40,613 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:27:40,613 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration11_Loop [2021-11-20 06:27:40,613 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:27:40,613 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:27:40,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:40,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:40,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:40,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:40,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:40,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:40,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:40,778 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:27:40,778 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-11-20 06:27:40,778 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:40,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:40,780 INFO L229 MonitoredProcess]: Starting monitored process 91 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:40,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2021-11-20 06:27:40,781 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:27:40,781 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:40,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:40,820 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:40,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:40,820 INFO L229 MonitoredProcess]: Starting monitored process 92 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:40,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2021-11-20 06:27:40,822 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-11-20 06:27:40,822 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:41,729 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-11-20 06:27:41,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:41,735 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:27:41,735 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:27:41,735 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:27:41,735 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:27:41,735 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-20 06:27:41,735 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:41,735 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:27:41,735 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:27:41,735 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration11_Loop [2021-11-20 06:27:41,735 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:27:41,735 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:27:41,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:41,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:41,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:41,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:41,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:41,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:41,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:41,911 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:27:41,911 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-20 06:27:41,912 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:41,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:41,913 INFO L229 MonitoredProcess]: Starting monitored process 93 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:41,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2021-11-20 06:27:41,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:27:41,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:27:41,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:27:41,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:27:41,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:27:41,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:27:41,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:27:41,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:27:41,926 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:27:41,951 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2021-11-20 06:27:41,951 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:41,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:41,952 INFO L229 MonitoredProcess]: Starting monitored process 94 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:41,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2021-11-20 06:27:41,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:27:41,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:27:41,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:27:41,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:27:41,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:27:41,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:27:41,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:27:41,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:27:41,977 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-20 06:27:41,985 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-11-20 06:27:41,985 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2021-11-20 06:27:41,985 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:41,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:41,990 INFO L229 MonitoredProcess]: Starting monitored process 95 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:41,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2021-11-20 06:27:41,991 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-20 06:27:41,991 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-11-20 06:27:41,991 INFO L513 LassoAnalysis]: Proved termination. [2021-11-20 06:27:41,991 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 [] [2021-11-20 06:27:42,015 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2021-11-20 06:27:42,016 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-11-20 06:27:42,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:42,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-20 06:27:42,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:42,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:42,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-20 06:27:42,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:42,927 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-20 06:27:42,927 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2021-11-20 06:27:42,928 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1918 states and 2805 transitions. cyclomatic complexity: 926 Second operand has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2021-11-20 06:27:43,897 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1918 states and 2805 transitions. cyclomatic complexity: 926. Second operand has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) Result 5476 states and 7569 transitions. Complement of second has 54 states. [2021-11-20 06:27:43,898 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 [2021-11-20 06:27:43,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2021-11-20 06:27:43,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 95 transitions. [2021-11-20 06:27:43,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 95 transitions. Stem has 41 letters. Loop has 41 letters. [2021-11-20 06:27:43,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:27:43,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 95 transitions. Stem has 82 letters. Loop has 41 letters. [2021-11-20 06:27:43,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:27:43,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 95 transitions. Stem has 41 letters. Loop has 82 letters. [2021-11-20 06:27:43,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:27:43,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5476 states and 7569 transitions. [2021-11-20 06:27:43,979 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 271 [2021-11-20 06:27:44,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5476 states to 4198 states and 5946 transitions. [2021-11-20 06:27:44,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1130 [2021-11-20 06:27:44,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1133 [2021-11-20 06:27:44,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4198 states and 5946 transitions. [2021-11-20 06:27:44,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:27:44,052 INFO L681 BuchiCegarLoop]: Abstraction has 4198 states and 5946 transitions. [2021-11-20 06:27:44,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4198 states and 5946 transitions. [2021-11-20 06:27:44,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4198 to 3941. [2021-11-20 06:27:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3941 states, 2407 states have (on average 1.1325301204819278) internal successors, (2726), 2436 states have internal predecessors, (2726), 1024 states have call successors, (1118), 522 states have call predecessors, (1118), 510 states have return successors, (1830), 982 states have call predecessors, (1830), 1024 states have call successors, (1830) [2021-11-20 06:27:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3941 states to 3941 states and 5674 transitions. [2021-11-20 06:27:44,312 INFO L704 BuchiCegarLoop]: Abstraction has 3941 states and 5674 transitions. [2021-11-20 06:27:44,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:27:44,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-20 06:27:44,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-11-20 06:27:44,314 INFO L87 Difference]: Start difference. First operand 3941 states and 5674 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2021-11-20 06:27:44,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:27:44,669 INFO L93 Difference]: Finished difference Result 1366 states and 1853 transitions. [2021-11-20 06:27:44,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 06:27:44,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1366 states and 1853 transitions. [2021-11-20 06:27:44,684 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 122 [2021-11-20 06:27:44,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1366 states to 1326 states and 1807 transitions. [2021-11-20 06:27:44,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 357 [2021-11-20 06:27:44,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 357 [2021-11-20 06:27:44,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1326 states and 1807 transitions. [2021-11-20 06:27:44,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:27:44,705 INFO L681 BuchiCegarLoop]: Abstraction has 1326 states and 1807 transitions. [2021-11-20 06:27:44,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states and 1807 transitions. [2021-11-20 06:27:44,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1194. [2021-11-20 06:27:44,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 743 states have (on average 1.0834454912516824) internal successors, (805), 758 states have internal predecessors, (805), 283 states have call successors, (310), 162 states have call predecessors, (310), 168 states have return successors, (472), 273 states have call predecessors, (472), 283 states have call successors, (472) [2021-11-20 06:27:44,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1587 transitions. [2021-11-20 06:27:44,759 INFO L704 BuchiCegarLoop]: Abstraction has 1194 states and 1587 transitions. [2021-11-20 06:27:44,759 INFO L587 BuchiCegarLoop]: Abstraction has 1194 states and 1587 transitions. [2021-11-20 06:27:44,759 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-11-20 06:27:44,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1194 states and 1587 transitions. [2021-11-20 06:27:44,767 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 101 [2021-11-20 06:27:44,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:27:44,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:27:44,769 INFO L842 BuchiCegarLoop]: 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] [2021-11-20 06:27:44,769 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:27:44,770 INFO L791 eck$LassoCheckResult]: Stem: 45503#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 45474#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 45475#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 45502#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 45525#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 45649#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 45648#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; 45466#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 45467#factENTRY ~n := #in~n; 45666#L25 assume ~n <= 0;#res := 1; 45664#factFINAL assume true; 45663#factEXIT >#68#return; 45517#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 45518#factENTRY ~n := #in~n; 45705#L25 assume ~n <= 0;#res := 1; 45702#factFINAL assume true; 45687#factEXIT >#70#return; 45688#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 45713#factENTRY ~n := #in~n; 45718#L25 assume ~n <= 0;#res := 1; 45714#factFINAL assume true; 45712#factEXIT >#72#return; 45709#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; 45711#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 45828#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 45826#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 45700#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; 45701#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 45835#factENTRY ~n := #in~n; 45838#L25 assume ~n <= 0;#res := 1; 45836#factFINAL assume true; 45834#factEXIT >#74#return; 45446#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 45832#factENTRY ~n := #in~n; 45842#L25 assume ~n <= 0;#res := 1; 45840#factFINAL assume true; 45445#factEXIT >#76#return; 45447#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 45526#factENTRY ~n := #in~n; 45805#L25 assume !(~n <= 0); 45480#L26 call #t~ret0 := fact(~n - 1);< 45481#factENTRY ~n := #in~n; 45819#L25 assume ~n <= 0;#res := 1; 45818#factFINAL assume true; 45815#factEXIT >#66#return; 45814#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 45792#factFINAL assume true; 45727#factEXIT >#78#return; 45726#L30-8 [2021-11-20 06:27:44,770 INFO L793 eck$LassoCheckResult]: Loop: 45726#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; 45485#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 45486#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 45742#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 45738#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; 45441#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 45442#factENTRY ~n := #in~n; 45761#L25 assume !(~n <= 0); 45745#L26 call #t~ret0 := fact(~n - 1);< 45751#factENTRY ~n := #in~n; 45756#L25 assume !(~n <= 0); 45748#L26 call #t~ret0 := fact(~n - 1);< 45754#factENTRY ~n := #in~n; 45758#L25 assume ~n <= 0;#res := 1; 45760#factFINAL assume true; 45757#factEXIT >#66#return; 45750#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 45753#factFINAL assume true; 45743#factEXIT >#66#return; 45739#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 45736#factFINAL assume true; 45732#factEXIT >#74#return; 45734#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 45741#factENTRY ~n := #in~n; 45755#L25 assume ~n <= 0;#res := 1; 45752#factFINAL assume true; 45740#factEXIT >#76#return; 45733#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 45737#factENTRY ~n := #in~n; 45837#L25 assume !(~n <= 0); 45747#L26 call #t~ret0 := fact(~n - 1);< 45759#factENTRY ~n := #in~n; 45756#L25 assume !(~n <= 0); 45748#L26 call #t~ret0 := fact(~n - 1);< 45754#factENTRY ~n := #in~n; 45758#L25 assume ~n <= 0;#res := 1; 45760#factFINAL assume true; 45757#factEXIT >#66#return; 45750#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 45753#factFINAL assume true; 45743#factEXIT >#66#return; 45739#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 45736#factFINAL assume true; 45732#factEXIT >#78#return; 45726#L30-8 [2021-11-20 06:27:44,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:44,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1440088363, now seen corresponding path program 1 times [2021-11-20 06:27:44,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:27:44,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894301870] [2021-11-20 06:27:44,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:44,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:27:44,778 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:27:44,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [558474432] [2021-11-20 06:27:44,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:44,779 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:27:44,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:44,780 INFO L229 MonitoredProcess]: Starting monitored process 96 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:27:44,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2021-11-20 06:27:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:44,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-20 06:27:44,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:45,056 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-20 06:27:45,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:27:45,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:27:45,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894301870] [2021-11-20 06:27:45,056 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:27:45,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558474432] [2021-11-20 06:27:45,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558474432] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:27:45,057 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:27:45,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 06:27:45,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057893182] [2021-11-20 06:27:45,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:27:45,058 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 06:27:45,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:45,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1514306572, now seen corresponding path program 2 times [2021-11-20 06:27:45,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:27:45,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483299834] [2021-11-20 06:27:45,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:45,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:27:45,062 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:27:45,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1712073051] [2021-11-20 06:27:45,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:27:45,063 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:27:45,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:45,064 INFO L229 MonitoredProcess]: Starting monitored process 97 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:27:45,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2021-11-20 06:27:45,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:27:45,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-20 06:27:45,119 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:27:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:27:45,146 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:27:47,681 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:27:47,681 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:27:47,681 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:27:47,681 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:27:47,681 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-11-20 06:27:47,681 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:47,681 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:27:47,682 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:27:47,682 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2021-11-20 06:27:47,682 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:27:47,682 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:27:47,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:47,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:47,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:47,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:47,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:47,826 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:27:47,826 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-11-20 06:27:47,826 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:47,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:47,828 INFO L229 MonitoredProcess]: Starting monitored process 98 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:47,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2021-11-20 06:27:47,828 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:27:47,829 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:47,838 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:27:47,838 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: [] [2021-11-20 06:27:47,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:47,860 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:47,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:47,861 INFO L229 MonitoredProcess]: Starting monitored process 99 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:47,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2021-11-20 06:27:47,863 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:27:47,864 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:47,872 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:27:47,872 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: [] [2021-11-20 06:27:47,893 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:47,893 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:47,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:47,894 INFO L229 MonitoredProcess]: Starting monitored process 100 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:47,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2021-11-20 06:27:47,895 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:27:47,895 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:47,925 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2021-11-20 06:27:47,926 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:47,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:47,927 INFO L229 MonitoredProcess]: Starting monitored process 101 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:47,928 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-11-20 06:27:47,928 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:27:47,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2021-11-20 06:27:47,945 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-11-20 06:27:47,966 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2021-11-20 06:27:47,966 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:27:47,966 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:27:47,980 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:27:47,981 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:27:47,981 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-20 06:27:47,981 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:47,981 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:27:47,981 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:27:47,981 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2021-11-20 06:27:47,981 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:27:47,981 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:27:47,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:47,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:47,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:47,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:48,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:27:48,135 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:27:48,135 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-20 06:27:48,135 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:48,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:48,136 INFO L229 MonitoredProcess]: Starting monitored process 102 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:48,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2021-11-20 06:27:48,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:27:48,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:27:48,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:27:48,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:27:48,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:27:48,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:27:48,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:27:48,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:27:48,147 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:27:48,171 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2021-11-20 06:27:48,172 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:48,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:48,172 INFO L229 MonitoredProcess]: Starting monitored process 103 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:48,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2021-11-20 06:27:48,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:27:48,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:27:48,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:27:48,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:27:48,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:27:48,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:27:48,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:27:48,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:27:48,184 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:27:48,208 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2021-11-20 06:27:48,209 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:48,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:48,211 INFO L229 MonitoredProcess]: Starting monitored process 104 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:48,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2021-11-20 06:27:48,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:27:48,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:27:48,221 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:27:48,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:27:48,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:27:48,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:27:48,222 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:27:48,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:27:48,225 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:27:48,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:48,248 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:48,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:48,249 INFO L229 MonitoredProcess]: Starting monitored process 105 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:48,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2021-11-20 06:27:48,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:27:48,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:27:48,259 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:27:48,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:27:48,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:27:48,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:27:48,261 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:27:48,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:27:48,265 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-20 06:27:48,270 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-11-20 06:27:48,270 INFO L444 ModelExtractionUtils]: 7 out of 11 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-11-20 06:27:48,270 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:27:48,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:48,271 INFO L229 MonitoredProcess]: Starting monitored process 106 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:27:48,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2021-11-20 06:27:48,272 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-20 06:27:48,272 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-11-20 06:27:48,272 INFO L513 LassoAnalysis]: Proved termination. [2021-11-20 06:27:48,272 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~k~0#1) = 1*ULTIMATE.start_main_~x~0#1 - 1*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2021-11-20 06:27:48,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2021-11-20 06:27:48,296 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-11-20 06:27:48,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:48,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-20 06:27:48,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:48,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-20 06:27:48,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:48,982 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2021-11-20 06:27:49,232 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-11-20 06:27:49,233 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2021-11-20 06:27:49,233 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1194 states and 1587 transitions. cyclomatic complexity: 413 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2021-11-20 06:27:49,427 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1194 states and 1587 transitions. cyclomatic complexity: 413. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Result 1907 states and 2434 transitions. Complement of second has 13 states. [2021-11-20 06:27:49,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2021-11-20 06:27:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2021-11-20 06:27:49,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2021-11-20 06:27:49,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 60 transitions. Stem has 48 letters. Loop has 44 letters. [2021-11-20 06:27:49,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:27:49,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 60 transitions. Stem has 92 letters. Loop has 44 letters. [2021-11-20 06:27:49,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:27:49,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 60 transitions. Stem has 48 letters. Loop has 88 letters. [2021-11-20 06:27:49,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:27:49,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1907 states and 2434 transitions. [2021-11-20 06:27:49,456 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 93 [2021-11-20 06:27:49,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1907 states to 898 states and 1236 transitions. [2021-11-20 06:27:49,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2021-11-20 06:27:49,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2021-11-20 06:27:49,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 898 states and 1236 transitions. [2021-11-20 06:27:49,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:27:49,471 INFO L681 BuchiCegarLoop]: Abstraction has 898 states and 1236 transitions. [2021-11-20 06:27:49,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states and 1236 transitions. [2021-11-20 06:27:49,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 730. [2021-11-20 06:27:49,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 439 states have (on average 1.1138952164009113) internal successors, (489), 447 states have internal predecessors, (489), 202 states have call successors, (213), 88 states have call predecessors, (213), 89 states have return successors, (350), 194 states have call predecessors, (350), 202 states have call successors, (350) [2021-11-20 06:27:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1052 transitions. [2021-11-20 06:27:49,513 INFO L704 BuchiCegarLoop]: Abstraction has 730 states and 1052 transitions. [2021-11-20 06:27:49,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:27:49,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 06:27:49,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:27:49,514 INFO L87 Difference]: Start difference. First operand 730 states and 1052 transitions. 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) [2021-11-20 06:27:49,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:27:49,700 INFO L93 Difference]: Finished difference Result 631 states and 885 transitions. [2021-11-20 06:27:49,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 06:27:49,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 631 states and 885 transitions. [2021-11-20 06:27:49,708 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 89 [2021-11-20 06:27:49,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 631 states to 528 states and 774 transitions. [2021-11-20 06:27:49,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 149 [2021-11-20 06:27:49,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2021-11-20 06:27:49,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 528 states and 774 transitions. [2021-11-20 06:27:49,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:27:49,719 INFO L681 BuchiCegarLoop]: Abstraction has 528 states and 774 transitions. [2021-11-20 06:27:49,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states and 774 transitions. [2021-11-20 06:27:49,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 519. [2021-11-20 06:27:49,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 312 states have (on average 1.1185897435897436) internal successors, (349), 314 states have internal predecessors, (349), 154 states have call successors, (156), 59 states have call predecessors, (156), 53 states have return successors, (260), 145 states have call predecessors, (260), 154 states have call successors, (260) [2021-11-20 06:27:49,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 765 transitions. [2021-11-20 06:27:49,753 INFO L704 BuchiCegarLoop]: Abstraction has 519 states and 765 transitions. [2021-11-20 06:27:49,756 INFO L587 BuchiCegarLoop]: Abstraction has 519 states and 765 transitions. [2021-11-20 06:27:49,756 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-11-20 06:27:49,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 519 states and 765 transitions. [2021-11-20 06:27:49,760 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 89 [2021-11-20 06:27:49,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:27:49,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:27:49,763 INFO L842 BuchiCegarLoop]: 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] [2021-11-20 06:27:49,763 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [10, 10, 6, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:27:49,763 INFO L791 eck$LassoCheckResult]: Stem: 50453#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 50424#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 50425#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 50452#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 50439#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 50440#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 50640#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; 50636#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 50637#factENTRY ~n := #in~n; 50641#L25 assume ~n <= 0;#res := 1; 50639#factFINAL assume true; 50635#factEXIT >#68#return; 50632#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 50633#factENTRY ~n := #in~n; 50638#L25 assume ~n <= 0;#res := 1; 50634#factFINAL assume true; 50631#factEXIT >#70#return; 50629#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 50630#factENTRY ~n := #in~n; 50645#L25 assume ~n <= 0;#res := 1; 50642#factFINAL assume true; 50628#factEXIT >#72#return; 50626#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; 50624#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 50623#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 50622#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 50620#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; 50615#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 50616#factENTRY ~n := #in~n; 50651#L25 assume !(~n <= 0); 50648#L26 call #t~ret0 := fact(~n - 1);< 50649#factENTRY ~n := #in~n; 50652#L25 assume ~n <= 0;#res := 1; 50650#factFINAL assume true; 50647#factEXIT >#66#return; 50646#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50644#factFINAL assume true; 50614#factEXIT >#74#return; 50609#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 50610#factENTRY ~n := #in~n; 50643#L25 assume ~n <= 0;#res := 1; 50613#factFINAL assume true; 50608#factEXIT >#76#return; 50605#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 50606#factENTRY ~n := #in~n; 50621#L25 assume !(~n <= 0); 50618#L26 call #t~ret0 := fact(~n - 1);< 50619#factENTRY ~n := #in~n; 50627#L25 assume ~n <= 0;#res := 1; 50625#factFINAL assume true; 50617#factEXIT >#66#return; 50612#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50607#factFINAL assume true; 50604#factEXIT >#78#return; 50603#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; 50429#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 50564#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 50558#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 50557#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 50556#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 50555#L42-3 [2021-11-20 06:27:49,764 INFO L793 eck$LassoCheckResult]: Loop: 50555#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 50554#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; 50390#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 50366#factENTRY ~n := #in~n; 50547#L25 assume !(~n <= 0); 50410#L26 call #t~ret0 := fact(~n - 1);< 50537#factENTRY ~n := #in~n; 50552#L25 assume ~n <= 0;#res := 1; 50409#factFINAL assume true; 50412#factEXIT >#66#return; 50540#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50559#factFINAL assume true; 50501#factEXIT >#68#return; 50377#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 50366#factENTRY ~n := #in~n; 50547#L25 assume ~n <= 0;#res := 1; 50545#factFINAL assume true; 50369#factEXIT >#70#return; 50393#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 50553#factENTRY ~n := #in~n; 50542#L25 assume !(~n <= 0); 50410#L26 call #t~ret0 := fact(~n - 1);< 50537#factENTRY ~n := #in~n; 50552#L25 assume ~n <= 0;#res := 1; 50409#factFINAL assume true; 50412#factEXIT >#66#return; 50540#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50559#factFINAL assume true; 50501#factEXIT >#72#return; 50395#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; 50443#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 50563#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 50561#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 50454#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; 50365#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 50366#factENTRY ~n := #in~n; 50547#L25 assume !(~n <= 0); 50410#L26 call #t~ret0 := fact(~n - 1);< 50537#factENTRY ~n := #in~n; 50552#L25 assume ~n <= 0;#res := 1; 50409#factFINAL assume true; 50412#factEXIT >#66#return; 50540#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50559#factFINAL assume true; 50501#factEXIT >#74#return; 50388#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 50366#factENTRY ~n := #in~n; 50547#L25 assume ~n <= 0;#res := 1; 50545#factFINAL assume true; 50369#factEXIT >#76#return; 50399#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 50553#factENTRY ~n := #in~n; 50542#L25 assume !(~n <= 0); 50410#L26 call #t~ret0 := fact(~n - 1);< 50537#factENTRY ~n := #in~n; 50552#L25 assume ~n <= 0;#res := 1; 50409#factFINAL assume true; 50412#factEXIT >#66#return; 50540#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50559#factFINAL assume true; 50501#factEXIT >#78#return; 50426#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; 50427#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 50475#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 50473#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 50449#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 50450#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 50555#L42-3 [2021-11-20 06:27:49,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:49,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 1 times [2021-11-20 06:27:49,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:27:49,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431491957] [2021-11-20 06:27:49,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:49,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:27:49,774 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:27:49,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [934614128] [2021-11-20 06:27:49,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:49,774 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:27:49,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:49,777 INFO L229 MonitoredProcess]: Starting monitored process 107 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:27:49,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2021-11-20 06:27:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:27:49,844 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:27:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:27:49,876 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:27:49,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:49,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1715041092, now seen corresponding path program 1 times [2021-11-20 06:27:49,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:27:49,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159312457] [2021-11-20 06:27:49,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:49,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:27:49,882 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:27:49,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [238002799] [2021-11-20 06:27:49,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:49,883 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:27:49,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:49,888 INFO L229 MonitoredProcess]: Starting monitored process 108 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:27:49,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2021-11-20 06:27:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:49,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-20 06:27:49,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:50,248 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 118 proven. 18 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-11-20 06:27:50,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:27:50,675 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 10 proven. 52 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-11-20 06:27:50,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:27:50,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159312457] [2021-11-20 06:27:50,676 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:27:50,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238002799] [2021-11-20 06:27:50,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238002799] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:27:50,676 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:27:50,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-11-20 06:27:50,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896990101] [2021-11-20 06:27:50,676 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:27:50,677 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 06:27:50,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:27:50,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-20 06:27:50,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-11-20 06:27:50,678 INFO L87 Difference]: Start difference. First operand 519 states and 765 transitions. cyclomatic complexity: 257 Second operand has 16 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 14 states have internal predecessors, (40), 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) [2021-11-20 06:27:51,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:27:51,377 INFO L93 Difference]: Finished difference Result 653 states and 959 transitions. [2021-11-20 06:27:51,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 06:27:51,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 653 states and 959 transitions. [2021-11-20 06:27:51,386 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 151 [2021-11-20 06:27:51,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 653 states to 653 states and 959 transitions. [2021-11-20 06:27:51,396 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 216 [2021-11-20 06:27:51,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 216 [2021-11-20 06:27:51,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 653 states and 959 transitions. [2021-11-20 06:27:51,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:27:51,402 INFO L681 BuchiCegarLoop]: Abstraction has 653 states and 959 transitions. [2021-11-20 06:27:51,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states and 959 transitions. [2021-11-20 06:27:51,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 535. [2021-11-20 06:27:51,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 332 states have (on average 1.1114457831325302) internal successors, (369), 330 states have internal predecessors, (369), 150 states have call successors, (152), 59 states have call predecessors, (152), 53 states have return successors, (254), 145 states have call predecessors, (254), 150 states have call successors, (254) [2021-11-20 06:27:51,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 775 transitions. [2021-11-20 06:27:51,423 INFO L704 BuchiCegarLoop]: Abstraction has 535 states and 775 transitions. [2021-11-20 06:27:51,423 INFO L587 BuchiCegarLoop]: Abstraction has 535 states and 775 transitions. [2021-11-20 06:27:51,423 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-11-20 06:27:51,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 535 states and 775 transitions. [2021-11-20 06:27:51,426 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 97 [2021-11-20 06:27:51,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:27:51,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:27:51,428 INFO L842 BuchiCegarLoop]: 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] [2021-11-20 06:27:51,428 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [10, 10, 6, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:27:51,428 INFO L791 eck$LassoCheckResult]: Stem: 52051#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 52022#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 52023#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 52050#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 52036#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 52037#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 52328#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; 52013#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 52014#factENTRY ~n := #in~n; 52330#L25 assume ~n <= 0;#res := 1; 52329#factFINAL assume true; 52324#factEXIT >#68#return; 52068#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 52069#factENTRY ~n := #in~n; 52326#L25 assume ~n <= 0;#res := 1; 52316#factFINAL assume true; 52315#factEXIT >#70#return; 52011#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 52012#factENTRY ~n := #in~n; 52365#L25 assume ~n <= 0;#res := 1; 52364#factFINAL assume true; 52363#factEXIT >#72#return; 52360#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; 52358#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 52354#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 52351#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 52348#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; 52342#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 52343#factENTRY ~n := #in~n; 52361#L25 assume !(~n <= 0); 52356#L26 call #t~ret0 := fact(~n - 1);< 52357#factENTRY ~n := #in~n; 52362#L25 assume ~n <= 0;#res := 1; 52359#factFINAL assume true; 52355#factEXIT >#66#return; 52353#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52347#factFINAL assume true; 52341#factEXIT >#74#return; 52337#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 52338#factENTRY ~n := #in~n; 52367#L25 assume ~n <= 0;#res := 1; 52366#factFINAL assume true; 52336#factEXIT >#76#return; 52306#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 52308#factENTRY ~n := #in~n; 52350#L25 assume !(~n <= 0); 52345#L26 call #t~ret0 := fact(~n - 1);< 52346#factENTRY ~n := #in~n; 52352#L25 assume ~n <= 0;#res := 1; 52349#factFINAL assume true; 52344#factEXIT >#66#return; 52340#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52335#factFINAL assume true; 52305#factEXIT >#78#return; 52307#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; 52302#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 52300#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 52075#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 52048#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 52049#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 52142#L42-3 [2021-11-20 06:27:51,429 INFO L793 eck$LassoCheckResult]: Loop: 52142#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 52141#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; 51981#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 51973#factENTRY ~n := #in~n; 52181#L25 assume !(~n <= 0); 52113#L26 call #t~ret0 := fact(~n - 1);< 52115#factENTRY ~n := #in~n; 52122#L25 assume ~n <= 0;#res := 1; 52120#factFINAL assume true; 52111#factEXIT >#66#return; 52114#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52143#factFINAL assume true; 52101#factEXIT >#68#return; 51977#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 51973#factENTRY ~n := #in~n; 52181#L25 assume !(~n <= 0); 52113#L26 call #t~ret0 := fact(~n - 1);< 52115#factENTRY ~n := #in~n; 52122#L25 assume ~n <= 0;#res := 1; 52120#factFINAL assume true; 52111#factEXIT >#66#return; 52114#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52143#factFINAL assume true; 52101#factEXIT >#70#return; 51982#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 52010#factENTRY ~n := #in~n; 52182#L25 assume ~n <= 0;#res := 1; 52015#factFINAL assume true; 51976#factEXIT >#72#return; 52005#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; 52188#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 52186#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 52185#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 52184#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; 51972#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 51973#factENTRY ~n := #in~n; 52181#L25 assume !(~n <= 0); 52113#L26 call #t~ret0 := fact(~n - 1);< 52115#factENTRY ~n := #in~n; 52122#L25 assume ~n <= 0;#res := 1; 52120#factFINAL assume true; 52111#factEXIT >#66#return; 52114#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52143#factFINAL assume true; 52101#factEXIT >#74#return; 51979#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 51973#factENTRY ~n := #in~n; 52181#L25 assume ~n <= 0;#res := 1; 52015#factFINAL assume true; 51976#factEXIT >#76#return; 52000#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 52144#factENTRY ~n := #in~n; 52121#L25 assume !(~n <= 0); 52113#L26 call #t~ret0 := fact(~n - 1);< 52115#factENTRY ~n := #in~n; 52122#L25 assume ~n <= 0;#res := 1; 52120#factFINAL assume true; 52111#factEXIT >#66#return; 52114#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52143#factFINAL assume true; 52101#factEXIT >#78#return; 52024#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; 52025#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 52074#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 52072#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 52046#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 52047#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 52142#L42-3 [2021-11-20 06:27:51,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:51,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 2 times [2021-11-20 06:27:51,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:27:51,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063870870] [2021-11-20 06:27:51,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:51,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:27:51,436 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:27:51,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [272952533] [2021-11-20 06:27:51,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:27:51,437 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:27:51,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:51,439 INFO L229 MonitoredProcess]: Starting monitored process 109 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:27:51,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2021-11-20 06:27:51,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:27:51,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-20 06:27:51,502 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:27:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:27:51,537 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:27:51,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:51,538 INFO L85 PathProgramCache]: Analyzing trace with hash 920708724, now seen corresponding path program 2 times [2021-11-20 06:27:51,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:27:51,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784658511] [2021-11-20 06:27:51,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:51,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:27:51,543 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:27:51,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1788341453] [2021-11-20 06:27:51,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:27:51,543 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:27:51,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:51,546 INFO L229 MonitoredProcess]: Starting monitored process 110 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:27:51,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2021-11-20 06:27:51,603 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:27:51,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:27:51,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-20 06:27:51,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 131 proven. 14 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-11-20 06:27:51,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:27:52,355 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 41 proven. 46 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2021-11-20 06:27:52,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:27:52,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784658511] [2021-11-20 06:27:52,356 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:27:52,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788341453] [2021-11-20 06:27:52,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788341453] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:27:52,356 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:27:52,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 15 [2021-11-20 06:27:52,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098215414] [2021-11-20 06:27:52,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:27:52,357 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 06:27:52,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:27:52,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 06:27:52,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-11-20 06:27:52,358 INFO L87 Difference]: Start difference. First operand 535 states and 775 transitions. cyclomatic complexity: 251 Second operand has 15 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 15 states have internal predecessors, (40), 9 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (15), 7 states have call predecessors, (15), 9 states have call successors, (15) [2021-11-20 06:27:52,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:27:52,969 INFO L93 Difference]: Finished difference Result 691 states and 1002 transitions. [2021-11-20 06:27:52,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 06:27:52,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 691 states and 1002 transitions. [2021-11-20 06:27:52,980 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 124 [2021-11-20 06:27:52,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 691 states to 689 states and 998 transitions. [2021-11-20 06:27:52,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2021-11-20 06:27:52,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 223 [2021-11-20 06:27:52,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 689 states and 998 transitions. [2021-11-20 06:27:52,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:27:52,992 INFO L681 BuchiCegarLoop]: Abstraction has 689 states and 998 transitions. [2021-11-20 06:27:52,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states and 998 transitions. [2021-11-20 06:27:53,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 569. [2021-11-20 06:27:53,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 352 states have (on average 1.1079545454545454) internal successors, (390), 352 states have internal predecessors, (390), 164 states have call successors, (166), 59 states have call predecessors, (166), 53 states have return successors, (272), 157 states have call predecessors, (272), 164 states have call successors, (272) [2021-11-20 06:27:53,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 828 transitions. [2021-11-20 06:27:53,017 INFO L704 BuchiCegarLoop]: Abstraction has 569 states and 828 transitions. [2021-11-20 06:27:53,017 INFO L587 BuchiCegarLoop]: Abstraction has 569 states and 828 transitions. [2021-11-20 06:27:53,017 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-11-20 06:27:53,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 569 states and 828 transitions. [2021-11-20 06:27:53,022 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 108 [2021-11-20 06:27:53,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:27:53,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:27:53,026 INFO L842 BuchiCegarLoop]: 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] [2021-11-20 06:27:53,026 INFO L843 BuchiCegarLoop]: 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] [2021-11-20 06:27:53,027 INFO L791 eck$LassoCheckResult]: Stem: 53708#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 53684#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 53685#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 53707#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 53693#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 53694#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 54016#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; 53678#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 53679#factENTRY ~n := #in~n; 53983#L25 assume ~n <= 0;#res := 1; 53980#factFINAL assume true; 53977#factEXIT >#68#return; 53724#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 53725#factENTRY ~n := #in~n; 54017#L25 assume ~n <= 0;#res := 1; 54008#factFINAL assume true; 54007#factEXIT >#70#return; 53672#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 53673#factENTRY ~n := #in~n; 54080#L25 assume ~n <= 0;#res := 1; 54079#factFINAL assume true; 54078#factEXIT >#72#return; 54076#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; 54072#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 53728#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 53716#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 53710#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; 53630#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 53631#factENTRY ~n := #in~n; 54186#L25 assume !(~n <= 0); 54183#L26 call #t~ret0 := fact(~n - 1);< 54184#factENTRY ~n := #in~n; 54187#L25 assume ~n <= 0;#res := 1; 54185#factFINAL assume true; 54182#factEXIT >#66#return; 54181#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54180#factFINAL assume true; 54178#factEXIT >#74#return; 54153#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 54154#factENTRY ~n := #in~n; 54164#L25 assume ~n <= 0;#res := 1; 54159#factFINAL assume true; 54152#factEXIT >#76#return; 53729#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 53730#factENTRY ~n := #in~n; 54042#L25 assume !(~n <= 0); 54039#L26 call #t~ret0 := fact(~n - 1);< 54040#factENTRY ~n := #in~n; 54043#L25 assume ~n <= 0;#res := 1; 54041#factFINAL assume true; 54038#factEXIT >#66#return; 54037#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54036#factFINAL assume true; 54027#factEXIT >#78#return; 54028#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; 54020#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 54018#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 54014#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 53705#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 53706#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 53801#L42-3 [2021-11-20 06:27:53,027 INFO L793 eck$LassoCheckResult]: Loop: 53801#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 53786#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; 53740#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 53767#factENTRY ~n := #in~n; 53795#L25 assume !(~n <= 0); 53772#L26 call #t~ret0 := fact(~n - 1);< 53779#factENTRY ~n := #in~n; 53785#L25 assume !(~n <= 0); 53773#L26 call #t~ret0 := fact(~n - 1);< 53788#factENTRY ~n := #in~n; 53792#L25 assume ~n <= 0;#res := 1; 53803#factFINAL assume true; 53802#factEXIT >#66#return; 53776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53787#factFINAL assume true; 53771#factEXIT >#66#return; 53770#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53762#factFINAL assume true; 53765#factEXIT >#68#return; 53747#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 53767#factENTRY ~n := #in~n; 53795#L25 assume ~n <= 0;#res := 1; 53793#factFINAL assume true; 53789#factEXIT >#70#return; 53763#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 53761#factENTRY ~n := #in~n; 53781#L25 assume !(~n <= 0); 53775#L26 call #t~ret0 := fact(~n - 1);< 53690#factENTRY ~n := #in~n; 53785#L25 assume !(~n <= 0); 53773#L26 call #t~ret0 := fact(~n - 1);< 53788#factENTRY ~n := #in~n; 53792#L25 assume ~n <= 0;#res := 1; 53803#factFINAL assume true; 53802#factEXIT >#66#return; 53776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53787#factFINAL assume true; 53771#factEXIT >#66#return; 53770#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53762#factFINAL assume true; 53765#factEXIT >#72#return; 53758#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; 53800#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 53799#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 53798#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 53797#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; 53752#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 53767#factENTRY ~n := #in~n; 53795#L25 assume !(~n <= 0); 53772#L26 call #t~ret0 := fact(~n - 1);< 53779#factENTRY ~n := #in~n; 53783#L25 assume ~n <= 0;#res := 1; 53782#factFINAL assume true; 53778#factEXIT >#66#return; 53768#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53769#factFINAL assume true; 53736#factEXIT >#68#return; 53748#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 53767#factENTRY ~n := #in~n; 53795#L25 assume !(~n <= 0); 53772#L26 call #t~ret0 := fact(~n - 1);< 53779#factENTRY ~n := #in~n; 53785#L25 assume !(~n <= 0); 53773#L26 call #t~ret0 := fact(~n - 1);< 53788#factENTRY ~n := #in~n; 53792#L25 assume ~n <= 0;#res := 1; 53803#factFINAL assume true; 53802#factEXIT >#66#return; 53776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53787#factFINAL assume true; 53771#factEXIT >#66#return; 53770#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53762#factFINAL assume true; 53765#factEXIT >#70#return; 53757#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 53794#factENTRY ~n := #in~n; 53796#L25 assume ~n <= 0;#res := 1; 53793#factFINAL assume true; 53789#factEXIT >#72#return; 53790#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; 54009#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 53809#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 53808#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 53804#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; 53745#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 53766#factENTRY ~n := #in~n; 53784#L25 assume !(~n <= 0); 53772#L26 call #t~ret0 := fact(~n - 1);< 53779#factENTRY ~n := #in~n; 53785#L25 assume !(~n <= 0); 53773#L26 call #t~ret0 := fact(~n - 1);< 53788#factENTRY ~n := #in~n; 53792#L25 assume ~n <= 0;#res := 1; 53803#factFINAL assume true; 53802#factEXIT >#66#return; 53776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53787#factFINAL assume true; 53771#factEXIT >#66#return; 53770#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53762#factFINAL assume true; 53765#factEXIT >#74#return; 53737#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 53767#factENTRY ~n := #in~n; 53795#L25 assume !(~n <= 0); 53772#L26 call #t~ret0 := fact(~n - 1);< 53779#factENTRY ~n := #in~n; 53785#L25 assume !(~n <= 0); 53773#L26 call #t~ret0 := fact(~n - 1);< 53788#factENTRY ~n := #in~n; 53792#L25 assume ~n <= 0;#res := 1; 53803#factFINAL assume true; 53802#factEXIT >#66#return; 53776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53787#factFINAL assume true; 53771#factEXIT >#66#return; 53770#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53762#factFINAL assume true; 53765#factEXIT >#76#return; 53738#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 53766#factENTRY ~n := #in~n; 53784#L25 assume !(~n <= 0); 53772#L26 call #t~ret0 := fact(~n - 1);< 53779#factENTRY ~n := #in~n; 53783#L25 assume ~n <= 0;#res := 1; 53782#factFINAL assume true; 53778#factEXIT >#66#return; 53768#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53769#factFINAL assume true; 53736#factEXIT >#78#return; 53735#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; 53734#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 53733#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 53731#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 53703#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 53704#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 53801#L42-3 [2021-11-20 06:27:53,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:53,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 3 times [2021-11-20 06:27:53,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:27:53,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923256097] [2021-11-20 06:27:53,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:53,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:27:53,039 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:27:53,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [660285291] [2021-11-20 06:27:53,040 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 06:27:53,040 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:27:53,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:53,042 INFO L229 MonitoredProcess]: Starting monitored process 111 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:27:53,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2021-11-20 06:27:53,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2021-11-20 06:27:53,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-20 06:27:53,121 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:27:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:27:53,158 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:27:53,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:53,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1140274845, now seen corresponding path program 3 times [2021-11-20 06:27:53,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:27:53,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986555656] [2021-11-20 06:27:53,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:53,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:27:53,172 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:27:53,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1292552414] [2021-11-20 06:27:53,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 06:27:53,173 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:27:53,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:53,175 INFO L229 MonitoredProcess]: Starting monitored process 112 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:27:53,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2021-11-20 06:27:53,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2021-11-20 06:27:53,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:27:53,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-20 06:27:53,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:53,729 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 362 proven. 77 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2021-11-20 06:27:53,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:27:54,458 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 188 proven. 109 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2021-11-20 06:27:54,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:27:54,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986555656] [2021-11-20 06:27:54,459 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:27:54,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292552414] [2021-11-20 06:27:54,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292552414] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:27:54,460 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:27:54,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 16 [2021-11-20 06:27:54,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856446328] [2021-11-20 06:27:54,460 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:27:54,461 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 06:27:54,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:27:54,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-20 06:27:54,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-11-20 06:27:54,462 INFO L87 Difference]: Start difference. First operand 569 states and 828 transitions. cyclomatic complexity: 272 Second operand has 16 states, 13 states have (on average 3.769230769230769) internal successors, (49), 16 states have internal predecessors, (49), 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) [2021-11-20 06:27:55,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:27:55,366 INFO L93 Difference]: Finished difference Result 761 states and 1119 transitions. [2021-11-20 06:27:55,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-20 06:27:55,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 761 states and 1119 transitions. [2021-11-20 06:27:55,376 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 183 [2021-11-20 06:27:55,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 761 states to 759 states and 1117 transitions. [2021-11-20 06:27:55,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2021-11-20 06:27:55,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 260 [2021-11-20 06:27:55,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 759 states and 1117 transitions. [2021-11-20 06:27:55,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:27:55,391 INFO L681 BuchiCegarLoop]: Abstraction has 759 states and 1117 transitions. [2021-11-20 06:27:55,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states and 1117 transitions. [2021-11-20 06:27:55,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 673. [2021-11-20 06:27:55,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 412 states have (on average 1.1213592233009708) internal successors, (462), 410 states have internal predecessors, (462), 208 states have call successors, (210), 65 states have call predecessors, (210), 53 states have return successors, (324), 197 states have call predecessors, (324), 208 states have call successors, (324) [2021-11-20 06:27:55,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 996 transitions. [2021-11-20 06:27:55,417 INFO L704 BuchiCegarLoop]: Abstraction has 673 states and 996 transitions. [2021-11-20 06:27:55,417 INFO L587 BuchiCegarLoop]: Abstraction has 673 states and 996 transitions. [2021-11-20 06:27:55,418 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-11-20 06:27:55,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 673 states and 996 transitions. [2021-11-20 06:27:55,422 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 153 [2021-11-20 06:27:55,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:27:55,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:27:55,424 INFO L842 BuchiCegarLoop]: 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] [2021-11-20 06:27:55,424 INFO L843 BuchiCegarLoop]: 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] [2021-11-20 06:27:55,424 INFO L791 eck$LassoCheckResult]: Stem: 55865#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 55831#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 55832#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 55864#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 55849#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 55850#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 56139#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; 56136#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 56137#factENTRY ~n := #in~n; 56140#L25 assume ~n <= 0;#res := 1; 56138#factFINAL assume true; 56135#factEXIT >#68#return; 56127#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 56128#factENTRY ~n := #in~n; 56131#L25 assume ~n <= 0;#res := 1; 56130#factFINAL assume true; 56126#factEXIT >#70#return; 56124#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 56125#factENTRY ~n := #in~n; 56133#L25 assume ~n <= 0;#res := 1; 56132#factFINAL assume true; 56123#factEXIT >#72#return; 56120#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; 56119#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 56118#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 56116#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 56111#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; 56103#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 56104#factENTRY ~n := #in~n; 56117#L25 assume !(~n <= 0); 56114#L26 call #t~ret0 := fact(~n - 1);< 56115#factENTRY ~n := #in~n; 56129#L25 assume ~n <= 0;#res := 1; 56122#factFINAL assume true; 56113#factEXIT >#66#return; 56110#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56109#factFINAL assume true; 56102#factEXIT >#74#return; 56097#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 56098#factENTRY ~n := #in~n; 56108#L25 assume ~n <= 0;#res := 1; 56101#factFINAL assume true; 56096#factEXIT >#76#return; 56093#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 56094#factENTRY ~n := #in~n; 56134#L25 assume !(~n <= 0); 56106#L26 call #t~ret0 := fact(~n - 1);< 56107#factENTRY ~n := #in~n; 56121#L25 assume ~n <= 0;#res := 1; 56112#factFINAL assume true; 56105#factEXIT >#66#return; 56100#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56095#factFINAL assume true; 56092#factEXIT >#78#return; 56090#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; 56091#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 56306#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 56061#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 56060#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 56037#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 56016#L42-3 [2021-11-20 06:27:55,425 INFO L793 eck$LassoCheckResult]: Loop: 56016#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 56008#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; 55885#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 55823#factENTRY ~n := #in~n; 56019#L25 assume !(~n <= 0); 55972#L26 call #t~ret0 := fact(~n - 1);< 55978#factENTRY ~n := #in~n; 56014#L25 assume !(~n <= 0); 55806#L26 call #t~ret0 := fact(~n - 1);< 56012#factENTRY ~n := #in~n; 56015#L25 assume ~n <= 0;#res := 1; 55815#factFINAL assume true; 55805#factEXIT >#66#return; 55807#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56011#factFINAL assume true; 55970#factEXIT >#66#return; 55871#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55900#factFINAL assume true; 56038#factEXIT >#68#return; 55873#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 55823#factENTRY ~n := #in~n; 56019#L25 assume !(~n <= 0); 55972#L26 call #t~ret0 := fact(~n - 1);< 55978#factENTRY ~n := #in~n; 55829#L25 assume ~n <= 0;#res := 1; 55980#factFINAL assume true; 55976#factEXIT >#66#return; 55977#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56059#factFINAL assume true; 56047#factEXIT >#70#return; 55878#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 55823#factENTRY ~n := #in~n; 56019#L25 assume ~n <= 0;#res := 1; 56033#factFINAL assume true; 56000#factEXIT >#72#return; 56007#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; 56080#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 56079#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 56069#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 55866#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; 55867#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 55802#factENTRY ~n := #in~n; 56013#L25 assume !(~n <= 0); 55972#L26 call #t~ret0 := fact(~n - 1);< 55978#factENTRY ~n := #in~n; 56014#L25 assume !(~n <= 0); 55806#L26 call #t~ret0 := fact(~n - 1);< 56012#factENTRY ~n := #in~n; 56015#L25 assume ~n <= 0;#res := 1; 55815#factFINAL assume true; 55805#factEXIT >#66#return; 55807#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56011#factFINAL assume true; 55970#factEXIT >#66#return; 55871#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55900#factFINAL assume true; 56038#factEXIT >#68#return; 55984#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 56036#factENTRY ~n := #in~n; 56067#L25 assume !(~n <= 0); 55827#L26 call #t~ret0 := fact(~n - 1);< 55826#factENTRY ~n := #in~n; 55829#L25 assume ~n <= 0;#res := 1; 55980#factFINAL assume true; 55976#factEXIT >#66#return; 55977#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56059#factFINAL assume true; 56047#factEXIT >#70#return; 55899#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 55823#factENTRY ~n := #in~n; 56019#L25 assume ~n <= 0;#res := 1; 56033#factFINAL assume true; 56000#factEXIT >#72#return; 56005#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; 55857#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 55858#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 55908#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 55909#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; 55886#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 55802#factENTRY ~n := #in~n; 56013#L25 assume !(~n <= 0); 55972#L26 call #t~ret0 := fact(~n - 1);< 55978#factENTRY ~n := #in~n; 56014#L25 assume !(~n <= 0); 55806#L26 call #t~ret0 := fact(~n - 1);< 56012#factENTRY ~n := #in~n; 56015#L25 assume ~n <= 0;#res := 1; 55815#factFINAL assume true; 55805#factEXIT >#66#return; 55807#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56011#factFINAL assume true; 55970#factEXIT >#66#return; 55871#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55900#factFINAL assume true; 56038#factEXIT >#74#return; 55985#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 56036#factENTRY ~n := #in~n; 56067#L25 assume !(~n <= 0); 55827#L26 call #t~ret0 := fact(~n - 1);< 55826#factENTRY ~n := #in~n; 55829#L25 assume ~n <= 0;#res := 1; 55980#factFINAL assume true; 55976#factEXIT >#66#return; 55977#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56059#factFINAL assume true; 56047#factEXIT >#76#return; 55881#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 55802#factENTRY ~n := #in~n; 56013#L25 assume !(~n <= 0); 55972#L26 call #t~ret0 := fact(~n - 1);< 55978#factENTRY ~n := #in~n; 55829#L25 assume ~n <= 0;#res := 1; 55980#factFINAL assume true; 55976#factEXIT >#66#return; 55977#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56059#factFINAL assume true; 56047#factEXIT >#78#return; 56039#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; 56052#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 56050#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 56048#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 55861#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 55862#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 56016#L42-3 [2021-11-20 06:27:55,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:55,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 4 times [2021-11-20 06:27:55,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:27:55,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468620327] [2021-11-20 06:27:55,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:55,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:27:55,431 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:27:55,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [725100502] [2021-11-20 06:27:55,431 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 06:27:55,432 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:27:55,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:55,438 INFO L229 MonitoredProcess]: Starting monitored process 113 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:27:55,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2021-11-20 06:27:55,513 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 06:27:55,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-20 06:27:55,514 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:27:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:27:55,551 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:27:55,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:55,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1247475331, now seen corresponding path program 4 times [2021-11-20 06:27:55,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:27:55,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025163219] [2021-11-20 06:27:55,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:55,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:27:55,559 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:27:55,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [148402225] [2021-11-20 06:27:55,559 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 06:27:55,559 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:27:55,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:55,565 INFO L229 MonitoredProcess]: Starting monitored process 114 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:27:55,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2021-11-20 06:27:55,653 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 06:27:55,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:27:55,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-20 06:27:55,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:56,037 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 380 proven. 27 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2021-11-20 06:27:56,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:27:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 26 proven. 267 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2021-11-20 06:27:56,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:27:56,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025163219] [2021-11-20 06:27:56,758 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:27:56,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148402225] [2021-11-20 06:27:56,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148402225] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:27:56,758 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:27:56,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2021-11-20 06:27:56,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360350421] [2021-11-20 06:27:56,759 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:27:56,759 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 06:27:56,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:27:56,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 06:27:56,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-11-20 06:27:56,760 INFO L87 Difference]: Start difference. First operand 673 states and 996 transitions. cyclomatic complexity: 336 Second operand has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 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) [2021-11-20 06:27:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:27:57,334 INFO L93 Difference]: Finished difference Result 805 states and 1147 transitions. [2021-11-20 06:27:57,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 06:27:57,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 805 states and 1147 transitions. [2021-11-20 06:27:57,345 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 164 [2021-11-20 06:27:57,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 805 states to 767 states and 1072 transitions. [2021-11-20 06:27:57,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 269 [2021-11-20 06:27:57,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 269 [2021-11-20 06:27:57,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 767 states and 1072 transitions. [2021-11-20 06:27:57,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:27:57,358 INFO L681 BuchiCegarLoop]: Abstraction has 767 states and 1072 transitions. [2021-11-20 06:27:57,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states and 1072 transitions. [2021-11-20 06:27:57,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 624. [2021-11-20 06:27:57,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 387 states have (on average 1.103359173126615) internal successors, (427), 384 states have internal predecessors, (427), 184 states have call successors, (186), 65 states have call predecessors, (186), 53 states have return successors, (278), 174 states have call predecessors, (278), 184 states have call successors, (278) [2021-11-20 06:27:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 891 transitions. [2021-11-20 06:27:57,383 INFO L704 BuchiCegarLoop]: Abstraction has 624 states and 891 transitions. [2021-11-20 06:27:57,383 INFO L587 BuchiCegarLoop]: Abstraction has 624 states and 891 transitions. [2021-11-20 06:27:57,383 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-11-20 06:27:57,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 624 states and 891 transitions. [2021-11-20 06:27:57,388 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 127 [2021-11-20 06:27:57,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:27:57,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:27:57,391 INFO L842 BuchiCegarLoop]: 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] [2021-11-20 06:27:57,391 INFO L843 BuchiCegarLoop]: 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] [2021-11-20 06:27:57,391 INFO L791 eck$LassoCheckResult]: Stem: 58157#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 58122#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 58123#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 58156#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 58142#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 58143#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 58441#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; 58438#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 58439#factENTRY ~n := #in~n; 58442#L25 assume ~n <= 0;#res := 1; 58440#factFINAL assume true; 58437#factEXIT >#68#return; 58170#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 58171#factENTRY ~n := #in~n; 58475#L25 assume ~n <= 0;#res := 1; 58474#factFINAL assume true; 58473#factEXIT >#70#return; 58089#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 58090#factENTRY ~n := #in~n; 58530#L25 assume ~n <= 0;#res := 1; 58528#factFINAL assume true; 58516#factEXIT >#72#return; 58511#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; 58150#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 58151#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 58168#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 58159#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; 58160#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 58509#factENTRY ~n := #in~n; 58541#L25 assume !(~n <= 0); 58537#L26 call #t~ret0 := fact(~n - 1);< 58539#factENTRY ~n := #in~n; 58553#L25 assume ~n <= 0;#res := 1; 58554#factFINAL assume true; 58536#factEXIT >#66#return; 58538#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58532#factFINAL assume true; 58504#factEXIT >#74#return; 58496#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 58498#factENTRY ~n := #in~n; 58564#L25 assume ~n <= 0;#res := 1; 58563#factFINAL assume true; 58495#factEXIT >#76#return; 58497#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 58559#factENTRY ~n := #in~n; 58572#L25 assume !(~n <= 0); 58566#L26 call #t~ret0 := fact(~n - 1);< 58567#factENTRY ~n := #in~n; 58571#L25 assume ~n <= 0;#res := 1; 58570#factFINAL assume true; 58565#factEXIT >#66#return; 58562#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58560#factFINAL assume true; 58558#factEXIT >#78#return; 58557#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; 58488#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 58487#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 58315#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 58154#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 58155#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 58166#L42-3 [2021-11-20 06:27:57,392 INFO L793 eck$LassoCheckResult]: Loop: 58166#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 58167#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; 58074#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 58169#factENTRY ~n := #in~n; 58261#L25 assume !(~n <= 0); 58189#L26 call #t~ret0 := fact(~n - 1);< 58198#factENTRY ~n := #in~n; 58204#L25 assume ~n <= 0;#res := 1; 58201#factFINAL assume true; 58186#factEXIT >#66#return; 58161#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58091#factFINAL assume true; 58046#factEXIT >#68#return; 58065#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 58169#factENTRY ~n := #in~n; 58261#L25 assume ~n <= 0;#res := 1; 58164#factFINAL assume true; 58256#factEXIT >#70#return; 58047#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 58043#factENTRY ~n := #in~n; 58275#L25 assume !(~n <= 0); 58189#L26 call #t~ret0 := fact(~n - 1);< 58198#factENTRY ~n := #in~n; 58202#L25 assume !(~n <= 0); 58184#L26 call #t~ret0 := fact(~n - 1);< 58196#factENTRY ~n := #in~n; 58203#L25 assume ~n <= 0;#res := 1; 58200#factFINAL assume true; 58183#factEXIT >#66#return; 58185#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58205#factFINAL assume true; 58192#factEXIT >#66#return; 58195#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58264#factFINAL assume true; 58262#factEXIT >#72#return; 58079#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; 58310#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 58308#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 58305#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 58276#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; 58048#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 58169#factENTRY ~n := #in~n; 58261#L25 assume !(~n <= 0); 58189#L26 call #t~ret0 := fact(~n - 1);< 58198#factENTRY ~n := #in~n; 58204#L25 assume ~n <= 0;#res := 1; 58201#factFINAL assume true; 58186#factEXIT >#66#return; 58161#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58091#factFINAL assume true; 58046#factEXIT >#68#return; 58072#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 58214#factENTRY ~n := #in~n; 58211#L25 assume !(~n <= 0); 58187#L26 call #t~ret0 := fact(~n - 1);< 58197#factENTRY ~n := #in~n; 58204#L25 assume ~n <= 0;#res := 1; 58201#factFINAL assume true; 58186#factEXIT >#66#return; 58161#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58091#factFINAL assume true; 58046#factEXIT >#70#return; 58084#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 58260#factENTRY ~n := #in~n; 58163#L25 assume ~n <= 0;#res := 1; 58164#factFINAL assume true; 58256#factEXIT >#72#return; 58258#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; 58271#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 58269#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 58267#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 58265#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; 58062#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 58043#factENTRY ~n := #in~n; 58275#L25 assume !(~n <= 0); 58189#L26 call #t~ret0 := fact(~n - 1);< 58198#factENTRY ~n := #in~n; 58202#L25 assume !(~n <= 0); 58184#L26 call #t~ret0 := fact(~n - 1);< 58196#factENTRY ~n := #in~n; 58203#L25 assume ~n <= 0;#res := 1; 58200#factFINAL assume true; 58183#factEXIT >#66#return; 58185#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58205#factFINAL assume true; 58192#factEXIT >#66#return; 58195#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58264#factFINAL assume true; 58262#factEXIT >#74#return; 58051#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 58214#factENTRY ~n := #in~n; 58211#L25 assume !(~n <= 0); 58187#L26 call #t~ret0 := fact(~n - 1);< 58197#factENTRY ~n := #in~n; 58204#L25 assume ~n <= 0;#res := 1; 58201#factFINAL assume true; 58186#factEXIT >#66#return; 58161#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58091#factFINAL assume true; 58046#factEXIT >#76#return; 58056#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 58043#factENTRY ~n := #in~n; 58275#L25 assume !(~n <= 0); 58189#L26 call #t~ret0 := fact(~n - 1);< 58198#factENTRY ~n := #in~n; 58204#L25 assume ~n <= 0;#res := 1; 58201#factFINAL assume true; 58186#factEXIT >#66#return; 58161#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58091#factFINAL assume true; 58046#factEXIT >#78#return; 58081#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; 58272#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 58270#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 58268#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 58152#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 58153#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 58166#L42-3 [2021-11-20 06:27:57,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:57,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 5 times [2021-11-20 06:27:57,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:27:57,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818160871] [2021-11-20 06:27:57,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:57,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:27:57,409 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:27:57,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [543006549] [2021-11-20 06:27:57,409 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-20 06:27:57,410 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:27:57,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:57,414 INFO L229 MonitoredProcess]: Starting monitored process 115 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:27:57,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2021-11-20 06:27:57,493 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2021-11-20 06:27:57,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-20 06:27:57,494 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:27:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:27:57,547 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:27:57,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:57,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1937843675, now seen corresponding path program 5 times [2021-11-20 06:27:57,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:27:57,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786433556] [2021-11-20 06:27:57,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:57,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:27:57,554 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:27:57,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [231321093] [2021-11-20 06:27:57,555 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-20 06:27:57,555 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:27:57,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:57,561 INFO L229 MonitoredProcess]: Starting monitored process 116 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:27:57,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2021-11-20 06:27:57,647 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2021-11-20 06:27:57,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:27:57,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-20 06:27:57,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 402 proven. 90 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2021-11-20 06:27:58,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:27:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 42 proven. 245 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2021-11-20 06:27:58,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:27:58,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786433556] [2021-11-20 06:27:58,863 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:27:58,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231321093] [2021-11-20 06:27:58,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231321093] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:27:58,864 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:27:58,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 19 [2021-11-20 06:27:58,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126066005] [2021-11-20 06:27:58,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:27:58,865 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 06:27:58,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:27:58,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 06:27:58,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2021-11-20 06:27:58,867 INFO L87 Difference]: Start difference. First operand 624 states and 891 transitions. cyclomatic complexity: 281 Second operand has 19 states, 14 states have (on average 3.5) internal successors, (49), 17 states have internal predecessors, (49), 12 states have call successors, (23), 2 states have call predecessors, (23), 6 states have return successors, (23), 9 states have call predecessors, (23), 12 states have call successors, (23) [2021-11-20 06:27:59,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:27:59,714 INFO L93 Difference]: Finished difference Result 810 states and 1105 transitions. [2021-11-20 06:27:59,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-20 06:27:59,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 810 states and 1105 transitions. [2021-11-20 06:27:59,728 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 203 [2021-11-20 06:27:59,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 810 states to 810 states and 1105 transitions. [2021-11-20 06:27:59,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 300 [2021-11-20 06:27:59,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 300 [2021-11-20 06:27:59,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 810 states and 1105 transitions. [2021-11-20 06:27:59,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:27:59,740 INFO L681 BuchiCegarLoop]: Abstraction has 810 states and 1105 transitions. [2021-11-20 06:27:59,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states and 1105 transitions. [2021-11-20 06:27:59,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 651. [2021-11-20 06:27:59,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 407 states have (on average 1.0982800982800982) internal successors, (447), 404 states have internal predecessors, (447), 191 states have call successors, (193), 65 states have call predecessors, (193), 53 states have return successors, (279), 181 states have call predecessors, (279), 191 states have call successors, (279) [2021-11-20 06:27:59,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 919 transitions. [2021-11-20 06:27:59,762 INFO L704 BuchiCegarLoop]: Abstraction has 651 states and 919 transitions. [2021-11-20 06:27:59,762 INFO L587 BuchiCegarLoop]: Abstraction has 651 states and 919 transitions. [2021-11-20 06:27:59,762 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-11-20 06:27:59,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 651 states and 919 transitions. [2021-11-20 06:27:59,767 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 141 [2021-11-20 06:27:59,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:27:59,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:27:59,771 INFO L842 BuchiCegarLoop]: 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] [2021-11-20 06:27:59,772 INFO L843 BuchiCegarLoop]: 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] [2021-11-20 06:27:59,772 INFO L791 eck$LassoCheckResult]: Stem: 60304#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 60275#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 60276#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 60303#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 60291#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 60292#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 60668#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; 60259#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60260#factENTRY ~n := #in~n; 60672#L25 assume ~n <= 0;#res := 1; 60671#factFINAL assume true; 60670#factEXIT >#68#return; 60327#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 60328#factENTRY ~n := #in~n; 60692#L25 assume ~n <= 0;#res := 1; 60691#factFINAL assume true; 60690#factEXIT >#70#return; 60257#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60258#factENTRY ~n := #in~n; 60743#L25 assume ~n <= 0;#res := 1; 60734#factFINAL assume true; 60732#factEXIT >#72#return; 60296#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; 60297#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 60299#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 60333#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 60306#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; 60307#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60759#factENTRY ~n := #in~n; 60774#L25 assume !(~n <= 0); 60772#L26 call #t~ret0 := fact(~n - 1);< 60773#factENTRY ~n := #in~n; 60776#L25 assume ~n <= 0;#res := 1; 60775#factFINAL assume true; 60771#factEXIT >#66#return; 60769#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60765#factFINAL assume true; 60758#factEXIT >#74#return; 60711#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 60714#factENTRY ~n := #in~n; 60713#L25 assume ~n <= 0;#res := 1; 60710#factFINAL assume true; 60712#factEXIT >#76#return; 60751#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60752#factENTRY ~n := #in~n; 60782#L25 assume !(~n <= 0); 60761#L26 call #t~ret0 := fact(~n - 1);< 60762#factENTRY ~n := #in~n; 60781#L25 assume ~n <= 0;#res := 1; 60780#factFINAL assume true; 60760#factEXIT >#66#return; 60755#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60753#factFINAL assume true; 60750#factEXIT >#78#return; 60748#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; 60699#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 60698#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 60339#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 60340#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 60493#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 60491#L42-3 [2021-11-20 06:27:59,772 INFO L793 eck$LassoCheckResult]: Loop: 60491#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 60430#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; 60404#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60326#factENTRY ~n := #in~n; 60429#L25 assume !(~n <= 0); 60348#L26 call #t~ret0 := fact(~n - 1);< 60356#factENTRY ~n := #in~n; 60359#L25 assume !(~n <= 0); 60342#L26 call #t~ret0 := fact(~n - 1);< 60354#factENTRY ~n := #in~n; 60360#L25 assume ~n <= 0;#res := 1; 60357#factFINAL assume true; 60341#factEXIT >#66#return; 60343#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60377#factFINAL assume true; 60344#factEXIT >#66#return; 60349#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60432#factFINAL assume true; 60421#factEXIT >#68#return; 60406#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 60420#factENTRY ~n := #in~n; 60428#L25 assume ~n <= 0;#res := 1; 60419#factFINAL assume true; 60397#factEXIT >#70#return; 60381#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60433#factENTRY ~n := #in~n; 60378#L25 assume !(~n <= 0); 60346#L26 call #t~ret0 := fact(~n - 1);< 60355#factENTRY ~n := #in~n; 60359#L25 assume !(~n <= 0); 60342#L26 call #t~ret0 := fact(~n - 1);< 60354#factENTRY ~n := #in~n; 60360#L25 assume ~n <= 0;#res := 1; 60357#factFINAL assume true; 60341#factEXIT >#66#return; 60343#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60377#factFINAL assume true; 60344#factEXIT >#66#return; 60349#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60432#factFINAL assume true; 60421#factEXIT >#72#return; 60426#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; 60447#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 60445#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 60443#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 60441#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; 60407#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60326#factENTRY ~n := #in~n; 60429#L25 assume !(~n <= 0); 60348#L26 call #t~ret0 := fact(~n - 1);< 60356#factENTRY ~n := #in~n; 60361#L25 assume ~n <= 0;#res := 1; 60358#factFINAL assume true; 60350#factEXIT >#66#return; 60352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60440#factFINAL assume true; 60439#factEXIT >#68#return; 60408#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 60326#factENTRY ~n := #in~n; 60429#L25 assume !(~n <= 0); 60348#L26 call #t~ret0 := fact(~n - 1);< 60356#factENTRY ~n := #in~n; 60359#L25 assume !(~n <= 0); 60342#L26 call #t~ret0 := fact(~n - 1);< 60354#factENTRY ~n := #in~n; 60360#L25 assume ~n <= 0;#res := 1; 60357#factFINAL assume true; 60341#factEXIT >#66#return; 60343#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60377#factFINAL assume true; 60344#factEXIT >#66#return; 60349#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60432#factFINAL assume true; 60421#factEXIT >#70#return; 60410#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60420#factENTRY ~n := #in~n; 60428#L25 assume ~n <= 0;#res := 1; 60419#factFINAL assume true; 60397#factEXIT >#72#return; 60413#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; 60449#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 60448#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 60446#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 60444#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; 60370#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60396#factENTRY ~n := #in~n; 60362#L25 assume !(~n <= 0); 60348#L26 call #t~ret0 := fact(~n - 1);< 60356#factENTRY ~n := #in~n; 60359#L25 assume !(~n <= 0); 60342#L26 call #t~ret0 := fact(~n - 1);< 60354#factENTRY ~n := #in~n; 60360#L25 assume ~n <= 0;#res := 1; 60357#factFINAL assume true; 60341#factEXIT >#66#return; 60343#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60377#factFINAL assume true; 60344#factEXIT >#66#return; 60349#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60432#factFINAL assume true; 60421#factEXIT >#74#return; 60391#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 60388#factENTRY ~n := #in~n; 60394#L25 assume !(~n <= 0); 60351#L26 call #t~ret0 := fact(~n - 1);< 60282#factENTRY ~n := #in~n; 60361#L25 assume ~n <= 0;#res := 1; 60358#factFINAL assume true; 60350#factEXIT >#66#return; 60352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60440#factFINAL assume true; 60439#factEXIT >#76#return; 60372#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60396#factENTRY ~n := #in~n; 60362#L25 assume !(~n <= 0); 60348#L26 call #t~ret0 := fact(~n - 1);< 60356#factENTRY ~n := #in~n; 60361#L25 assume ~n <= 0;#res := 1; 60358#factFINAL assume true; 60350#factEXIT >#66#return; 60352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60440#factFINAL assume true; 60439#factEXIT >#78#return; 60422#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; 60501#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 60437#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 60436#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 60300#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 60301#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 60491#L42-3 [2021-11-20 06:27:59,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:59,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 6 times [2021-11-20 06:27:59,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:27:59,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734748940] [2021-11-20 06:27:59,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:59,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:27:59,783 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:27:59,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1307495465] [2021-11-20 06:27:59,783 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-20 06:27:59,783 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:27:59,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:59,789 INFO L229 MonitoredProcess]: Starting monitored process 117 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:27:59,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2021-11-20 06:27:59,867 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2021-11-20 06:27:59,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-20 06:27:59,867 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:27:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:27:59,905 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:27:59,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:59,905 INFO L85 PathProgramCache]: Analyzing trace with hash -2098912549, now seen corresponding path program 6 times [2021-11-20 06:27:59,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:27:59,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085287794] [2021-11-20 06:27:59,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:59,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:27:59,913 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:27:59,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1450467826] [2021-11-20 06:27:59,914 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-20 06:27:59,914 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:27:59,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:27:59,917 INFO L229 MonitoredProcess]: Starting monitored process 118 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:27:59,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2021-11-20 06:28:00,033 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2021-11-20 06:28:00,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:28:00,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-20 06:28:00,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:28:00,617 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 15 proven. 201 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked. [2021-11-20 06:28:00,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:28:01,553 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 15 proven. 202 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2021-11-20 06:28:01,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:28:01,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085287794] [2021-11-20 06:28:01,554 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:28:01,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450467826] [2021-11-20 06:28:01,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450467826] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:28:01,554 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:28:01,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2021-11-20 06:28:01,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530595546] [2021-11-20 06:28:01,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:28:01,557 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 06:28:01,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:28:01,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-20 06:28:01,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2021-11-20 06:28:01,559 INFO L87 Difference]: Start difference. First operand 651 states and 919 transitions. cyclomatic complexity: 282 Second operand has 26 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 24 states have internal predecessors, (56), 14 states have call successors, (22), 1 states have call predecessors, (22), 4 states have return successors, (22), 11 states have call predecessors, (22), 14 states have call successors, (22) [2021-11-20 06:28:04,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:28:04,488 INFO L93 Difference]: Finished difference Result 1114 states and 1635 transitions. [2021-11-20 06:28:04,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-20 06:28:04,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1114 states and 1635 transitions. [2021-11-20 06:28:04,503 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 388 [2021-11-20 06:28:04,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1114 states to 1061 states and 1546 transitions. [2021-11-20 06:28:04,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 500 [2021-11-20 06:28:04,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 500 [2021-11-20 06:28:04,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1061 states and 1546 transitions. [2021-11-20 06:28:04,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:28:04,523 INFO L681 BuchiCegarLoop]: Abstraction has 1061 states and 1546 transitions. [2021-11-20 06:28:04,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states and 1546 transitions. [2021-11-20 06:28:04,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 692. [2021-11-20 06:28:04,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 437 states have (on average 1.091533180778032) internal successors, (477), 434 states have internal predecessors, (477), 202 states have call successors, (204), 65 states have call predecessors, (204), 53 states have return successors, (299), 192 states have call predecessors, (299), 202 states have call successors, (299) [2021-11-20 06:28:04,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 980 transitions. [2021-11-20 06:28:04,556 INFO L704 BuchiCegarLoop]: Abstraction has 692 states and 980 transitions. [2021-11-20 06:28:04,556 INFO L587 BuchiCegarLoop]: Abstraction has 692 states and 980 transitions. [2021-11-20 06:28:04,556 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-11-20 06:28:04,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 692 states and 980 transitions. [2021-11-20 06:28:04,561 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 178 [2021-11-20 06:28:04,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:28:04,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:28:04,563 INFO L842 BuchiCegarLoop]: 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] [2021-11-20 06:28:04,563 INFO L843 BuchiCegarLoop]: 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] [2021-11-20 06:28:04,563 INFO L791 eck$LassoCheckResult]: Stem: 62919#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 62893#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 62894#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 62918#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 62904#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 62905#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 63326#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; 62883#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 62884#factENTRY ~n := #in~n; 63329#L25 assume ~n <= 0;#res := 1; 63328#factFINAL assume true; 63327#factEXIT >#68#return; 62938#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 62939#factENTRY ~n := #in~n; 63310#L25 assume ~n <= 0;#res := 1; 63309#factFINAL assume true; 63306#factEXIT >#70#return; 62881#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 62882#factENTRY ~n := #in~n; 63412#L25 assume ~n <= 0;#res := 1; 63411#factFINAL assume true; 63410#factEXIT >#72#return; 63409#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; 63408#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 63407#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 63405#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 63376#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; 63377#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 63395#factENTRY ~n := #in~n; 63502#L25 assume !(~n <= 0); 63500#L26 call #t~ret0 := fact(~n - 1);< 63501#factENTRY ~n := #in~n; 63504#L25 assume ~n <= 0;#res := 1; 63503#factFINAL assume true; 63499#factEXIT >#66#return; 63498#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63380#factFINAL assume true; 63381#factEXIT >#74#return; 63348#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 63393#factENTRY ~n := #in~n; 63494#L25 assume ~n <= 0;#res := 1; 63347#factFINAL assume true; 63349#factEXIT >#76#return; 63340#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 63342#factENTRY ~n := #in~n; 63506#L25 assume !(~n <= 0); 63507#L26 call #t~ret0 := fact(~n - 1);< 63512#factENTRY ~n := #in~n; 63516#L25 assume ~n <= 0;#res := 1; 63515#factFINAL assume true; 63511#factEXIT >#66#return; 63510#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63508#factFINAL assume true; 63339#factEXIT >#78#return; 63341#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; 63337#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 63334#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 63054#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 62916#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 62917#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 63053#L42-3 [2021-11-20 06:28:04,564 INFO L793 eck$LassoCheckResult]: Loop: 63053#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 63052#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; 62991#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 62937#factENTRY ~n := #in~n; 63049#L25 assume !(~n <= 0); 62958#L26 call #t~ret0 := fact(~n - 1);< 62968#factENTRY ~n := #in~n; 62973#L25 assume ~n <= 0;#res := 1; 62970#factFINAL assume true; 62962#factEXIT >#66#return; 62965#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63075#factFINAL assume true; 63072#factEXIT >#68#return; 62989#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 63025#factENTRY ~n := #in~n; 63050#L25 assume ~n <= 0;#res := 1; 63024#factFINAL assume true; 62980#factEXIT >#70#return; 63014#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 63048#factENTRY ~n := #in~n; 63059#L25 assume !(~n <= 0); 62958#L26 call #t~ret0 := fact(~n - 1);< 62968#factENTRY ~n := #in~n; 62973#L25 assume ~n <= 0;#res := 1; 62970#factFINAL assume true; 62962#factEXIT >#66#return; 62965#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63075#factFINAL assume true; 63072#factEXIT >#72#return; 63073#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; 63079#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 63078#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 63077#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 63076#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; 63004#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 62937#factENTRY ~n := #in~n; 63049#L25 assume !(~n <= 0); 62958#L26 call #t~ret0 := fact(~n - 1);< 62968#factENTRY ~n := #in~n; 62973#L25 assume ~n <= 0;#res := 1; 62970#factFINAL assume true; 62962#factEXIT >#66#return; 62965#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63075#factFINAL assume true; 63072#factEXIT >#68#return; 62997#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 63023#factENTRY ~n := #in~n; 63051#L25 assume !(~n <= 0); 62963#L26 call #t~ret0 := fact(~n - 1);< 62900#factENTRY ~n := #in~n; 62973#L25 assume ~n <= 0;#res := 1; 62970#factFINAL assume true; 62962#factEXIT >#66#return; 62965#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63075#factFINAL assume true; 63072#factEXIT >#70#return; 63001#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 63025#factENTRY ~n := #in~n; 63050#L25 assume ~n <= 0;#res := 1; 63024#factFINAL assume true; 62980#factEXIT >#72#return; 63017#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; 63068#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 63065#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 63064#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 63062#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; 63039#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 63048#factENTRY ~n := #in~n; 63059#L25 assume !(~n <= 0); 62958#L26 call #t~ret0 := fact(~n - 1);< 62968#factENTRY ~n := #in~n; 62971#L25 assume !(~n <= 0); 62954#L26 call #t~ret0 := fact(~n - 1);< 62966#factENTRY ~n := #in~n; 62972#L25 assume ~n <= 0;#res := 1; 62969#factFINAL assume true; 62953#factEXIT >#66#return; 62955#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62975#factFINAL assume true; 62956#factEXIT >#66#return; 62961#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63056#factFINAL assume true; 63027#factEXIT >#74#return; 62993#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 63023#factENTRY ~n := #in~n; 63051#L25 assume !(~n <= 0); 62963#L26 call #t~ret0 := fact(~n - 1);< 62900#factENTRY ~n := #in~n; 62973#L25 assume ~n <= 0;#res := 1; 62970#factFINAL assume true; 62962#factEXIT >#66#return; 62965#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63075#factFINAL assume true; 63072#factEXIT >#76#return; 63041#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 63048#factENTRY ~n := #in~n; 63059#L25 assume !(~n <= 0); 62958#L26 call #t~ret0 := fact(~n - 1);< 62968#factENTRY ~n := #in~n; 62973#L25 assume ~n <= 0;#res := 1; 62970#factFINAL assume true; 62962#factEXIT >#66#return; 62965#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63075#factFINAL assume true; 63072#factEXIT >#78#return; 63045#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; 63133#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 62947#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 62945#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 62914#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 62915#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 63053#L42-3 [2021-11-20 06:28:04,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:28:04,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 7 times [2021-11-20 06:28:04,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:28:04,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729200986] [2021-11-20 06:28:04,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:28:04,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:28:04,571 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:28:04,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [979221285] [2021-11-20 06:28:04,571 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 06:28:04,572 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:28:04,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:04,579 INFO L229 MonitoredProcess]: Starting monitored process 119 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:28:04,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process [2021-11-20 06:28:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:28:04,655 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:28:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:28:04,692 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:28:04,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:28:04,693 INFO L85 PathProgramCache]: Analyzing trace with hash 590406435, now seen corresponding path program 7 times [2021-11-20 06:28:04,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:28:04,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614824366] [2021-11-20 06:28:04,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:28:04,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:28:04,699 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:28:04,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [863921611] [2021-11-20 06:28:04,700 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 06:28:04,700 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:28:04,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:04,702 INFO L229 MonitoredProcess]: Starting monitored process 120 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:28:04,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Waiting until timeout for monitored process [2021-11-20 06:28:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:28:04,830 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:28:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:28:04,894 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:28:04,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:28:04,895 INFO L85 PathProgramCache]: Analyzing trace with hash 736681859, now seen corresponding path program 8 times [2021-11-20 06:28:04,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:28:04,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447699456] [2021-11-20 06:28:04,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:28:04,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:28:04,903 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:28:04,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [973782265] [2021-11-20 06:28:04,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:28:04,904 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:28:04,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:04,922 INFO L229 MonitoredProcess]: Starting monitored process 121 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:28:04,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2021-11-20 06:28:05,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:28:05,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:28:05,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-20 06:28:05,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:28:05,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1355 backedges. 585 proven. 32 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2021-11-20 06:28:05,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:28:05,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1355 backedges. 33 proven. 32 refuted. 0 times theorem prover too weak. 1290 trivial. 0 not checked. [2021-11-20 06:28:05,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:28:05,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447699456] [2021-11-20 06:28:05,992 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:28:05,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973782265] [2021-11-20 06:28:05,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973782265] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:28:05,993 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:28:05,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2021-11-20 06:28:05,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282827309] [2021-11-20 06:28:05,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:28:47,561 WARN L227 SmtUtils]: Spent 40.24s on a formula simplification. DAG size of input: 191 DAG size of output: 173 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-20 06:28:47,894 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:28:47,894 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:28:47,895 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:28:47,895 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:28:47,895 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-11-20 06:28:47,895 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:28:47,895 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:28:47,895 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:28:47,895 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration19_Loop [2021-11-20 06:28:47,895 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:28:47,895 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:28:47,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:47,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:47,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:47,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:47,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:47,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:47,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:47,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:47,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:48,140 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:28:48,141 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-11-20 06:28:48,141 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:28:48,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:48,142 INFO L229 MonitoredProcess]: Starting monitored process 122 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:28:48,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2021-11-20 06:28:48,143 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:28:48,143 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:28:48,151 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:28:48,151 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: [] [2021-11-20 06:28:48,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2021-11-20 06:28:48,171 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:28:48,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:48,172 INFO L229 MonitoredProcess]: Starting monitored process 123 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:28:48,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2021-11-20 06:28:48,173 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:28:48,173 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:28:48,186 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:28:48,186 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: [] [2021-11-20 06:28:48,206 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2021-11-20 06:28:48,206 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:28:48,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:48,207 INFO L229 MonitoredProcess]: Starting monitored process 124 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:28:48,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2021-11-20 06:28:48,208 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:28:48,208 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:28:48,216 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:28:48,216 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: [] [2021-11-20 06:28:48,236 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2021-11-20 06:28:48,236 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:28:48,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:48,237 INFO L229 MonitoredProcess]: Starting monitored process 125 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:28:48,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2021-11-20 06:28:48,238 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:28:48,238 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:28:48,266 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2021-11-20 06:28:48,266 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:28:48,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:48,267 INFO L229 MonitoredProcess]: Starting monitored process 126 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:28:48,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2021-11-20 06:28:48,268 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-11-20 06:28:48,268 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:28:48,279 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-11-20 06:28:48,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2021-11-20 06:28:48,299 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:28:48,299 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:28:48,299 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:28:48,299 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:28:48,299 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-20 06:28:48,299 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:28:48,299 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:28:48,299 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:28:48,299 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration19_Loop [2021-11-20 06:28:48,299 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:28:48,299 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:28:48,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:48,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:48,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:48,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:48,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:48,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:48,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:48,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:48,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:48,562 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:28:48,562 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-20 06:28:48,563 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:28:48,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:48,563 INFO L229 MonitoredProcess]: Starting monitored process 127 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:28:48,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:28:48,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2021-11-20 06:28:48,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:28:48,573 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:28:48,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:28:48,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:28:48,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:28:48,574 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:28:48,574 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:28:48,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:28:48,597 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2021-11-20 06:28:48,597 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:28:48,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:48,598 INFO L229 MonitoredProcess]: Starting monitored process 128 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:28:48,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2021-11-20 06:28:48,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:28:48,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:28:48,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:28:48,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:28:48,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:28:48,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:28:48,610 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:28:48,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:28:48,611 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:28:48,630 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2021-11-20 06:28:48,631 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:28:48,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:48,632 INFO L229 MonitoredProcess]: Starting monitored process 129 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:28:48,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2021-11-20 06:28:48,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:28:48,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:28:48,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:28:48,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:28:48,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:28:48,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:28:48,644 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:28:48,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:28:48,645 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:28:48,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2021-11-20 06:28:48,665 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:28:48,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:48,665 INFO L229 MonitoredProcess]: Starting monitored process 130 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:28:48,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2021-11-20 06:28:48,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:28:48,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:28:48,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:28:48,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:28:48,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:28:48,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:28:48,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:28:48,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:28:48,677 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:28:48,696 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2021-11-20 06:28:48,696 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:28:48,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:48,697 INFO L229 MonitoredProcess]: Starting monitored process 131 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:28:48,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 [2021-11-20 06:28:48,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2021-11-20 06:28:48,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:28:48,720 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:28:48,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:28:48,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:28:48,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:28:48,720 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:28:48,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:28:48,721 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:28:48,741 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2021-11-20 06:28:48,741 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:28:48,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:48,742 INFO L229 MonitoredProcess]: Starting monitored process 132 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:28:48,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2021-11-20 06:28:48,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:28:48,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:28:48,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:28:48,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:28:48,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:28:48,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:28:48,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:28:48,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:28:48,756 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:28:48,775 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2021-11-20 06:28:48,775 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:28:48,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:48,776 INFO L229 MonitoredProcess]: Starting monitored process 133 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:28:48,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2021-11-20 06:28:48,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:28:48,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:28:48,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:28:48,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:28:48,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:28:48,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:28:48,786 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:28:48,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:28:48,789 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-20 06:28:48,792 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-11-20 06:28:48,792 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-11-20 06:28:48,792 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:28:48,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:48,793 INFO L229 MonitoredProcess]: Starting monitored process 134 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:28:48,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2021-11-20 06:28:48,794 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-20 06:28:48,794 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-11-20 06:28:48,794 INFO L513 LassoAnalysis]: Proved termination. [2021-11-20 06:28:48,794 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 [] [2021-11-20 06:28:48,814 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2021-11-20 06:28:48,814 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-11-20 06:28:48,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:28:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:28:48,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-20 06:28:48,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:28:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:28:49,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-20 06:28:49,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:28:50,175 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 5 proven. 107 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2021-11-20 06:28:50,175 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2021-11-20 06:28:50,175 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 692 states and 980 transitions. cyclomatic complexity: 304 Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 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) [2021-11-20 06:28:50,633 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 692 states and 980 transitions. cyclomatic complexity: 304. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 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 1505 states and 2128 transitions. Complement of second has 32 states. [2021-11-20 06:28:50,633 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 [2021-11-20 06:28:50,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 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) [2021-11-20 06:28:50,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2021-11-20 06:28:50,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 83 transitions. Stem has 60 letters. Loop has 111 letters. [2021-11-20 06:28:50,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:28:50,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 83 transitions. Stem has 171 letters. Loop has 111 letters. [2021-11-20 06:28:50,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:28:50,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 83 transitions. Stem has 60 letters. Loop has 222 letters. [2021-11-20 06:28:50,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:28:50,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1505 states and 2128 transitions. [2021-11-20 06:28:50,650 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2021-11-20 06:28:50,657 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 169 [2021-11-20 06:28:50,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1505 states to 905 states and 1287 transitions. [2021-11-20 06:28:50,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 289 [2021-11-20 06:28:50,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 290 [2021-11-20 06:28:50,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 905 states and 1287 transitions. [2021-11-20 06:28:50,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:28:50,687 INFO L681 BuchiCegarLoop]: Abstraction has 905 states and 1287 transitions. [2021-11-20 06:28:50,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states and 1287 transitions. [2021-11-20 06:28:50,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 875. [2021-11-20 06:28:50,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 559 states have (on average 1.0948121645796065) internal successors, (612), 552 states have internal predecessors, (612), 248 states have call successors, (250), 86 states have call predecessors, (250), 68 states have return successors, (370), 236 states have call predecessors, (370), 248 states have call successors, (370) [2021-11-20 06:28:50,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1232 transitions. [2021-11-20 06:28:50,716 INFO L704 BuchiCegarLoop]: Abstraction has 875 states and 1232 transitions. [2021-11-20 06:28:50,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:28:50,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-20 06:28:50,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-11-20 06:28:50,717 INFO L87 Difference]: Start difference. First operand 875 states and 1232 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 8 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2021-11-20 06:28:51,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:28:51,023 INFO L93 Difference]: Finished difference Result 1729 states and 2513 transitions. [2021-11-20 06:28:51,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 06:28:51,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1729 states and 2513 transitions. [2021-11-20 06:28:51,041 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 218 [2021-11-20 06:28:51,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1729 states to 1436 states and 2112 transitions. [2021-11-20 06:28:51,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 540 [2021-11-20 06:28:51,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 540 [2021-11-20 06:28:51,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1436 states and 2112 transitions. [2021-11-20 06:28:51,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:28:51,057 INFO L681 BuchiCegarLoop]: Abstraction has 1436 states and 2112 transitions. [2021-11-20 06:28:51,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states and 2112 transitions. [2021-11-20 06:28:51,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 878. [2021-11-20 06:28:51,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 562 states have (on average 1.092526690391459) internal successors, (614), 555 states have internal predecessors, (614), 248 states have call successors, (250), 86 states have call predecessors, (250), 68 states have return successors, (370), 236 states have call predecessors, (370), 248 states have call successors, (370) [2021-11-20 06:28:51,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1234 transitions. [2021-11-20 06:28:51,102 INFO L704 BuchiCegarLoop]: Abstraction has 878 states and 1234 transitions. [2021-11-20 06:28:51,102 INFO L587 BuchiCegarLoop]: Abstraction has 878 states and 1234 transitions. [2021-11-20 06:28:51,103 INFO L425 BuchiCegarLoop]: ======== Iteration 20============ [2021-11-20 06:28:51,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 878 states and 1234 transitions. [2021-11-20 06:28:51,107 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 169 [2021-11-20 06:28:51,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:28:51,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:28:51,110 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [13, 13, 9, 4, 4, 4, 4, 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] [2021-11-20 06:28:51,110 INFO L843 BuchiCegarLoop]: 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] [2021-11-20 06:28:51,111 INFO L791 eck$LassoCheckResult]: Stem: 69341#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 69314#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 69315#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 69340#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 69325#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 69326#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 69899#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; 69307#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 69308#factENTRY ~n := #in~n; 69912#L25 assume ~n <= 0;#res := 1; 69911#factFINAL assume true; 69910#factEXIT >#68#return; 69360#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 69361#factENTRY ~n := #in~n; 69939#L25 assume ~n <= 0;#res := 1; 69937#factFINAL assume true; 69935#factEXIT >#70#return; 69298#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 69299#factENTRY ~n := #in~n; 70017#L25 assume ~n <= 0;#res := 1; 70016#factFINAL assume true; 70015#factEXIT >#72#return; 70014#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; 70013#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 70012#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 69352#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 69344#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; 69254#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 69255#factENTRY ~n := #in~n; 70067#L25 assume !(~n <= 0); 69321#L26 call #t~ret0 := fact(~n - 1);< 69322#factENTRY ~n := #in~n; 70088#L25 assume ~n <= 0;#res := 1; 70087#factFINAL assume true; 70086#factEXIT >#66#return; 70085#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70084#factFINAL assume true; 70083#factEXIT >#74#return; 70080#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 70081#factENTRY ~n := #in~n; 70094#L25 assume ~n <= 0;#res := 1; 70089#factFINAL assume true; 70079#factEXIT >#76#return; 70008#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 70009#factENTRY ~n := #in~n; 70102#L25 assume !(~n <= 0); 70032#L26 call #t~ret0 := fact(~n - 1);< 70033#factENTRY ~n := #in~n; 70064#L25 assume ~n <= 0;#res := 1; 70038#factFINAL assume true; 70039#factEXIT >#66#return; 70024#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70025#factFINAL assume true; 70007#factEXIT >#78#return; 70006#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; 70003#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 70001#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 70000#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 69986#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; 69984#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 69985#factENTRY ~n := #in~n; 69994#L25 assume !(~n <= 0); 69991#L26 call #t~ret0 := fact(~n - 1);< 69992#factENTRY ~n := #in~n; 69995#L25 assume ~n <= 0;#res := 1; 69993#factFINAL assume true; 69990#factEXIT >#66#return; 69989#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69988#factFINAL assume true; 69983#factEXIT >#74#return; 69979#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 69980#factENTRY ~n := #in~n; 69982#L25 assume ~n <= 0;#res := 1; 69981#factFINAL assume true; 69978#factEXIT >#76#return; 69944#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 69976#factENTRY ~n := #in~n; 69973#L25 assume !(~n <= 0); 69957#L26 call #t~ret0 := fact(~n - 1);< 69969#factENTRY ~n := #in~n; 69966#L25 assume ~n <= 0;#res := 1; 69967#factFINAL assume true; 69955#factEXIT >#66#return; 69951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69952#factFINAL assume true; 69943#factEXIT >#78#return; 69942#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; 69941#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 69930#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 69590#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 69466#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 69467#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 69442#L42-3 [2021-11-20 06:28:51,112 INFO L793 eck$LassoCheckResult]: Loop: 69442#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 69441#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; 69379#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 69402#factENTRY ~n := #in~n; 69439#L25 assume !(~n <= 0); 69413#L26 call #t~ret0 := fact(~n - 1);< 69417#factENTRY ~n := #in~n; 69435#L25 assume !(~n <= 0); 69425#L26 call #t~ret0 := fact(~n - 1);< 69434#factENTRY ~n := #in~n; 69438#L25 assume ~n <= 0;#res := 1; 69446#factFINAL assume true; 69445#factEXIT >#66#return; 69428#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69433#factFINAL assume true; 69422#factEXIT >#66#return; 69409#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69397#factFINAL assume true; 69400#factEXIT >#68#return; 69408#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 69437#factENTRY ~n := #in~n; 69440#L25 assume ~n <= 0;#res := 1; 69436#factFINAL assume true; 69418#factEXIT >#70#return; 69398#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 69396#factENTRY ~n := #in~n; 69429#L25 assume !(~n <= 0); 69423#L26 call #t~ret0 := fact(~n - 1);< 69320#factENTRY ~n := #in~n; 69435#L25 assume !(~n <= 0); 69425#L26 call #t~ret0 := fact(~n - 1);< 69434#factENTRY ~n := #in~n; 69438#L25 assume ~n <= 0;#res := 1; 69446#factFINAL assume true; 69445#factEXIT >#66#return; 69428#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69433#factFINAL assume true; 69422#factEXIT >#66#return; 69409#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69397#factFINAL assume true; 69400#factEXIT >#72#return; 69406#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; 69498#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 69475#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 69474#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 69472#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; 69381#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 69402#factENTRY ~n := #in~n; 69439#L25 assume !(~n <= 0); 69413#L26 call #t~ret0 := fact(~n - 1);< 69417#factENTRY ~n := #in~n; 69435#L25 assume !(~n <= 0); 69425#L26 call #t~ret0 := fact(~n - 1);< 69434#factENTRY ~n := #in~n; 69438#L25 assume ~n <= 0;#res := 1; 69446#factFINAL assume true; 69445#factEXIT >#66#return; 69428#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69433#factFINAL assume true; 69422#factEXIT >#66#return; 69409#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69397#factFINAL assume true; 69400#factEXIT >#68#return; 69377#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 69402#factENTRY ~n := #in~n; 69439#L25 assume !(~n <= 0); 69413#L26 call #t~ret0 := fact(~n - 1);< 69417#factENTRY ~n := #in~n; 69435#L25 assume !(~n <= 0); 69425#L26 call #t~ret0 := fact(~n - 1);< 69434#factENTRY ~n := #in~n; 69438#L25 assume ~n <= 0;#res := 1; 69446#factFINAL assume true; 69445#factEXIT >#66#return; 69428#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69433#factFINAL assume true; 69422#factEXIT >#66#return; 69409#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69397#factFINAL assume true; 69400#factEXIT >#70#return; 69375#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 69402#factENTRY ~n := #in~n; 69439#L25 assume ~n <= 0;#res := 1; 69436#factFINAL assume true; 69418#factEXIT >#72#return; 69393#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; 69495#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 69489#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 69488#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 69487#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; 69384#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 69401#factENTRY ~n := #in~n; 69421#L25 assume !(~n <= 0); 69413#L26 call #t~ret0 := fact(~n - 1);< 69417#factENTRY ~n := #in~n; 69435#L25 assume !(~n <= 0); 69425#L26 call #t~ret0 := fact(~n - 1);< 69434#factENTRY ~n := #in~n; 69438#L25 assume ~n <= 0;#res := 1; 69446#factFINAL assume true; 69445#factEXIT >#66#return; 69428#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69433#factFINAL assume true; 69422#factEXIT >#66#return; 69409#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69397#factFINAL assume true; 69400#factEXIT >#68#return; 69380#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 69402#factENTRY ~n := #in~n; 69439#L25 assume !(~n <= 0); 69413#L26 call #t~ret0 := fact(~n - 1);< 69417#factENTRY ~n := #in~n; 69435#L25 assume !(~n <= 0); 69425#L26 call #t~ret0 := fact(~n - 1);< 69434#factENTRY ~n := #in~n; 69438#L25 assume ~n <= 0;#res := 1; 69446#factFINAL assume true; 69445#factEXIT >#66#return; 69428#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69433#factFINAL assume true; 69422#factEXIT >#66#return; 69409#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69397#factFINAL assume true; 69400#factEXIT >#70#return; 69387#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 69402#factENTRY ~n := #in~n; 69439#L25 assume ~n <= 0;#res := 1; 69436#factFINAL assume true; 69418#factEXIT >#72#return; 69419#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; 69473#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 69464#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 69465#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 69405#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; 69386#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 69401#factENTRY ~n := #in~n; 69421#L25 assume !(~n <= 0); 69413#L26 call #t~ret0 := fact(~n - 1);< 69417#factENTRY ~n := #in~n; 69435#L25 assume !(~n <= 0); 69425#L26 call #t~ret0 := fact(~n - 1);< 69434#factENTRY ~n := #in~n; 69438#L25 assume ~n <= 0;#res := 1; 69446#factFINAL assume true; 69445#factEXIT >#66#return; 69428#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69433#factFINAL assume true; 69422#factEXIT >#66#return; 69409#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69397#factFINAL assume true; 69400#factEXIT >#74#return; 69378#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 69402#factENTRY ~n := #in~n; 69439#L25 assume !(~n <= 0); 69413#L26 call #t~ret0 := fact(~n - 1);< 69417#factENTRY ~n := #in~n; 69435#L25 assume !(~n <= 0); 69425#L26 call #t~ret0 := fact(~n - 1);< 69434#factENTRY ~n := #in~n; 69438#L25 assume ~n <= 0;#res := 1; 69446#factFINAL assume true; 69445#factEXIT >#66#return; 69428#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69433#factFINAL assume true; 69422#factEXIT >#66#return; 69409#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69397#factFINAL assume true; 69400#factEXIT >#76#return; 69388#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 69401#factENTRY ~n := #in~n; 69421#L25 assume !(~n <= 0); 69413#L26 call #t~ret0 := fact(~n - 1);< 69417#factENTRY ~n := #in~n; 69432#L25 assume ~n <= 0;#res := 1; 69430#factFINAL assume true; 69410#factEXIT >#66#return; 69403#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69404#factFINAL assume true; 69373#factEXIT >#78#return; 69372#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; 69371#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 69370#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 69368#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 69329#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 69330#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 69442#L42-3 [2021-11-20 06:28:51,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:28:51,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1906942052, now seen corresponding path program 9 times [2021-11-20 06:28:51,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:28:51,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149334958] [2021-11-20 06:28:51,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:28:51,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:28:51,125 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:28:51,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [534597162] [2021-11-20 06:28:51,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 06:28:51,127 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:28:51,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:51,129 INFO L229 MonitoredProcess]: Starting monitored process 135 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:28:51,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Waiting until timeout for monitored process [2021-11-20 06:28:51,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-11-20 06:28:51,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:28:51,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-20 06:28:51,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:28:51,520 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 87 proven. 5 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2021-11-20 06:28:51,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:28:52,013 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 87 proven. 6 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2021-11-20 06:28:52,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:28:52,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149334958] [2021-11-20 06:28:52,014 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:28:52,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534597162] [2021-11-20 06:28:52,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534597162] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:28:52,014 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:28:52,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-11-20 06:28:52,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465952449] [2021-11-20 06:28:52,014 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:28:52,015 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 06:28:52,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:28:52,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1791762122, now seen corresponding path program 8 times [2021-11-20 06:28:52,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:28:52,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287233673] [2021-11-20 06:28:52,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:28:52,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:28:52,020 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:28:52,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [286730435] [2021-11-20 06:28:52,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:28:52,020 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:28:52,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:52,023 INFO L229 MonitoredProcess]: Starting monitored process 136 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:28:52,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Waiting until timeout for monitored process [2021-11-20 06:28:52,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:28:52,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:28:52,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-20 06:28:52,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:28:52,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 1095 proven. 32 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2021-11-20 06:28:52,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:28:53,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 119 proven. 213 refuted. 0 times theorem prover too weak. 1601 trivial. 0 not checked. [2021-11-20 06:28:53,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:28:53,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287233673] [2021-11-20 06:28:53,039 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:28:53,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286730435] [2021-11-20 06:28:53,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286730435] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:28:53,039 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:28:53,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 15 [2021-11-20 06:28:53,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906309777] [2021-11-20 06:28:53,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:28:53,040 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 06:28:53,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:28:53,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-20 06:28:53,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-11-20 06:28:53,041 INFO L87 Difference]: Start difference. First operand 878 states and 1234 transitions. cyclomatic complexity: 376 Second operand has 16 states, 14 states have (on average 3.642857142857143) internal successors, (51), 16 states have internal predecessors, (51), 9 states have call successors, (21), 1 states have call predecessors, (21), 3 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) [2021-11-20 06:28:53,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:28:53,448 INFO L93 Difference]: Finished difference Result 908 states and 1258 transitions. [2021-11-20 06:28:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-20 06:28:53,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 908 states and 1258 transitions. [2021-11-20 06:28:53,461 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 170 [2021-11-20 06:28:53,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 908 states to 830 states and 1172 transitions. [2021-11-20 06:28:53,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 301 [2021-11-20 06:28:53,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 301 [2021-11-20 06:28:53,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 830 states and 1172 transitions. [2021-11-20 06:28:53,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:28:53,474 INFO L681 BuchiCegarLoop]: Abstraction has 830 states and 1172 transitions. [2021-11-20 06:28:53,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states and 1172 transitions. [2021-11-20 06:28:53,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 731. [2021-11-20 06:28:53,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 468 states have (on average 1.0833333333333333) internal successors, (507), 459 states have internal predecessors, (507), 214 states have call successors, (214), 65 states have call predecessors, (214), 49 states have return successors, (318), 206 states have call predecessors, (318), 214 states have call successors, (318) [2021-11-20 06:28:53,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1039 transitions. [2021-11-20 06:28:53,496 INFO L704 BuchiCegarLoop]: Abstraction has 731 states and 1039 transitions. [2021-11-20 06:28:53,496 INFO L587 BuchiCegarLoop]: Abstraction has 731 states and 1039 transitions. [2021-11-20 06:28:53,496 INFO L425 BuchiCegarLoop]: ======== Iteration 21============ [2021-11-20 06:28:53,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 731 states and 1039 transitions. [2021-11-20 06:28:53,500 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 161 [2021-11-20 06:28:53,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:28:53,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:28:53,507 INFO L842 BuchiCegarLoop]: 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] [2021-11-20 06:28:53,507 INFO L843 BuchiCegarLoop]: 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] [2021-11-20 06:28:53,507 INFO L791 eck$LassoCheckResult]: Stem: 72827#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 72801#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 72802#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 72826#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 72812#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 72813#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 73208#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; 72771#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 72772#factENTRY ~n := #in~n; 73447#L25 assume ~n <= 0;#res := 1; 73446#factFINAL assume true; 73445#factEXIT >#68#return; 72838#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 72839#factENTRY ~n := #in~n; 73444#L25 assume ~n <= 0;#res := 1; 73441#factFINAL assume true; 73440#factEXIT >#70#return; 72768#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 72769#factENTRY ~n := #in~n; 73443#L25 assume ~n <= 0;#res := 1; 73442#factFINAL assume true; 73436#factEXIT >#72#return; 72821#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; 72818#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 72819#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 73434#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 72829#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; 72734#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 72735#factENTRY ~n := #in~n; 73439#L25 assume !(~n <= 0); 73430#L26 call #t~ret0 := fact(~n - 1);< 73431#factENTRY ~n := #in~n; 73435#L25 assume ~n <= 0;#res := 1; 73433#factFINAL assume true; 73429#factEXIT >#66#return; 73426#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73424#factFINAL assume true; 73412#factEXIT >#74#return; 72841#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 72842#factENTRY ~n := #in~n; 73432#L25 assume ~n <= 0;#res := 1; 73425#factFINAL assume true; 73411#factEXIT >#76#return; 73210#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 73415#factENTRY ~n := #in~n; 73420#L25 assume !(~n <= 0); 73418#L26 call #t~ret0 := fact(~n - 1);< 73419#factENTRY ~n := #in~n; 73423#L25 assume ~n <= 0;#res := 1; 73421#factFINAL assume true; 73417#factEXIT >#66#return; 73416#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73414#factFINAL assume true; 73209#factEXIT >#78#return; 72805#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; 72806#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 72811#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 72845#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 73334#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; 73314#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 72847#factENTRY ~n := #in~n; 73461#L25 assume !(~n <= 0); 73339#L26 call #t~ret0 := fact(~n - 1);< 73341#factENTRY ~n := #in~n; 73454#L25 assume !(~n <= 0); 73338#L26 call #t~ret0 := fact(~n - 1);< 73453#factENTRY ~n := #in~n; 73457#L25 assume ~n <= 0;#res := 1; 73456#factFINAL assume true; 73455#factEXIT >#66#return; 73340#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73452#factFINAL assume true; 73337#factEXIT >#66#return; 73333#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73332#factFINAL assume true; 73313#factEXIT >#74#return; 73311#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 73312#factENTRY ~n := #in~n; 73360#L25 assume ~n <= 0;#res := 1; 73330#factFINAL assume true; 73310#factEXIT >#76#return; 72846#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 72847#factENTRY ~n := #in~n; 73461#L25 assume !(~n <= 0); 73339#L26 call #t~ret0 := fact(~n - 1);< 73341#factENTRY ~n := #in~n; 73454#L25 assume !(~n <= 0); 73338#L26 call #t~ret0 := fact(~n - 1);< 73453#factENTRY ~n := #in~n; 73457#L25 assume ~n <= 0;#res := 1; 73456#factFINAL assume true; 73455#factEXIT >#66#return; 73340#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73452#factFINAL assume true; 73337#factEXIT >#66#return; 73333#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73332#factFINAL assume true; 73313#factEXIT >#78#return; 73315#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; 73385#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 73184#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 73181#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 72824#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 72825#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 72948#L42-3 [2021-11-20 06:28:53,508 INFO L793 eck$LassoCheckResult]: Loop: 72948#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 72897#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; 72855#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 72877#factENTRY ~n := #in~n; 72916#L25 assume !(~n <= 0); 72891#L26 call #t~ret0 := fact(~n - 1);< 72903#factENTRY ~n := #in~n; 72927#L25 assume !(~n <= 0); 72887#L26 call #t~ret0 := fact(~n - 1);< 72926#factENTRY ~n := #in~n; 72928#L25 assume ~n <= 0;#res := 1; 72931#factFINAL assume true; 72930#factEXIT >#66#return; 72893#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72925#factFINAL assume true; 72885#factEXIT >#66#return; 72884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72872#factFINAL assume true; 72876#factEXIT >#68#return; 72881#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 72914#factENTRY ~n := #in~n; 72915#L25 assume ~n <= 0;#res := 1; 72913#factFINAL assume true; 72911#factEXIT >#70#return; 72875#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 72878#factENTRY ~n := #in~n; 72907#L25 assume !(~n <= 0); 72888#L26 call #t~ret0 := fact(~n - 1);< 72808#factENTRY ~n := #in~n; 72927#L25 assume !(~n <= 0); 72887#L26 call #t~ret0 := fact(~n - 1);< 72926#factENTRY ~n := #in~n; 72928#L25 assume ~n <= 0;#res := 1; 72931#factFINAL assume true; 72930#factEXIT >#66#return; 72893#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72925#factFINAL assume true; 72885#factEXIT >#66#return; 72884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72872#factFINAL assume true; 72876#factEXIT >#72#return; 72883#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; 72920#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 72919#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 72918#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 72917#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; 72861#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 72877#factENTRY ~n := #in~n; 72916#L25 assume !(~n <= 0); 72891#L26 call #t~ret0 := fact(~n - 1);< 72903#factENTRY ~n := #in~n; 72927#L25 assume !(~n <= 0); 72887#L26 call #t~ret0 := fact(~n - 1);< 72926#factENTRY ~n := #in~n; 72928#L25 assume ~n <= 0;#res := 1; 72931#factFINAL assume true; 72930#factEXIT >#66#return; 72893#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72925#factFINAL assume true; 72885#factEXIT >#66#return; 72884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72872#factFINAL assume true; 72876#factEXIT >#68#return; 72856#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 72877#factENTRY ~n := #in~n; 72916#L25 assume !(~n <= 0); 72891#L26 call #t~ret0 := fact(~n - 1);< 72903#factENTRY ~n := #in~n; 72927#L25 assume !(~n <= 0); 72887#L26 call #t~ret0 := fact(~n - 1);< 72926#factENTRY ~n := #in~n; 72928#L25 assume ~n <= 0;#res := 1; 72931#factFINAL assume true; 72930#factEXIT >#66#return; 72893#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72925#factFINAL assume true; 72885#factEXIT >#66#return; 72884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72872#factFINAL assume true; 72876#factEXIT >#70#return; 72857#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 72877#factENTRY ~n := #in~n; 72916#L25 assume !(~n <= 0); 72891#L26 call #t~ret0 := fact(~n - 1);< 72903#factENTRY ~n := #in~n; 72909#L25 assume ~n <= 0;#res := 1; 72905#factFINAL assume true; 72898#factEXIT >#66#return; 72879#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72880#factFINAL assume true; 72853#factEXIT >#72#return; 72870#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; 72924#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 72923#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 72922#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 72921#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; 72863#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 72871#factENTRY ~n := #in~n; 72894#L25 assume !(~n <= 0); 72891#L26 call #t~ret0 := fact(~n - 1);< 72903#factENTRY ~n := #in~n; 72927#L25 assume !(~n <= 0); 72887#L26 call #t~ret0 := fact(~n - 1);< 72926#factENTRY ~n := #in~n; 72928#L25 assume ~n <= 0;#res := 1; 72931#factFINAL assume true; 72930#factEXIT >#66#return; 72893#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72925#factFINAL assume true; 72885#factEXIT >#66#return; 72884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72872#factFINAL assume true; 72876#factEXIT >#68#return; 72862#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 72877#factENTRY ~n := #in~n; 72916#L25 assume !(~n <= 0); 72891#L26 call #t~ret0 := fact(~n - 1);< 72903#factENTRY ~n := #in~n; 72927#L25 assume !(~n <= 0); 72887#L26 call #t~ret0 := fact(~n - 1);< 72926#factENTRY ~n := #in~n; 72928#L25 assume ~n <= 0;#res := 1; 72931#factFINAL assume true; 72930#factEXIT >#66#return; 72893#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72925#factFINAL assume true; 72885#factEXIT >#66#return; 72884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72872#factFINAL assume true; 72876#factEXIT >#70#return; 72867#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 72877#factENTRY ~n := #in~n; 72916#L25 assume ~n <= 0;#res := 1; 72913#factFINAL assume true; 72911#factEXIT >#72#return; 72910#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; 72908#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 72904#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 72896#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 72895#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; 72869#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 72871#factENTRY ~n := #in~n; 72894#L25 assume !(~n <= 0); 72891#L26 call #t~ret0 := fact(~n - 1);< 72903#factENTRY ~n := #in~n; 72927#L25 assume !(~n <= 0); 72887#L26 call #t~ret0 := fact(~n - 1);< 72926#factENTRY ~n := #in~n; 72928#L25 assume ~n <= 0;#res := 1; 72931#factFINAL assume true; 72930#factEXIT >#66#return; 72893#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72925#factFINAL assume true; 72885#factEXIT >#66#return; 72884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72872#factFINAL assume true; 72876#factEXIT >#74#return; 72860#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 72877#factENTRY ~n := #in~n; 72916#L25 assume !(~n <= 0); 72891#L26 call #t~ret0 := fact(~n - 1);< 72903#factENTRY ~n := #in~n; 72909#L25 assume ~n <= 0;#res := 1; 72905#factFINAL assume true; 72898#factEXIT >#66#return; 72879#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72880#factFINAL assume true; 72853#factEXIT >#76#return; 72868#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 72871#factENTRY ~n := #in~n; 72894#L25 assume !(~n <= 0); 72891#L26 call #t~ret0 := fact(~n - 1);< 72903#factENTRY ~n := #in~n; 72909#L25 assume ~n <= 0;#res := 1; 72905#factFINAL assume true; 72898#factEXIT >#66#return; 72879#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72880#factFINAL assume true; 72853#factEXIT >#78#return; 72852#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; 72851#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 72850#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 72848#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 72822#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 72823#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 72948#L42-3 [2021-11-20 06:28:53,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:28:53,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1161858644, now seen corresponding path program 10 times [2021-11-20 06:28:53,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:28:53,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113753760] [2021-11-20 06:28:53,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:28:53,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:28:53,513 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:28:53,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [243792713] [2021-11-20 06:28:53,514 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 06:28:53,514 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:28:53,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:53,516 INFO L229 MonitoredProcess]: Starting monitored process 137 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:28:53,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Waiting until timeout for monitored process [2021-11-20 06:28:53,605 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 06:28:53,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-20 06:28:53,605 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:28:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:28:53,658 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:28:53,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:28:53,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1414734902, now seen corresponding path program 9 times [2021-11-20 06:28:53,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:28:53,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525692621] [2021-11-20 06:28:53,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:28:53,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:28:53,662 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:28:53,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1487196590] [2021-11-20 06:28:53,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 06:28:53,662 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:28:53,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:53,664 INFO L229 MonitoredProcess]: Starting monitored process 138 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:28:53,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Waiting until timeout for monitored process [2021-11-20 06:28:53,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2021-11-20 06:28:53,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:28:53,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-20 06:28:53,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:28:54,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 570 proven. 79 refuted. 0 times theorem prover too weak. 1284 trivial. 0 not checked. [2021-11-20 06:28:54,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:28:54,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 322 proven. 111 refuted. 0 times theorem prover too weak. 1500 trivial. 0 not checked. [2021-11-20 06:28:54,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:28:54,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525692621] [2021-11-20 06:28:54,865 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:28:54,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487196590] [2021-11-20 06:28:54,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487196590] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:28:54,865 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:28:54,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 16 [2021-11-20 06:28:54,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503273112] [2021-11-20 06:28:54,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:28:54,866 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 06:28:54,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:28:54,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-20 06:28:54,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-11-20 06:28:54,866 INFO L87 Difference]: Start difference. First operand 731 states and 1039 transitions. cyclomatic complexity: 326 Second operand has 16 states, 13 states have (on average 3.769230769230769) internal successors, (49), 16 states have internal predecessors, (49), 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) [2021-11-20 06:28:55,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:28:55,528 INFO L93 Difference]: Finished difference Result 984 states and 1382 transitions. [2021-11-20 06:28:55,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-20 06:28:55,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 984 states and 1382 transitions. [2021-11-20 06:28:55,539 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 205 [2021-11-20 06:28:55,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 984 states to 731 states and 1011 transitions. [2021-11-20 06:28:55,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 354 [2021-11-20 06:28:55,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 354 [2021-11-20 06:28:55,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 731 states and 1011 transitions. [2021-11-20 06:28:55,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:28:55,547 INFO L681 BuchiCegarLoop]: Abstraction has 731 states and 1011 transitions. [2021-11-20 06:28:55,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states and 1011 transitions. [2021-11-20 06:28:55,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 623. [2021-11-20 06:28:55,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 401 states have (on average 1.084788029925187) internal successors, (435), 396 states have internal predecessors, (435), 176 states have call successors, (176), 59 states have call predecessors, (176), 46 states have return successors, (249), 167 states have call predecessors, (249), 176 states have call successors, (249) [2021-11-20 06:28:55,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 860 transitions. [2021-11-20 06:28:55,565 INFO L704 BuchiCegarLoop]: Abstraction has 623 states and 860 transitions. [2021-11-20 06:28:55,565 INFO L587 BuchiCegarLoop]: Abstraction has 623 states and 860 transitions. [2021-11-20 06:28:55,566 INFO L425 BuchiCegarLoop]: ======== Iteration 22============ [2021-11-20 06:28:55,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 623 states and 860 transitions. [2021-11-20 06:28:55,568 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 160 [2021-11-20 06:28:55,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:28:55,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:28:55,570 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [17, 17, 10, 7, 7, 7, 7, 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] [2021-11-20 06:28:55,570 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:28:55,570 INFO L791 eck$LassoCheckResult]: Stem: 75679#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 75651#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 75652#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 75678#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 75664#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 75665#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 76037#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; 75637#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 75638#factENTRY ~n := #in~n; 76039#L25 assume ~n <= 0;#res := 1; 76038#factFINAL assume true; 76036#factEXIT >#68#return; 75698#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 75699#factENTRY ~n := #in~n; 76045#L25 assume ~n <= 0;#res := 1; 76043#factFINAL assume true; 76041#factEXIT >#70#return; 75631#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 75632#factENTRY ~n := #in~n; 76052#L25 assume ~n <= 0;#res := 1; 76051#factFINAL assume true; 76047#factEXIT >#72#return; 76046#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; 75672#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 75673#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 75695#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 75681#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; 75590#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 75591#factENTRY ~n := #in~n; 76120#L25 assume !(~n <= 0); 76118#L26 call #t~ret0 := fact(~n - 1);< 76119#factENTRY ~n := #in~n; 76123#L25 assume ~n <= 0;#res := 1; 76122#factFINAL assume true; 76117#factEXIT >#66#return; 76112#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76110#factFINAL assume true; 76106#factEXIT >#74#return; 76087#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 76094#factENTRY ~n := #in~n; 76095#L25 assume ~n <= 0;#res := 1; 76086#factFINAL assume true; 76088#factEXIT >#76#return; 75635#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 75704#factENTRY ~n := #in~n; 76130#L25 assume !(~n <= 0); 75629#L26 call #t~ret0 := fact(~n - 1);< 75649#factENTRY ~n := #in~n; 75650#L25 assume ~n <= 0;#res := 1; 76129#factFINAL assume true; 75628#factEXIT >#66#return; 75630#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75634#factFINAL assume true; 75636#factEXIT >#78#return; 75654#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; 75655#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 75663#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 75703#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 76076#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; 76068#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 76071#factENTRY ~n := #in~n; 76085#L25 assume !(~n <= 0); 76081#L26 call #t~ret0 := fact(~n - 1);< 76083#factENTRY ~n := #in~n; 76091#L25 assume !(~n <= 0); 76080#L26 call #t~ret0 := fact(~n - 1);< 76090#factENTRY ~n := #in~n; 76098#L25 assume ~n <= 0;#res := 1; 76097#factFINAL assume true; 76096#factEXIT >#66#return; 76082#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76089#factFINAL assume true; 76079#factEXIT >#66#return; 76075#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76072#factFINAL assume true; 76067#factEXIT >#74#return; 76070#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 76074#factENTRY ~n := #in~n; 76084#L25 assume ~n <= 0;#res := 1; 76078#factFINAL assume true; 76073#factEXIT >#76#return; 76069#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 76071#factENTRY ~n := #in~n; 76085#L25 assume !(~n <= 0); 76081#L26 call #t~ret0 := fact(~n - 1);< 76083#factENTRY ~n := #in~n; 76091#L25 assume !(~n <= 0); 76080#L26 call #t~ret0 := fact(~n - 1);< 76090#factENTRY ~n := #in~n; 76098#L25 assume ~n <= 0;#res := 1; 76097#factFINAL assume true; 76096#factEXIT >#66#return; 76082#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76089#factFINAL assume true; 76079#factEXIT >#66#return; 76075#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76072#factFINAL assume true; 76067#factEXIT >#78#return; 76066#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; 76065#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 76064#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 75798#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 75676#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 75677#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 75796#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 75797#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; 75711#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 75734#factENTRY ~n := #in~n; 75771#L25 assume !(~n <= 0); 75746#L26 call #t~ret0 := fact(~n - 1);< 75756#factENTRY ~n := #in~n; 75761#L25 assume ~n <= 0;#res := 1; 75759#factFINAL assume true; 75752#factEXIT >#66#return; 75741#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75739#factFINAL assume true; 75710#factEXIT >#68#return; 75685#L30-1 [2021-11-20 06:28:55,570 INFO L793 eck$LassoCheckResult]: Loop: 75685#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 76134#factENTRY ~n := #in~n; 75683#L25 assume ~n <= 0;#res := 1; 75689#factFINAL assume true; 76099#factEXIT >#70#return; 75646#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 75639#factENTRY ~n := #in~n; 75648#L25 assume !(~n <= 0); 75748#L26 call #t~ret0 := fact(~n - 1);< 75756#factENTRY ~n := #in~n; 75783#L25 assume !(~n <= 0); 75743#L26 call #t~ret0 := fact(~n - 1);< 75782#factENTRY ~n := #in~n; 75785#L25 assume ~n <= 0;#res := 1; 75787#factFINAL assume true; 75786#factEXIT >#66#return; 75749#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75781#factFINAL assume true; 75742#factEXIT >#66#return; 75750#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76143#factFINAL assume true; 76136#factEXIT >#72#return; 76139#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; 76171#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 76170#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 76169#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 76168#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; 76101#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 75697#factENTRY ~n := #in~n; 76142#L25 assume !(~n <= 0); 75748#L26 call #t~ret0 := fact(~n - 1);< 75756#factENTRY ~n := #in~n; 75761#L25 assume ~n <= 0;#res := 1; 75759#factFINAL assume true; 75752#factEXIT >#66#return; 75755#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76150#factFINAL assume true; 76148#factEXIT >#68#return; 75685#L30-1 [2021-11-20 06:28:55,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:28:55,571 INFO L85 PathProgramCache]: Analyzing trace with hash -896424588, now seen corresponding path program 11 times [2021-11-20 06:28:55,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:28:55,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10214153] [2021-11-20 06:28:55,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:28:55,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:28:55,576 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:28:55,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [909099291] [2021-11-20 06:28:55,576 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-20 06:28:55,576 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:28:55,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:55,582 INFO L229 MonitoredProcess]: Starting monitored process 139 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:28:55,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Waiting until timeout for monitored process [2021-11-20 06:28:55,686 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2021-11-20 06:28:55,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-20 06:28:55,686 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:28:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:28:55,741 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:28:55,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:28:55,742 INFO L85 PathProgramCache]: Analyzing trace with hash -471330376, now seen corresponding path program 2 times [2021-11-20 06:28:55,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:28:55,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589765402] [2021-11-20 06:28:55,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:28:55,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:28:55,745 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:28:55,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [433070098] [2021-11-20 06:28:55,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:28:55,745 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:28:55,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:55,747 INFO L229 MonitoredProcess]: Starting monitored process 140 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:28:55,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Waiting until timeout for monitored process [2021-11-20 06:28:55,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:28:55,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-20 06:28:55,799 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:28:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:28:55,816 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:28:55,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:28:55,816 INFO L85 PathProgramCache]: Analyzing trace with hash 612698347, now seen corresponding path program 12 times [2021-11-20 06:28:55,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:28:55,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590544420] [2021-11-20 06:28:55,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:28:55,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:28:55,822 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:28:55,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1634617292] [2021-11-20 06:28:55,822 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-20 06:28:55,822 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:28:55,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:55,824 INFO L229 MonitoredProcess]: Starting monitored process 141 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:28:55,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Waiting until timeout for monitored process [2021-11-20 06:28:55,949 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2021-11-20 06:28:55,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:28:55,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-20 06:28:55,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:28:56,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 345 proven. 14 refuted. 0 times theorem prover too weak. 787 trivial. 0 not checked. [2021-11-20 06:28:56,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:28:56,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 159 proven. 31 refuted. 0 times theorem prover too weak. 956 trivial. 0 not checked. [2021-11-20 06:28:56,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:28:56,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590544420] [2021-11-20 06:28:56,733 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:28:56,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634617292] [2021-11-20 06:28:56,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634617292] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:28:56,733 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:28:56,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2021-11-20 06:28:56,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487333403] [2021-11-20 06:28:56,733 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:28:57,488 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:28:57,488 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:28:57,488 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:28:57,489 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:28:57,489 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-11-20 06:28:57,489 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:28:57,489 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:28:57,489 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:28:57,489 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration22_Loop [2021-11-20 06:28:57,489 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:28:57,489 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:28:57,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:57,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:57,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:57,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:57,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:57,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:57,648 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:28:57,648 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-11-20 06:28:57,648 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:28:57,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:57,649 INFO L229 MonitoredProcess]: Starting monitored process 142 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:28:57,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2021-11-20 06:28:57,650 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:28:57,651 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:28:57,661 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:28:57,661 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: [] [2021-11-20 06:28:57,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2021-11-20 06:28:57,681 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:28:57,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:57,681 INFO L229 MonitoredProcess]: Starting monitored process 143 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:28:57,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2021-11-20 06:28:57,683 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:28:57,683 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:28:57,690 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:28:57,690 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: [] [2021-11-20 06:28:57,710 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2021-11-20 06:28:57,710 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:28:57,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:57,711 INFO L229 MonitoredProcess]: Starting monitored process 144 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:28:57,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2021-11-20 06:28:57,717 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:28:57,717 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:28:57,725 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:28:57,725 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: [] [2021-11-20 06:28:57,744 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2021-11-20 06:28:57,744 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:28:57,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:57,745 INFO L229 MonitoredProcess]: Starting monitored process 145 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:28:57,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2021-11-20 06:28:57,746 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:28:57,746 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:28:57,777 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2021-11-20 06:28:57,778 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:28:57,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:57,779 INFO L229 MonitoredProcess]: Starting monitored process 146 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:28:57,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2021-11-20 06:28:57,780 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-11-20 06:28:57,780 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:28:58,569 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-11-20 06:28:58,573 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2021-11-20 06:28:58,574 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:28:58,574 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:28:58,574 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:28:58,574 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:28:58,574 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-20 06:28:58,574 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:28:58,574 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:28:58,574 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:28:58,574 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration22_Loop [2021-11-20 06:28:58,574 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:28:58,574 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:28:58,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:58,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:58,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:58,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:58,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:58,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:28:58,721 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:28:58,721 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-20 06:28:58,721 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:28:58,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:58,723 INFO L229 MonitoredProcess]: Starting monitored process 147 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:28:58,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2021-11-20 06:28:58,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:28:58,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:28:58,731 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:28:58,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:28:58,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:28:58,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:28:58,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:28:58,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:28:58,732 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:28:58,752 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2021-11-20 06:28:58,752 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:28:58,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:58,753 INFO L229 MonitoredProcess]: Starting monitored process 148 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:28:58,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2021-11-20 06:28:58,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:28:58,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:28:58,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:28:58,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:28:58,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:28:58,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:28:58,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:28:58,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:28:58,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:28:58,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Forceful destruction successful, exit code 0 [2021-11-20 06:28:58,783 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:28:58,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:58,783 INFO L229 MonitoredProcess]: Starting monitored process 149 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:28:58,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2021-11-20 06:28:58,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:28:58,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:28:58,794 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:28:58,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:28:58,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:28:58,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:28:58,794 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:28:58,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:28:58,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:28:58,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2021-11-20 06:28:58,815 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:28:58,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:58,816 INFO L229 MonitoredProcess]: Starting monitored process 150 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:28:58,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2021-11-20 06:28:58,817 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:28:58,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:28:58,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:28:58,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:28:58,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:28:58,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:28:58,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:28:58,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:28:58,833 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-20 06:28:58,837 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-11-20 06:28:58,837 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-11-20 06:28:58,837 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:28:58,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:28:58,838 INFO L229 MonitoredProcess]: Starting monitored process 151 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:28:58,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2021-11-20 06:28:58,839 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-20 06:28:58,839 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-11-20 06:28:58,839 INFO L513 LassoAnalysis]: Proved termination. [2021-11-20 06:28:58,839 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~k~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2021-11-20 06:28:58,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2021-11-20 06:28:58,859 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-11-20 06:28:58,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:28:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:28:58,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-20 06:28:58,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:28:59,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Forceful destruction successful, exit code 0 [2021-11-20 06:28:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:28:59,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-20 06:28:59,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:29:00,257 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-11-20 06:29:00,257 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2021-11-20 06:29:00,257 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 623 states and 860 transitions. cyclomatic complexity: 255 Second operand has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2021-11-20 06:29:00,374 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 623 states and 860 transitions. cyclomatic complexity: 255. Second operand has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Result 723 states and 969 transitions. Complement of second has 16 states. [2021-11-20 06:29:00,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2021-11-20 06:29:00,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2021-11-20 06:29:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2021-11-20 06:29:00,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 39 transitions. Stem has 117 letters. Loop has 38 letters. [2021-11-20 06:29:00,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:29:00,377 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-11-20 06:29:00,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:29:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:29:00,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-20 06:29:00,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:29:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:29:01,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-20 06:29:01,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:29:01,894 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-11-20 06:29:01,895 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2021-11-20 06:29:01,895 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 623 states and 860 transitions. cyclomatic complexity: 255 Second operand has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2021-11-20 06:29:02,021 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 623 states and 860 transitions. cyclomatic complexity: 255. Second operand has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Result 723 states and 969 transitions. Complement of second has 16 states. [2021-11-20 06:29:02,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2021-11-20 06:29:02,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2021-11-20 06:29:02,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2021-11-20 06:29:02,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 39 transitions. Stem has 117 letters. Loop has 38 letters. [2021-11-20 06:29:02,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:29:02,024 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-11-20 06:29:02,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:29:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:29:02,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-20 06:29:02,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:29:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:29:03,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-20 06:29:03,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:29:03,292 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-11-20 06:29:03,292 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2021-11-20 06:29:03,292 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 623 states and 860 transitions. cyclomatic complexity: 255 Second operand has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2021-11-20 06:29:03,463 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 623 states and 860 transitions. cyclomatic complexity: 255. Second operand has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Result 1720 states and 2209 transitions. Complement of second has 22 states. [2021-11-20 06:29:03,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2021-11-20 06:29:03,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2021-11-20 06:29:03,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2021-11-20 06:29:03,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 67 transitions. Stem has 117 letters. Loop has 38 letters. [2021-11-20 06:29:03,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:29:03,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 67 transitions. Stem has 155 letters. Loop has 38 letters. [2021-11-20 06:29:03,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:29:03,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 67 transitions. Stem has 117 letters. Loop has 76 letters. [2021-11-20 06:29:03,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:29:03,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1720 states and 2209 transitions. [2021-11-20 06:29:03,486 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 83 [2021-11-20 06:29:03,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1720 states to 921 states and 1111 transitions. [2021-11-20 06:29:03,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2021-11-20 06:29:03,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 227 [2021-11-20 06:29:03,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 921 states and 1111 transitions. [2021-11-20 06:29:03,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:29:03,495 INFO L681 BuchiCegarLoop]: Abstraction has 921 states and 1111 transitions. [2021-11-20 06:29:03,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states and 1111 transitions. [2021-11-20 06:29:03,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 875. [2021-11-20 06:29:03,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 579 states have (on average 1.079447322970639) internal successors, (625), 587 states have internal predecessors, (625), 181 states have call successors, (189), 108 states have call predecessors, (189), 115 states have return successors, (240), 179 states have call predecessors, (240), 181 states have call successors, (240) [2021-11-20 06:29:03,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1054 transitions. [2021-11-20 06:29:03,516 INFO L704 BuchiCegarLoop]: Abstraction has 875 states and 1054 transitions. [2021-11-20 06:29:03,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:29:03,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 06:29:03,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-20 06:29:03,517 INFO L87 Difference]: Start difference. First operand 875 states and 1054 transitions. Second operand has 13 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 13 states have internal predecessors, (47), 8 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (19), 7 states have call predecessors, (19), 8 states have call successors, (19) [2021-11-20 06:29:03,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:29:03,960 INFO L93 Difference]: Finished difference Result 1098 states and 1422 transitions. [2021-11-20 06:29:03,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 06:29:03,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1098 states and 1422 transitions. [2021-11-20 06:29:03,970 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 104 [2021-11-20 06:29:03,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1098 states to 1098 states and 1422 transitions. [2021-11-20 06:29:03,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 294 [2021-11-20 06:29:03,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 294 [2021-11-20 06:29:03,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1098 states and 1422 transitions. [2021-11-20 06:29:03,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:29:03,980 INFO L681 BuchiCegarLoop]: Abstraction has 1098 states and 1422 transitions. [2021-11-20 06:29:03,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states and 1422 transitions. [2021-11-20 06:29:03,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 931. [2021-11-20 06:29:04,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 612 states have (on average 1.0784313725490196) internal successors, (660), 623 states have internal predecessors, (660), 204 states have call successors, (219), 108 states have call predecessors, (219), 115 states have return successors, (274), 199 states have call predecessors, (274), 204 states have call successors, (274) [2021-11-20 06:29:04,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1153 transitions. [2021-11-20 06:29:04,004 INFO L704 BuchiCegarLoop]: Abstraction has 931 states and 1153 transitions. [2021-11-20 06:29:04,004 INFO L587 BuchiCegarLoop]: Abstraction has 931 states and 1153 transitions. [2021-11-20 06:29:04,004 INFO L425 BuchiCegarLoop]: ======== Iteration 23============ [2021-11-20 06:29:04,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 931 states and 1153 transitions. [2021-11-20 06:29:04,008 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2021-11-20 06:29:04,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:29:04,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:29:04,010 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [23, 23, 15, 8, 8, 8, 8, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-11-20 06:29:04,010 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:29:04,010 INFO L791 eck$LassoCheckResult]: Stem: 83850#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 83820#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 83821#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 83849#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 83836#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 83837#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 84180#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; 84172#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 84173#factENTRY ~n := #in~n; 84179#L25 assume ~n <= 0;#res := 1; 84178#factFINAL assume true; 84171#factEXIT >#68#return; 84166#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 84167#factENTRY ~n := #in~n; 84177#L25 assume ~n <= 0;#res := 1; 84170#factFINAL assume true; 84165#factEXIT >#70#return; 84161#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 84162#factENTRY ~n := #in~n; 84169#L25 assume ~n <= 0;#res := 1; 84164#factFINAL assume true; 84160#factEXIT >#72#return; 84159#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; 84158#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 84146#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 84140#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 84137#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; 84132#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 84134#factENTRY ~n := #in~n; 84154#L25 assume !(~n <= 0); 84151#L26 call #t~ret0 := fact(~n - 1);< 84152#factENTRY ~n := #in~n; 84157#L25 assume ~n <= 0;#res := 1; 84155#factFINAL assume true; 84150#factEXIT >#66#return; 84149#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84136#factFINAL assume true; 84131#factEXIT >#74#return; 84128#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 84138#factENTRY ~n := #in~n; 84153#L25 assume ~n <= 0;#res := 1; 84127#factFINAL assume true; 84129#factEXIT >#76#return; 84091#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 84092#factENTRY ~n := #in~n; 84183#L25 assume !(~n <= 0); 84175#L26 call #t~ret0 := fact(~n - 1);< 84176#factENTRY ~n := #in~n; 84182#L25 assume ~n <= 0;#res := 1; 84181#factFINAL assume true; 84174#factEXIT >#66#return; 84168#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84163#factFINAL assume true; 84090#factEXIT >#78#return; 84089#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; 84088#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 84087#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 84084#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 84081#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; 84074#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 84077#factENTRY ~n := #in~n; 84105#L25 assume !(~n <= 0); 84101#L26 call #t~ret0 := fact(~n - 1);< 84103#factENTRY ~n := #in~n; 84195#L25 assume !(~n <= 0); 84100#L26 call #t~ret0 := fact(~n - 1);< 84194#factENTRY ~n := #in~n; 84204#L25 assume ~n <= 0;#res := 1; 84203#factFINAL assume true; 84202#factEXIT >#66#return; 84102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84193#factFINAL assume true; 84099#factEXIT >#66#return; 84096#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84079#factFINAL assume true; 84073#factEXIT >#74#return; 84076#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 84094#factENTRY ~n := #in~n; 84104#L25 assume ~n <= 0;#res := 1; 84098#factFINAL assume true; 84093#factEXIT >#76#return; 84075#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 84077#factENTRY ~n := #in~n; 84105#L25 assume !(~n <= 0); 84101#L26 call #t~ret0 := fact(~n - 1);< 84103#factENTRY ~n := #in~n; 84195#L25 assume !(~n <= 0); 84100#L26 call #t~ret0 := fact(~n - 1);< 84194#factENTRY ~n := #in~n; 84204#L25 assume ~n <= 0;#res := 1; 84203#factFINAL assume true; 84202#factEXIT >#66#return; 84102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84193#factFINAL assume true; 84099#factEXIT >#66#return; 84096#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84079#factFINAL assume true; 84073#factEXIT >#78#return; 84072#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; 84071#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 84070#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 84069#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 84068#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 84062#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 84060#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 84058#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; 83809#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 83810#factENTRY ~n := #in~n; 84393#L25 assume ~n <= 0;#res := 1; 84333#factFINAL assume true; 84334#factEXIT >#68#return; 84403#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 84541#factENTRY ~n := #in~n; 84703#L25 assume ~n <= 0;#res := 1; 84656#factFINAL assume true; 84702#factEXIT >#70#return; 84697#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 84699#factENTRY ~n := #in~n; 84701#L25 assume ~n <= 0;#res := 1; 84700#factFINAL assume true; 84695#factEXIT >#72#return; 84698#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; 84710#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 84709#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 84708#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 84707#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; 84661#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 84670#factENTRY ~n := #in~n; 84668#L25 assume !(~n <= 0); 83904#L26 call #t~ret0 := fact(~n - 1);< 83923#factENTRY ~n := #in~n; 83945#L25 assume ~n <= 0;#res := 1; 83942#factFINAL assume true; 83913#factEXIT >#66#return; 83918#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84676#factFINAL assume true; 84673#factEXIT >#74#return; 84662#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 84667#factENTRY ~n := #in~n; 84677#L25 assume ~n <= 0;#res := 1; 84669#factFINAL assume true; 84657#factEXIT >#76#return; 83976#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 83784#factENTRY ~n := #in~n; 83974#L25 assume !(~n <= 0); 83904#L26 call #t~ret0 := fact(~n - 1);< 83923#factENTRY ~n := #in~n; 83945#L25 assume ~n <= 0;#res := 1; 83942#factFINAL assume true; 83913#factEXIT >#66#return; 83918#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84676#factFINAL assume true; 84673#factEXIT >#78#return; 84674#L30-8 [2021-11-20 06:29:04,010 INFO L793 eck$LassoCheckResult]: Loop: 84674#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; 84692#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 84690#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 84688#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 84686#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; 84664#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 84670#factENTRY ~n := #in~n; 84668#L25 assume !(~n <= 0); 83904#L26 call #t~ret0 := fact(~n - 1);< 83923#factENTRY ~n := #in~n; 83945#L25 assume ~n <= 0;#res := 1; 83942#factFINAL assume true; 83913#factEXIT >#66#return; 83918#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84676#factFINAL assume true; 84673#factEXIT >#74#return; 84659#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 84667#factENTRY ~n := #in~n; 84677#L25 assume ~n <= 0;#res := 1; 84669#factFINAL assume true; 84657#factEXIT >#76#return; 83977#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 83784#factENTRY ~n := #in~n; 83974#L25 assume !(~n <= 0); 83904#L26 call #t~ret0 := fact(~n - 1);< 83923#factENTRY ~n := #in~n; 83968#L25 assume !(~n <= 0); 83897#L26 call #t~ret0 := fact(~n - 1);< 83965#factENTRY ~n := #in~n; 83969#L25 assume ~n <= 0;#res := 1; 84108#factFINAL assume true; 84106#factEXIT >#66#return; 83908#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 83961#factFINAL assume true; 83895#factEXIT >#66#return; 83910#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84685#factFINAL assume true; 84684#factEXIT >#78#return; 84674#L30-8 [2021-11-20 06:29:04,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:29:04,011 INFO L85 PathProgramCache]: Analyzing trace with hash -214456813, now seen corresponding path program 13 times [2021-11-20 06:29:04,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:29:04,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265290903] [2021-11-20 06:29:04,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:29:04,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:29:04,016 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:29:04,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1931758003] [2021-11-20 06:29:04,017 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 06:29:04,017 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:29:04,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:29:04,021 INFO L229 MonitoredProcess]: Starting monitored process 152 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:29:04,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (152)] Waiting until timeout for monitored process [2021-11-20 06:29:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:29:04,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-20 06:29:04,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:29:04,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 547 proven. 1 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2021-11-20 06:29:04,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:29:04,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 75 proven. 22 refuted. 0 times theorem prover too weak. 1019 trivial. 0 not checked. [2021-11-20 06:29:04,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:29:04,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265290903] [2021-11-20 06:29:04,755 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:29:04,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931758003] [2021-11-20 06:29:04,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931758003] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:29:04,755 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:29:04,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-11-20 06:29:04,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035248459] [2021-11-20 06:29:04,755 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:29:04,755 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 06:29:04,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:29:04,756 INFO L85 PathProgramCache]: Analyzing trace with hash -468350084, now seen corresponding path program 3 times [2021-11-20 06:29:04,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:29:04,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468277738] [2021-11-20 06:29:04,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:29:04,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:29:04,758 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:29:04,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1409674507] [2021-11-20 06:29:04,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 06:29:04,758 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:29:04,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:29:04,771 INFO L229 MonitoredProcess]: Starting monitored process 153 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:29:04,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (153)] Waiting until timeout for monitored process [2021-11-20 06:29:04,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-11-20 06:29:04,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-20 06:29:04,814 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:29:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:29:04,829 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:29:05,709 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:29:05,709 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:29:05,709 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:29:05,709 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:29:05,709 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-11-20 06:29:05,709 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:29:05,709 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:29:05,709 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:29:05,709 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration23_Loop [2021-11-20 06:29:05,709 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:29:05,709 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:29:05,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:29:05,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:29:05,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:29:05,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:29:05,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:29:05,848 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:29:05,848 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-11-20 06:29:05,848 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:29:05,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:29:05,850 INFO L229 MonitoredProcess]: Starting monitored process 154 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:29:05,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2021-11-20 06:29:05,851 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:29:05,851 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:29:05,859 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:29:05,859 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: [] [2021-11-20 06:29:05,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2021-11-20 06:29:05,878 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:29:05,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:29:05,881 INFO L229 MonitoredProcess]: Starting monitored process 155 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:29:05,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2021-11-20 06:29:05,882 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:29:05,882 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:29:05,911 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2021-11-20 06:29:05,911 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:29:05,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:29:05,912 INFO L229 MonitoredProcess]: Starting monitored process 156 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:29:05,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2021-11-20 06:29:05,913 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-11-20 06:29:05,913 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:29:05,937 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-11-20 06:29:05,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Forceful destruction successful, exit code 0 [2021-11-20 06:29:05,956 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:29:05,956 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:29:05,956 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:29:05,956 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:29:05,956 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-20 06:29:05,956 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:29:05,956 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:29:05,956 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:29:05,956 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration23_Loop [2021-11-20 06:29:05,957 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:29:05,957 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:29:05,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:29:05,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:29:05,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:29:05,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:29:05,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:29:06,087 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:29:06,087 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-20 06:29:06,087 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:29:06,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:29:06,088 INFO L229 MonitoredProcess]: Starting monitored process 157 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:29:06,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2021-11-20 06:29:06,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:29:06,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:29:06,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:29:06,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:29:06,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:29:06,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:29:06,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:29:06,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:29:06,101 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:29:06,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Forceful destruction successful, exit code 0 [2021-11-20 06:29:06,119 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:29:06,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:29:06,120 INFO L229 MonitoredProcess]: Starting monitored process 158 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:29:06,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2021-11-20 06:29:06,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:29:06,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:29:06,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:29:06,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:29:06,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:29:06,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:29:06,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:29:06,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:29:06,129 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:29:06,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2021-11-20 06:29:06,149 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:29:06,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:29:06,152 INFO L229 MonitoredProcess]: Starting monitored process 159 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:29:06,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2021-11-20 06:29:06,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:29:06,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:29:06,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:29:06,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:29:06,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:29:06,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:29:06,163 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:29:06,163 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:29:06,186 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-20 06:29:06,198 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-11-20 06:29:06,198 INFO L444 ModelExtractionUtils]: 7 out of 11 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-11-20 06:29:06,198 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:29:06,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:29:06,202 INFO L229 MonitoredProcess]: Starting monitored process 160 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:29:06,205 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-20 06:29:06,205 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-11-20 06:29:06,205 INFO L513 LassoAnalysis]: Proved termination. [2021-11-20 06:29:06,205 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~k~0#1) = 1*ULTIMATE.start_main_~x~0#1 - 1*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2021-11-20 06:29:06,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2021-11-20 06:29:06,239 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Ended with exit code 0 [2021-11-20 06:29:06,239 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-11-20 06:29:06,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:29:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:29:06,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 48 conjunts are in the unsatisfiable core [2021-11-20 06:29:06,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:29:06,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Forceful destruction successful, exit code 0 [2021-11-20 06:29:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:29:07,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-20 06:29:07,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:29:07,964 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-11-20 06:29:07,964 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2021-11-20 06:29:07,965 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 931 states and 1153 transitions. cyclomatic complexity: 245 Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2021-11-20 06:29:08,093 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 931 states and 1153 transitions. cyclomatic complexity: 245. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Result 988 states and 1217 transitions. Complement of second has 13 states. [2021-11-20 06:29:08,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2021-11-20 06:29:08,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2021-11-20 06:29:08,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2021-11-20 06:29:08,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 153 letters. Loop has 38 letters. [2021-11-20 06:29:08,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:29:08,096 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-11-20 06:29:08,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:29:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:29:08,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 48 conjunts are in the unsatisfiable core [2021-11-20 06:29:08,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:29:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:29:09,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-20 06:29:09,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:29:09,686 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-11-20 06:29:09,686 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2021-11-20 06:29:09,687 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 931 states and 1153 transitions. cyclomatic complexity: 245 Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2021-11-20 06:29:09,836 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 931 states and 1153 transitions. cyclomatic complexity: 245. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Result 986 states and 1214 transitions. Complement of second has 15 states. [2021-11-20 06:29:09,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2021-11-20 06:29:09,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2021-11-20 06:29:09,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2021-11-20 06:29:09,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 50 transitions. Stem has 153 letters. Loop has 38 letters. [2021-11-20 06:29:09,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:29:09,839 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-11-20 06:29:09,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:29:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:29:09,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 48 conjunts are in the unsatisfiable core [2021-11-20 06:29:09,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:29:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:29:11,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-20 06:29:11,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:29:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-11-20 06:29:11,584 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2021-11-20 06:29:11,584 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 931 states and 1153 transitions. cyclomatic complexity: 245 Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2021-11-20 06:29:11,733 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 931 states and 1153 transitions. cyclomatic complexity: 245. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Result 1346 states and 1652 transitions. Complement of second has 14 states. [2021-11-20 06:29:11,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2021-11-20 06:29:11,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2021-11-20 06:29:11,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2021-11-20 06:29:11,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 56 transitions. Stem has 153 letters. Loop has 38 letters. [2021-11-20 06:29:11,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:29:11,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 56 transitions. Stem has 191 letters. Loop has 38 letters. [2021-11-20 06:29:11,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:29:11,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 56 transitions. Stem has 153 letters. Loop has 76 letters. [2021-11-20 06:29:11,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:29:11,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1346 states and 1652 transitions. [2021-11-20 06:29:11,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2021-11-20 06:29:11,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1346 states to 926 states and 1118 transitions. [2021-11-20 06:29:11,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2021-11-20 06:29:11,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 103 [2021-11-20 06:29:11,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 926 states and 1118 transitions. [2021-11-20 06:29:11,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:29:11,756 INFO L681 BuchiCegarLoop]: Abstraction has 926 states and 1118 transitions. [2021-11-20 06:29:11,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states and 1118 transitions. [2021-11-20 06:29:11,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 903. [2021-11-20 06:29:11,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 600 states have (on average 1.0966666666666667) internal successors, (658), 605 states have internal predecessors, (658), 181 states have call successors, (190), 121 states have call predecessors, (190), 122 states have return successors, (240), 176 states have call predecessors, (240), 181 states have call successors, (240) [2021-11-20 06:29:11,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1088 transitions. [2021-11-20 06:29:11,775 INFO L704 BuchiCegarLoop]: Abstraction has 903 states and 1088 transitions. [2021-11-20 06:29:11,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:29:11,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 06:29:11,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-20 06:29:11,776 INFO L87 Difference]: Start difference. First operand 903 states and 1088 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2021-11-20 06:29:11,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:29:11,962 INFO L93 Difference]: Finished difference Result 724 states and 844 transitions. [2021-11-20 06:29:11,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:29:11,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 724 states and 844 transitions. [2021-11-20 06:29:11,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2021-11-20 06:29:11,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 724 states to 516 states and 599 transitions. [2021-11-20 06:29:11,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2021-11-20 06:29:11,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2021-11-20 06:29:11,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 516 states and 599 transitions. [2021-11-20 06:29:11,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:29:11,971 INFO L681 BuchiCegarLoop]: Abstraction has 516 states and 599 transitions. [2021-11-20 06:29:11,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states and 599 transitions. [2021-11-20 06:29:11,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2021-11-20 06:29:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 348 states have (on average 1.0833333333333333) internal successors, (377), 350 states have internal predecessors, (377), 95 states have call successors, (98), 72 states have call predecessors, (98), 73 states have return successors, (124), 93 states have call predecessors, (124), 95 states have call successors, (124) [2021-11-20 06:29:11,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 599 transitions. [2021-11-20 06:29:11,981 INFO L704 BuchiCegarLoop]: Abstraction has 516 states and 599 transitions. [2021-11-20 06:29:11,981 INFO L587 BuchiCegarLoop]: Abstraction has 516 states and 599 transitions. [2021-11-20 06:29:11,981 INFO L425 BuchiCegarLoop]: ======== Iteration 24============ [2021-11-20 06:29:11,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 516 states and 599 transitions. [2021-11-20 06:29:11,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2021-11-20 06:29:11,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:29:11,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:29:11,985 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [32, 32, 18, 14, 14, 14, 14, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2021-11-20 06:29:11,985 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [30, 30, 18, 18, 18, 18, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:29:11,986 INFO L791 eck$LassoCheckResult]: Stem: 92438#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 92408#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 92409#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 92437#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 92423#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 92424#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 92714#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; 92712#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 92713#factENTRY ~n := #in~n; 92717#L25 assume ~n <= 0;#res := 1; 92716#factFINAL assume true; 92711#factEXIT >#68#return; 92707#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 92708#factENTRY ~n := #in~n; 92715#L25 assume ~n <= 0;#res := 1; 92710#factFINAL assume true; 92706#factEXIT >#70#return; 92703#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 92704#factENTRY ~n := #in~n; 92709#L25 assume ~n <= 0;#res := 1; 92705#factFINAL assume true; 92702#factEXIT >#72#return; 92701#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; 92700#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 92699#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 92698#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 92697#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; 92386#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 92387#factENTRY ~n := #in~n; 92407#L25 assume !(~n <= 0); 92892#L26 call #t~ret0 := fact(~n - 1);< 92893#factENTRY ~n := #in~n; 92897#L25 assume ~n <= 0;#res := 1; 92895#factFINAL assume true; 92891#factEXIT >#66#return; 92890#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92889#factFINAL assume true; 92861#factEXIT >#74#return; 92858#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 92865#factENTRY ~n := #in~n; 92874#L25 assume ~n <= 0;#res := 1; 92857#factFINAL assume true; 92859#factEXIT >#76#return; 92458#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 92459#factENTRY ~n := #in~n; 92886#L25 assume !(~n <= 0); 92884#L26 call #t~ret0 := fact(~n - 1);< 92885#factENTRY ~n := #in~n; 92888#L25 assume ~n <= 0;#res := 1; 92887#factFINAL assume true; 92883#factEXIT >#66#return; 92882#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92881#factFINAL assume true; 92618#factEXIT >#78#return; 92612#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; 92610#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 92597#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 92596#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 92594#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; 92571#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 92574#factENTRY ~n := #in~n; 92586#L25 assume !(~n <= 0); 92582#L26 call #t~ret0 := fact(~n - 1);< 92585#factENTRY ~n := #in~n; 92589#L25 assume !(~n <= 0); 92583#L26 call #t~ret0 := fact(~n - 1);< 92588#factENTRY ~n := #in~n; 92592#L25 assume ~n <= 0;#res := 1; 92591#factFINAL assume true; 92590#factEXIT >#66#return; 92584#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92587#factFINAL assume true; 92581#factEXIT >#66#return; 92579#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92577#factFINAL assume true; 92570#factEXIT >#74#return; 92573#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 92576#factENTRY ~n := #in~n; 92580#L25 assume ~n <= 0;#res := 1; 92578#factFINAL assume true; 92575#factEXIT >#76#return; 92572#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 92574#factENTRY ~n := #in~n; 92586#L25 assume !(~n <= 0); 92582#L26 call #t~ret0 := fact(~n - 1);< 92585#factENTRY ~n := #in~n; 92589#L25 assume !(~n <= 0); 92583#L26 call #t~ret0 := fact(~n - 1);< 92588#factENTRY ~n := #in~n; 92592#L25 assume ~n <= 0;#res := 1; 92591#factFINAL assume true; 92590#factEXIT >#66#return; 92584#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92587#factFINAL assume true; 92581#factEXIT >#66#return; 92579#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92577#factFINAL assume true; 92570#factEXIT >#78#return; 92410#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; 92411#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 92421#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 92559#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 92434#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 92435#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 92448#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 92440#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; 92402#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 92403#factENTRY ~n := #in~n; 92847#L25 assume !(~n <= 0); 92835#L26 call #t~ret0 := fact(~n - 1);< 92836#factENTRY ~n := #in~n; 92846#L25 assume ~n <= 0;#res := 1; 92844#factFINAL assume true; 92834#factEXIT >#66#return; 92832#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92831#factFINAL assume true; 92822#factEXIT >#68#return; 92452#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 92453#factENTRY ~n := #in~n; 92838#L25 assume ~n <= 0;#res := 1; 92818#factFINAL assume true; 92819#factEXIT >#70#return; 92396#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 92397#factENTRY ~n := #in~n; 92821#L25 assume !(~n <= 0); 92810#L26 call #t~ret0 := fact(~n - 1);< 92813#factENTRY ~n := #in~n; 92829#L25 assume ~n <= 0;#res := 1; 92814#factFINAL assume true; 92809#factEXIT >#66#return; 92808#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92807#factFINAL assume true; 92801#factEXIT >#72#return; 92799#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; 92797#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 92796#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 92794#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 92795#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; 92649#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 92651#factENTRY ~n := #in~n; 92667#L25 assume !(~n <= 0); 92659#L26 call #t~ret0 := fact(~n - 1);< 92665#factENTRY ~n := #in~n; 92666#L25 assume ~n <= 0;#res := 1; 92663#factFINAL assume true; 92655#factEXIT >#66#return; 92661#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92654#factFINAL assume true; 92647#factEXIT >#68#return; 92642#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 92643#factENTRY ~n := #in~n; 92664#L25 assume !(~n <= 0); 92657#L26 call #t~ret0 := fact(~n - 1);< 92662#factENTRY ~n := #in~n; 92666#L25 assume ~n <= 0;#res := 1; 92663#factFINAL assume true; 92655#factEXIT >#66#return; 92653#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92646#factFINAL assume true; 92641#factEXIT >#70#return; 92636#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 92637#factENTRY ~n := #in~n; 92645#L25 assume ~n <= 0;#res := 1; 92640#factFINAL assume true; 92635#factEXIT >#72#return; 92632#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; 92625#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 92622#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 92619#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 92613#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; 92600#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 92602#factENTRY ~n := #in~n; 92691#L25 assume !(~n <= 0); 92656#L26 call #t~ret0 := fact(~n - 1);< 92665#factENTRY ~n := #in~n; 92692#L25 assume !(~n <= 0); 92687#L26 call #t~ret0 := fact(~n - 1);< 92690#factENTRY ~n := #in~n; 92694#L25 assume ~n <= 0;#res := 1; 92695#factFINAL assume true; 92693#factEXIT >#66#return; 92688#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92689#factFINAL assume true; 92686#factEXIT >#66#return; 92685#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92684#factFINAL assume true; 92611#factEXIT >#74#return; 92601#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 92609#factENTRY ~n := #in~n; 92696#L25 assume !(~n <= 0); 92658#L26 call #t~ret0 := fact(~n - 1);< 92662#factENTRY ~n := #in~n; 92666#L25 assume ~n <= 0;#res := 1; 92663#factFINAL assume true; 92655#factEXIT >#66#return; 92660#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92668#factFINAL assume true; 92598#factEXIT >#76#return; 92599#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 92602#factENTRY ~n := #in~n; 92691#L25 assume !(~n <= 0); 92656#L26 call #t~ret0 := fact(~n - 1);< 92665#factENTRY ~n := #in~n; 92666#L25 assume ~n <= 0;#res := 1; 92663#factFINAL assume true; 92655#factEXIT >#66#return; 92660#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92668#factFINAL assume true; 92598#factEXIT >#78#return; 92593#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; 92546#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 92544#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 92543#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 92436#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 92425#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 92427#L42-3 [2021-11-20 06:29:11,986 INFO L793 eck$LassoCheckResult]: Loop: 92427#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 92463#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; 92400#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 92401#factENTRY ~n := #in~n; 92495#L25 assume !(~n <= 0); 92490#L26 call #t~ret0 := fact(~n - 1);< 92493#factENTRY ~n := #in~n; 92498#L25 assume !(~n <= 0); 92491#L26 call #t~ret0 := fact(~n - 1);< 92497#factENTRY ~n := #in~n; 92501#L25 assume ~n <= 0;#res := 1; 92502#factFINAL assume true; 92499#factEXIT >#66#return; 92492#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92496#factFINAL assume true; 92489#factEXIT >#66#return; 92487#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92484#factFINAL assume true; 92478#factEXIT >#68#return; 92450#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 92451#factENTRY ~n := #in~n; 92769#L25 assume ~n <= 0;#res := 1; 92768#factFINAL assume true; 92767#factEXIT >#70#return; 92756#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 92763#factENTRY ~n := #in~n; 92761#L25 assume !(~n <= 0); 92750#L26 call #t~ret0 := fact(~n - 1);< 92757#factENTRY ~n := #in~n; 92737#L25 assume !(~n <= 0); 92749#L26 call #t~ret0 := fact(~n - 1);< 92759#factENTRY ~n := #in~n; 92762#L25 assume ~n <= 0;#res := 1; 92760#factFINAL assume true; 92758#factEXIT >#66#return; 92752#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92754#factFINAL assume true; 92748#factEXIT >#66#return; 92751#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92783#factFINAL assume true; 92782#factEXIT >#72#return; 92781#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; 92779#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 92777#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); 92773#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; 92739#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 92771#factENTRY ~n := #in~n; 92770#L25 assume !(~n <= 0); 92726#L26 call #t~ret0 := fact(~n - 1);< 92729#factENTRY ~n := #in~n; 92737#L25 assume !(~n <= 0); 92749#L26 call #t~ret0 := fact(~n - 1);< 92759#factENTRY ~n := #in~n; 92762#L25 assume ~n <= 0;#res := 1; 92760#factFINAL assume true; 92758#factEXIT >#66#return; 92752#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92754#factFINAL assume true; 92748#factEXIT >#66#return; 92753#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92785#factFINAL assume true; 92784#factEXIT >#68#return; 92732#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 92736#factENTRY ~n := #in~n; 92733#L25 assume !(~n <= 0); 92727#L26 call #t~ret0 := fact(~n - 1);< 92729#factENTRY ~n := #in~n; 92737#L25 assume !(~n <= 0); 92749#L26 call #t~ret0 := fact(~n - 1);< 92759#factENTRY ~n := #in~n; 92762#L25 assume ~n <= 0;#res := 1; 92760#factFINAL assume true; 92758#factEXIT >#66#return; 92752#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92754#factFINAL assume true; 92748#factEXIT >#66#return; 92747#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92746#factFINAL assume true; 92743#factEXIT >#70#return; 92539#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 92724#factENTRY ~n := #in~n; 92720#L25 assume !(~n <= 0); 92721#L26 call #t~ret0 := fact(~n - 1);< 92729#factENTRY ~n := #in~n; 92735#L25 assume ~n <= 0;#res := 1; 92730#factFINAL assume true; 92725#factEXIT >#66#return; 92722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92723#factFINAL assume true; 92744#factEXIT >#72#return; 92537#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; 92535#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 92533#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 92531#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 92529#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; 92480#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 92528#factENTRY ~n := #in~n; 92568#L25 assume !(~n <= 0); 92470#L26 call #t~ret0 := fact(~n - 1);< 92477#factENTRY ~n := #in~n; 92482#L25 assume !(~n <= 0); 92472#L26 call #t~ret0 := fact(~n - 1);< 92481#factENTRY ~n := #in~n; 92486#L25 assume ~n <= 0;#res := 1; 92494#factFINAL assume true; 92488#factEXIT >#66#return; 92476#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92479#factFINAL assume true; 92469#factEXIT >#66#return; 92474#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92542#factFINAL assume true; 92526#factEXIT >#68#return; 92461#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 92462#factENTRY ~n := #in~n; 92483#L25 assume !(~n <= 0); 92473#L26 call #t~ret0 := fact(~n - 1);< 92477#factENTRY ~n := #in~n; 92482#L25 assume !(~n <= 0); 92472#L26 call #t~ret0 := fact(~n - 1);< 92481#factENTRY ~n := #in~n; 92486#L25 assume ~n <= 0;#res := 1; 92494#factFINAL assume true; 92488#factEXIT >#66#return; 92476#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92479#factFINAL assume true; 92469#factEXIT >#66#return; 92467#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92465#factFINAL assume true; 92460#factEXIT >#70#return; 92394#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 92395#factENTRY ~n := #in~n; 92468#L25 assume ~n <= 0;#res := 1; 92466#factFINAL assume true; 92464#factEXIT >#72#return; 92428#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; 92429#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 92432#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 92455#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 92439#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; 92384#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 92385#factENTRY ~n := #in~n; 92562#L25 assume !(~n <= 0); 92471#L26 call #t~ret0 := fact(~n - 1);< 92477#factENTRY ~n := #in~n; 92482#L25 assume !(~n <= 0); 92472#L26 call #t~ret0 := fact(~n - 1);< 92481#factENTRY ~n := #in~n; 92486#L25 assume ~n <= 0;#res := 1; 92494#factFINAL assume true; 92488#factEXIT >#66#return; 92476#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92479#factFINAL assume true; 92469#factEXIT >#66#return; 92475#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92525#factFINAL assume true; 92524#factEXIT >#74#return; 92405#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 92404#factENTRY ~n := #in~n; 92406#L25 assume !(~n <= 0); 92444#L26 call #t~ret0 := fact(~n - 1);< 92485#factENTRY ~n := #in~n; 92482#L25 assume !(~n <= 0); 92472#L26 call #t~ret0 := fact(~n - 1);< 92481#factENTRY ~n := #in~n; 92486#L25 assume ~n <= 0;#res := 1; 92494#factFINAL assume true; 92488#factEXIT >#66#return; 92476#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92479#factFINAL assume true; 92469#factEXIT >#66#return; 92475#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92525#factFINAL assume true; 92524#factEXIT >#76#return; 92457#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 92385#factENTRY ~n := #in~n; 92562#L25 assume !(~n <= 0); 92471#L26 call #t~ret0 := fact(~n - 1);< 92477#factENTRY ~n := #in~n; 92564#L25 assume ~n <= 0;#res := 1; 92563#factFINAL assume true; 92561#factEXIT >#66#return; 92560#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92558#factFINAL assume true; 92556#factEXIT >#78#return; 92515#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; 92516#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 92536#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 92534#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 92532#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 92530#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 92427#L42-3 [2021-11-20 06:29:11,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:29:11,987 INFO L85 PathProgramCache]: Analyzing trace with hash 52177008, now seen corresponding path program 14 times [2021-11-20 06:29:11,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:29:11,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924995385] [2021-11-20 06:29:11,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:29:11,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:29:11,998 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:29:11,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [301094813] [2021-11-20 06:29:11,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:29:11,998 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:29:11,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:29:12,005 INFO L229 MonitoredProcess]: Starting monitored process 161 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:29:12,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (161)] Waiting until timeout for monitored process [2021-11-20 06:29:12,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:29:12,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-20 06:29:12,215 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:29:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:29:12,327 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:29:12,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:29:12,328 INFO L85 PathProgramCache]: Analyzing trace with hash -786967790, now seen corresponding path program 10 times [2021-11-20 06:29:12,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:29:12,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770937476] [2021-11-20 06:29:12,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:29:12,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:29:12,333 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:29:12,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [204959890] [2021-11-20 06:29:12,333 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 06:29:12,333 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:29:12,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:29:12,337 INFO L229 MonitoredProcess]: Starting monitored process 162 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:29:12,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (162)] Waiting until timeout for monitored process [2021-11-20 06:29:12,439 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 06:29:12,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:29:12,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-20 06:29:12,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:29:12,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2083 backedges. 1163 proven. 32 refuted. 0 times theorem prover too weak. 888 trivial. 0 not checked. [2021-11-20 06:29:12,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:29:13,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2083 backedges. 119 proven. 226 refuted. 0 times theorem prover too weak. 1738 trivial. 0 not checked. [2021-11-20 06:29:13,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:29:13,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770937476] [2021-11-20 06:29:13,366 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:29:13,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204959890] [2021-11-20 06:29:13,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204959890] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:29:13,366 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:29:13,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 15 [2021-11-20 06:29:13,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256668797] [2021-11-20 06:29:13,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:29:13,367 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 06:29:13,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:29:13,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 06:29:13,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-11-20 06:29:13,368 INFO L87 Difference]: Start difference. First operand 516 states and 599 transitions. cyclomatic complexity: 98 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, (24), 2 states have call predecessors, (24), 5 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) [2021-11-20 06:29:13,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:29:13,890 INFO L93 Difference]: Finished difference Result 587 states and 697 transitions. [2021-11-20 06:29:13,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-20 06:29:13,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 587 states and 697 transitions. [2021-11-20 06:29:13,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2021-11-20 06:29:13,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 587 states to 587 states and 697 transitions. [2021-11-20 06:29:13,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 [2021-11-20 06:29:13,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2021-11-20 06:29:13,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 587 states and 697 transitions. [2021-11-20 06:29:13,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:29:13,899 INFO L681 BuchiCegarLoop]: Abstraction has 587 states and 697 transitions. [2021-11-20 06:29:13,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states and 697 transitions. [2021-11-20 06:29:13,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 523. [2021-11-20 06:29:13,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 353 states have (on average 1.0821529745042493) internal successors, (382), 355 states have internal predecessors, (382), 97 states have call successors, (100), 72 states have call predecessors, (100), 73 states have return successors, (126), 95 states have call predecessors, (126), 97 states have call successors, (126) [2021-11-20 06:29:13,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 608 transitions. [2021-11-20 06:29:13,910 INFO L704 BuchiCegarLoop]: Abstraction has 523 states and 608 transitions. [2021-11-20 06:29:13,911 INFO L587 BuchiCegarLoop]: Abstraction has 523 states and 608 transitions. [2021-11-20 06:29:13,911 INFO L425 BuchiCegarLoop]: ======== Iteration 25============ [2021-11-20 06:29:13,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 523 states and 608 transitions. [2021-11-20 06:29:13,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2021-11-20 06:29:13,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:29:13,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:29:13,915 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [32, 32, 18, 14, 14, 14, 14, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2021-11-20 06:29:13,915 INFO L843 BuchiCegarLoop]: 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] [2021-11-20 06:29:13,916 INFO L791 eck$LassoCheckResult]: Stem: 94722#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 94692#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 94693#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 94721#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 94707#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 94708#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 94926#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; 94924#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 94925#factENTRY ~n := #in~n; 94929#L25 assume ~n <= 0;#res := 1; 94928#factFINAL assume true; 94923#factEXIT >#68#return; 94919#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 94920#factENTRY ~n := #in~n; 94927#L25 assume ~n <= 0;#res := 1; 94922#factFINAL assume true; 94918#factEXIT >#70#return; 94914#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 94915#factENTRY ~n := #in~n; 94921#L25 assume ~n <= 0;#res := 1; 94917#factFINAL assume true; 94913#factEXIT >#72#return; 94912#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; 94911#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 94895#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 94891#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 94886#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; 94881#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 94882#factENTRY ~n := #in~n; 94909#L25 assume !(~n <= 0); 94893#L26 call #t~ret0 := fact(~n - 1);< 94894#factENTRY ~n := #in~n; 94910#L25 assume ~n <= 0;#res := 1; 94908#factFINAL assume true; 94892#factEXIT >#66#return; 94887#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94883#factFINAL assume true; 94880#factEXIT >#74#return; 94867#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 94868#factENTRY ~n := #in~n; 94905#L25 assume ~n <= 0;#res := 1; 94904#factFINAL assume true; 94866#factEXIT >#76#return; 94863#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 94885#factENTRY ~n := #in~n; 94951#L25 assume !(~n <= 0); 94902#L26 call #t~ret0 := fact(~n - 1);< 94903#factENTRY ~n := #in~n; 94907#L25 assume ~n <= 0;#res := 1; 94906#factFINAL assume true; 94901#factEXIT >#66#return; 94889#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94884#factFINAL assume true; 94862#factEXIT >#78#return; 94858#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; 94855#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 94848#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 94845#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 94837#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; 94829#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 94832#factENTRY ~n := #in~n; 94847#L25 assume !(~n <= 0); 94842#L26 call #t~ret0 := fact(~n - 1);< 94844#factENTRY ~n := #in~n; 94854#L25 assume !(~n <= 0); 94841#L26 call #t~ret0 := fact(~n - 1);< 94853#factENTRY ~n := #in~n; 94861#L25 assume ~n <= 0;#res := 1; 94860#factFINAL assume true; 94859#factEXIT >#66#return; 94843#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94852#factFINAL assume true; 94840#factEXIT >#66#return; 94836#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94833#factFINAL assume true; 94828#factEXIT >#74#return; 94831#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 94835#factENTRY ~n := #in~n; 94846#L25 assume ~n <= 0;#res := 1; 94839#factFINAL assume true; 94834#factEXIT >#76#return; 94830#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 94832#factENTRY ~n := #in~n; 94847#L25 assume !(~n <= 0); 94842#L26 call #t~ret0 := fact(~n - 1);< 94844#factENTRY ~n := #in~n; 94854#L25 assume !(~n <= 0); 94841#L26 call #t~ret0 := fact(~n - 1);< 94853#factENTRY ~n := #in~n; 94861#L25 assume ~n <= 0;#res := 1; 94860#factFINAL assume true; 94859#factEXIT >#66#return; 94843#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94852#factFINAL assume true; 94840#factEXIT >#66#return; 94836#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94833#factFINAL assume true; 94828#factEXIT >#78#return; 94827#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; 94704#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 94705#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 94744#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 94718#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 94719#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 94736#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 94725#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; 94726#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 94685#factENTRY ~n := #in~n; 95170#L25 assume !(~n <= 0); 95164#L26 call #t~ret0 := fact(~n - 1);< 95165#factENTRY ~n := #in~n; 95167#L25 assume ~n <= 0;#res := 1; 95166#factFINAL assume true; 95163#factEXIT >#66#return; 95161#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 95160#factFINAL assume true; 95158#factEXIT >#68#return; 94740#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 94741#factENTRY ~n := #in~n; 95138#L25 assume ~n <= 0;#res := 1; 95130#factFINAL assume true; 95136#factEXIT >#70#return; 95116#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 95118#factENTRY ~n := #in~n; 95127#L25 assume !(~n <= 0); 94680#L26 call #t~ret0 := fact(~n - 1);< 95124#factENTRY ~n := #in~n; 95128#L25 assume ~n <= 0;#res := 1; 95125#factFINAL assume true; 95122#factEXIT >#66#return; 95121#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 95120#factFINAL assume true; 95114#factEXIT >#72#return; 95108#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; 95101#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 95083#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 95084#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 95036#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; 94987#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 95023#factENTRY ~n := #in~n; 95156#L25 assume !(~n <= 0); 94975#L26 call #t~ret0 := fact(~n - 1);< 94985#factENTRY ~n := #in~n; 94991#L25 assume ~n <= 0;#res := 1; 94986#factFINAL assume true; 94972#factEXIT >#66#return; 94977#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 95025#factFINAL assume true; 95022#factEXIT >#68#return; 95012#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 95013#factENTRY ~n := #in~n; 95026#L25 assume !(~n <= 0); 94974#L26 call #t~ret0 := fact(~n - 1);< 94979#factENTRY ~n := #in~n; 94991#L25 assume ~n <= 0;#res := 1; 94986#factFINAL assume true; 94972#factEXIT >#66#return; 94978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 95020#factFINAL assume true; 95011#factEXIT >#70#return; 95008#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 95009#factENTRY ~n := #in~n; 95021#L25 assume ~n <= 0;#res := 1; 95019#factFINAL assume true; 95007#factEXIT >#72#return; 95004#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; 95003#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 95002#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 94995#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 94993#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; 94964#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 94967#factENTRY ~n := #in~n; 95018#L25 assume !(~n <= 0); 94976#L26 call #t~ret0 := fact(~n - 1);< 94985#factENTRY ~n := #in~n; 95047#L25 assume !(~n <= 0); 94983#L26 call #t~ret0 := fact(~n - 1);< 95043#factENTRY ~n := #in~n; 95048#L25 assume ~n <= 0;#res := 1; 95134#factFINAL assume true; 95060#factEXIT >#66#return; 94984#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 95042#factFINAL assume true; 94982#factEXIT >#66#return; 94981#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94980#factFINAL assume true; 94971#factEXIT >#74#return; 94965#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 94969#factENTRY ~n := #in~n; 95017#L25 assume !(~n <= 0); 94973#L26 call #t~ret0 := fact(~n - 1);< 94979#factENTRY ~n := #in~n; 94991#L25 assume ~n <= 0;#res := 1; 94986#factFINAL assume true; 94972#factEXIT >#66#return; 94970#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94968#factFINAL assume true; 94963#factEXIT >#76#return; 94966#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 94967#factENTRY ~n := #in~n; 95018#L25 assume !(~n <= 0); 94976#L26 call #t~ret0 := fact(~n - 1);< 94985#factENTRY ~n := #in~n; 94991#L25 assume ~n <= 0;#res := 1; 94986#factFINAL assume true; 94972#factEXIT >#66#return; 94970#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94968#factFINAL assume true; 94963#factEXIT >#78#return; 94962#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; 94933#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 94932#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 94930#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 94720#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 94709#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 94710#L42-3 [2021-11-20 06:29:13,916 INFO L793 eck$LassoCheckResult]: Loop: 94710#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 94750#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; 94682#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 94683#factENTRY ~n := #in~n; 94784#L25 assume !(~n <= 0); 94779#L26 call #t~ret0 := fact(~n - 1);< 94781#factENTRY ~n := #in~n; 94821#L25 assume !(~n <= 0); 94778#L26 call #t~ret0 := fact(~n - 1);< 94820#factENTRY ~n := #in~n; 94822#L25 assume ~n <= 0;#res := 1; 94870#factFINAL assume true; 94869#factEXIT >#66#return; 94780#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94819#factFINAL assume true; 94777#factEXIT >#66#return; 94775#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94773#factFINAL assume true; 94771#factEXIT >#68#return; 94738#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 94739#factENTRY ~n := #in~n; 95149#L25 assume ~n <= 0;#res := 1; 95146#factFINAL assume true; 95144#factEXIT >#70#return; 95099#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 94676#factENTRY ~n := #in~n; 95106#L25 assume !(~n <= 0); 95093#L26 call #t~ret0 := fact(~n - 1);< 95100#factENTRY ~n := #in~n; 95075#L25 assume !(~n <= 0); 95094#L26 call #t~ret0 := fact(~n - 1);< 95110#factENTRY ~n := #in~n; 95112#L25 assume ~n <= 0;#res := 1; 95111#factFINAL assume true; 95109#factEXIT >#66#return; 95097#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 95098#factFINAL assume true; 95092#factEXIT >#66#return; 95096#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 95142#factFINAL assume true; 95140#factEXIT >#72#return; 95141#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; 95155#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 95154#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 95153#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 95152#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; 95079#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 95151#factENTRY ~n := #in~n; 95148#L25 assume !(~n <= 0); 95062#L26 call #t~ret0 := fact(~n - 1);< 95065#factENTRY ~n := #in~n; 95075#L25 assume !(~n <= 0); 95094#L26 call #t~ret0 := fact(~n - 1);< 95110#factENTRY ~n := #in~n; 95112#L25 assume ~n <= 0;#res := 1; 95111#factFINAL assume true; 95109#factEXIT >#66#return; 95097#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 95098#factFINAL assume true; 95092#factEXIT >#66#return; 95095#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 95090#factFINAL assume true; 95088#factEXIT >#68#return; 95068#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 95076#factENTRY ~n := #in~n; 95072#L25 assume !(~n <= 0); 95063#L26 call #t~ret0 := fact(~n - 1);< 95065#factENTRY ~n := #in~n; 95071#L25 assume ~n <= 0;#res := 1; 95066#factFINAL assume true; 95061#factEXIT >#66#return; 95064#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 95086#factFINAL assume true; 95081#factEXIT >#70#return; 95058#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 95074#factENTRY ~n := #in~n; 95070#L25 assume !(~n <= 0); 95056#L26 call #t~ret0 := fact(~n - 1);< 95065#factENTRY ~n := #in~n; 95071#L25 assume ~n <= 0;#res := 1; 95066#factFINAL assume true; 95061#factEXIT >#66#return; 95057#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 95059#factFINAL assume true; 95082#factEXIT >#72#return; 95041#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; 95040#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 95039#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 95035#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 94764#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; 94760#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 94762#factENTRY ~n := #in~n; 94767#L25 assume !(~n <= 0); 94729#L26 call #t~ret0 := fact(~n - 1);< 94757#factENTRY ~n := #in~n; 94815#L25 assume !(~n <= 0); 94668#L26 call #t~ret0 := fact(~n - 1);< 94817#factENTRY ~n := #in~n; 94733#L25 assume ~n <= 0;#res := 1; 94677#factFINAL assume true; 94667#factEXIT >#66#return; 94669#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94730#factFINAL assume true; 94754#factEXIT >#66#return; 94756#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94763#factFINAL assume true; 94759#factEXIT >#68#return; 94748#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 94749#factENTRY ~n := #in~n; 94758#L25 assume !(~n <= 0); 94728#L26 call #t~ret0 := fact(~n - 1);< 94757#factENTRY ~n := #in~n; 94815#L25 assume !(~n <= 0); 94668#L26 call #t~ret0 := fact(~n - 1);< 94817#factENTRY ~n := #in~n; 94733#L25 assume ~n <= 0;#res := 1; 94677#factFINAL assume true; 94667#factEXIT >#66#return; 94669#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94730#factFINAL assume true; 94754#factEXIT >#66#return; 94753#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94752#factFINAL assume true; 94747#factEXIT >#70#return; 94673#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 94674#factENTRY ~n := #in~n; 94766#L25 assume ~n <= 0;#res := 1; 94765#factFINAL assume true; 94751#factEXIT >#72#return; 94712#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; 94713#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 94716#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 94768#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 94723#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; 94724#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 94791#factENTRY ~n := #in~n; 94816#L25 assume !(~n <= 0); 94727#L26 call #t~ret0 := fact(~n - 1);< 94757#factENTRY ~n := #in~n; 94815#L25 assume !(~n <= 0); 94668#L26 call #t~ret0 := fact(~n - 1);< 94817#factENTRY ~n := #in~n; 94733#L25 assume ~n <= 0;#res := 1; 94677#factFINAL assume true; 94667#factEXIT >#66#return; 94669#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94730#factFINAL assume true; 94754#factEXIT >#66#return; 94755#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94805#factFINAL assume true; 94795#factEXIT >#74#return; 94699#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 94796#factENTRY ~n := #in~n; 94818#L25 assume !(~n <= 0); 94698#L26 call #t~ret0 := fact(~n - 1);< 94700#factENTRY ~n := #in~n; 94815#L25 assume !(~n <= 0); 94668#L26 call #t~ret0 := fact(~n - 1);< 94817#factENTRY ~n := #in~n; 94733#L25 assume ~n <= 0;#res := 1; 94677#factFINAL assume true; 94667#factEXIT >#66#return; 94669#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94730#factFINAL assume true; 94754#factEXIT >#66#return; 94755#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94805#factFINAL assume true; 94795#factEXIT >#76#return; 94790#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 94791#factENTRY ~n := #in~n; 94816#L25 assume !(~n <= 0); 94727#L26 call #t~ret0 := fact(~n - 1);< 94757#factENTRY ~n := #in~n; 94814#L25 assume ~n <= 0;#res := 1; 94813#factFINAL assume true; 94804#factEXIT >#66#return; 94802#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94794#factFINAL assume true; 94789#factEXIT >#78#return; 94783#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; 94695#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 94826#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 94825#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 94824#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 94823#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 94710#L42-3 [2021-11-20 06:29:13,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:29:13,917 INFO L85 PathProgramCache]: Analyzing trace with hash 52177008, now seen corresponding path program 15 times [2021-11-20 06:29:13,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:29:13,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541038703] [2021-11-20 06:29:13,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:29:13,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:29:13,923 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:29:13,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [825474844] [2021-11-20 06:29:13,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 06:29:13,924 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:29:13,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:29:13,966 INFO L229 MonitoredProcess]: Starting monitored process 163 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:29:13,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (163)] Waiting until timeout for monitored process [2021-11-20 06:29:14,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2021-11-20 06:29:14,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-20 06:29:14,230 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:29:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:29:14,319 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:29:14,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:29:14,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2118586678, now seen corresponding path program 11 times [2021-11-20 06:29:14,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:29:14,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229177760] [2021-11-20 06:29:14,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:29:14,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:29:14,324 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:29:14,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [518847329] [2021-11-20 06:29:14,324 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-20 06:29:14,324 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:29:14,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:29:14,329 INFO L229 MonitoredProcess]: Starting monitored process 164 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:29:14,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (164)] Waiting until timeout for monitored process [2021-11-20 06:29:14,431 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2021-11-20 06:29:14,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:29:14,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-20 06:29:14,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:29:14,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 517 proven. 78 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2021-11-20 06:29:14,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:29:15,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 517 proven. 84 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [2021-11-20 06:29:15,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:29:15,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229177760] [2021-11-20 06:29:15,899 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:29:15,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518847329] [2021-11-20 06:29:15,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518847329] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:29:15,900 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:29:15,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 17 [2021-11-20 06:29:15,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618707518] [2021-11-20 06:29:15,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:29:15,905 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 06:29:15,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:29:15,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-20 06:29:15,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2021-11-20 06:29:15,906 INFO L87 Difference]: Start difference. First operand 523 states and 608 transitions. cyclomatic complexity: 100 Second operand has 17 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 10 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (16), 9 states have call predecessors, (16), 10 states have call successors, (16) [2021-11-20 06:29:16,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:29:16,448 INFO L93 Difference]: Finished difference Result 736 states and 923 transitions. [2021-11-20 06:29:16,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 06:29:16,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 736 states and 923 transitions. [2021-11-20 06:29:16,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 108 [2021-11-20 06:29:16,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 736 states to 724 states and 904 transitions. [2021-11-20 06:29:16,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2021-11-20 06:29:16,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2021-11-20 06:29:16,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 724 states and 904 transitions. [2021-11-20 06:29:16,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:29:16,460 INFO L681 BuchiCegarLoop]: Abstraction has 724 states and 904 transitions. [2021-11-20 06:29:16,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states and 904 transitions. [2021-11-20 06:29:16,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 551. [2021-11-20 06:29:16,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 371 states have (on average 1.0781671159029649) internal successors, (400), 372 states have internal predecessors, (400), 99 states have call successors, (102), 73 states have call predecessors, (102), 81 states have return successors, (152), 105 states have call predecessors, (152), 99 states have call successors, (152) [2021-11-20 06:29:16,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 654 transitions. [2021-11-20 06:29:16,474 INFO L704 BuchiCegarLoop]: Abstraction has 551 states and 654 transitions. [2021-11-20 06:29:16,474 INFO L587 BuchiCegarLoop]: Abstraction has 551 states and 654 transitions. [2021-11-20 06:29:16,475 INFO L425 BuchiCegarLoop]: ======== Iteration 26============ [2021-11-20 06:29:16,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 551 states and 654 transitions. [2021-11-20 06:29:16,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2021-11-20 06:29:16,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:29:16,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:29:16,479 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [32, 32, 18, 14, 14, 14, 14, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2021-11-20 06:29:16,479 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [31, 31, 19, 19, 19, 19, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:29:16,480 INFO L791 eck$LassoCheckResult]: Stem: 97118#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 97090#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 97091#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 97117#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 97102#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 97103#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97445#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; 97442#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97443#factENTRY ~n := #in~n; 97446#L25 assume ~n <= 0;#res := 1; 97444#factFINAL assume true; 97441#factEXIT >#68#return; 97438#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97439#factENTRY ~n := #in~n; 97448#L25 assume ~n <= 0;#res := 1; 97447#factFINAL assume true; 97437#factEXIT >#70#return; 97434#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 97435#factENTRY ~n := #in~n; 97440#L25 assume ~n <= 0;#res := 1; 97436#factFINAL assume true; 97433#factEXIT >#72#return; 97432#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; 97431#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 97430#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 97429#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97428#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; 97062#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97063#factENTRY ~n := #in~n; 97510#L25 assume !(~n <= 0); 97508#L26 call #t~ret0 := fact(~n - 1);< 97509#factENTRY ~n := #in~n; 97512#L25 assume ~n <= 0;#res := 1; 97511#factFINAL assume true; 97507#factEXIT >#66#return; 97505#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97502#factFINAL assume true; 97501#factEXIT >#74#return; 97455#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97459#factENTRY ~n := #in~n; 97460#L25 assume ~n <= 0;#res := 1; 97454#factFINAL assume true; 97456#factEXIT >#76#return; 97296#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 97504#factENTRY ~n := #in~n; 97494#L25 assume !(~n <= 0); 97495#L26 call #t~ret0 := fact(~n - 1);< 97514#factENTRY ~n := #in~n; 97516#L25 assume ~n <= 0;#res := 1; 97515#factFINAL assume true; 97513#factEXIT >#66#return; 97506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97503#factFINAL assume true; 97295#factEXIT >#78#return; 97279#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; 97278#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 97277#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 97276#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97268#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; 97262#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97265#factENTRY ~n := #in~n; 97275#L25 assume !(~n <= 0); 97272#L26 call #t~ret0 := fact(~n - 1);< 97274#factENTRY ~n := #in~n; 97482#L25 assume !(~n <= 0); 97271#L26 call #t~ret0 := fact(~n - 1);< 97481#factENTRY ~n := #in~n; 97487#L25 assume ~n <= 0;#res := 1; 97486#factFINAL assume true; 97485#factEXIT >#66#return; 97273#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97480#factFINAL assume true; 97270#factEXIT >#66#return; 97267#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97266#factFINAL assume true; 97261#factEXIT >#74#return; 97264#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97281#factENTRY ~n := #in~n; 97283#L25 assume ~n <= 0;#res := 1; 97282#factFINAL assume true; 97280#factEXIT >#76#return; 97263#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 97265#factENTRY ~n := #in~n; 97275#L25 assume !(~n <= 0); 97272#L26 call #t~ret0 := fact(~n - 1);< 97274#factENTRY ~n := #in~n; 97482#L25 assume !(~n <= 0); 97271#L26 call #t~ret0 := fact(~n - 1);< 97481#factENTRY ~n := #in~n; 97487#L25 assume ~n <= 0;#res := 1; 97486#factFINAL assume true; 97485#factEXIT >#66#return; 97273#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97480#factFINAL assume true; 97270#factEXIT >#66#return; 97267#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97266#factFINAL assume true; 97261#factEXIT >#78#return; 97092#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; 97093#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 97100#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 97258#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 97114#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 97115#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 97126#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97127#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; 97395#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97398#factENTRY ~n := #in~n; 97405#L25 assume !(~n <= 0); 97403#L26 call #t~ret0 := fact(~n - 1);< 97404#factENTRY ~n := #in~n; 97407#L25 assume ~n <= 0;#res := 1; 97406#factFINAL assume true; 97402#factEXIT >#66#return; 97401#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97400#factFINAL assume true; 97394#factEXIT >#68#return; 97392#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97393#factENTRY ~n := #in~n; 97399#L25 assume ~n <= 0;#res := 1; 97382#factFINAL assume true; 97390#factEXIT >#70#return; 97366#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 97369#factENTRY ~n := #in~n; 97379#L25 assume !(~n <= 0); 97373#L26 call #t~ret0 := fact(~n - 1);< 97376#factENTRY ~n := #in~n; 97380#L25 assume ~n <= 0;#res := 1; 97377#factFINAL assume true; 97372#factEXIT >#66#return; 97371#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97370#factFINAL assume true; 97365#factEXIT >#72#return; 97351#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; 97350#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 97345#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 97344#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97340#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; 97311#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97334#factENTRY ~n := #in~n; 97337#L25 assume !(~n <= 0); 97304#L26 call #t~ret0 := fact(~n - 1);< 97313#factENTRY ~n := #in~n; 97314#L25 assume ~n <= 0;#res := 1; 97310#factFINAL assume true; 97302#factEXIT >#66#return; 97307#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97336#factFINAL assume true; 97333#factEXIT >#68#return; 97318#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97330#factENTRY ~n := #in~n; 97317#L25 assume !(~n <= 0); 97305#L26 call #t~ret0 := fact(~n - 1);< 97309#factENTRY ~n := #in~n; 97314#L25 assume ~n <= 0;#res := 1; 97310#factFINAL assume true; 97302#factEXIT >#66#return; 97308#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97332#factFINAL assume true; 97329#factEXIT >#70#return; 97326#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 97327#factENTRY ~n := #in~n; 97331#L25 assume ~n <= 0;#res := 1; 97328#factFINAL assume true; 97325#factEXIT >#72#return; 97324#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; 97323#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 97322#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 97321#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97320#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; 97293#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97294#factENTRY ~n := #in~n; 97315#L25 assume !(~n <= 0); 97303#L26 call #t~ret0 := fact(~n - 1);< 97313#factENTRY ~n := #in~n; 97499#L25 assume !(~n <= 0); 97342#L26 call #t~ret0 := fact(~n - 1);< 97498#factENTRY ~n := #in~n; 97500#L25 assume ~n <= 0;#res := 1; 97518#factFINAL assume true; 97517#factEXIT >#66#return; 97343#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97497#factFINAL assume true; 97341#factEXIT >#66#return; 97339#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97338#factFINAL assume true; 97319#factEXIT >#74#return; 97292#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97300#factENTRY ~n := #in~n; 97316#L25 assume !(~n <= 0); 97306#L26 call #t~ret0 := fact(~n - 1);< 97309#factENTRY ~n := #in~n; 97314#L25 assume ~n <= 0;#res := 1; 97310#factFINAL assume true; 97302#factEXIT >#66#return; 97301#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97299#factFINAL assume true; 97290#factEXIT >#76#return; 97291#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 97294#factENTRY ~n := #in~n; 97315#L25 assume !(~n <= 0); 97303#L26 call #t~ret0 := fact(~n - 1);< 97313#factENTRY ~n := #in~n; 97314#L25 assume ~n <= 0;#res := 1; 97310#factFINAL assume true; 97302#factEXIT >#66#return; 97301#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97299#factFINAL assume true; 97290#factEXIT >#78#return; 97284#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; 97248#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 97244#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 97236#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 97116#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 97104#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 97106#L42-3 [2021-11-20 06:29:16,480 INFO L793 eck$LassoCheckResult]: Loop: 97106#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97142#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; 97074#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97075#factENTRY ~n := #in~n; 97246#L25 assume !(~n <= 0); 97079#L26 call #t~ret0 := fact(~n - 1);< 97096#factENTRY ~n := #in~n; 97260#L25 assume !(~n <= 0); 97065#L26 call #t~ret0 := fact(~n - 1);< 97259#factENTRY ~n := #in~n; 97129#L25 assume ~n <= 0;#res := 1; 97130#factFINAL assume true; 97064#factEXIT >#66#return; 97066#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97078#factFINAL assume true; 97080#factEXIT >#66#return; 97249#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97247#factFINAL assume true; 97245#factEXIT >#68#return; 97069#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97088#factENTRY ~n := #in~n; 97089#L25 assume ~n <= 0;#res := 1; 97131#factFINAL assume true; 97067#factEXIT >#70#return; 97070#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 97073#factENTRY ~n := #in~n; 97595#L25 assume !(~n <= 0); 97097#L26 call #t~ret0 := fact(~n - 1);< 97099#factENTRY ~n := #in~n; 97576#L25 assume !(~n <= 0); 97582#L26 call #t~ret0 := fact(~n - 1);< 97592#factENTRY ~n := #in~n; 97594#L25 assume ~n <= 0;#res := 1; 97593#factFINAL assume true; 97591#factEXIT >#66#return; 97589#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97585#factFINAL assume true; 97581#factEXIT >#66#return; 97122#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97125#factFINAL assume true; 97604#factEXIT >#72#return; 97605#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; 97109#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 97110#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 97128#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97121#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; 97068#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97596#factENTRY ~n := #in~n; 97597#L25 assume !(~n <= 0); 97563#L26 call #t~ret0 := fact(~n - 1);< 97565#factENTRY ~n := #in~n; 97576#L25 assume !(~n <= 0); 97582#L26 call #t~ret0 := fact(~n - 1);< 97592#factENTRY ~n := #in~n; 97576#L25 assume !(~n <= 0); 97582#L26 call #t~ret0 := fact(~n - 1);< 97592#factENTRY ~n := #in~n; 97594#L25 assume ~n <= 0;#res := 1; 97593#factFINAL assume true; 97591#factEXIT >#66#return; 97589#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97585#factFINAL assume true; 97581#factEXIT >#66#return; 97584#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97600#factFINAL assume true; 97590#factEXIT >#66#return; 97588#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97587#factFINAL assume true; 97586#factEXIT >#68#return; 97084#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97132#factENTRY ~n := #in~n; 97570#L25 assume !(~n <= 0); 97562#L26 call #t~ret0 := fact(~n - 1);< 97565#factENTRY ~n := #in~n; 97569#L25 assume ~n <= 0;#res := 1; 97566#factFINAL assume true; 97560#factEXIT >#66#return; 97564#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97607#factFINAL assume true; 97606#factEXIT >#70#return; 97124#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 97553#factENTRY ~n := #in~n; 97568#L25 assume !(~n <= 0); 97561#L26 call #t~ret0 := fact(~n - 1);< 97565#factENTRY ~n := #in~n; 97569#L25 assume ~n <= 0;#res := 1; 97566#factFINAL assume true; 97560#factEXIT >#66#return; 97558#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97559#factFINAL assume true; 97552#factEXIT >#72#return; 97551#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; 97550#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 97549#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 97537#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97240#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; 97203#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97238#factENTRY ~n := #in~n; 97253#L25 assume !(~n <= 0); 97171#L26 call #t~ret0 := fact(~n - 1);< 97179#factENTRY ~n := #in~n; 97206#L25 assume !(~n <= 0); 97173#L26 call #t~ret0 := fact(~n - 1);< 97204#factENTRY ~n := #in~n; 97207#L25 assume ~n <= 0;#res := 1; 97215#factFINAL assume true; 97213#factEXIT >#66#return; 97212#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97202#factFINAL assume true; 97194#factEXIT >#66#return; 97176#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97243#factFINAL assume true; 97237#factEXIT >#68#return; 97144#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97145#factENTRY ~n := #in~n; 97250#L25 assume !(~n <= 0); 97174#L26 call #t~ret0 := fact(~n - 1);< 97179#factENTRY ~n := #in~n; 97206#L25 assume !(~n <= 0); 97173#L26 call #t~ret0 := fact(~n - 1);< 97204#factENTRY ~n := #in~n; 97207#L25 assume ~n <= 0;#res := 1; 97215#factFINAL assume true; 97213#factEXIT >#66#return; 97212#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97202#factFINAL assume true; 97194#factEXIT >#66#return; 97178#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97235#factFINAL assume true; 97143#factEXIT >#70#return; 97071#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 97072#factENTRY ~n := #in~n; 97087#L25 assume ~n <= 0;#res := 1; 97257#factFINAL assume true; 97256#factEXIT >#72#return; 97111#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; 97107#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 97108#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 97137#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97119#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; 97120#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97139#factENTRY ~n := #in~n; 97198#L25 assume !(~n <= 0); 97172#L26 call #t~ret0 := fact(~n - 1);< 97179#factENTRY ~n := #in~n; 97206#L25 assume !(~n <= 0); 97173#L26 call #t~ret0 := fact(~n - 1);< 97204#factENTRY ~n := #in~n; 97206#L25 assume !(~n <= 0); 97173#L26 call #t~ret0 := fact(~n - 1);< 97204#factENTRY ~n := #in~n; 97207#L25 assume ~n <= 0;#res := 1; 97215#factFINAL assume true; 97213#factEXIT >#66#return; 97212#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97202#factFINAL assume true; 97194#factEXIT >#66#return; 97177#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97255#factFINAL assume true; 97170#factEXIT >#66#return; 97169#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97155#factFINAL assume true; 97146#factEXIT >#74#return; 97133#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97134#factENTRY ~n := #in~n; 97197#L25 assume !(~n <= 0); 97175#L26 call #t~ret0 := fact(~n - 1);< 97195#factENTRY ~n := #in~n; 97206#L25 assume !(~n <= 0); 97173#L26 call #t~ret0 := fact(~n - 1);< 97204#factENTRY ~n := #in~n; 97207#L25 assume ~n <= 0;#res := 1; 97215#factFINAL assume true; 97213#factEXIT >#66#return; 97212#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97202#factFINAL assume true; 97194#factEXIT >#66#return; 97193#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97191#factFINAL assume true; 97186#factEXIT >#76#return; 97138#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 97139#factENTRY ~n := #in~n; 97198#L25 assume !(~n <= 0); 97172#L26 call #t~ret0 := fact(~n - 1);< 97179#factENTRY ~n := #in~n; 97205#L25 assume ~n <= 0;#res := 1; 97201#factFINAL assume true; 97200#factEXIT >#66#return; 97199#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97196#factFINAL assume true; 97192#factEXIT >#78#return; 97189#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; 97190#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 97242#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 97241#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 97239#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 97234#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 97106#L42-3 [2021-11-20 06:29:16,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:29:16,481 INFO L85 PathProgramCache]: Analyzing trace with hash 52177008, now seen corresponding path program 16 times [2021-11-20 06:29:16,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:29:16,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955536626] [2021-11-20 06:29:16,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:29:16,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:29:16,487 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:29:16,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1568584012] [2021-11-20 06:29:16,488 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 06:29:16,488 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:29:16,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:29:16,494 INFO L229 MonitoredProcess]: Starting monitored process 165 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:29:16,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (165)] Waiting until timeout for monitored process [2021-11-20 06:29:16,680 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 06:29:16,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-20 06:29:16,680 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:29:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:29:16,776 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:29:16,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:29:16,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1224494170, now seen corresponding path program 12 times [2021-11-20 06:29:16,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:29:16,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087089451] [2021-11-20 06:29:16,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:29:16,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:29:16,782 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:29:16,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1960487168] [2021-11-20 06:29:16,783 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-20 06:29:16,783 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:29:16,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:29:16,793 INFO L229 MonitoredProcess]: Starting monitored process 166 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:29:16,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (166)] Waiting until timeout for monitored process [2021-11-20 06:29:16,933 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2021-11-20 06:29:16,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:29:16,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-20 06:29:16,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:29:17,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2239 backedges. 1171 proven. 77 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2021-11-20 06:29:17,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:29:18,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2239 backedges. 123 proven. 627 refuted. 0 times theorem prover too weak. 1489 trivial. 0 not checked. [2021-11-20 06:29:18,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:29:18,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087089451] [2021-11-20 06:29:18,614 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:29:18,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960487168] [2021-11-20 06:29:18,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960487168] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:29:18,614 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:29:18,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 22 [2021-11-20 06:29:18,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499659346] [2021-11-20 06:29:18,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:29:18,615 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 06:29:18,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:29:18,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-20 06:29:18,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2021-11-20 06:29:18,616 INFO L87 Difference]: Start difference. First operand 551 states and 654 transitions. cyclomatic complexity: 118 Second operand has 22 states, 17 states have (on average 3.411764705882353) internal successors, (58), 20 states have internal predecessors, (58), 14 states have call successors, (28), 2 states have call predecessors, (28), 8 states have return successors, (30), 12 states have call predecessors, (30), 14 states have call successors, (30) [2021-11-20 06:29:19,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:29:19,637 INFO L93 Difference]: Finished difference Result 805 states and 1021 transitions. [2021-11-20 06:29:19,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-20 06:29:19,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 805 states and 1021 transitions. [2021-11-20 06:29:19,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 137 [2021-11-20 06:29:19,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 805 states to 791 states and 1001 transitions. [2021-11-20 06:29:19,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 173 [2021-11-20 06:29:19,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 176 [2021-11-20 06:29:19,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 791 states and 1001 transitions. [2021-11-20 06:29:19,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:29:19,648 INFO L681 BuchiCegarLoop]: Abstraction has 791 states and 1001 transitions. [2021-11-20 06:29:19,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states and 1001 transitions. [2021-11-20 06:29:19,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 610. [2021-11-20 06:29:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 412 states have (on average 1.0728155339805825) internal successors, (442), 409 states have internal predecessors, (442), 113 states have call successors, (117), 81 states have call predecessors, (117), 85 states have return successors, (181), 119 states have call predecessors, (181), 113 states have call successors, (181) [2021-11-20 06:29:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 740 transitions. [2021-11-20 06:29:19,664 INFO L704 BuchiCegarLoop]: Abstraction has 610 states and 740 transitions. [2021-11-20 06:29:19,664 INFO L587 BuchiCegarLoop]: Abstraction has 610 states and 740 transitions. [2021-11-20 06:29:19,664 INFO L425 BuchiCegarLoop]: ======== Iteration 27============ [2021-11-20 06:29:19,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 610 states and 740 transitions. [2021-11-20 06:29:19,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2021-11-20 06:29:19,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:29:19,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:29:19,668 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [32, 32, 18, 14, 14, 14, 14, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2021-11-20 06:29:19,669 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [31, 31, 19, 19, 19, 19, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:29:19,669 INFO L791 eck$LassoCheckResult]: Stem: 99707#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 99679#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 99680#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 99706#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 99728#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 100063#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 100061#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; 100057#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 100058#factENTRY ~n := #in~n; 100062#L25 assume ~n <= 0;#res := 1; 100060#factFINAL assume true; 100056#factEXIT >#68#return; 100052#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 100053#factENTRY ~n := #in~n; 100059#L25 assume ~n <= 0;#res := 1; 100055#factFINAL assume true; 100051#factEXIT >#70#return; 100048#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 100049#factENTRY ~n := #in~n; 100054#L25 assume ~n <= 0;#res := 1; 100050#factFINAL assume true; 100047#factEXIT >#72#return; 100046#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; 100044#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 100042#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 100039#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 100037#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; 100023#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 100024#factENTRY ~n := #in~n; 100035#L25 assume !(~n <= 0); 100032#L26 call #t~ret0 := fact(~n - 1);< 100033#factENTRY ~n := #in~n; 100036#L25 assume ~n <= 0;#res := 1; 100034#factFINAL assume true; 100031#factEXIT >#66#return; 100028#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100027#factFINAL assume true; 100022#factEXIT >#74#return; 99997#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 100000#factENTRY ~n := #in~n; 99999#L25 assume ~n <= 0;#res := 1; 99996#factFINAL assume true; 99998#factEXIT >#76#return; 99990#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 100026#factENTRY ~n := #in~n; 100013#L25 assume !(~n <= 0); 100014#L26 call #t~ret0 := fact(~n - 1);< 100041#factENTRY ~n := #in~n; 100045#L25 assume ~n <= 0;#res := 1; 100043#factFINAL assume true; 100040#factEXIT >#66#return; 100038#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100025#factFINAL assume true; 99989#factEXIT >#78#return; 99988#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; 99987#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 99986#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 99977#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 99974#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; 99965#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 99968#factENTRY ~n := #in~n; 99985#L25 assume !(~n <= 0); 99980#L26 call #t~ret0 := fact(~n - 1);< 99982#factENTRY ~n := #in~n; 100007#L25 assume !(~n <= 0); 99979#L26 call #t~ret0 := fact(~n - 1);< 100006#factENTRY ~n := #in~n; 100020#L25 assume ~n <= 0;#res := 1; 100019#factFINAL assume true; 100018#factEXIT >#66#return; 99981#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100005#factFINAL assume true; 99978#factEXIT >#66#return; 99976#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99973#factFINAL assume true; 99964#factEXIT >#74#return; 99967#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 99970#factENTRY ~n := #in~n; 99972#L25 assume ~n <= 0;#res := 1; 99971#factFINAL assume true; 99969#factEXIT >#76#return; 99966#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 99968#factENTRY ~n := #in~n; 99985#L25 assume !(~n <= 0); 99980#L26 call #t~ret0 := fact(~n - 1);< 99982#factENTRY ~n := #in~n; 100007#L25 assume !(~n <= 0); 99979#L26 call #t~ret0 := fact(~n - 1);< 100006#factENTRY ~n := #in~n; 100020#L25 assume ~n <= 0;#res := 1; 100019#factFINAL assume true; 100018#factEXIT >#66#return; 99981#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100005#factFINAL assume true; 99978#factEXIT >#66#return; 99976#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99973#factFINAL assume true; 99964#factEXIT >#78#return; 99963#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; 99962#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 99961#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 99939#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 99704#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 99692#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 99693#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 99713#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; 100066#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 100100#factENTRY ~n := #in~n; 100107#L25 assume !(~n <= 0); 100104#L26 call #t~ret0 := fact(~n - 1);< 100105#factENTRY ~n := #in~n; 100108#L25 assume ~n <= 0;#res := 1; 100106#factFINAL assume true; 100103#factEXIT >#66#return; 100102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100101#factFINAL assume true; 100064#factEXIT >#68#return; 99724#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 99725#factENTRY ~n := #in~n; 100077#L25 assume ~n <= 0;#res := 1; 100075#factFINAL assume true; 100076#factEXIT >#70#return; 99663#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 99664#factENTRY ~n := #in~n; 100124#L25 assume !(~n <= 0); 100116#L26 call #t~ret0 := fact(~n - 1);< 100123#factENTRY ~n := #in~n; 100129#L25 assume ~n <= 0;#res := 1; 100121#factFINAL assume true; 100115#factEXIT >#66#return; 100118#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100149#factFINAL assume true; 100148#factEXIT >#72#return; 100147#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; 100146#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 100145#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 100144#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 100143#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; 100069#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 100094#factENTRY ~n := #in~n; 100096#L25 assume !(~n <= 0); 100082#L26 call #t~ret0 := fact(~n - 1);< 100087#factENTRY ~n := #in~n; 100091#L25 assume ~n <= 0;#res := 1; 100088#factFINAL assume true; 100080#factEXIT >#66#return; 100086#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100095#factFINAL assume true; 100093#factEXIT >#68#return; 100073#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 100092#factENTRY ~n := #in~n; 100090#L25 assume !(~n <= 0); 100081#L26 call #t~ret0 := fact(~n - 1);< 100087#factENTRY ~n := #in~n; 100091#L25 assume ~n <= 0;#res := 1; 100088#factFINAL assume true; 100080#factEXIT >#66#return; 100078#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100079#factFINAL assume true; 100072#factEXIT >#70#return; 100074#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 100131#factENTRY ~n := #in~n; 100133#L25 assume ~n <= 0;#res := 1; 100132#factFINAL assume true; 100130#factEXIT >#72#return; 100128#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; 100127#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 100126#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 100120#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 100114#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; 100099#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 100112#factENTRY ~n := #in~n; 100097#L25 assume !(~n <= 0); 100084#L26 call #t~ret0 := fact(~n - 1);< 100162#factENTRY ~n := #in~n; 100195#L25 assume !(~n <= 0); 100160#L26 call #t~ret0 := fact(~n - 1);< 100194#factENTRY ~n := #in~n; 100196#L25 assume ~n <= 0;#res := 1; 100201#factFINAL assume true; 100200#factEXIT >#66#return; 100161#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100193#factFINAL assume true; 100159#factEXIT >#66#return; 100158#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100154#factFINAL assume true; 100152#factEXIT >#74#return; 100089#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 100109#factENTRY ~n := #in~n; 100110#L25 assume !(~n <= 0); 100083#L26 call #t~ret0 := fact(~n - 1);< 100087#factENTRY ~n := #in~n; 100091#L25 assume ~n <= 0;#res := 1; 100088#factFINAL assume true; 100080#factEXIT >#66#return; 100085#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100137#factFINAL assume true; 100135#factEXIT >#76#return; 100098#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 100112#factENTRY ~n := #in~n; 100097#L25 assume !(~n <= 0); 100084#L26 call #t~ret0 := fact(~n - 1);< 100162#factENTRY ~n := #in~n; 100091#L25 assume ~n <= 0;#res := 1; 100088#factFINAL assume true; 100080#factEXIT >#66#return; 100085#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100137#factFINAL assume true; 100135#factEXIT >#78#return; 100136#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; 99684#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 99691#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 99714#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 99705#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 99694#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 99696#L42-3 [2021-11-20 06:29:19,670 INFO L793 eck$LassoCheckResult]: Loop: 99696#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 99731#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; 99665#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 99666#factENTRY ~n := #in~n; 99758#L25 assume !(~n <= 0); 99754#L26 call #t~ret0 := fact(~n - 1);< 99757#factENTRY ~n := #in~n; 99927#L25 assume !(~n <= 0); 99755#L26 call #t~ret0 := fact(~n - 1);< 99926#factENTRY ~n := #in~n; 99929#L25 assume ~n <= 0;#res := 1; 99931#factFINAL assume true; 99930#factEXIT >#66#return; 99928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99925#factFINAL assume true; 99753#factEXIT >#66#return; 99748#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99749#factFINAL assume true; 99738#factEXIT >#68#return; 99739#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 99723#factENTRY ~n := #in~n; 99915#L25 assume ~n <= 0;#res := 1; 99914#factFINAL assume true; 99913#factEXIT >#70#return; 99855#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 99866#factENTRY ~n := #in~n; 99900#L25 assume !(~n <= 0); 99829#L26 call #t~ret0 := fact(~n - 1);< 99897#factENTRY ~n := #in~n; 99811#L25 assume !(~n <= 0); 99828#L26 call #t~ret0 := fact(~n - 1);< 99903#factENTRY ~n := #in~n; 99811#L25 assume !(~n <= 0); 99828#L26 call #t~ret0 := fact(~n - 1);< 99903#factENTRY ~n := #in~n; 99910#L25 assume ~n <= 0;#res := 1; 99908#factFINAL assume true; 99905#factEXIT >#66#return; 99904#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99902#factFINAL assume true; 99894#factEXIT >#66#return; 99830#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99983#factFINAL assume true; 99827#factEXIT >#66#return; 99831#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99864#factFINAL assume true; 99865#factEXIT >#72#return; 99860#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; 99886#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 99884#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 99882#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 99880#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; 99874#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 99877#factENTRY ~n := #in~n; 99911#L25 assume !(~n <= 0); 99895#L26 call #t~ret0 := fact(~n - 1);< 99896#factENTRY ~n := #in~n; 99909#L25 assume !(~n <= 0); 99906#L26 call #t~ret0 := fact(~n - 1);< 99907#factENTRY ~n := #in~n; 99910#L25 assume ~n <= 0;#res := 1; 99908#factFINAL assume true; 99905#factEXIT >#66#return; 99904#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99902#factFINAL assume true; 99894#factEXIT >#66#return; 99892#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99890#factFINAL assume true; 99873#factEXIT >#68#return; 99803#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 99818#factENTRY ~n := #in~n; 99815#L25 assume !(~n <= 0); 99795#L26 call #t~ret0 := fact(~n - 1);< 99799#factENTRY ~n := #in~n; 99809#L25 assume ~n <= 0;#res := 1; 99800#factFINAL assume true; 99794#factEXIT >#66#return; 99798#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99836#factFINAL assume true; 99835#factEXIT >#70#return; 99788#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 99810#factENTRY ~n := #in~n; 99808#L25 assume !(~n <= 0); 99796#L26 call #t~ret0 := fact(~n - 1);< 99799#factENTRY ~n := #in~n; 99809#L25 assume ~n <= 0;#res := 1; 99800#factFINAL assume true; 99794#factEXIT >#66#return; 99793#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99787#factFINAL assume true; 99790#factEXIT >#72#return; 99782#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; 99834#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 99833#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 99770#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 99771#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; 99742#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 99743#factENTRY ~n := #in~n; 99777#L25 assume !(~n <= 0); 99764#L26 call #t~ret0 := fact(~n - 1);< 99772#factENTRY ~n := #in~n; 99938#L25 assume !(~n <= 0); 99935#L26 call #t~ret0 := fact(~n - 1);< 99936#factENTRY ~n := #in~n; 99843#L25 assume ~n <= 0;#res := 1; 99937#factFINAL assume true; 99934#factEXIT >#66#return; 99933#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99932#factFINAL assume true; 99761#factEXIT >#66#return; 99766#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99750#factFINAL assume true; 99751#factEXIT >#68#return; 99733#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 99734#factENTRY ~n := #in~n; 99769#L25 assume !(~n <= 0); 99716#L26 call #t~ret0 := fact(~n - 1);< 99768#factENTRY ~n := #in~n; 99841#L25 assume !(~n <= 0); 99762#L26 call #t~ret0 := fact(~n - 1);< 99840#factENTRY ~n := #in~n; 99843#L25 assume ~n <= 0;#res := 1; 99937#factFINAL assume true; 99934#factEXIT >#66#return; 99933#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99932#factFINAL assume true; 99761#factEXIT >#66#return; 99745#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99737#factFINAL assume true; 99732#factEXIT >#70#return; 99661#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 99662#factENTRY ~n := #in~n; 99786#L25 assume ~n <= 0;#res := 1; 99785#factFINAL assume true; 99784#factEXIT >#72#return; 99701#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; 99697#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 99698#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 99868#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 99708#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; 99655#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 99849#factENTRY ~n := #in~n; 99850#L25 assume !(~n <= 0); 99717#L26 call #t~ret0 := fact(~n - 1);< 99768#factENTRY ~n := #in~n; 99841#L25 assume !(~n <= 0); 99762#L26 call #t~ret0 := fact(~n - 1);< 99840#factENTRY ~n := #in~n; 99841#L25 assume !(~n <= 0); 99762#L26 call #t~ret0 := fact(~n - 1);< 99840#factENTRY ~n := #in~n; 99843#L25 assume ~n <= 0;#res := 1; 99937#factFINAL assume true; 99934#factEXIT >#66#return; 99933#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99932#factFINAL assume true; 99761#factEXIT >#66#return; 99767#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99839#factFINAL assume true; 99837#factEXIT >#66#return; 99838#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99862#factFINAL assume true; 99863#factEXIT >#74#return; 99847#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 99852#factENTRY ~n := #in~n; 99846#L25 assume !(~n <= 0); 99763#L26 call #t~ret0 := fact(~n - 1);< 99842#factENTRY ~n := #in~n; 99841#L25 assume !(~n <= 0); 99762#L26 call #t~ret0 := fact(~n - 1);< 99840#factENTRY ~n := #in~n; 99843#L25 assume ~n <= 0;#res := 1; 99937#factFINAL assume true; 99934#factEXIT >#66#return; 99933#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99932#factFINAL assume true; 99761#factEXIT >#66#return; 99765#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99867#factFINAL assume true; 99861#factEXIT >#76#return; 99656#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 99849#factENTRY ~n := #in~n; 99850#L25 assume !(~n <= 0); 99717#L26 call #t~ret0 := fact(~n - 1);< 99768#factENTRY ~n := #in~n; 99715#L25 assume ~n <= 0;#res := 1; 99719#factFINAL assume true; 99984#factEXIT >#66#return; 99711#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99669#factFINAL assume true; 99654#factEXIT >#78#return; 99657#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; 99682#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 99690#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 99727#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 99736#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 99735#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 99696#L42-3 [2021-11-20 06:29:19,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:29:19,670 INFO L85 PathProgramCache]: Analyzing trace with hash 52177008, now seen corresponding path program 17 times [2021-11-20 06:29:19,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:29:19,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729686079] [2021-11-20 06:29:19,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:29:19,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:29:19,677 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:29:19,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1862789723] [2021-11-20 06:29:19,677 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-20 06:29:19,677 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:29:19,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:29:19,688 INFO L229 MonitoredProcess]: Starting monitored process 167 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:29:19,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (167)] Waiting until timeout for monitored process [2021-11-20 06:29:19,862 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2021-11-20 06:29:19,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-20 06:29:19,862 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:29:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:29:19,950 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:29:19,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:29:19,950 INFO L85 PathProgramCache]: Analyzing trace with hash 828132762, now seen corresponding path program 13 times [2021-11-20 06:29:19,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:29:19,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752945668] [2021-11-20 06:29:19,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:29:19,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:29:19,954 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:29:19,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [601328785] [2021-11-20 06:29:19,954 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 06:29:19,954 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:29:19,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:29:19,955 INFO L229 MonitoredProcess]: Starting monitored process 168 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:29:19,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (168)] Waiting until timeout for monitored process [2021-11-20 06:29:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:29:20,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-20 06:29:20,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:29:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2239 backedges. 1182 proven. 185 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2021-11-20 06:29:20,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:29:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2239 backedges. 70 proven. 705 refuted. 0 times theorem prover too weak. 1464 trivial. 0 not checked. [2021-11-20 06:29:21,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:29:21,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752945668] [2021-11-20 06:29:21,893 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:29:21,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601328785] [2021-11-20 06:29:21,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601328785] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:29:21,893 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:29:21,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 23 [2021-11-20 06:29:21,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766472913] [2021-11-20 06:29:21,894 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:29:21,894 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 06:29:21,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:29:21,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-20 06:29:21,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2021-11-20 06:29:21,895 INFO L87 Difference]: Start difference. First operand 610 states and 740 transitions. cyclomatic complexity: 145 Second operand has 23 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 21 states have internal predecessors, (58), 14 states have call successors, (29), 2 states have call predecessors, (29), 8 states have return successors, (31), 11 states have call predecessors, (31), 14 states have call successors, (31) [2021-11-20 06:29:22,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:29:22,943 INFO L93 Difference]: Finished difference Result 765 states and 943 transitions. [2021-11-20 06:29:22,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-20 06:29:22,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 765 states and 943 transitions. [2021-11-20 06:29:22,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 130 [2021-11-20 06:29:22,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 765 states to 765 states and 943 transitions. [2021-11-20 06:29:22,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2021-11-20 06:29:22,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2021-11-20 06:29:22,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 765 states and 943 transitions. [2021-11-20 06:29:22,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:29:22,955 INFO L681 BuchiCegarLoop]: Abstraction has 765 states and 943 transitions. [2021-11-20 06:29:22,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states and 943 transitions. [2021-11-20 06:29:22,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 626. [2021-11-20 06:29:22,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 424 states have (on average 1.070754716981132) internal successors, (454), 420 states have internal predecessors, (454), 117 states have call successors, (121), 82 states have call predecessors, (121), 85 states have return successors, (185), 123 states have call predecessors, (185), 117 states have call successors, (185) [2021-11-20 06:29:22,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 760 transitions. [2021-11-20 06:29:22,969 INFO L704 BuchiCegarLoop]: Abstraction has 626 states and 760 transitions. [2021-11-20 06:29:22,970 INFO L587 BuchiCegarLoop]: Abstraction has 626 states and 760 transitions. [2021-11-20 06:29:22,970 INFO L425 BuchiCegarLoop]: ======== Iteration 28============ [2021-11-20 06:29:22,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 626 states and 760 transitions. [2021-11-20 06:29:22,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2021-11-20 06:29:22,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:29:22,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:29:22,974 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [32, 32, 18, 14, 14, 14, 14, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2021-11-20 06:29:22,974 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [32, 32, 20, 20, 20, 20, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:29:22,975 INFO L791 eck$LassoCheckResult]: Stem: 102310#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 102284#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 102285#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 102309#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 102294#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 102295#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 102656#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; 102652#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 102653#factENTRY ~n := #in~n; 102657#L25 assume ~n <= 0;#res := 1; 102655#factFINAL assume true; 102651#factEXIT >#68#return; 102647#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 102648#factENTRY ~n := #in~n; 102654#L25 assume ~n <= 0;#res := 1; 102650#factFINAL assume true; 102646#factEXIT >#70#return; 102643#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 102644#factENTRY ~n := #in~n; 102649#L25 assume ~n <= 0;#res := 1; 102645#factFINAL assume true; 102642#factEXIT >#72#return; 102641#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; 102639#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 102636#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 102632#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 102630#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; 102625#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 102628#factENTRY ~n := #in~n; 102638#L25 assume !(~n <= 0); 102634#L26 call #t~ret0 := fact(~n - 1);< 102635#factENTRY ~n := #in~n; 102640#L25 assume ~n <= 0;#res := 1; 102637#factFINAL assume true; 102633#factEXIT >#66#return; 102631#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102629#factFINAL assume true; 102624#factEXIT >#74#return; 102626#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 102661#factENTRY ~n := #in~n; 102664#L25 assume ~n <= 0;#res := 1; 102662#factFINAL assume true; 102660#factEXIT >#76#return; 102613#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 102614#factENTRY ~n := #in~n; 102671#L25 assume !(~n <= 0); 102667#L26 call #t~ret0 := fact(~n - 1);< 102668#factENTRY ~n := #in~n; 102670#L25 assume ~n <= 0;#res := 1; 102669#factFINAL assume true; 102666#factEXIT >#66#return; 102665#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102663#factFINAL assume true; 102612#factEXIT >#78#return; 102564#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; 102561#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 102545#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 102523#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 102516#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; 102491#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 102494#factENTRY ~n := #in~n; 102518#L25 assume !(~n <= 0); 102500#L26 call #t~ret0 := fact(~n - 1);< 102502#factENTRY ~n := #in~n; 102825#L25 assume !(~n <= 0); 102499#L26 call #t~ret0 := fact(~n - 1);< 102824#factENTRY ~n := #in~n; 102830#L25 assume ~n <= 0;#res := 1; 102829#factFINAL assume true; 102828#factEXIT >#66#return; 102501#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102823#factFINAL assume true; 102498#factEXIT >#66#return; 102497#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102495#factFINAL assume true; 102490#factEXIT >#74#return; 102493#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 102522#factENTRY ~n := #in~n; 102537#L25 assume ~n <= 0;#res := 1; 102536#factFINAL assume true; 102521#factEXIT >#76#return; 102492#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 102494#factENTRY ~n := #in~n; 102518#L25 assume !(~n <= 0); 102500#L26 call #t~ret0 := fact(~n - 1);< 102502#factENTRY ~n := #in~n; 102825#L25 assume !(~n <= 0); 102499#L26 call #t~ret0 := fact(~n - 1);< 102824#factENTRY ~n := #in~n; 102830#L25 assume ~n <= 0;#res := 1; 102829#factFINAL assume true; 102828#factEXIT >#66#return; 102501#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102823#factFINAL assume true; 102498#factEXIT >#66#return; 102497#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102495#factFINAL assume true; 102490#factEXIT >#78#return; 102286#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; 102287#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 102333#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 102334#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 102306#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 102307#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 102318#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 102319#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; 102775#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 102778#factENTRY ~n := #in~n; 102787#L25 assume !(~n <= 0); 102784#L26 call #t~ret0 := fact(~n - 1);< 102785#factENTRY ~n := #in~n; 102801#L25 assume ~n <= 0;#res := 1; 102800#factFINAL assume true; 102783#factEXIT >#66#return; 102781#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102779#factFINAL assume true; 102774#factEXIT >#68#return; 102709#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 102328#factENTRY ~n := #in~n; 102716#L25 assume ~n <= 0;#res := 1; 102717#factFINAL assume true; 102708#factEXIT >#70#return; 102266#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 102267#factENTRY ~n := #in~n; 102797#L25 assume !(~n <= 0); 102789#L26 call #t~ret0 := fact(~n - 1);< 102794#factENTRY ~n := #in~n; 102796#L25 assume ~n <= 0;#res := 1; 102793#factFINAL assume true; 102788#factEXIT >#66#return; 102791#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102804#factFINAL assume true; 102803#factEXIT >#72#return; 102304#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; 102305#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 102758#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 102742#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 102739#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; 102711#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 102733#factENTRY ~n := #in~n; 102735#L25 assume !(~n <= 0); 102721#L26 call #t~ret0 := fact(~n - 1);< 102726#factENTRY ~n := #in~n; 102730#L25 assume ~n <= 0;#res := 1; 102727#factFINAL assume true; 102719#factEXIT >#66#return; 102724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102734#factFINAL assume true; 102732#factEXIT >#68#return; 102714#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 102731#factENTRY ~n := #in~n; 102729#L25 assume !(~n <= 0); 102723#L26 call #t~ret0 := fact(~n - 1);< 102726#factENTRY ~n := #in~n; 102730#L25 assume ~n <= 0;#res := 1; 102727#factFINAL assume true; 102719#factEXIT >#66#return; 102718#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102713#factFINAL assume true; 102715#factEXIT >#70#return; 102754#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 102755#factENTRY ~n := #in~n; 102757#L25 assume ~n <= 0;#res := 1; 102756#factFINAL assume true; 102753#factEXIT >#72#return; 102752#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; 102751#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 102750#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 102748#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 102744#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; 102738#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 102743#factENTRY ~n := #in~n; 102736#L25 assume !(~n <= 0); 102720#L26 call #t~ret0 := fact(~n - 1);< 102769#factENTRY ~n := #in~n; 102821#L25 assume !(~n <= 0); 102767#L26 call #t~ret0 := fact(~n - 1);< 102820#factENTRY ~n := #in~n; 102822#L25 assume ~n <= 0;#res := 1; 102827#factFINAL assume true; 102826#factEXIT >#66#return; 102768#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102819#factFINAL assume true; 102766#factEXIT >#66#return; 102765#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102761#factFINAL assume true; 102745#factEXIT >#74#return; 102728#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 102740#factENTRY ~n := #in~n; 102741#L25 assume !(~n <= 0); 102722#L26 call #t~ret0 := fact(~n - 1);< 102726#factENTRY ~n := #in~n; 102730#L25 assume ~n <= 0;#res := 1; 102727#factFINAL assume true; 102719#factEXIT >#66#return; 102725#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102749#factFINAL assume true; 102746#factEXIT >#76#return; 102737#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 102743#factENTRY ~n := #in~n; 102736#L25 assume !(~n <= 0); 102720#L26 call #t~ret0 := fact(~n - 1);< 102769#factENTRY ~n := #in~n; 102730#L25 assume ~n <= 0;#res := 1; 102727#factFINAL assume true; 102719#factEXIT >#66#return; 102725#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102749#factFINAL assume true; 102746#factEXIT >#78#return; 102747#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; 102836#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 102487#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 102421#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 102308#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 102296#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 102297#L42-3 [2021-11-20 06:29:22,975 INFO L793 eck$LassoCheckResult]: Loop: 102297#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 102339#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; 102268#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 102269#factENTRY ~n := #in~n; 102480#L25 assume !(~n <= 0); 102273#L26 call #t~ret0 := fact(~n - 1);< 102280#factENTRY ~n := #in~n; 102281#L25 assume !(~n <= 0); 102259#L26 call #t~ret0 := fact(~n - 1);< 102515#factENTRY ~n := #in~n; 102281#L25 assume !(~n <= 0); 102259#L26 call #t~ret0 := fact(~n - 1);< 102515#factENTRY ~n := #in~n; 102321#L25 assume ~n <= 0;#res := 1; 102322#factFINAL assume true; 102258#factEXIT >#66#return; 102260#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102696#factFINAL assume true; 102596#factEXIT >#66#return; 102314#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102272#factFINAL assume true; 102274#factEXIT >#66#return; 102562#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102563#factFINAL assume true; 102484#factEXIT >#68#return; 102485#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 102326#factENTRY ~n := #in~n; 102687#L25 assume ~n <= 0;#res := 1; 102685#factFINAL assume true; 102683#factEXIT >#70#return; 102540#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 102600#factENTRY ~n := #in~n; 102598#L25 assume !(~n <= 0); 102527#L26 call #t~ret0 := fact(~n - 1);< 102543#factENTRY ~n := #in~n; 102552#L25 assume !(~n <= 0); 102530#L26 call #t~ret0 := fact(~n - 1);< 102549#factENTRY ~n := #in~n; 102553#L25 assume ~n <= 0;#res := 1; 102550#factFINAL assume true; 102546#factEXIT >#66#return; 102544#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102538#factFINAL assume true; 102525#factEXIT >#66#return; 102533#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102599#factFINAL assume true; 102591#factEXIT >#72#return; 102594#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; 102695#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 102694#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 102693#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 102692#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; 102511#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 102520#factENTRY ~n := #in~n; 102557#L25 assume !(~n <= 0); 102526#L26 call #t~ret0 := fact(~n - 1);< 102554#factENTRY ~n := #in~n; 102551#L25 assume !(~n <= 0); 102547#L26 call #t~ret0 := fact(~n - 1);< 102548#factENTRY ~n := #in~n; 102553#L25 assume ~n <= 0;#res := 1; 102550#factFINAL assume true; 102546#factEXIT >#66#return; 102544#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102538#factFINAL assume true; 102525#factEXIT >#66#return; 102524#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102519#factFINAL assume true; 102503#factEXIT >#68#return; 102475#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 102479#factENTRY ~n := #in~n; 102575#L25 assume !(~n <= 0); 102528#L26 call #t~ret0 := fact(~n - 1);< 102535#factENTRY ~n := #in~n; 102573#L25 assume ~n <= 0;#res := 1; 102570#factFINAL assume true; 102568#factEXIT >#66#return; 102569#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102601#factFINAL assume true; 102470#factEXIT >#70#return; 102477#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 102574#factENTRY ~n := #in~n; 102572#L25 assume !(~n <= 0); 102531#L26 call #t~ret0 := fact(~n - 1);< 102535#factENTRY ~n := #in~n; 102573#L25 assume ~n <= 0;#res := 1; 102570#factFINAL assume true; 102568#factEXIT >#66#return; 102567#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102488#factFINAL assume true; 102489#factEXIT >#72#return; 102407#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; 102404#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 102405#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 102431#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 102426#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; 102397#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 102398#factENTRY ~n := #in~n; 102469#L25 assume !(~n <= 0); 102388#L26 call #t~ret0 := fact(~n - 1);< 102408#factENTRY ~n := #in~n; 102468#L25 assume !(~n <= 0); 102435#L26 call #t~ret0 := fact(~n - 1);< 102436#factENTRY ~n := #in~n; 102438#L25 assume ~n <= 0;#res := 1; 102439#factFINAL assume true; 102434#factEXIT >#66#return; 102433#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102391#factFINAL assume true; 102387#factEXIT >#66#return; 102389#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102406#factFINAL assume true; 102418#factEXIT >#68#return; 102342#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 102343#factENTRY ~n := #in~n; 102440#L25 assume !(~n <= 0); 102359#L26 call #t~ret0 := fact(~n - 1);< 102366#factENTRY ~n := #in~n; 102437#L25 assume !(~n <= 0); 102358#L26 call #t~ret0 := fact(~n - 1);< 102392#factENTRY ~n := #in~n; 102438#L25 assume ~n <= 0;#res := 1; 102439#factFINAL assume true; 102434#factEXIT >#66#return; 102433#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102391#factFINAL assume true; 102387#factEXIT >#66#return; 102364#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102415#factFINAL assume true; 102341#factEXIT >#70#return; 102264#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 102265#factENTRY ~n := #in~n; 102483#L25 assume ~n <= 0;#res := 1; 102482#factFINAL assume true; 102481#factEXIT >#72#return; 102303#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; 102299#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 102300#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 102340#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 102311#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; 102312#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 102336#factENTRY ~n := #in~n; 102432#L25 assume !(~n <= 0); 102362#L26 call #t~ret0 := fact(~n - 1);< 102366#factENTRY ~n := #in~n; 102437#L25 assume !(~n <= 0); 102358#L26 call #t~ret0 := fact(~n - 1);< 102392#factENTRY ~n := #in~n; 102437#L25 assume !(~n <= 0); 102358#L26 call #t~ret0 := fact(~n - 1);< 102392#factENTRY ~n := #in~n; 102438#L25 assume ~n <= 0;#res := 1; 102439#factFINAL assume true; 102434#factEXIT >#66#return; 102433#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102391#factFINAL assume true; 102387#factEXIT >#66#return; 102363#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102486#factFINAL assume true; 102357#factEXIT >#66#return; 102354#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102351#factFINAL assume true; 102344#factEXIT >#74#return; 102329#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 102330#factENTRY ~n := #in~n; 102393#L25 assume !(~n <= 0); 102360#L26 call #t~ret0 := fact(~n - 1);< 102390#factENTRY ~n := #in~n; 102437#L25 assume !(~n <= 0); 102358#L26 call #t~ret0 := fact(~n - 1);< 102392#factENTRY ~n := #in~n; 102437#L25 assume !(~n <= 0); 102358#L26 call #t~ret0 := fact(~n - 1);< 102392#factENTRY ~n := #in~n; 102438#L25 assume ~n <= 0;#res := 1; 102439#factFINAL assume true; 102434#factEXIT >#66#return; 102433#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102391#factFINAL assume true; 102387#factEXIT >#66#return; 102363#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102486#factFINAL assume true; 102357#factEXIT >#66#return; 102354#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102351#factFINAL assume true; 102344#factEXIT >#76#return; 102335#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 102336#factENTRY ~n := #in~n; 102432#L25 assume !(~n <= 0); 102362#L26 call #t~ret0 := fact(~n - 1);< 102366#factENTRY ~n := #in~n; 102449#L25 assume ~n <= 0;#res := 1; 102446#factFINAL assume true; 102444#factEXIT >#66#return; 102443#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102442#factFINAL assume true; 102441#factEXIT >#78#return; 102424#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; 102291#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 102292#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 102422#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 102420#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 102419#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 102297#L42-3 [2021-11-20 06:29:22,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:29:22,976 INFO L85 PathProgramCache]: Analyzing trace with hash 52177008, now seen corresponding path program 18 times [2021-11-20 06:29:22,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:29:22,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787882744] [2021-11-20 06:29:22,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:29:22,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:29:22,985 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:29:22,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [882662582] [2021-11-20 06:29:22,985 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-20 06:29:22,985 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:29:22,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:29:22,994 INFO L229 MonitoredProcess]: Starting monitored process 169 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:29:23,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (169)] Waiting until timeout for monitored process [2021-11-20 06:29:23,178 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2021-11-20 06:29:23,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-20 06:29:23,179 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:29:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:29:23,284 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:29:23,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:29:23,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1782552558, now seen corresponding path program 14 times [2021-11-20 06:29:23,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:29:23,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829413638] [2021-11-20 06:29:23,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:29:23,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:29:23,290 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:29:23,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [790656520] [2021-11-20 06:29:23,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:29:23,291 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:29:23,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:29:23,298 INFO L229 MonitoredProcess]: Starting monitored process 170 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:29:23,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (170)] Waiting until timeout for monitored process [2021-11-20 06:29:23,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:29:23,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:29:23,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-20 06:29:23,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:29:23,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 958 proven. 64 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2021-11-20 06:29:23,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:29:25,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 40 proven. 728 refuted. 0 times theorem prover too weak. 1633 trivial. 0 not checked. [2021-11-20 06:29:25,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:29:25,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829413638] [2021-11-20 06:29:25,103 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:29:25,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790656520] [2021-11-20 06:29:25,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790656520] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:29:25,104 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:29:25,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 19 [2021-11-20 06:29:25,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152447025] [2021-11-20 06:29:25,104 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:29:25,105 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 06:29:25,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:29:25,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 06:29:25,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-11-20 06:29:25,106 INFO L87 Difference]: Start difference. First operand 626 states and 760 transitions. cyclomatic complexity: 149 Second operand has 19 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 12 states have call successors, (25), 2 states have call predecessors, (25), 8 states have return successors, (28), 10 states have call predecessors, (28), 12 states have call successors, (28) [2021-11-20 06:29:25,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:29:25,808 INFO L93 Difference]: Finished difference Result 873 states and 1095 transitions. [2021-11-20 06:29:25,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-20 06:29:25,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 873 states and 1095 transitions. [2021-11-20 06:29:25,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 134 [2021-11-20 06:29:25,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 873 states to 868 states and 1090 transitions. [2021-11-20 06:29:25,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2021-11-20 06:29:25,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 177 [2021-11-20 06:29:25,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 868 states and 1090 transitions. [2021-11-20 06:29:25,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:29:25,818 INFO L681 BuchiCegarLoop]: Abstraction has 868 states and 1090 transitions. [2021-11-20 06:29:25,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states and 1090 transitions. [2021-11-20 06:29:25,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 688. [2021-11-20 06:29:25,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 460 states have (on average 1.065217391304348) internal successors, (490), 456 states have internal predecessors, (490), 135 states have call successors, (139), 92 states have call predecessors, (139), 93 states have return successors, (228), 139 states have call predecessors, (228), 135 states have call successors, (228) [2021-11-20 06:29:25,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 857 transitions. [2021-11-20 06:29:25,835 INFO L704 BuchiCegarLoop]: Abstraction has 688 states and 857 transitions. [2021-11-20 06:29:25,835 INFO L587 BuchiCegarLoop]: Abstraction has 688 states and 857 transitions. [2021-11-20 06:29:25,835 INFO L425 BuchiCegarLoop]: ======== Iteration 29============ [2021-11-20 06:29:25,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 688 states and 857 transitions. [2021-11-20 06:29:25,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2021-11-20 06:29:25,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:29:25,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:29:25,840 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [32, 32, 18, 14, 14, 14, 14, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2021-11-20 06:29:25,840 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [33, 33, 21, 21, 21, 21, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:29:25,841 INFO L791 eck$LassoCheckResult]: Stem: 105059#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 105037#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 105038#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 105058#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 105085#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 105475#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 105473#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; 105021#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 105022#factENTRY ~n := #in~n; 105472#L25 assume ~n <= 0;#res := 1; 105471#factFINAL assume true; 105368#factEXIT >#68#return; 105077#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 105078#factENTRY ~n := #in~n; 105377#L25 assume ~n <= 0;#res := 1; 105378#factFINAL assume true; 105369#factEXIT >#70#return; 105017#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 105018#factENTRY ~n := #in~n; 105470#L25 assume ~n <= 0;#res := 1; 105469#factFINAL assume true; 105468#factEXIT >#72#return; 105467#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; 105054#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 105055#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 105582#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 105572#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; 105567#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 105568#factENTRY ~n := #in~n; 105579#L25 assume !(~n <= 0); 105577#L26 call #t~ret0 := fact(~n - 1);< 105578#factENTRY ~n := #in~n; 105581#L25 assume ~n <= 0;#res := 1; 105580#factFINAL assume true; 105576#factEXIT >#66#return; 105575#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105571#factFINAL assume true; 105566#factEXIT >#74#return; 105559#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 105574#factENTRY ~n := #in~n; 105561#L25 assume ~n <= 0;#res := 1; 105558#factFINAL assume true; 105560#factEXIT >#76#return; 105547#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 105570#factENTRY ~n := #in~n; 105587#L25 assume !(~n <= 0); 105584#L26 call #t~ret0 := fact(~n - 1);< 105585#factENTRY ~n := #in~n; 105589#L25 assume ~n <= 0;#res := 1; 105588#factFINAL assume true; 105583#factEXIT >#66#return; 105573#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105569#factFINAL assume true; 105546#factEXIT >#78#return; 105545#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; 105544#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 105543#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 105531#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 105512#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; 105505#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 105511#factENTRY ~n := #in~n; 105530#L25 assume !(~n <= 0); 105522#L26 call #t~ret0 := fact(~n - 1);< 105527#factENTRY ~n := #in~n; 105534#L25 assume !(~n <= 0); 105524#L26 call #t~ret0 := fact(~n - 1);< 105537#factENTRY ~n := #in~n; 105540#L25 assume ~n <= 0;#res := 1; 105538#factFINAL assume true; 105535#factEXIT >#66#return; 105536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105542#factFINAL assume true; 105521#factEXIT >#66#return; 105526#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105509#factFINAL assume true; 105510#factEXIT >#74#return; 105515#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 105516#factENTRY ~n := #in~n; 105518#L25 assume ~n <= 0;#res := 1; 105517#factFINAL assume true; 105514#factEXIT >#76#return; 105504#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 105511#factENTRY ~n := #in~n; 105530#L25 assume !(~n <= 0); 105522#L26 call #t~ret0 := fact(~n - 1);< 105527#factENTRY ~n := #in~n; 105534#L25 assume !(~n <= 0); 105524#L26 call #t~ret0 := fact(~n - 1);< 105537#factENTRY ~n := #in~n; 105540#L25 assume ~n <= 0;#res := 1; 105538#factFINAL assume true; 105535#factEXIT >#66#return; 105536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105542#factFINAL assume true; 105521#factEXIT >#66#return; 105526#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105509#factFINAL assume true; 105510#factEXIT >#78#return; 105039#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; 105040#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 105043#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 105502#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 105497#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 105492#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 105487#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 105477#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; 105450#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 105452#factENTRY ~n := #in~n; 105459#L25 assume !(~n <= 0); 105456#L26 call #t~ret0 := fact(~n - 1);< 105457#factENTRY ~n := #in~n; 105460#L25 assume ~n <= 0;#res := 1; 105458#factFINAL assume true; 105455#factEXIT >#66#return; 105454#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105453#factFINAL assume true; 105449#factEXIT >#68#return; 105372#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 105445#factENTRY ~n := #in~n; 105446#L25 assume ~n <= 0;#res := 1; 105370#factFINAL assume true; 105376#factEXIT >#70#return; 105428#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 105430#factENTRY ~n := #in~n; 105440#L25 assume !(~n <= 0); 105434#L26 call #t~ret0 := fact(~n - 1);< 105437#factENTRY ~n := #in~n; 105441#L25 assume ~n <= 0;#res := 1; 105438#factFINAL assume true; 105433#factEXIT >#66#return; 105432#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105431#factFINAL assume true; 105426#factEXIT >#72#return; 105429#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; 105481#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 105480#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 105479#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 105478#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; 105373#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 105396#factENTRY ~n := #in~n; 105399#L25 assume !(~n <= 0); 105383#L26 call #t~ret0 := fact(~n - 1);< 105389#factENTRY ~n := #in~n; 105393#L25 assume ~n <= 0;#res := 1; 105390#factFINAL assume true; 105382#factEXIT >#66#return; 105387#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105398#factFINAL assume true; 105395#factEXIT >#68#return; 105380#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 105394#factENTRY ~n := #in~n; 105392#L25 assume !(~n <= 0); 105386#L26 call #t~ret0 := fact(~n - 1);< 105389#factENTRY ~n := #in~n; 105393#L25 assume ~n <= 0;#res := 1; 105390#factFINAL assume true; 105382#factEXIT >#66#return; 105379#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105381#factFINAL assume true; 105418#factEXIT >#70#return; 105415#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 105416#factENTRY ~n := #in~n; 105419#L25 assume ~n <= 0;#res := 1; 105417#factFINAL assume true; 105414#factEXIT >#72#return; 105413#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; 105412#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 105411#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 105410#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 105409#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; 105402#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 105408#factENTRY ~n := #in~n; 105401#L25 assume !(~n <= 0); 105385#L26 call #t~ret0 := fact(~n - 1);< 105466#factENTRY ~n := #in~n; 105495#L25 assume !(~n <= 0); 105464#L26 call #t~ret0 := fact(~n - 1);< 105494#factENTRY ~n := #in~n; 105496#L25 assume ~n <= 0;#res := 1; 105501#factFINAL assume true; 105500#factEXIT >#66#return; 105465#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105493#factFINAL assume true; 105463#factEXIT >#66#return; 105462#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105444#factFINAL assume true; 105425#factEXIT >#74#return; 105391#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 105405#factENTRY ~n := #in~n; 105406#L25 assume !(~n <= 0); 105384#L26 call #t~ret0 := fact(~n - 1);< 105389#factENTRY ~n := #in~n; 105393#L25 assume ~n <= 0;#res := 1; 105390#factFINAL assume true; 105382#factEXIT >#66#return; 105388#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105422#factFINAL assume true; 105420#factEXIT >#76#return; 105403#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 105408#factENTRY ~n := #in~n; 105401#L25 assume !(~n <= 0); 105385#L26 call #t~ret0 := fact(~n - 1);< 105466#factENTRY ~n := #in~n; 105393#L25 assume ~n <= 0;#res := 1; 105390#factFINAL assume true; 105382#factEXIT >#66#return; 105388#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105422#factFINAL assume true; 105420#factEXIT >#78#return; 105421#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; 105042#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 105044#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 105084#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 105057#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 105047#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 105046#L42-3 [2021-11-20 06:29:25,841 INFO L793 eck$LassoCheckResult]: Loop: 105046#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 105073#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; 105019#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 105020#factENTRY ~n := #in~n; 105285#L25 assume !(~n <= 0); 105033#L26 call #t~ret0 := fact(~n - 1);< 105032#factENTRY ~n := #in~n; 105034#L25 assume !(~n <= 0); 105288#L26 call #t~ret0 := fact(~n - 1);< 105304#factENTRY ~n := #in~n; 105034#L25 assume !(~n <= 0); 105288#L26 call #t~ret0 := fact(~n - 1);< 105304#factENTRY ~n := #in~n; 105307#L25 assume ~n <= 0;#res := 1; 105308#factFINAL assume true; 105306#factEXIT >#66#return; 105305#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105303#factFINAL assume true; 105302#factEXIT >#66#return; 105289#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105321#factFINAL assume true; 105287#factEXIT >#66#return; 105286#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105282#factFINAL assume true; 105277#factEXIT >#68#return; 105075#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 105076#factENTRY ~n := #in~n; 105279#L25 assume ~n <= 0;#res := 1; 105276#factFINAL assume true; 105273#factEXIT >#70#return; 105271#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 105301#factENTRY ~n := #in~n; 105312#L25 assume !(~n <= 0); 105232#L26 call #t~ret0 := fact(~n - 1);< 105311#factENTRY ~n := #in~n; 105310#L25 assume !(~n <= 0); 105233#L26 call #t~ret0 := fact(~n - 1);< 105259#factENTRY ~n := #in~n; 105212#L25 assume !(~n <= 0); 105235#L26 call #t~ret0 := fact(~n - 1);< 105266#factENTRY ~n := #in~n; 105269#L25 assume ~n <= 0;#res := 1; 105267#factFINAL assume true; 105263#factEXIT >#66#return; 105261#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105258#factFINAL assume true; 105254#factEXIT >#66#return; 105237#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105365#factFINAL assume true; 105231#factEXIT >#66#return; 105236#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105309#factFINAL assume true; 105297#factEXIT >#72#return; 105295#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; 105293#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 105292#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 105291#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 105290#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; 105215#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 105284#factENTRY ~n := #in~n; 105281#L25 assume !(~n <= 0); 105202#L26 call #t~ret0 := fact(~n - 1);< 105204#factENTRY ~n := #in~n; 105212#L25 assume !(~n <= 0); 105235#L26 call #t~ret0 := fact(~n - 1);< 105266#factENTRY ~n := #in~n; 105269#L25 assume ~n <= 0;#res := 1; 105267#factFINAL assume true; 105263#factEXIT >#66#return; 105261#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105258#factFINAL assume true; 105254#factEXIT >#66#return; 105250#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105243#factFINAL assume true; 105217#factEXIT >#68#return; 105179#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 105185#factENTRY ~n := #in~n; 105209#L25 assume !(~n <= 0); 105200#L26 call #t~ret0 := fact(~n - 1);< 105204#factENTRY ~n := #in~n; 105208#L25 assume ~n <= 0;#res := 1; 105205#factFINAL assume true; 105199#factEXIT >#66#return; 105203#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105226#factFINAL assume true; 105216#factEXIT >#70#return; 105193#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 105176#factENTRY ~n := #in~n; 105207#L25 assume !(~n <= 0); 105201#L26 call #t~ret0 := fact(~n - 1);< 105204#factENTRY ~n := #in~n; 105208#L25 assume ~n <= 0;#res := 1; 105205#factFINAL assume true; 105199#factEXIT >#66#return; 105198#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105192#factFINAL assume true; 105194#factEXIT >#72#return; 105157#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; 105156#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 105155#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 105154#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 105151#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; 105144#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 105148#factENTRY ~n := #in~n; 105146#L25 assume !(~n <= 0); 105122#L26 call #t~ret0 := fact(~n - 1);< 105143#factENTRY ~n := #in~n; 105141#L25 assume !(~n <= 0); 105139#L26 call #t~ret0 := fact(~n - 1);< 105140#factENTRY ~n := #in~n; 105152#L25 assume ~n <= 0;#res := 1; 105153#factFINAL assume true; 105138#factEXIT >#66#return; 105135#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105128#factFINAL assume true; 105120#factEXIT >#66#return; 105124#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105188#factFINAL assume true; 105186#factEXIT >#68#return; 105089#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 105090#factENTRY ~n := #in~n; 105167#L25 assume !(~n <= 0); 105024#L26 call #t~ret0 := fact(~n - 1);< 105130#factENTRY ~n := #in~n; 105137#L25 assume !(~n <= 0); 105121#L26 call #t~ret0 := fact(~n - 1);< 105131#factENTRY ~n := #in~n; 105152#L25 assume ~n <= 0;#res := 1; 105153#factFINAL assume true; 105138#factEXIT >#66#return; 105135#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105128#factFINAL assume true; 105120#factEXIT >#66#return; 105102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105098#factFINAL assume true; 105088#factEXIT >#70#return; 105015#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 105016#factENTRY ~n := #in~n; 105097#L25 assume ~n <= 0;#res := 1; 105096#factFINAL assume true; 105095#factEXIT >#72#return; 105049#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; 105050#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 105053#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 105319#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 105060#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; 105004#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 105005#factENTRY ~n := #in~n; 105169#L25 assume !(~n <= 0); 105025#L26 call #t~ret0 := fact(~n - 1);< 105130#factENTRY ~n := #in~n; 105137#L25 assume !(~n <= 0); 105121#L26 call #t~ret0 := fact(~n - 1);< 105131#factENTRY ~n := #in~n; 105137#L25 assume !(~n <= 0); 105121#L26 call #t~ret0 := fact(~n - 1);< 105131#factENTRY ~n := #in~n; 105152#L25 assume ~n <= 0;#res := 1; 105153#factFINAL assume true; 105138#factEXIT >#66#return; 105135#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105128#factFINAL assume true; 105120#factEXIT >#66#return; 105125#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105318#factFINAL assume true; 105163#factEXIT >#66#return; 105164#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105099#factFINAL assume true; 105101#factEXIT >#74#return; 105100#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 105104#factENTRY ~n := #in~n; 105132#L25 assume !(~n <= 0); 105123#L26 call #t~ret0 := fact(~n - 1);< 105126#factENTRY ~n := #in~n; 105137#L25 assume !(~n <= 0); 105121#L26 call #t~ret0 := fact(~n - 1);< 105131#factENTRY ~n := #in~n; 105137#L25 assume !(~n <= 0); 105121#L26 call #t~ret0 := fact(~n - 1);< 105131#factENTRY ~n := #in~n; 105152#L25 assume ~n <= 0;#res := 1; 105153#factFINAL assume true; 105138#factEXIT >#66#return; 105135#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105128#factFINAL assume true; 105120#factEXIT >#66#return; 105125#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105318#factFINAL assume true; 105163#factEXIT >#66#return; 105164#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105099#factFINAL assume true; 105101#factEXIT >#76#return; 105009#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 105005#factENTRY ~n := #in~n; 105169#L25 assume !(~n <= 0); 105025#L26 call #t~ret0 := fact(~n - 1);< 105130#factENTRY ~n := #in~n; 105071#L25 assume ~n <= 0;#res := 1; 105023#factFINAL assume true; 105027#factEXIT >#66#return; 105063#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105064#factFINAL assume true; 105008#factEXIT >#78#return; 105010#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; 105334#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 105082#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 105083#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 105056#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 105045#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 105046#L42-3 [2021-11-20 06:29:25,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:29:25,842 INFO L85 PathProgramCache]: Analyzing trace with hash 52177008, now seen corresponding path program 19 times [2021-11-20 06:29:25,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:29:25,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498716057] [2021-11-20 06:29:25,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:29:25,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:29:25,848 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:29:25,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [789027653] [2021-11-20 06:29:25,848 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 06:29:25,848 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:29:25,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:29:25,860 INFO L229 MonitoredProcess]: Starting monitored process 171 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:29:25,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (171)] Waiting until timeout for monitored process [2021-11-20 06:29:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:29:26,034 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:29:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:29:26,125 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:29:26,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:29:26,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1084276634, now seen corresponding path program 15 times [2021-11-20 06:29:26,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:29:26,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12706260] [2021-11-20 06:29:26,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:29:26,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:29:26,138 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:29:26,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1391349942] [2021-11-20 06:29:26,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 06:29:26,138 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:29:26,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:29:26,140 INFO L229 MonitoredProcess]: Starting monitored process 172 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:29:26,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (172)] Waiting until timeout for monitored process [2021-11-20 06:29:26,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2021-11-20 06:29:26,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:29:26,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-20 06:29:26,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:29:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2569 backedges. 818 proven. 152 refuted. 0 times theorem prover too weak. 1599 trivial. 0 not checked. [2021-11-20 06:29:26,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:29:27,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2569 backedges. 530 proven. 206 refuted. 0 times theorem prover too weak. 1833 trivial. 0 not checked. [2021-11-20 06:29:27,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:29:27,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12706260] [2021-11-20 06:29:27,794 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:29:27,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391349942] [2021-11-20 06:29:27,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391349942] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:29:27,794 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:29:27,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 20 [2021-11-20 06:29:27,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31854382] [2021-11-20 06:29:27,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:29:27,795 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 06:29:27,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:29:27,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-20 06:29:27,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2021-11-20 06:29:27,796 INFO L87 Difference]: Start difference. First operand 688 states and 857 transitions. cyclomatic complexity: 184 Second operand has 20 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 20 states have internal predecessors, (57), 13 states have call successors, (20), 2 states have call predecessors, (20), 8 states have return successors, (22), 9 states have call predecessors, (22), 13 states have call successors, (22) [2021-11-20 06:29:28,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:29:28,814 INFO L93 Difference]: Finished difference Result 884 states and 1160 transitions. [2021-11-20 06:29:28,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-20 06:29:28,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 884 states and 1160 transitions. [2021-11-20 06:29:28,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 204 [2021-11-20 06:29:28,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 884 states to 877 states and 1150 transitions. [2021-11-20 06:29:28,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 194 [2021-11-20 06:29:28,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 200 [2021-11-20 06:29:28,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 877 states and 1150 transitions. [2021-11-20 06:29:28,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:29:28,829 INFO L681 BuchiCegarLoop]: Abstraction has 877 states and 1150 transitions. [2021-11-20 06:29:28,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states and 1150 transitions. [2021-11-20 06:29:28,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 757. [2021-11-20 06:29:28,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 501 states have (on average 1.0638722554890219) internal successors, (533), 496 states have internal predecessors, (533), 161 states have call successors, (166), 98 states have call predecessors, (166), 95 states have return successors, (276), 162 states have call predecessors, (276), 161 states have call successors, (276) [2021-11-20 06:29:28,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 975 transitions. [2021-11-20 06:29:28,848 INFO L704 BuchiCegarLoop]: Abstraction has 757 states and 975 transitions. [2021-11-20 06:29:28,848 INFO L587 BuchiCegarLoop]: Abstraction has 757 states and 975 transitions. [2021-11-20 06:29:28,848 INFO L425 BuchiCegarLoop]: ======== Iteration 30============ [2021-11-20 06:29:28,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 757 states and 975 transitions. [2021-11-20 06:29:28,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 158 [2021-11-20 06:29:28,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:29:28,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:29:28,853 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [32, 32, 18, 14, 14, 14, 14, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2021-11-20 06:29:28,853 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [34, 34, 22, 22, 22, 22, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:29:28,854 INFO L791 eck$LassoCheckResult]: Stem: 107935#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 107907#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 107908#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 107934#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 107920#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 107921#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 108496#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; 107891#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 107892#factENTRY ~n := #in~n; 108448#L25 assume ~n <= 0;#res := 1; 108442#factFINAL assume true; 108438#factEXIT >#68#return; 107953#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 107954#factENTRY ~n := #in~n; 108464#L25 assume ~n <= 0;#res := 1; 108462#factFINAL assume true; 108459#factEXIT >#70#return; 107887#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 107888#factENTRY ~n := #in~n; 108573#L25 assume ~n <= 0;#res := 1; 108572#factFINAL assume true; 108501#factEXIT >#72#return; 107927#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; 107928#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 107930#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 107959#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 107938#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; 107939#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 108576#factENTRY ~n := #in~n; 108594#L25 assume !(~n <= 0); 108591#L26 call #t~ret0 := fact(~n - 1);< 108592#factENTRY ~n := #in~n; 108595#L25 assume ~n <= 0;#res := 1; 108593#factFINAL assume true; 108590#factEXIT >#66#return; 108581#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108579#factFINAL assume true; 108574#factEXIT >#74#return; 108561#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 108580#factENTRY ~n := #in~n; 108586#L25 assume ~n <= 0;#res := 1; 108560#factFINAL assume true; 108562#factEXIT >#76#return; 108068#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 108578#factENTRY ~n := #in~n; 108587#L25 assume !(~n <= 0); 108584#L26 call #t~ret0 := fact(~n - 1);< 108585#factENTRY ~n := #in~n; 108589#L25 assume ~n <= 0;#res := 1; 108588#factFINAL assume true; 108583#factEXIT >#66#return; 108582#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108577#factFINAL assume true; 108067#factEXIT >#78#return; 108066#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; 108065#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 108064#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 108063#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 108062#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; 108019#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 108061#factENTRY ~n := #in~n; 108515#L25 assume !(~n <= 0); 108079#L26 call #t~ret0 := fact(~n - 1);< 108505#factENTRY ~n := #in~n; 108511#L25 assume !(~n <= 0); 108080#L26 call #t~ret0 := fact(~n - 1);< 108509#factENTRY ~n := #in~n; 108512#L25 assume ~n <= 0;#res := 1; 108510#factFINAL assume true; 108508#factEXIT >#66#return; 108507#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108504#factFINAL assume true; 108078#factEXIT >#66#return; 108075#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108060#factFINAL assume true; 108017#factEXIT >#74#return; 108020#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 108072#factENTRY ~n := #in~n; 108074#L25 assume ~n <= 0;#res := 1; 108073#factFINAL assume true; 108070#factEXIT >#76#return; 108018#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 108061#factENTRY ~n := #in~n; 108515#L25 assume !(~n <= 0); 108079#L26 call #t~ret0 := fact(~n - 1);< 108505#factENTRY ~n := #in~n; 108511#L25 assume !(~n <= 0); 108080#L26 call #t~ret0 := fact(~n - 1);< 108509#factENTRY ~n := #in~n; 108512#L25 assume ~n <= 0;#res := 1; 108510#factFINAL assume true; 108508#factEXIT >#66#return; 108507#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108504#factFINAL assume true; 108078#factEXIT >#66#return; 108075#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108060#factFINAL assume true; 108017#factEXIT >#78#return; 108016#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; 108015#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 108013#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 108007#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 107931#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 107932#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 108135#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 108133#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; 108122#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 108124#factENTRY ~n := #in~n; 108132#L25 assume !(~n <= 0); 108130#L26 call #t~ret0 := fact(~n - 1);< 108131#factENTRY ~n := #in~n; 108136#L25 assume ~n <= 0;#res := 1; 108134#factFINAL assume true; 108129#factEXIT >#66#return; 108128#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108126#factFINAL assume true; 108121#factEXIT >#68#return; 108115#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 108117#factENTRY ~n := #in~n; 108118#L25 assume ~n <= 0;#res := 1; 108107#factFINAL assume true; 108114#factEXIT >#70#return; 108090#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 108093#factENTRY ~n := #in~n; 108104#L25 assume !(~n <= 0); 108097#L26 call #t~ret0 := fact(~n - 1);< 108100#factENTRY ~n := #in~n; 108105#L25 assume ~n <= 0;#res := 1; 108101#factFINAL assume true; 108096#factEXIT >#66#return; 108095#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108094#factFINAL assume true; 108089#factEXIT >#72#return; 108092#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; 108137#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 108076#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 108077#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 108054#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; 108033#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 108035#factENTRY ~n := #in~n; 108055#L25 assume !(~n <= 0); 108027#L26 call #t~ret0 := fact(~n - 1);< 108030#factENTRY ~n := #in~n; 108039#L25 assume ~n <= 0;#res := 1; 108037#factFINAL assume true; 108023#factEXIT >#66#return; 108029#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108038#factFINAL assume true; 108032#factEXIT >#68#return; 108011#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 108012#factENTRY ~n := #in~n; 108056#L25 assume !(~n <= 0); 108024#L26 call #t~ret0 := fact(~n - 1);< 108030#factENTRY ~n := #in~n; 108039#L25 assume ~n <= 0;#res := 1; 108037#factFINAL assume true; 108023#factEXIT >#66#return; 108028#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108031#factFINAL assume true; 108010#factEXIT >#70#return; 108005#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 108006#factENTRY ~n := #in~n; 108014#L25 assume ~n <= 0;#res := 1; 108008#factFINAL assume true; 108004#factEXIT >#72#return; 108002#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; 107998#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 107996#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 107994#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 107992#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; 107969#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 107973#factENTRY ~n := #in~n; 108057#L25 assume !(~n <= 0); 108026#L26 call #t~ret0 := fact(~n - 1);< 108050#factENTRY ~n := #in~n; 108536#L25 assume !(~n <= 0); 108048#L26 call #t~ret0 := fact(~n - 1);< 108535#factENTRY ~n := #in~n; 108537#L25 assume ~n <= 0;#res := 1; 108610#factFINAL assume true; 108609#factEXIT >#66#return; 108049#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108534#factFINAL assume true; 108047#factEXIT >#66#return; 108044#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108043#factFINAL assume true; 107990#factEXIT >#74#return; 107971#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 107988#factENTRY ~n := #in~n; 108053#L25 assume !(~n <= 0); 108025#L26 call #t~ret0 := fact(~n - 1);< 108030#factENTRY ~n := #in~n; 108039#L25 assume ~n <= 0;#res := 1; 108037#factFINAL assume true; 108023#factEXIT >#66#return; 108009#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108003#factFINAL assume true; 107968#factEXIT >#76#return; 107970#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 107973#factENTRY ~n := #in~n; 108057#L25 assume !(~n <= 0); 108026#L26 call #t~ret0 := fact(~n - 1);< 108050#factENTRY ~n := #in~n; 108039#L25 assume ~n <= 0;#res := 1; 108037#factFINAL assume true; 108023#factEXIT >#66#return; 108009#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108003#factFINAL assume true; 107968#factEXIT >#78#return; 107972#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; 107966#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 107965#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 107964#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 107933#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 107922#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 107923#L42-3 [2021-11-20 06:29:28,854 INFO L793 eck$LassoCheckResult]: Loop: 107923#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 107963#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; 107889#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 107890#factENTRY ~n := #in~n; 108433#L25 assume !(~n <= 0); 108429#L26 call #t~ret0 := fact(~n - 1);< 108432#factENTRY ~n := #in~n; 108445#L25 assume !(~n <= 0); 108430#L26 call #t~ret0 := fact(~n - 1);< 108444#factENTRY ~n := #in~n; 108445#L25 assume !(~n <= 0); 108430#L26 call #t~ret0 := fact(~n - 1);< 108444#factENTRY ~n := #in~n; 108450#L25 assume ~n <= 0;#res := 1; 108458#factFINAL assume true; 108453#factEXIT >#66#return; 108449#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108443#factFINAL assume true; 108439#factEXIT >#66#return; 108431#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108503#factFINAL assume true; 108428#factEXIT >#66#return; 108426#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108419#factFINAL assume true; 108418#factEXIT >#68#return; 108413#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 108415#factENTRY ~n := #in~n; 108421#L25 assume ~n <= 0;#res := 1; 108416#factFINAL assume true; 108412#factEXIT >#70#return; 108333#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 108402#factENTRY ~n := #in~n; 108502#L25 assume !(~n <= 0); 108326#L26 call #t~ret0 := fact(~n - 1);< 108335#factENTRY ~n := #in~n; 108497#L25 assume !(~n <= 0); 108323#L26 call #t~ret0 := fact(~n - 1);< 108370#factENTRY ~n := #in~n; 108382#L25 assume !(~n <= 0); 108325#L26 call #t~ret0 := fact(~n - 1);< 108379#factENTRY ~n := #in~n; 108440#L25 assume ~n <= 0;#res := 1; 108425#factFINAL assume true; 108376#factEXIT >#66#return; 108373#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108369#factFINAL assume true; 108358#factEXIT >#66#return; 108328#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108331#factFINAL assume true; 108322#factEXIT >#66#return; 108327#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108401#factFINAL assume true; 108394#factEXIT >#72#return; 108398#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; 108441#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 108436#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 108435#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 108434#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; 108339#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 108427#factENTRY ~n := #in~n; 108422#L25 assume !(~n <= 0); 108305#L26 call #t~ret0 := fact(~n - 1);< 108309#factENTRY ~n := #in~n; 108382#L25 assume !(~n <= 0); 108325#L26 call #t~ret0 := fact(~n - 1);< 108379#factENTRY ~n := #in~n; 108382#L25 assume !(~n <= 0); 108325#L26 call #t~ret0 := fact(~n - 1);< 108379#factENTRY ~n := #in~n; 108440#L25 assume ~n <= 0;#res := 1; 108425#factFINAL assume true; 108376#factEXIT >#66#return; 108373#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108369#factFINAL assume true; 108358#factEXIT >#66#return; 108328#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108331#factFINAL assume true; 108322#factEXIT >#66#return; 108329#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108368#factFINAL assume true; 108337#factEXIT >#68#return; 108289#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 108295#factENTRY ~n := #in~n; 108330#L25 assume !(~n <= 0); 108307#L26 call #t~ret0 := fact(~n - 1);< 108309#factENTRY ~n := #in~n; 108345#L25 assume ~n <= 0;#res := 1; 108310#factFINAL assume true; 108303#factEXIT >#66#return; 108308#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108347#factFINAL assume true; 108346#factEXIT >#70#return; 108266#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 108273#factENTRY ~n := #in~n; 108316#L25 assume !(~n <= 0); 108304#L26 call #t~ret0 := fact(~n - 1);< 108309#factENTRY ~n := #in~n; 108345#L25 assume ~n <= 0;#res := 1; 108310#factFINAL assume true; 108303#factEXIT >#66#return; 108301#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108302#factFINAL assume true; 108264#factEXIT >#72#return; 108271#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; 108487#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 108471#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 108466#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 108344#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; 108249#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 108251#factENTRY ~n := #in~n; 108261#L25 assume !(~n <= 0); 107878#L26 call #t~ret0 := fact(~n - 1);< 108219#factENTRY ~n := #in~n; 108236#L25 assume !(~n <= 0); 108215#L26 call #t~ret0 := fact(~n - 1);< 108234#factENTRY ~n := #in~n; 108237#L25 assume ~n <= 0;#res := 1; 108253#factFINAL assume true; 108241#factEXIT >#66#return; 108238#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108233#factFINAL assume true; 108221#factEXIT >#66#return; 108225#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108274#factFINAL assume true; 108256#factEXIT >#68#return; 108245#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 108247#factENTRY ~n := #in~n; 108284#L25 assume !(~n <= 0); 107880#L26 call #t~ret0 := fact(~n - 1);< 108219#factENTRY ~n := #in~n; 108236#L25 assume !(~n <= 0); 108215#L26 call #t~ret0 := fact(~n - 1);< 108234#factENTRY ~n := #in~n; 108236#L25 assume !(~n <= 0); 108215#L26 call #t~ret0 := fact(~n - 1);< 108234#factENTRY ~n := #in~n; 108237#L25 assume ~n <= 0;#res := 1; 108253#factFINAL assume true; 108241#factEXIT >#66#return; 108238#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108233#factFINAL assume true; 108221#factEXIT >#66#return; 108217#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108299#factFINAL assume true; 108213#factEXIT >#66#return; 108218#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108254#factFINAL assume true; 108244#factEXIT >#70#return; 107885#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 107886#factENTRY ~n := #in~n; 107980#L25 assume ~n <= 0;#res := 1; 107979#factFINAL assume true; 107976#factEXIT >#72#return; 107925#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; 107926#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 107929#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 107949#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 107936#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; 107937#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 108203#factENTRY ~n := #in~n; 108232#L25 assume !(~n <= 0); 107879#L26 call #t~ret0 := fact(~n - 1);< 108219#factENTRY ~n := #in~n; 108236#L25 assume !(~n <= 0); 108215#L26 call #t~ret0 := fact(~n - 1);< 108234#factENTRY ~n := #in~n; 108236#L25 assume !(~n <= 0); 108215#L26 call #t~ret0 := fact(~n - 1);< 108234#factENTRY ~n := #in~n; 108237#L25 assume ~n <= 0;#res := 1; 108253#factFINAL assume true; 108241#factEXIT >#66#return; 108238#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108233#factFINAL assume true; 108221#factEXIT >#66#return; 108217#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108299#factFINAL assume true; 108213#factEXIT >#66#return; 108211#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108210#factFINAL assume true; 108204#factEXIT >#74#return; 108206#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 108209#factENTRY ~n := #in~n; 108240#L25 assume !(~n <= 0); 108224#L26 call #t~ret0 := fact(~n - 1);< 108228#factENTRY ~n := #in~n; 108285#L25 assume !(~n <= 0); 108242#L26 call #t~ret0 := fact(~n - 1);< 108243#factENTRY ~n := #in~n; 108237#L25 assume ~n <= 0;#res := 1; 108253#factFINAL assume true; 108241#factEXIT >#66#return; 108238#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108233#factFINAL assume true; 108221#factEXIT >#66#return; 108220#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108212#factFINAL assume true; 108208#factEXIT >#76#return; 107941#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 108203#factENTRY ~n := #in~n; 108232#L25 assume !(~n <= 0); 107879#L26 call #t~ret0 := fact(~n - 1);< 108219#factENTRY ~n := #in~n; 108528#L25 assume ~n <= 0;#res := 1; 108527#factFINAL assume true; 107877#factEXIT >#66#return; 107881#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107943#factFINAL assume true; 108201#factEXIT >#78#return; 108202#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; 107910#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 107918#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 107981#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 107975#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 107974#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 107923#L42-3 [2021-11-20 06:29:28,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:29:28,855 INFO L85 PathProgramCache]: Analyzing trace with hash 52177008, now seen corresponding path program 20 times [2021-11-20 06:29:28,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:29:28,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321224941] [2021-11-20 06:29:28,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:29:28,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:29:28,861 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:29:28,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1923662085] [2021-11-20 06:29:28,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:29:28,862 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:29:28,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:29:28,865 INFO L229 MonitoredProcess]: Starting monitored process 173 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:29:28,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (173)] Waiting until timeout for monitored process [2021-11-20 06:29:29,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:29:29,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-20 06:29:29,050 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:29:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:29:29,141 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:29:29,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:29:29,142 INFO L85 PathProgramCache]: Analyzing trace with hash 894291362, now seen corresponding path program 16 times [2021-11-20 06:29:29,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:29:29,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860645249] [2021-11-20 06:29:29,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:29:29,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:29:29,147 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:29:29,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [633560594] [2021-11-20 06:29:29,147 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 06:29:29,147 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:29:29,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:29:29,164 INFO L229 MonitoredProcess]: Starting monitored process 174 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:29:29,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (174)] Waiting until timeout for monitored process [2021-11-20 06:29:29,262 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 06:29:29,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:29:29,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-20 06:29:29,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:29:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2743 backedges. 1521 proven. 207 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2021-11-20 06:29:29,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:29:31,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2743 backedges. 123 proven. 607 refuted. 0 times theorem prover too weak. 2013 trivial. 0 not checked. [2021-11-20 06:29:31,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:29:31,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860645249] [2021-11-20 06:29:31,215 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:29:31,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633560594] [2021-11-20 06:29:31,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633560594] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:29:31,215 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:29:31,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 24 [2021-11-20 06:29:31,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864478163] [2021-11-20 06:29:31,216 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:29:31,216 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 06:29:31,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:29:31,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-20 06:29:31,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2021-11-20 06:29:31,217 INFO L87 Difference]: Start difference. First operand 757 states and 975 transitions. cyclomatic complexity: 233 Second operand has 24 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 22 states have internal predecessors, (59), 16 states have call successors, (32), 2 states have call predecessors, (32), 7 states have return successors, (33), 12 states have call predecessors, (33), 16 states have call successors, (33) [2021-11-20 06:29:34,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:29:34,210 INFO L93 Difference]: Finished difference Result 990 states and 1302 transitions. [2021-11-20 06:29:34,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-20 06:29:34,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 990 states and 1302 transitions. [2021-11-20 06:29:34,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 268 [2021-11-20 06:29:34,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 990 states to 981 states and 1291 transitions. [2021-11-20 06:29:34,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 181 [2021-11-20 06:29:34,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 181 [2021-11-20 06:29:34,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 981 states and 1291 transitions. [2021-11-20 06:29:34,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:29:34,228 INFO L681 BuchiCegarLoop]: Abstraction has 981 states and 1291 transitions. [2021-11-20 06:29:34,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states and 1291 transitions. [2021-11-20 06:29:34,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 789. [2021-11-20 06:29:34,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 521 states have (on average 1.0614203454894433) internal successors, (553), 515 states have internal predecessors, (553), 171 states have call successors, (176), 102 states have call predecessors, (176), 97 states have return successors, (297), 171 states have call predecessors, (297), 171 states have call successors, (297) [2021-11-20 06:29:34,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1026 transitions. [2021-11-20 06:29:34,250 INFO L704 BuchiCegarLoop]: Abstraction has 789 states and 1026 transitions. [2021-11-20 06:29:34,250 INFO L587 BuchiCegarLoop]: Abstraction has 789 states and 1026 transitions. [2021-11-20 06:29:34,250 INFO L425 BuchiCegarLoop]: ======== Iteration 31============ [2021-11-20 06:29:34,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 789 states and 1026 transitions. [2021-11-20 06:29:34,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 167 [2021-11-20 06:29:34,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:29:34,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:29:34,256 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [32, 32, 18, 14, 14, 14, 14, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2021-11-20 06:29:34,256 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [30, 30, 18, 18, 18, 18, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:29:34,257 INFO L791 eck$LassoCheckResult]: Stem: 111059#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 111030#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 111031#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 111058#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 111078#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 111185#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 111183#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; 111179#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 111180#factENTRY ~n := #in~n; 111184#L25 assume ~n <= 0;#res := 1; 111182#factFINAL assume true; 111178#factEXIT >#68#return; 111174#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 111175#factENTRY ~n := #in~n; 111181#L25 assume ~n <= 0;#res := 1; 111177#factFINAL assume true; 111173#factEXIT >#70#return; 111170#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 111171#factENTRY ~n := #in~n; 111176#L25 assume ~n <= 0;#res := 1; 111172#factFINAL assume true; 111169#factEXIT >#72#return; 111168#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; 111166#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 111163#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 111159#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 111157#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; 111153#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 111155#factENTRY ~n := #in~n; 111165#L25 assume !(~n <= 0); 111161#L26 call #t~ret0 := fact(~n - 1);< 111162#factENTRY ~n := #in~n; 111167#L25 assume ~n <= 0;#res := 1; 111164#factFINAL assume true; 111160#factEXIT >#66#return; 111158#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111156#factFINAL assume true; 111152#factEXIT >#74#return; 111141#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 111145#factENTRY ~n := #in~n; 111146#L25 assume ~n <= 0;#res := 1; 111140#factFINAL assume true; 111142#factEXIT >#76#return; 111132#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 111133#factENTRY ~n := #in~n; 111197#L25 assume !(~n <= 0); 111193#L26 call #t~ret0 := fact(~n - 1);< 111194#factENTRY ~n := #in~n; 111196#L25 assume ~n <= 0;#res := 1; 111195#factFINAL assume true; 111192#factEXIT >#66#return; 111191#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111190#factFINAL assume true; 111131#factEXIT >#78#return; 111130#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; 111128#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 111126#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 111117#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 111108#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; 111100#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 111107#factENTRY ~n := #in~n; 111129#L25 assume !(~n <= 0); 111122#L26 call #t~ret0 := fact(~n - 1);< 111125#factENTRY ~n := #in~n; 111148#L25 assume !(~n <= 0); 111121#L26 call #t~ret0 := fact(~n - 1);< 111762#factENTRY ~n := #in~n; 111764#L25 assume ~n <= 0;#res := 1; 111763#factFINAL assume true; 111760#factEXIT >#66#return; 111761#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111766#factFINAL assume true; 111765#factEXIT >#66#return; 111115#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111116#factFINAL assume true; 111099#factEXIT >#74#return; 111102#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 111112#factENTRY ~n := #in~n; 111114#L25 assume ~n <= 0;#res := 1; 111113#factFINAL assume true; 111110#factEXIT >#76#return; 111101#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 111107#factENTRY ~n := #in~n; 111129#L25 assume !(~n <= 0); 111122#L26 call #t~ret0 := fact(~n - 1);< 111125#factENTRY ~n := #in~n; 111148#L25 assume !(~n <= 0); 111121#L26 call #t~ret0 := fact(~n - 1);< 111762#factENTRY ~n := #in~n; 111764#L25 assume ~n <= 0;#res := 1; 111763#factFINAL assume true; 111760#factEXIT >#66#return; 111761#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111766#factFINAL assume true; 111765#factEXIT >#66#return; 111115#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111116#factFINAL assume true; 111099#factEXIT >#78#return; 111098#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; 111097#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 111096#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 111095#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 111094#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 111044#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 111045#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 111065#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; 111645#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 111010#factENTRY ~n := #in~n; 111658#L25 assume !(~n <= 0); 111654#L26 call #t~ret0 := fact(~n - 1);< 111655#factENTRY ~n := #in~n; 111660#L25 assume ~n <= 0;#res := 1; 111657#factFINAL assume true; 111653#factEXIT >#66#return; 111651#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111648#factFINAL assume true; 111644#factEXIT >#68#return; 111613#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 111615#factENTRY ~n := #in~n; 111618#L25 assume ~n <= 0;#res := 1; 111608#factFINAL assume true; 111610#factEXIT >#70#return; 111591#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 111593#factENTRY ~n := #in~n; 111605#L25 assume !(~n <= 0); 111597#L26 call #t~ret0 := fact(~n - 1);< 111600#factENTRY ~n := #in~n; 111606#L25 assume ~n <= 0;#res := 1; 111601#factFINAL assume true; 111596#factEXIT >#66#return; 111595#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111594#factFINAL assume true; 111589#factEXIT >#72#return; 111587#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; 111588#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 111583#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 111584#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 111580#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; 111573#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 111576#factENTRY ~n := #in~n; 111571#L25 assume !(~n <= 0); 111562#L26 call #t~ret0 := fact(~n - 1);< 111566#factENTRY ~n := #in~n; 111570#L25 assume ~n <= 0;#res := 1; 111567#factFINAL assume true; 111560#factEXIT >#66#return; 111565#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111579#factFINAL assume true; 111578#factEXIT >#68#return; 111568#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 111574#factENTRY ~n := #in~n; 111575#L25 assume !(~n <= 0); 111561#L26 call #t~ret0 := fact(~n - 1);< 111566#factENTRY ~n := #in~n; 111570#L25 assume ~n <= 0;#res := 1; 111567#factFINAL assume true; 111560#factEXIT >#66#return; 111564#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111616#factFINAL assume true; 111609#factEXIT >#70#return; 111005#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 111006#factENTRY ~n := #in~n; 111705#L25 assume ~n <= 0;#res := 1; 111704#factFINAL assume true; 111703#factEXIT >#72#return; 111702#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; 111701#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 111700#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 111699#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 111061#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; 110991#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 110992#factENTRY ~n := #in~n; 111555#L25 assume !(~n <= 0); 111552#L26 call #t~ret0 := fact(~n - 1);< 111554#factENTRY ~n := #in~n; 111708#L25 assume !(~n <= 0); 111551#L26 call #t~ret0 := fact(~n - 1);< 111707#factENTRY ~n := #in~n; 111709#L25 assume ~n <= 0;#res := 1; 111712#factFINAL assume true; 111711#factEXIT >#66#return; 111553#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111706#factFINAL assume true; 111550#factEXIT >#66#return; 111549#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111548#factFINAL assume true; 111546#factEXIT >#74#return; 111544#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 111545#factENTRY ~n := #in~n; 111569#L25 assume !(~n <= 0); 111563#L26 call #t~ret0 := fact(~n - 1);< 111566#factENTRY ~n := #in~n; 111570#L25 assume ~n <= 0;#res := 1; 111567#factFINAL assume true; 111560#factEXIT >#66#return; 111559#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111558#factFINAL assume true; 111556#factEXIT >#76#return; 111547#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 110992#factENTRY ~n := #in~n; 111555#L25 assume !(~n <= 0); 111552#L26 call #t~ret0 := fact(~n - 1);< 111554#factENTRY ~n := #in~n; 111570#L25 assume ~n <= 0;#res := 1; 111567#factFINAL assume true; 111560#factEXIT >#66#return; 111559#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111558#factFINAL assume true; 111556#factEXIT >#78#return; 111557#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; 111086#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 111083#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 111082#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 111057#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 111046#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 111047#L42-3 [2021-11-20 06:29:34,257 INFO L793 eck$LassoCheckResult]: Loop: 111047#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 111081#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; 111007#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 111008#factENTRY ~n := #in~n; 111314#L25 assume !(~n <= 0); 111310#L26 call #t~ret0 := fact(~n - 1);< 111313#factENTRY ~n := #in~n; 111512#L25 assume !(~n <= 0); 110994#L26 call #t~ret0 := fact(~n - 1);< 111511#factENTRY ~n := #in~n; 111513#L25 assume ~n <= 0;#res := 1; 111510#factFINAL assume true; 110993#factEXIT >#66#return; 110995#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111777#factFINAL assume true; 111776#factEXIT >#66#return; 111306#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111307#factFINAL assume true; 111299#factEXIT >#68#return; 110997#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 111072#factENTRY ~n := #in~n; 111070#L25 assume ~n <= 0;#res := 1; 111071#factFINAL assume true; 110996#factEXIT >#70#return; 111001#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 111024#factENTRY ~n := #in~n; 111026#L25 assume !(~n <= 0); 111362#L26 call #t~ret0 := fact(~n - 1);< 111370#factENTRY ~n := #in~n; 111379#L25 assume !(~n <= 0); 111357#L26 call #t~ret0 := fact(~n - 1);< 111375#factENTRY ~n := #in~n; 111381#L25 assume ~n <= 0;#res := 1; 111378#factFINAL assume true; 111373#factEXIT >#66#return; 111372#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111368#factFINAL assume true; 111355#factEXIT >#66#return; 111366#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111427#factFINAL assume true; 111422#factEXIT >#72#return; 111426#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; 111525#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 111520#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 111518#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 111516#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; 110999#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 111411#factENTRY ~n := #in~n; 111412#L25 assume !(~n <= 0); 111358#L26 call #t~ret0 := fact(~n - 1);< 111367#factENTRY ~n := #in~n; 111380#L25 assume !(~n <= 0); 111374#L26 call #t~ret0 := fact(~n - 1);< 111376#factENTRY ~n := #in~n; 111381#L25 assume ~n <= 0;#res := 1; 111378#factFINAL assume true; 111373#factEXIT >#66#return; 111372#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111368#factFINAL assume true; 111355#factEXIT >#66#return; 111354#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111351#factFINAL assume true; 111346#factEXIT >#68#return; 111320#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 111321#factENTRY ~n := #in~n; 111396#L25 assume !(~n <= 0); 111363#L26 call #t~ret0 := fact(~n - 1);< 111390#factENTRY ~n := #in~n; 111399#L25 assume ~n <= 0;#res := 1; 111395#factFINAL assume true; 111386#factEXIT >#66#return; 111384#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111382#factFINAL assume true; 111332#factEXIT >#70#return; 111285#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 111308#factENTRY ~n := #in~n; 111400#L25 assume !(~n <= 0); 111361#L26 call #t~ret0 := fact(~n - 1);< 111394#factENTRY ~n := #in~n; 111399#L25 assume ~n <= 0;#res := 1; 111395#factFINAL assume true; 111386#factEXIT >#66#return; 111388#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111344#factFINAL assume true; 111280#factEXIT >#72#return; 111279#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; 111277#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 111276#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 111273#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 111270#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; 111257#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 111258#factENTRY ~n := #in~n; 111298#L25 assume !(~n <= 0); 111244#L26 call #t~ret0 := fact(~n - 1);< 111229#factENTRY ~n := #in~n; 111254#L25 assume !(~n <= 0); 111251#L26 call #t~ret0 := fact(~n - 1);< 111252#factENTRY ~n := #in~n; 111240#L25 assume ~n <= 0;#res := 1; 111253#factFINAL assume true; 111250#factEXIT >#66#return; 111249#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111246#factFINAL assume true; 111243#factEXIT >#66#return; 111245#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111297#factFINAL assume true; 111256#factEXIT >#68#return; 111211#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 111231#factENTRY ~n := #in~n; 111232#L25 assume !(~n <= 0); 111228#L26 call #t~ret0 := fact(~n - 1);< 111229#factENTRY ~n := #in~n; 111254#L25 assume !(~n <= 0); 111251#L26 call #t~ret0 := fact(~n - 1);< 111252#factENTRY ~n := #in~n; 111240#L25 assume ~n <= 0;#res := 1; 111253#factFINAL assume true; 111250#factEXIT >#66#return; 111249#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111246#factFINAL assume true; 111243#factEXIT >#66#return; 111216#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111217#factFINAL assume true; 111209#factEXIT >#70#return; 111003#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 111004#factENTRY ~n := #in~n; 111296#L25 assume ~n <= 0;#res := 1; 111295#factFINAL assume true; 111293#factEXIT >#72#return; 111053#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; 111049#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 111050#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 111087#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 111060#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; 111021#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 111018#factENTRY ~n := #in~n; 111023#L25 assume !(~n <= 0); 111221#L26 call #t~ret0 := fact(~n - 1);< 111242#factENTRY ~n := #in~n; 111239#L25 assume !(~n <= 0); 111220#L26 call #t~ret0 := fact(~n - 1);< 111238#factENTRY ~n := #in~n; 111239#L25 assume !(~n <= 0); 111220#L26 call #t~ret0 := fact(~n - 1);< 111238#factENTRY ~n := #in~n; 111240#L25 assume ~n <= 0;#res := 1; 111253#factFINAL assume true; 111250#factEXIT >#66#return; 111249#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111246#factFINAL assume true; 111243#factEXIT >#66#return; 111224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111237#factFINAL assume true; 111218#factEXIT >#66#return; 111227#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111274#factFINAL assume true; 111271#factEXIT >#74#return; 111012#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 111075#factENTRY ~n := #in~n; 111068#L25 assume !(~n <= 0); 111069#L26 call #t~ret0 := fact(~n - 1);< 111229#factENTRY ~n := #in~n; 111254#L25 assume !(~n <= 0); 111251#L26 call #t~ret0 := fact(~n - 1);< 111252#factENTRY ~n := #in~n; 111240#L25 assume ~n <= 0;#res := 1; 111253#factFINAL assume true; 111250#factEXIT >#66#return; 111249#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111246#factFINAL assume true; 111243#factEXIT >#66#return; 111062#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111011#factFINAL assume true; 111014#factEXIT >#76#return; 111019#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 111018#factENTRY ~n := #in~n; 111023#L25 assume !(~n <= 0); 111221#L26 call #t~ret0 := fact(~n - 1);< 111242#factENTRY ~n := #in~n; 111507#L25 assume ~n <= 0;#res := 1; 111496#factFINAL assume true; 111492#factEXIT >#66#return; 111482#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111479#factFINAL assume true; 111470#factEXIT >#78#return; 111468#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; 111033#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 111042#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 111077#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 111055#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 111056#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 111047#L42-3 [2021-11-20 06:29:34,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:29:34,258 INFO L85 PathProgramCache]: Analyzing trace with hash 52177008, now seen corresponding path program 21 times [2021-11-20 06:29:34,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:29:34,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863991277] [2021-11-20 06:29:34,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:29:34,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:29:34,264 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:29:34,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [780094405] [2021-11-20 06:29:34,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 06:29:34,265 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:29:34,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:29:34,276 INFO L229 MonitoredProcess]: Starting monitored process 175 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:29:34,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (175)] Waiting until timeout for monitored process [2021-11-20 06:29:34,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2021-11-20 06:29:34,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-20 06:29:34,555 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:29:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:29:34,646 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:29:34,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:29:34,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1676318190, now seen corresponding path program 17 times [2021-11-20 06:29:34,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:29:34,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026267976] [2021-11-20 06:29:34,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:29:34,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:29:34,652 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:29:34,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [100738003] [2021-11-20 06:29:34,652 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-20 06:29:34,652 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:29:34,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:29:34,654 INFO L229 MonitoredProcess]: Starting monitored process 176 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:29:34,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (176)] Waiting until timeout for monitored process [2021-11-20 06:29:34,789 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2021-11-20 06:29:34,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-20 06:29:34,789 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:29:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:29:34,886 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:29:34,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:29:34,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1406721987, now seen corresponding path program 22 times [2021-11-20 06:29:34,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:29:34,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468805782] [2021-11-20 06:29:34,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:29:34,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:29:34,895 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:29:34,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [568752430] [2021-11-20 06:29:34,896 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 06:29:34,896 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:29:34,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:29:34,902 INFO L229 MonitoredProcess]: Starting monitored process 177 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:29:34,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (177)] Waiting until timeout for monitored process [2021-11-20 06:29:35,082 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 06:29:35,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:29:35,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-20 06:29:35,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:29:35,818 INFO L134 CoverageAnalysis]: Checked inductivity of 8838 backedges. 2363 proven. 120 refuted. 0 times theorem prover too weak. 6355 trivial. 0 not checked. [2021-11-20 06:29:35,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:29:36,850 INFO L134 CoverageAnalysis]: Checked inductivity of 8838 backedges. 79 proven. 184 refuted. 0 times theorem prover too weak. 8575 trivial. 0 not checked. [2021-11-20 06:29:36,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:29:36,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468805782] [2021-11-20 06:29:36,851 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:29:36,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568752430] [2021-11-20 06:29:36,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568752430] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:29:36,851 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:29:36,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-11-20 06:29:36,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043585030] [2021-11-20 06:29:36,852 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:31:46,680 WARN L227 SmtUtils]: Spent 2.12m on a formula simplification. DAG size of input: 268 DAG size of output: 227 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-20 06:31:48,498 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:31:48,498 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:31:48,498 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:31:48,498 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:31:48,498 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-11-20 06:31:48,498 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:31:48,498 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:31:48,498 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:31:48,498 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration31_Loop [2021-11-20 06:31:48,498 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:31:48,498 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:31:48,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:31:48,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:31:48,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:31:48,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:31:48,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:31:48,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:31:48,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:31:48,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:31:49,089 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:31:49,089 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-11-20 06:31:49,089 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:31:49,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:31:49,091 INFO L229 MonitoredProcess]: Starting monitored process 178 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:31:49,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2021-11-20 06:31:49,092 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:31:49,092 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:31:49,099 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:31:49,099 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: [] [2021-11-20 06:31:49,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Forceful destruction successful, exit code 0 [2021-11-20 06:31:49,118 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:31:49,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:31:49,119 INFO L229 MonitoredProcess]: Starting monitored process 179 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:31:49,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2021-11-20 06:31:49,120 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:31:49,120 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:31:49,128 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:31:49,128 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: [] [2021-11-20 06:31:49,147 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Ended with exit code 0 [2021-11-20 06:31:49,147 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:31:49,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:31:49,148 INFO L229 MonitoredProcess]: Starting monitored process 180 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:31:49,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2021-11-20 06:31:49,149 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:31:49,149 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:31:49,157 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:31:49,157 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: [] [2021-11-20 06:31:49,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Ended with exit code 0 [2021-11-20 06:31:49,176 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:31:49,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:31:49,177 INFO L229 MonitoredProcess]: Starting monitored process 181 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:31:49,179 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:31:49,179 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:31:49,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2021-11-20 06:31:49,189 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:31:49,189 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: [] [2021-11-20 06:31:49,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Forceful destruction successful, exit code 0 [2021-11-20 06:31:49,208 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:31:49,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:31:49,208 INFO L229 MonitoredProcess]: Starting monitored process 182 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:31:49,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2021-11-20 06:31:49,210 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:31:49,210 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:31:49,217 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:31:49,217 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: [] [2021-11-20 06:31:49,236 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Forceful destruction successful, exit code 0 [2021-11-20 06:31:49,237 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:31:49,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:31:49,238 INFO L229 MonitoredProcess]: Starting monitored process 183 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:31:49,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2021-11-20 06:31:49,239 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:31:49,239 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:31:49,246 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:31:49,246 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: [] [2021-11-20 06:31:49,265 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Forceful destruction successful, exit code 0 [2021-11-20 06:31:49,265 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:31:49,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:31:49,266 INFO L229 MonitoredProcess]: Starting monitored process 184 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:31:49,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2021-11-20 06:31:49,267 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:31:49,267 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:31:49,275 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:31:49,275 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: [] [2021-11-20 06:31:49,294 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Ended with exit code 0 [2021-11-20 06:31:49,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:31:49,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:31:49,295 INFO L229 MonitoredProcess]: Starting monitored process 185 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:31:49,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2021-11-20 06:31:49,296 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:31:49,296 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:31:49,349 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Ended with exit code 0 [2021-11-20 06:31:49,349 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:31:49,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:31:49,350 INFO L229 MonitoredProcess]: Starting monitored process 186 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:31:49,358 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-11-20 06:31:49,359 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:31:49,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2021-11-20 06:31:49,429 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-11-20 06:31:49,456 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Forceful destruction successful, exit code 0 [2021-11-20 06:31:49,456 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:31:49,457 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:31:49,457 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:31:49,457 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:31:49,457 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-20 06:31:49,457 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:31:49,457 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:31:49,457 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:31:49,457 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration31_Loop [2021-11-20 06:31:49,457 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:31:49,457 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:31:49,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:31:49,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:31:49,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:31:49,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:31:49,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:31:49,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:31:49,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:31:49,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:31:50,014 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:31:50,014 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-20 06:31:50,015 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:31:50,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:31:50,021 INFO L229 MonitoredProcess]: Starting monitored process 187 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:31:50,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2021-11-20 06:31:50,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 [2021-11-20 06:31:50,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:31:50,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:31:50,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:31:50,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:31:50,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:31:50,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:31:50,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:31:50,033 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:31:50,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Ended with exit code 0 [2021-11-20 06:31:50,052 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:31:50,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:31:50,053 INFO L229 MonitoredProcess]: Starting monitored process 188 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:31:50,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2021-11-20 06:31:50,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:31:50,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:31:50,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:31:50,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:31:50,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:31:50,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:31:50,062 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:31:50,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:31:50,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:31:50,086 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Ended with exit code 0 [2021-11-20 06:31:50,087 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:31:50,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:31:50,089 INFO L229 MonitoredProcess]: Starting monitored process 189 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:31:50,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2021-11-20 06:31:50,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:31:50,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:31:50,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:31:50,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:31:50,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:31:50,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:31:50,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:31:50,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:31:50,101 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:31:50,120 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Forceful destruction successful, exit code 0 [2021-11-20 06:31:50,120 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:31:50,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:31:50,121 INFO L229 MonitoredProcess]: Starting monitored process 190 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:31:50,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2021-11-20 06:31:50,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:31:50,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:31:50,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:31:50,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:31:50,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:31:50,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:31:50,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:31:50,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:31:50,130 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:31:50,149 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2021-11-20 06:31:50,150 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:31:50,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:31:50,150 INFO L229 MonitoredProcess]: Starting monitored process 191 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:31:50,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2021-11-20 06:31:50,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:31:50,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:31:50,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:31:50,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:31:50,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:31:50,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:31:50,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:31:50,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:31:50,160 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:31:50,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Forceful destruction successful, exit code 0 [2021-11-20 06:31:50,179 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:31:50,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:31:50,180 INFO L229 MonitoredProcess]: Starting monitored process 192 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:31:50,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2021-11-20 06:31:50,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:31:50,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:31:50,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:31:50,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:31:50,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:31:50,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:31:50,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:31:50,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:31:50,192 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:31:50,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Ended with exit code 0 [2021-11-20 06:31:50,211 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:31:50,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:31:50,212 INFO L229 MonitoredProcess]: Starting monitored process 193 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:31:50,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:31:50,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2021-11-20 06:31:50,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:31:50,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:31:50,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:31:50,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:31:50,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:31:50,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:31:50,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:31:50,231 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:31:50,250 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Forceful destruction successful, exit code 0 [2021-11-20 06:31:50,251 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:31:50,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:31:50,252 INFO L229 MonitoredProcess]: Starting monitored process 194 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:31:50,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2021-11-20 06:31:50,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:31:50,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:31:50,260 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:31:50,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:31:50,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:31:50,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:31:50,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:31:50,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:31:50,268 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-20 06:31:50,272 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-11-20 06:31:50,272 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-11-20 06:31:50,272 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:31:50,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:31:50,273 INFO L229 MonitoredProcess]: Starting monitored process 195 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:31:50,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2021-11-20 06:31:50,274 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-20 06:31:50,274 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-11-20 06:31:50,274 INFO L513 LassoAnalysis]: Proved termination. [2021-11-20 06:31:50,274 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~n~0#1 + 5 Supporting invariants [] [2021-11-20 06:31:50,294 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Forceful destruction successful, exit code 0 [2021-11-20 06:31:50,294 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-11-20 06:31:50,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:31:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:31:50,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 1397 conjuncts, 66 conjunts are in the unsatisfiable core [2021-11-20 06:31:50,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:31:51,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Forceful destruction successful, exit code 0 [2021-11-20 06:31:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:31:52,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 72 conjunts are in the unsatisfiable core [2021-11-20 06:31:52,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:31:54,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2083 backedges. 7 proven. 316 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2021-11-20 06:31:54,092 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2021-11-20 06:31:54,092 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 789 states and 1026 transitions. cyclomatic complexity: 252 Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 6 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2021-11-20 06:31:54,772 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 789 states and 1026 transitions. cyclomatic complexity: 252. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 6 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Result 1902 states and 2487 transitions. Complement of second has 38 states. [2021-11-20 06:31:54,772 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 [2021-11-20 06:31:54,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 6 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2021-11-20 06:31:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 94 transitions. [2021-11-20 06:31:54,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 94 transitions. Stem has 215 letters. Loop has 191 letters. [2021-11-20 06:31:54,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:31:54,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 94 transitions. Stem has 406 letters. Loop has 191 letters. [2021-11-20 06:31:54,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:31:54,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 94 transitions. Stem has 215 letters. Loop has 382 letters. [2021-11-20 06:31:54,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:31:54,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1902 states and 2487 transitions. [2021-11-20 06:31:54,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 116 [2021-11-20 06:31:54,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1902 states to 1305 states and 1725 transitions. [2021-11-20 06:31:54,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 152 [2021-11-20 06:31:54,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2021-11-20 06:31:54,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1305 states and 1725 transitions. [2021-11-20 06:31:54,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:31:54,802 INFO L681 BuchiCegarLoop]: Abstraction has 1305 states and 1725 transitions. [2021-11-20 06:31:54,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states and 1725 transitions. [2021-11-20 06:31:54,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1250. [2021-11-20 06:31:54,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 824 states have (on average 1.0655339805825244) internal successors, (878), 815 states have internal predecessors, (878), 269 states have call successors, (276), 160 states have call predecessors, (276), 157 states have return successors, (465), 274 states have call predecessors, (465), 269 states have call successors, (465) [2021-11-20 06:31:54,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1619 transitions. [2021-11-20 06:31:54,830 INFO L704 BuchiCegarLoop]: Abstraction has 1250 states and 1619 transitions. [2021-11-20 06:31:54,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:31:54,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 06:31:54,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-11-20 06:31:54,831 INFO L87 Difference]: Start difference. First operand 1250 states and 1619 transitions. Second operand has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 12 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 12 states have call predecessors, (41), 12 states have call successors, (41) [2021-11-20 06:31:55,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:31:55,318 INFO L93 Difference]: Finished difference Result 2139 states and 3038 transitions. [2021-11-20 06:31:55,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 06:31:55,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2139 states and 3038 transitions. [2021-11-20 06:31:55,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 228 [2021-11-20 06:31:55,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2139 states to 1803 states and 2542 transitions. [2021-11-20 06:31:55,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2021-11-20 06:31:55,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2021-11-20 06:31:55,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1803 states and 2542 transitions. [2021-11-20 06:31:55,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:31:55,347 INFO L681 BuchiCegarLoop]: Abstraction has 1803 states and 2542 transitions. [2021-11-20 06:31:55,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states and 2542 transitions. [2021-11-20 06:31:55,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1281. [2021-11-20 06:31:55,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 844 states have (on average 1.0639810426540284) internal successors, (898), 834 states have internal predecessors, (898), 280 states have call successors, (289), 160 states have call predecessors, (289), 157 states have return successors, (480), 286 states have call predecessors, (480), 280 states have call successors, (480) [2021-11-20 06:31:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1667 transitions. [2021-11-20 06:31:55,382 INFO L704 BuchiCegarLoop]: Abstraction has 1281 states and 1667 transitions. [2021-11-20 06:31:55,382 INFO L587 BuchiCegarLoop]: Abstraction has 1281 states and 1667 transitions. [2021-11-20 06:31:55,382 INFO L425 BuchiCegarLoop]: ======== Iteration 32============ [2021-11-20 06:31:55,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1281 states and 1667 transitions. [2021-11-20 06:31:55,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 116 [2021-11-20 06:31:55,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:31:55,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:31:55,390 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [46, 46, 24, 22, 22, 22, 22, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2021-11-20 06:31:55,390 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [43, 43, 28, 28, 28, 28, 15, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:31:55,391 INFO L791 eck$LassoCheckResult]: Stem: 120875#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 120847#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 120848#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 120874#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 120859#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 120860#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 121203#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; 121199#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 121200#factENTRY ~n := #in~n; 121204#L25 assume ~n <= 0;#res := 1; 121202#factFINAL assume true; 121198#factEXIT >#68#return; 121194#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 121195#factENTRY ~n := #in~n; 121201#L25 assume ~n <= 0;#res := 1; 121197#factFINAL assume true; 121193#factEXIT >#70#return; 121190#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 121191#factENTRY ~n := #in~n; 121196#L25 assume ~n <= 0;#res := 1; 121192#factFINAL assume true; 121189#factEXIT >#72#return; 121188#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; 121187#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 121186#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 121182#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 121179#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; 121167#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 121168#factENTRY ~n := #in~n; 121178#L25 assume !(~n <= 0); 121176#L26 call #t~ret0 := fact(~n - 1);< 121177#factENTRY ~n := #in~n; 121185#L25 assume ~n <= 0;#res := 1; 121181#factFINAL assume true; 121175#factEXIT >#66#return; 121174#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121173#factFINAL assume true; 121166#factEXIT >#74#return; 121162#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 121163#factENTRY ~n := #in~n; 121172#L25 assume ~n <= 0;#res := 1; 121165#factFINAL assume true; 121161#factEXIT >#76#return; 121158#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 121159#factENTRY ~n := #in~n; 121184#L25 assume !(~n <= 0); 121170#L26 call #t~ret0 := fact(~n - 1);< 121171#factENTRY ~n := #in~n; 121183#L25 assume ~n <= 0;#res := 1; 121180#factFINAL assume true; 121169#factEXIT >#66#return; 121164#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121160#factFINAL assume true; 121157#factEXIT >#78#return; 121156#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; 121155#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 121154#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 121153#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 121152#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; 120925#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 121104#factENTRY ~n := #in~n; 121133#L25 assume !(~n <= 0); 121128#L26 call #t~ret0 := fact(~n - 1);< 121136#factENTRY ~n := #in~n; 121137#L25 assume !(~n <= 0); 121126#L26 call #t~ret0 := fact(~n - 1);< 121144#factENTRY ~n := #in~n; 121146#L25 assume ~n <= 0;#res := 1; 121145#factFINAL assume true; 121143#factEXIT >#66#return; 121140#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121141#factFINAL assume true; 121125#factEXIT >#66#return; 121130#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121121#factFINAL assume true; 121101#factEXIT >#74#return; 121103#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 121150#factENTRY ~n := #in~n; 121207#L25 assume ~n <= 0;#res := 1; 121206#factFINAL assume true; 121148#factEXIT >#76#return; 121102#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 121104#factENTRY ~n := #in~n; 121133#L25 assume !(~n <= 0); 121128#L26 call #t~ret0 := fact(~n - 1);< 121136#factENTRY ~n := #in~n; 121137#L25 assume !(~n <= 0); 121126#L26 call #t~ret0 := fact(~n - 1);< 121144#factENTRY ~n := #in~n; 121146#L25 assume ~n <= 0;#res := 1; 121145#factFINAL assume true; 121143#factEXIT >#66#return; 121140#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121141#factFINAL assume true; 121125#factEXIT >#66#return; 121130#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121121#factFINAL assume true; 121101#factEXIT >#78#return; 120969#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; 120954#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 120937#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 120932#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 120924#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; 120910#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 120920#factENTRY ~n := #in~n; 120941#L25 assume !(~n <= 0); 120927#L26 call #t~ret0 := fact(~n - 1);< 120931#factENTRY ~n := #in~n; 120940#L25 assume !(~n <= 0); 120929#L26 call #t~ret0 := fact(~n - 1);< 120943#factENTRY ~n := #in~n; 120947#L25 assume ~n <= 0;#res := 1; 120944#factFINAL assume true; 120942#factEXIT >#66#return; 120938#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120939#factFINAL assume true; 120926#factEXIT >#66#return; 120922#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120923#factFINAL assume true; 120909#factEXIT >#74#return; 120912#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 120951#factENTRY ~n := #in~n; 120953#L25 assume ~n <= 0;#res := 1; 120952#factFINAL assume true; 120949#factEXIT >#76#return; 120911#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 120920#factENTRY ~n := #in~n; 120941#L25 assume !(~n <= 0); 120927#L26 call #t~ret0 := fact(~n - 1);< 120931#factENTRY ~n := #in~n; 120940#L25 assume !(~n <= 0); 120929#L26 call #t~ret0 := fact(~n - 1);< 120943#factENTRY ~n := #in~n; 120947#L25 assume ~n <= 0;#res := 1; 120944#factFINAL assume true; 120942#factEXIT >#66#return; 120938#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120939#factFINAL assume true; 120926#factEXIT >#66#return; 120922#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120923#factFINAL assume true; 120909#factEXIT >#78#return; 120849#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; 120850#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 120915#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 120908#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 120906#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 120907#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 121948#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 122030#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; 121922#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 121923#factENTRY ~n := #in~n; 121930#L25 assume !(~n <= 0); 121927#L26 call #t~ret0 := fact(~n - 1);< 121928#factENTRY ~n := #in~n; 121931#L25 assume ~n <= 0;#res := 1; 121929#factFINAL assume true; 121926#factEXIT >#66#return; 121925#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121924#factFINAL assume true; 121920#factEXIT >#68#return; 121907#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 121911#factENTRY ~n := #in~n; 121912#L25 assume ~n <= 0;#res := 1; 121904#factFINAL assume true; 121905#factEXIT >#70#return; 121885#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 121889#factENTRY ~n := #in~n; 121901#L25 assume !(~n <= 0); 121894#L26 call #t~ret0 := fact(~n - 1);< 121896#factENTRY ~n := #in~n; 121902#L25 assume ~n <= 0;#res := 1; 121897#factFINAL assume true; 121892#factEXIT >#66#return; 121891#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121890#factFINAL assume true; 121881#factEXIT >#72#return; 121888#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; 121871#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 121872#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 121865#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 121866#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; 121822#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 121855#factENTRY ~n := #in~n; 121862#L25 assume !(~n <= 0); 121815#L26 call #t~ret0 := fact(~n - 1);< 121818#factENTRY ~n := #in~n; 121828#L25 assume ~n <= 0;#res := 1; 121821#factFINAL assume true; 121811#factEXIT >#66#return; 121817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121859#factFINAL assume true; 121854#factEXIT >#68#return; 121850#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 121852#factENTRY ~n := #in~n; 121861#L25 assume !(~n <= 0); 121814#L26 call #t~ret0 := fact(~n - 1);< 121818#factENTRY ~n := #in~n; 121828#L25 assume ~n <= 0;#res := 1; 121821#factFINAL assume true; 121811#factEXIT >#66#return; 121816#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121858#factFINAL assume true; 121849#factEXIT >#70#return; 121843#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 121845#factENTRY ~n := #in~n; 121857#L25 assume ~n <= 0;#res := 1; 121848#factFINAL assume true; 121841#factEXIT >#72#return; 121839#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; 121835#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 121830#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 121827#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 121820#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; 121805#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 121807#factENTRY ~n := #in~n; 121838#L25 assume !(~n <= 0); 121813#L26 call #t~ret0 := fact(~n - 1);< 121834#factENTRY ~n := #in~n; 121840#L25 assume !(~n <= 0); 121832#L26 call #t~ret0 := fact(~n - 1);< 121837#factENTRY ~n := #in~n; 121847#L25 assume ~n <= 0;#res := 1; 121853#factFINAL assume true; 121846#factEXIT >#66#return; 121833#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121836#factFINAL assume true; 121831#factEXIT >#66#return; 121829#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121826#factFINAL assume true; 121819#factEXIT >#74#return; 121806#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 121809#factENTRY ~n := #in~n; 121860#L25 assume !(~n <= 0); 121812#L26 call #t~ret0 := fact(~n - 1);< 121818#factENTRY ~n := #in~n; 121828#L25 assume ~n <= 0;#res := 1; 121821#factFINAL assume true; 121811#factEXIT >#66#return; 121810#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121808#factFINAL assume true; 121800#factEXIT >#76#return; 121802#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 121807#factENTRY ~n := #in~n; 121838#L25 assume !(~n <= 0); 121813#L26 call #t~ret0 := fact(~n - 1);< 121834#factENTRY ~n := #in~n; 121828#L25 assume ~n <= 0;#res := 1; 121821#factFINAL assume true; 121811#factEXIT >#66#return; 121810#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121808#factFINAL assume true; 121800#factEXIT >#78#return; 120851#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; 120852#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 120858#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 121913#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 121880#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; 120815#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 120816#factENTRY ~n := #in~n; 121985#L25 assume !(~n <= 0); 121971#L26 call #t~ret0 := fact(~n - 1);< 121973#factENTRY ~n := #in~n; 121988#L25 assume !(~n <= 0); 121969#L26 call #t~ret0 := fact(~n - 1);< 121990#factENTRY ~n := #in~n; 121993#L25 assume ~n <= 0;#res := 1; 121991#factFINAL assume true; 121989#factEXIT >#66#return; 121986#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121987#factFINAL assume true; 121968#factEXIT >#66#return; 121966#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121967#factFINAL assume true; 121956#factEXIT >#74#return; 120892#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 120893#factENTRY ~n := #in~n; 122001#L25 assume ~n <= 0;#res := 1; 121999#factFINAL assume true; 121997#factEXIT >#76#return; 121957#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 120816#factENTRY ~n := #in~n; 121985#L25 assume !(~n <= 0); 121971#L26 call #t~ret0 := fact(~n - 1);< 121973#factENTRY ~n := #in~n; 121988#L25 assume !(~n <= 0); 121969#L26 call #t~ret0 := fact(~n - 1);< 121990#factENTRY ~n := #in~n; 121993#L25 assume ~n <= 0;#res := 1; 121991#factFINAL assume true; 121989#factEXIT >#66#return; 121986#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121987#factFINAL assume true; 121968#factEXIT >#66#return; 121966#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121967#factFINAL assume true; 121956#factEXIT >#78#return; 121955#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; 121799#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 121953#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 121952#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 120865#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 120866#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 120904#L42-3 [2021-11-20 06:31:55,391 INFO L793 eck$LassoCheckResult]: Loop: 120904#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 120901#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; 120836#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 120837#factENTRY ~n := #in~n; 121057#L25 assume !(~n <= 0); 120841#L26 call #t~ret0 := fact(~n - 1);< 120840#factENTRY ~n := #in~n; 120842#L25 assume !(~n <= 0); 120881#L26 call #t~ret0 := fact(~n - 1);< 121114#factENTRY ~n := #in~n; 120842#L25 assume !(~n <= 0); 120881#L26 call #t~ret0 := fact(~n - 1);< 121114#factENTRY ~n := #in~n; 120880#L25 assume ~n <= 0;#res := 1; 120882#factFINAL assume true; 121119#factEXIT >#66#return; 121117#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121116#factFINAL assume true; 121115#factEXIT >#66#return; 121112#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121113#factFINAL assume true; 121111#factEXIT >#66#return; 121110#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121108#factFINAL assume true; 121105#factEXIT >#68#return; 120887#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 120888#factENTRY ~n := #in~n; 122072#L25 assume ~n <= 0;#res := 1; 122071#factFINAL assume true; 122070#factEXIT >#70#return; 121261#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 121292#factENTRY ~n := #in~n; 121293#L25 assume !(~n <= 0); 121253#L26 call #t~ret0 := fact(~n - 1);< 121263#factENTRY ~n := #in~n; 121290#L25 assume !(~n <= 0); 121255#L26 call #t~ret0 := fact(~n - 1);< 121269#factENTRY ~n := #in~n; 121279#L25 assume !(~n <= 0); 121256#L26 call #t~ret0 := fact(~n - 1);< 121284#factENTRY ~n := #in~n; 121289#L25 assume ~n <= 0;#res := 1; 121288#factFINAL assume true; 121282#factEXIT >#66#return; 121275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121270#factFINAL assume true; 121266#factEXIT >#66#return; 121259#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121260#factFINAL assume true; 121251#factEXIT >#66#return; 121258#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121327#factFINAL assume true; 121323#factEXIT >#72#return; 121324#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; 122079#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 121756#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 121754#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 121748#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; 121277#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 121294#factENTRY ~n := #in~n; 121276#L25 assume !(~n <= 0); 121252#L26 call #t~ret0 := fact(~n - 1);< 121263#factENTRY ~n := #in~n; 121290#L25 assume !(~n <= 0); 121255#L26 call #t~ret0 := fact(~n - 1);< 121269#factENTRY ~n := #in~n; 121279#L25 assume !(~n <= 0); 121256#L26 call #t~ret0 := fact(~n - 1);< 121284#factENTRY ~n := #in~n; 121289#L25 assume ~n <= 0;#res := 1; 121288#factFINAL assume true; 121282#factEXIT >#66#return; 121275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121270#factFINAL assume true; 121266#factEXIT >#66#return; 121259#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121260#factFINAL assume true; 121251#factEXIT >#66#return; 121257#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121296#factFINAL assume true; 121295#factEXIT >#68#return; 121234#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 121304#factENTRY ~n := #in~n; 121330#L25 assume !(~n <= 0); 121230#L26 call #t~ret0 := fact(~n - 1);< 121236#factENTRY ~n := #in~n; 121238#L25 assume ~n <= 0;#res := 1; 121233#factFINAL assume true; 121226#factEXIT >#66#return; 121231#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121303#factFINAL assume true; 121302#factEXIT >#70#return; 121247#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 121286#factENTRY ~n := #in~n; 121280#L25 assume !(~n <= 0); 121254#L26 call #t~ret0 := fact(~n - 1);< 121269#factENTRY ~n := #in~n; 121279#L25 assume !(~n <= 0); 121256#L26 call #t~ret0 := fact(~n - 1);< 121284#factENTRY ~n := #in~n; 121289#L25 assume ~n <= 0;#res := 1; 121288#factFINAL assume true; 121282#factEXIT >#66#return; 121275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121270#factFINAL assume true; 121266#factEXIT >#66#return; 121268#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121317#factFINAL assume true; 121315#factEXIT >#72#return; 121316#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; 121796#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 121331#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 121301#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 121299#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; 121241#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 121017#factENTRY ~n := #in~n; 121243#L25 assume !(~n <= 0); 121229#L26 call #t~ret0 := fact(~n - 1);< 121232#factENTRY ~n := #in~n; 121279#L25 assume !(~n <= 0); 121256#L26 call #t~ret0 := fact(~n - 1);< 121284#factENTRY ~n := #in~n; 121279#L25 assume !(~n <= 0); 121256#L26 call #t~ret0 := fact(~n - 1);< 121284#factENTRY ~n := #in~n; 121289#L25 assume ~n <= 0;#res := 1; 121288#factFINAL assume true; 121282#factEXIT >#66#return; 121275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121270#factFINAL assume true; 121266#factEXIT >#66#return; 121259#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121260#factFINAL assume true; 121251#factEXIT >#66#return; 121257#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121296#factFINAL assume true; 121295#factEXIT >#68#return; 121245#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 121248#factENTRY ~n := #in~n; 121264#L25 assume !(~n <= 0); 121227#L26 call #t~ret0 := fact(~n - 1);< 121232#factENTRY ~n := #in~n; 121238#L25 assume ~n <= 0;#res := 1; 121233#factFINAL assume true; 121226#factEXIT >#66#return; 121231#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121303#factFINAL assume true; 121302#factEXIT >#70#return; 121219#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 121217#factENTRY ~n := #in~n; 121237#L25 assume !(~n <= 0); 121223#L26 call #t~ret0 := fact(~n - 1);< 121232#factENTRY ~n := #in~n; 121238#L25 assume ~n <= 0;#res := 1; 121233#factFINAL assume true; 121226#factEXIT >#66#return; 121224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121218#factFINAL assume true; 121220#factEXIT >#72#return; 121215#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; 121208#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 121099#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 121097#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 121095#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; 120988#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 121016#factENTRY ~n := #in~n; 121015#L25 assume !(~n <= 0); 120974#L26 call #t~ret0 := fact(~n - 1);< 120976#factENTRY ~n := #in~n; 120985#L25 assume !(~n <= 0); 120991#L26 call #t~ret0 := fact(~n - 1);< 120998#factENTRY ~n := #in~n; 120985#L25 assume !(~n <= 0); 120991#L26 call #t~ret0 := fact(~n - 1);< 120998#factENTRY ~n := #in~n; 121004#L25 assume ~n <= 0;#res := 1; 121013#factFINAL assume true; 121009#factEXIT >#66#return; 121007#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121005#factFINAL assume true; 121000#factEXIT >#66#return; 120994#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120997#factFINAL assume true; 120990#factEXIT >#66#return; 120993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121038#factFINAL assume true; 121027#factEXIT >#68#return; 120819#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 121012#factENTRY ~n := #in~n; 121008#L25 assume !(~n <= 0); 120975#L26 call #t~ret0 := fact(~n - 1);< 120976#factENTRY ~n := #in~n; 120985#L25 assume !(~n <= 0); 120991#L26 call #t~ret0 := fact(~n - 1);< 120998#factENTRY ~n := #in~n; 121004#L25 assume ~n <= 0;#res := 1; 121013#factFINAL assume true; 121009#factEXIT >#66#return; 121007#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121005#factFINAL assume true; 121000#factEXIT >#66#return; 120878#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120830#factFINAL assume true; 120817#factEXIT >#70#return; 120820#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 120827#factENTRY ~n := #in~n; 121109#L25 assume ~n <= 0;#res := 1; 121106#factFINAL assume true; 121098#factEXIT >#72#return; 121096#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; 120867#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 120868#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 120885#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 120876#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; 120813#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 120814#factENTRY ~n := #in~n; 120977#L25 assume !(~n <= 0); 120973#L26 call #t~ret0 := fact(~n - 1);< 120976#factENTRY ~n := #in~n; 120985#L25 assume !(~n <= 0); 120991#L26 call #t~ret0 := fact(~n - 1);< 120998#factENTRY ~n := #in~n; 120985#L25 assume !(~n <= 0); 120991#L26 call #t~ret0 := fact(~n - 1);< 120998#factENTRY ~n := #in~n; 121004#L25 assume ~n <= 0;#res := 1; 121013#factFINAL assume true; 121009#factEXIT >#66#return; 121007#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121005#factFINAL assume true; 121000#factEXIT >#66#return; 120994#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120997#factFINAL assume true; 120990#factEXIT >#66#return; 120986#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120982#factFINAL assume true; 120980#factEXIT >#74#return; 120962#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 120968#factENTRY ~n := #in~n; 121090#L25 assume !(~n <= 0); 121002#L26 call #t~ret0 := fact(~n - 1);< 121006#factENTRY ~n := #in~n; 121014#L25 assume !(~n <= 0); 121010#L26 call #t~ret0 := fact(~n - 1);< 121011#factENTRY ~n := #in~n; 121004#L25 assume ~n <= 0;#res := 1; 121013#factFINAL assume true; 121009#factEXIT >#66#return; 121007#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121005#factFINAL assume true; 121000#factEXIT >#66#return; 121003#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121089#factFINAL assume true; 120961#factEXIT >#76#return; 120958#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 120814#factENTRY ~n := #in~n; 120977#L25 assume !(~n <= 0); 120973#L26 call #t~ret0 := fact(~n - 1);< 120976#factENTRY ~n := #in~n; 120984#L25 assume ~n <= 0;#res := 1; 120981#factFINAL assume true; 120972#factEXIT >#66#return; 120971#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120970#factFINAL assume true; 120955#factEXIT >#78#return; 120959#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; 120856#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 120857#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 120903#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 120863#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 120864#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 120904#L42-3 [2021-11-20 06:31:55,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:31:55,392 INFO L85 PathProgramCache]: Analyzing trace with hash -860596592, now seen corresponding path program 23 times [2021-11-20 06:31:55,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:31:55,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567043303] [2021-11-20 06:31:55,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:31:55,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:31:55,400 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:31:55,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1701841796] [2021-11-20 06:31:55,401 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-20 06:31:55,401 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:31:55,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:31:55,410 INFO L229 MonitoredProcess]: Starting monitored process 196 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:31:55,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (196)] Waiting until timeout for monitored process [2021-11-20 06:31:55,539 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2021-11-20 06:31:55,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:31:55,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-20 06:31:55,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:31:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4772 backedges. 2511 proven. 64 refuted. 0 times theorem prover too weak. 2197 trivial. 0 not checked. [2021-11-20 06:31:56,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:31:57,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4772 backedges. 272 proven. 487 refuted. 0 times theorem prover too weak. 4013 trivial. 0 not checked. [2021-11-20 06:31:57,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:31:57,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567043303] [2021-11-20 06:31:57,639 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:31:57,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701841796] [2021-11-20 06:31:57,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701841796] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:31:57,640 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:31:57,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 18 [2021-11-20 06:31:57,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960879639] [2021-11-20 06:31:57,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:31:57,640 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 06:31:57,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:31:57,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1597408225, now seen corresponding path program 18 times [2021-11-20 06:31:57,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:31:57,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46769787] [2021-11-20 06:31:57,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:31:57,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:31:57,645 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:31:57,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [288670575] [2021-11-20 06:31:57,645 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-20 06:31:57,645 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:31:57,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:31:57,649 INFO L229 MonitoredProcess]: Starting monitored process 197 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:31:57,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (197)] Waiting until timeout for monitored process [2021-11-20 06:31:57,773 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2021-11-20 06:31:57,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:31:57,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-20 06:31:57,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:31:58,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4433 backedges. 1171 proven. 153 refuted. 0 times theorem prover too weak. 3109 trivial. 0 not checked. [2021-11-20 06:31:58,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:32:00,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4433 backedges. 789 proven. 207 refuted. 0 times theorem prover too weak. 3437 trivial. 0 not checked. [2021-11-20 06:32:00,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:32:00,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46769787] [2021-11-20 06:32:00,159 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:32:00,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288670575] [2021-11-20 06:32:00,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288670575] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:32:00,160 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:32:00,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 20 [2021-11-20 06:32:00,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621206610] [2021-11-20 06:32:00,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:32:00,161 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 06:32:00,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:32:00,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-20 06:32:00,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2021-11-20 06:32:00,162 INFO L87 Difference]: Start difference. First operand 1281 states and 1667 transitions. cyclomatic complexity: 407 Second operand has 20 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 20 states have internal predecessors, (57), 13 states have call successors, (20), 2 states have call predecessors, (20), 8 states have return successors, (22), 9 states have call predecessors, (22), 13 states have call successors, (22) [2021-11-20 06:32:01,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:32:01,284 INFO L93 Difference]: Finished difference Result 1484 states and 1965 transitions. [2021-11-20 06:32:01,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-20 06:32:01,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1484 states and 1965 transitions. [2021-11-20 06:32:01,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2021-11-20 06:32:01,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1484 states to 1053 states and 1323 transitions. [2021-11-20 06:32:01,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2021-11-20 06:32:01,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2021-11-20 06:32:01,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1053 states and 1323 transitions. [2021-11-20 06:32:01,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:32:01,299 INFO L681 BuchiCegarLoop]: Abstraction has 1053 states and 1323 transitions. [2021-11-20 06:32:01,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states and 1323 transitions. [2021-11-20 06:32:01,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 942. [2021-11-20 06:32:01,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 630 states have (on average 1.065079365079365) internal successors, (671), 625 states have internal predecessors, (671), 184 states have call successors, (190), 127 states have call predecessors, (190), 128 states have return successors, (294), 189 states have call predecessors, (294), 184 states have call successors, (294) [2021-11-20 06:32:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1155 transitions. [2021-11-20 06:32:01,320 INFO L704 BuchiCegarLoop]: Abstraction has 942 states and 1155 transitions. [2021-11-20 06:32:01,320 INFO L587 BuchiCegarLoop]: Abstraction has 942 states and 1155 transitions. [2021-11-20 06:32:01,320 INFO L425 BuchiCegarLoop]: ======== Iteration 33============ [2021-11-20 06:32:01,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 942 states and 1155 transitions. [2021-11-20 06:32:01,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2021-11-20 06:32:01,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:32:01,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:32:01,326 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [46, 46, 24, 22, 22, 22, 22, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2021-11-20 06:32:01,326 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [46, 46, 31, 31, 31, 31, 15, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:32:01,326 INFO L791 eck$LassoCheckResult]: Stem: 127129#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 127101#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 127102#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 127128#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 127152#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 127476#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 127474#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; 127470#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 127471#factENTRY ~n := #in~n; 127475#L25 assume ~n <= 0;#res := 1; 127473#factFINAL assume true; 127469#factEXIT >#68#return; 127465#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 127466#factENTRY ~n := #in~n; 127472#L25 assume ~n <= 0;#res := 1; 127468#factFINAL assume true; 127464#factEXIT >#70#return; 127461#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 127462#factENTRY ~n := #in~n; 127467#L25 assume ~n <= 0;#res := 1; 127463#factFINAL assume true; 127460#factEXIT >#72#return; 127458#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; 127457#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 127454#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 127450#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 127449#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; 127438#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 127439#factENTRY ~n := #in~n; 127459#L25 assume !(~n <= 0); 127447#L26 call #t~ret0 := fact(~n - 1);< 127448#factENTRY ~n := #in~n; 127456#L25 assume ~n <= 0;#res := 1; 127453#factFINAL assume true; 127446#factEXIT >#66#return; 127445#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127444#factFINAL assume true; 127437#factEXIT >#74#return; 127433#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 127434#factENTRY ~n := #in~n; 127443#L25 assume ~n <= 0;#res := 1; 127436#factFINAL assume true; 127432#factEXIT >#76#return; 127429#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 127430#factENTRY ~n := #in~n; 127452#L25 assume !(~n <= 0); 127441#L26 call #t~ret0 := fact(~n - 1);< 127442#factENTRY ~n := #in~n; 127455#L25 assume ~n <= 0;#res := 1; 127451#factFINAL assume true; 127440#factEXIT >#66#return; 127435#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127431#factFINAL assume true; 127428#factEXIT >#78#return; 127427#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; 127426#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 127425#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 127424#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 127423#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; 127388#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 127422#factENTRY ~n := #in~n; 127489#L25 assume !(~n <= 0); 127482#L26 call #t~ret0 := fact(~n - 1);< 127487#factENTRY ~n := #in~n; 127496#L25 assume !(~n <= 0); 127485#L26 call #t~ret0 := fact(~n - 1);< 127503#factENTRY ~n := #in~n; 127505#L25 assume ~n <= 0;#res := 1; 127504#factFINAL assume true; 127501#factEXIT >#66#return; 127502#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127509#factFINAL assume true; 127507#factEXIT >#66#return; 127506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127477#factFINAL assume true; 127478#factEXIT >#74#return; 127418#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 127419#factENTRY ~n := #in~n; 127421#L25 assume ~n <= 0;#res := 1; 127420#factFINAL assume true; 127417#factEXIT >#76#return; 127414#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 127422#factENTRY ~n := #in~n; 127489#L25 assume !(~n <= 0); 127482#L26 call #t~ret0 := fact(~n - 1);< 127487#factENTRY ~n := #in~n; 127496#L25 assume !(~n <= 0); 127485#L26 call #t~ret0 := fact(~n - 1);< 127503#factENTRY ~n := #in~n; 127505#L25 assume ~n <= 0;#res := 1; 127504#factFINAL assume true; 127501#factEXIT >#66#return; 127502#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127509#factFINAL assume true; 127507#factEXIT >#66#return; 127506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127477#factFINAL assume true; 127478#factEXIT >#78#return; 127411#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; 127407#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 127404#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 127396#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 127387#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; 127378#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 127386#factENTRY ~n := #in~n; 127410#L25 assume !(~n <= 0); 127398#L26 call #t~ret0 := fact(~n - 1);< 127403#factENTRY ~n := #in~n; 127492#L25 assume !(~n <= 0); 127399#L26 call #t~ret0 := fact(~n - 1);< 127516#factENTRY ~n := #in~n; 127518#L25 assume ~n <= 0;#res := 1; 127517#factFINAL assume true; 127514#factEXIT >#66#return; 127515#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127519#factFINAL assume true; 127397#factEXIT >#66#return; 127402#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127384#factFINAL assume true; 127385#factEXIT >#74#return; 127390#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 127391#factENTRY ~n := #in~n; 127393#L25 assume ~n <= 0;#res := 1; 127392#factFINAL assume true; 127389#factEXIT >#76#return; 127377#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 127386#factENTRY ~n := #in~n; 127410#L25 assume !(~n <= 0); 127398#L26 call #t~ret0 := fact(~n - 1);< 127403#factENTRY ~n := #in~n; 127492#L25 assume !(~n <= 0); 127399#L26 call #t~ret0 := fact(~n - 1);< 127516#factENTRY ~n := #in~n; 127518#L25 assume ~n <= 0;#res := 1; 127517#factFINAL assume true; 127514#factEXIT >#66#return; 127515#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127519#factFINAL assume true; 127397#factEXIT >#66#return; 127402#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127384#factFINAL assume true; 127385#factEXIT >#78#return; 127103#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; 127104#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 127511#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 127510#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 127508#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 127117#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 127118#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 127809#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; 127799#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 127800#factENTRY ~n := #in~n; 127807#L25 assume !(~n <= 0); 127804#L26 call #t~ret0 := fact(~n - 1);< 127805#factENTRY ~n := #in~n; 127808#L25 assume ~n <= 0;#res := 1; 127806#factFINAL assume true; 127803#factEXIT >#66#return; 127802#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127801#factFINAL assume true; 127797#factEXIT >#68#return; 127792#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 127147#factENTRY ~n := #in~n; 127813#L25 assume ~n <= 0;#res := 1; 127812#factFINAL assume true; 127790#factEXIT >#70#return; 127781#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 127788#factENTRY ~n := #in~n; 127927#L25 assume !(~n <= 0); 127911#L26 call #t~ret0 := fact(~n - 1);< 127923#factENTRY ~n := #in~n; 127926#L25 assume ~n <= 0;#res := 1; 127925#factFINAL assume true; 127910#factEXIT >#66#return; 127913#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127905#factFINAL assume true; 127780#factEXIT >#72#return; 127778#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; 127777#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 127776#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 127774#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 127772#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; 127632#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 127636#factENTRY ~n := #in~n; 127628#L25 assume !(~n <= 0); 127551#L26 call #t~ret0 := fact(~n - 1);< 127555#factENTRY ~n := #in~n; 127609#L25 assume ~n <= 0;#res := 1; 127606#factFINAL assume true; 127548#factEXIT >#66#return; 127554#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127639#factFINAL assume true; 127638#factEXIT >#68#return; 127607#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 127634#factENTRY ~n := #in~n; 127635#L25 assume !(~n <= 0); 127549#L26 call #t~ret0 := fact(~n - 1);< 127555#factENTRY ~n := #in~n; 127609#L25 assume ~n <= 0;#res := 1; 127606#factFINAL assume true; 127548#factEXIT >#66#return; 127553#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127657#factFINAL assume true; 127656#factEXIT >#70#return; 127650#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 127653#factENTRY ~n := #in~n; 127655#L25 assume ~n <= 0;#res := 1; 127654#factFINAL assume true; 127649#factEXIT >#72#return; 127647#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; 127648#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 127643#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 127644#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 127637#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; 127528#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 127538#factENTRY ~n := #in~n; 127613#L25 assume !(~n <= 0); 127552#L26 call #t~ret0 := fact(~n - 1);< 127834#factENTRY ~n := #in~n; 127981#L25 assume !(~n <= 0); 127078#L26 call #t~ret0 := fact(~n - 1);< 127980#factENTRY ~n := #in~n; 127982#L25 assume ~n <= 0;#res := 1; 128011#factFINAL assume true; 127077#factEXIT >#66#return; 127079#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127979#factFINAL assume true; 127833#factEXIT >#66#return; 127832#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127815#factFINAL assume true; 127770#factEXIT >#74#return; 127529#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 127541#factENTRY ~n := #in~n; 127633#L25 assume !(~n <= 0); 127550#L26 call #t~ret0 := fact(~n - 1);< 127555#factENTRY ~n := #in~n; 127609#L25 assume ~n <= 0;#res := 1; 127606#factFINAL assume true; 127548#factEXIT >#66#return; 127546#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127540#factFINAL assume true; 127527#factEXIT >#76#return; 127530#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 127538#factENTRY ~n := #in~n; 127613#L25 assume !(~n <= 0); 127552#L26 call #t~ret0 := fact(~n - 1);< 127834#factENTRY ~n := #in~n; 127609#L25 assume ~n <= 0;#res := 1; 127606#factFINAL assume true; 127548#factEXIT >#66#return; 127546#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127540#factFINAL assume true; 127527#factEXIT >#78#return; 127520#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; 127113#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 127114#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 127143#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 127132#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; 127133#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 127946#factENTRY ~n := #in~n; 127991#L25 assume !(~n <= 0); 127952#L26 call #t~ret0 := fact(~n - 1);< 127956#factENTRY ~n := #in~n; 127978#L25 assume !(~n <= 0); 127954#L26 call #t~ret0 := fact(~n - 1);< 127986#factENTRY ~n := #in~n; 127990#L25 assume ~n <= 0;#res := 1; 127987#factFINAL assume true; 127984#factEXIT >#66#return; 127985#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127995#factFINAL assume true; 127951#factEXIT >#66#return; 127947#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127948#factFINAL assume true; 127942#factEXIT >#74#return; 127149#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 127150#factENTRY ~n := #in~n; 127997#L25 assume ~n <= 0;#res := 1; 127996#factFINAL assume true; 127994#factEXIT >#76#return; 127943#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 127946#factENTRY ~n := #in~n; 127991#L25 assume !(~n <= 0); 127952#L26 call #t~ret0 := fact(~n - 1);< 127956#factENTRY ~n := #in~n; 127978#L25 assume !(~n <= 0); 127954#L26 call #t~ret0 := fact(~n - 1);< 127986#factENTRY ~n := #in~n; 127990#L25 assume ~n <= 0;#res := 1; 127987#factFINAL assume true; 127984#factEXIT >#66#return; 127985#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127995#factFINAL assume true; 127951#factEXIT >#66#return; 127947#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127948#factFINAL assume true; 127942#factEXIT >#78#return; 127105#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; 127106#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 127513#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 127512#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 127126#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 127127#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 127116#L42-3 [2021-11-20 06:32:01,327 INFO L793 eck$LassoCheckResult]: Loop: 127116#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 127142#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; 127091#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 127092#factENTRY ~n := #in~n; 127192#L25 assume !(~n <= 0); 127188#L26 call #t~ret0 := fact(~n - 1);< 127191#factENTRY ~n := #in~n; 127195#L25 assume !(~n <= 0); 127189#L26 call #t~ret0 := fact(~n - 1);< 127194#factENTRY ~n := #in~n; 127195#L25 assume !(~n <= 0); 127189#L26 call #t~ret0 := fact(~n - 1);< 127194#factENTRY ~n := #in~n; 127196#L25 assume ~n <= 0;#res := 1; 127278#factFINAL assume true; 127277#factEXIT >#66#return; 127276#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127275#factFINAL assume true; 127274#factEXIT >#66#return; 127190#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127193#factFINAL assume true; 127187#factEXIT >#66#return; 127186#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127185#factFINAL assume true; 127184#factEXIT >#68#return; 127144#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 127145#factENTRY ~n := #in~n; 127359#L25 assume ~n <= 0;#res := 1; 127357#factFINAL assume true; 127356#factEXIT >#70#return; 127351#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 127354#factENTRY ~n := #in~n; 127362#L25 assume !(~n <= 0); 127318#L26 call #t~ret0 := fact(~n - 1);< 127326#factENTRY ~n := #in~n; 127361#L25 assume !(~n <= 0); 127319#L26 call #t~ret0 := fact(~n - 1);< 127334#factENTRY ~n := #in~n; 127363#L25 assume !(~n <= 0); 127321#L26 call #t~ret0 := fact(~n - 1);< 127372#factENTRY ~n := #in~n; 127374#L25 assume ~n <= 0;#res := 1; 127373#factFINAL assume true; 127371#factEXIT >#66#return; 127370#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127369#factFINAL assume true; 127367#factEXIT >#66#return; 127324#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127333#factFINAL assume true; 127317#factEXIT >#66#return; 127323#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127358#factFINAL assume true; 127350#factEXIT >#72#return; 127352#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; 127349#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 127347#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 127345#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 127343#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; 127311#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 127329#factENTRY ~n := #in~n; 127330#L25 assume !(~n <= 0); 127322#L26 call #t~ret0 := fact(~n - 1);< 127326#factENTRY ~n := #in~n; 127361#L25 assume !(~n <= 0); 127319#L26 call #t~ret0 := fact(~n - 1);< 127334#factENTRY ~n := #in~n; 127363#L25 assume !(~n <= 0); 127321#L26 call #t~ret0 := fact(~n - 1);< 127372#factENTRY ~n := #in~n; 127374#L25 assume ~n <= 0;#res := 1; 127373#factFINAL assume true; 127371#factEXIT >#66#return; 127370#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127369#factFINAL assume true; 127367#factEXIT >#66#return; 127324#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127333#factFINAL assume true; 127317#factEXIT >#66#return; 127316#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127314#factFINAL assume true; 127310#factEXIT >#68#return; 127300#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 127340#factENTRY ~n := #in~n; 127337#L25 assume !(~n <= 0); 127296#L26 call #t~ret0 := fact(~n - 1);< 127301#factENTRY ~n := #in~n; 127308#L25 assume ~n <= 0;#res := 1; 127299#factFINAL assume true; 127293#factEXIT >#66#return; 127297#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127309#factFINAL assume true; 127303#factEXIT >#70#return; 127306#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 127353#factENTRY ~n := #in~n; 127360#L25 assume !(~n <= 0); 127320#L26 call #t~ret0 := fact(~n - 1);< 127334#factENTRY ~n := #in~n; 127363#L25 assume !(~n <= 0); 127321#L26 call #t~ret0 := fact(~n - 1);< 127372#factENTRY ~n := #in~n; 127374#L25 assume ~n <= 0;#res := 1; 127373#factFINAL assume true; 127371#factEXIT >#66#return; 127370#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127369#factFINAL assume true; 127367#factEXIT >#66#return; 127366#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127365#factFINAL assume true; 127364#factEXIT >#72#return; 127335#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; 127332#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 127331#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 127328#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 127315#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; 127312#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 127177#factENTRY ~n := #in~n; 127327#L25 assume !(~n <= 0); 127295#L26 call #t~ret0 := fact(~n - 1);< 127298#factENTRY ~n := #in~n; 127363#L25 assume !(~n <= 0); 127321#L26 call #t~ret0 := fact(~n - 1);< 127372#factENTRY ~n := #in~n; 127363#L25 assume !(~n <= 0); 127321#L26 call #t~ret0 := fact(~n - 1);< 127372#factENTRY ~n := #in~n; 127374#L25 assume ~n <= 0;#res := 1; 127373#factFINAL assume true; 127371#factEXIT >#66#return; 127370#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127369#factFINAL assume true; 127367#factEXIT >#66#return; 127324#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127333#factFINAL assume true; 127317#factEXIT >#66#return; 127316#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127314#factFINAL assume true; 127310#factEXIT >#68#return; 127305#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 127307#factENTRY ~n := #in~n; 127339#L25 assume !(~n <= 0); 127294#L26 call #t~ret0 := fact(~n - 1);< 127298#factENTRY ~n := #in~n; 127363#L25 assume !(~n <= 0); 127321#L26 call #t~ret0 := fact(~n - 1);< 127372#factENTRY ~n := #in~n; 127374#L25 assume ~n <= 0;#res := 1; 127373#factFINAL assume true; 127371#factEXIT >#66#return; 127370#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127369#factFINAL assume true; 127367#factEXIT >#66#return; 127368#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127383#factFINAL assume true; 127336#factEXIT >#70#return; 127281#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 127292#factENTRY ~n := #in~n; 127288#L25 assume !(~n <= 0); 127290#L26 call #t~ret0 := fact(~n - 1);< 127298#factENTRY ~n := #in~n; 127308#L25 assume ~n <= 0;#res := 1; 127299#factFINAL assume true; 127293#factEXIT >#66#return; 127291#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127286#factFINAL assume true; 127287#factEXIT >#72#return; 127279#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; 127273#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 127270#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 127197#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 127179#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; 127175#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 127176#factENTRY ~n := #in~n; 127182#L25 assume !(~n <= 0); 127167#L26 call #t~ret0 := fact(~n - 1);< 127172#factENTRY ~n := #in~n; 127262#L25 assume !(~n <= 0); 127075#L26 call #t~ret0 := fact(~n - 1);< 127269#factENTRY ~n := #in~n; 127262#L25 assume !(~n <= 0); 127075#L26 call #t~ret0 := fact(~n - 1);< 127269#factENTRY ~n := #in~n; 127139#L25 assume ~n <= 0;#res := 1; 127084#factFINAL assume true; 127074#factEXIT >#66#return; 127076#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127409#factFINAL assume true; 127408#factEXIT >#66#return; 127171#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127285#factFINAL assume true; 127163#factEXIT >#66#return; 127170#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127178#factFINAL assume true; 127174#factEXIT >#68#return; 127157#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 127158#factENTRY ~n := #in~n; 127173#L25 assume !(~n <= 0); 127165#L26 call #t~ret0 := fact(~n - 1);< 127172#factENTRY ~n := #in~n; 127262#L25 assume !(~n <= 0); 127075#L26 call #t~ret0 := fact(~n - 1);< 127269#factENTRY ~n := #in~n; 127262#L25 assume !(~n <= 0); 127075#L26 call #t~ret0 := fact(~n - 1);< 127269#factENTRY ~n := #in~n; 127139#L25 assume ~n <= 0;#res := 1; 127084#factFINAL assume true; 127074#factEXIT >#66#return; 127076#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127409#factFINAL assume true; 127408#factEXIT >#66#return; 127171#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127285#factFINAL assume true; 127163#factEXIT >#66#return; 127162#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127161#factFINAL assume true; 127156#factEXIT >#70#return; 127080#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 127081#factENTRY ~n := #in~n; 127181#L25 assume ~n <= 0;#res := 1; 127180#factFINAL assume true; 127160#factEXIT >#72#return; 127119#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; 127120#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 127123#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 127151#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 127130#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; 127131#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 127210#factENTRY ~n := #in~n; 127221#L25 assume !(~n <= 0); 127168#L26 call #t~ret0 := fact(~n - 1);< 127172#factENTRY ~n := #in~n; 127262#L25 assume !(~n <= 0); 127075#L26 call #t~ret0 := fact(~n - 1);< 127269#factENTRY ~n := #in~n; 127262#L25 assume !(~n <= 0); 127075#L26 call #t~ret0 := fact(~n - 1);< 127269#factENTRY ~n := #in~n; 127139#L25 assume ~n <= 0;#res := 1; 127084#factFINAL assume true; 127074#factEXIT >#66#return; 127076#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127409#factFINAL assume true; 127408#factEXIT >#66#return; 127171#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127285#factFINAL assume true; 127163#factEXIT >#66#return; 127169#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127219#factFINAL assume true; 127211#factEXIT >#74#return; 127212#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 127213#factENTRY ~n := #in~n; 127258#L25 assume !(~n <= 0); 127166#L26 call #t~ret0 := fact(~n - 1);< 127222#factENTRY ~n := #in~n; 127272#L25 assume !(~n <= 0); 127164#L26 call #t~ret0 := fact(~n - 1);< 127271#factENTRY ~n := #in~n; 127262#L25 assume !(~n <= 0); 127075#L26 call #t~ret0 := fact(~n - 1);< 127269#factENTRY ~n := #in~n; 127139#L25 assume ~n <= 0;#res := 1; 127084#factFINAL assume true; 127074#factEXIT >#66#return; 127076#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127409#factFINAL assume true; 127408#factEXIT >#66#return; 127171#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127285#factFINAL assume true; 127163#factEXIT >#66#return; 127169#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127219#factFINAL assume true; 127211#factEXIT >#76#return; 127209#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 127210#factENTRY ~n := #in~n; 127221#L25 assume !(~n <= 0); 127168#L26 call #t~ret0 := fact(~n - 1);< 127172#factENTRY ~n := #in~n; 127261#L25 assume ~n <= 0;#res := 1; 127259#factFINAL assume true; 127220#factEXIT >#66#return; 127218#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127217#factFINAL assume true; 127208#factEXIT >#78#return; 127204#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; 127111#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 127112#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 127183#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 127125#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 127115#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 127116#L42-3 [2021-11-20 06:32:01,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:32:01,328 INFO L85 PathProgramCache]: Analyzing trace with hash -860596592, now seen corresponding path program 24 times [2021-11-20 06:32:01,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:32:01,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815044502] [2021-11-20 06:32:01,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:32:01,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:32:01,336 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:32:01,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2110729491] [2021-11-20 06:32:01,336 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-20 06:32:01,336 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:32:01,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:32:01,346 INFO L229 MonitoredProcess]: Starting monitored process 198 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:32:01,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (198)] Waiting until timeout for monitored process [2021-11-20 06:32:01,499 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2021-11-20 06:32:01,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:32:01,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-20 06:32:01,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:32:02,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4772 backedges. 926 proven. 118 refuted. 0 times theorem prover too weak. 3728 trivial. 0 not checked. [2021-11-20 06:32:02,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:32:04,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4772 backedges. 926 proven. 124 refuted. 0 times theorem prover too weak. 3722 trivial. 0 not checked. [2021-11-20 06:32:04,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:32:04,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815044502] [2021-11-20 06:32:04,147 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:32:04,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110729491] [2021-11-20 06:32:04,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110729491] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:32:04,147 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:32:04,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 20 [2021-11-20 06:32:04,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732580271] [2021-11-20 06:32:04,148 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:32:04,148 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 06:32:04,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:32:04,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2073829095, now seen corresponding path program 19 times [2021-11-20 06:32:04,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:32:04,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563416037] [2021-11-20 06:32:04,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:32:04,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:32:04,153 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:32:04,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1437190173] [2021-11-20 06:32:04,153 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 06:32:04,154 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:32:04,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:32:04,161 INFO L229 MonitoredProcess]: Starting monitored process 199 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:32:04,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (199)] Waiting until timeout for monitored process [2021-11-20 06:32:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:32:04,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-20 06:32:04,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:32:05,422 INFO L134 CoverageAnalysis]: Checked inductivity of 5135 backedges. 1742 proven. 959 refuted. 0 times theorem prover too weak. 2434 trivial. 0 not checked. [2021-11-20 06:32:05,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:32:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5135 backedges. 575 proven. 1260 refuted. 0 times theorem prover too weak. 3300 trivial. 0 not checked. [2021-11-20 06:32:08,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:32:08,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563416037] [2021-11-20 06:32:08,892 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:32:08,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437190173] [2021-11-20 06:32:08,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437190173] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:32:08,892 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:32:08,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24] total 28 [2021-11-20 06:32:08,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26566648] [2021-11-20 06:32:08,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:32:08,893 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 06:32:08,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:32:08,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-20 06:32:08,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2021-11-20 06:32:08,894 INFO L87 Difference]: Start difference. First operand 942 states and 1155 transitions. cyclomatic complexity: 234 Second operand has 28 states, 23 states have (on average 3.130434782608696) internal successors, (72), 26 states have internal predecessors, (72), 18 states have call successors, (30), 2 states have call predecessors, (30), 9 states have return successors, (33), 14 states have call predecessors, (33), 18 states have call successors, (33) [2021-11-20 06:32:12,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:32:12,340 INFO L93 Difference]: Finished difference Result 1490 states and 2030 transitions. [2021-11-20 06:32:12,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-20 06:32:12,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1490 states and 2030 transitions. [2021-11-20 06:32:12,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 158 [2021-11-20 06:32:12,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1490 states to 1275 states and 1726 transitions. [2021-11-20 06:32:12,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2021-11-20 06:32:12,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2021-11-20 06:32:12,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1275 states and 1726 transitions. [2021-11-20 06:32:12,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:32:12,358 INFO L681 BuchiCegarLoop]: Abstraction has 1275 states and 1726 transitions. [2021-11-20 06:32:12,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states and 1726 transitions. [2021-11-20 06:32:12,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1037. [2021-11-20 06:32:12,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 694 states have (on average 1.0605187319884726) internal successors, (736), 692 states have internal predecessors, (736), 200 states have call successors, (203), 136 states have call predecessors, (203), 143 states have return successors, (368), 208 states have call predecessors, (368), 200 states have call successors, (368) [2021-11-20 06:32:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1307 transitions. [2021-11-20 06:32:12,385 INFO L704 BuchiCegarLoop]: Abstraction has 1037 states and 1307 transitions. [2021-11-20 06:32:12,386 INFO L587 BuchiCegarLoop]: Abstraction has 1037 states and 1307 transitions. [2021-11-20 06:32:12,386 INFO L425 BuchiCegarLoop]: ======== Iteration 34============ [2021-11-20 06:32:12,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1037 states and 1307 transitions. [2021-11-20 06:32:12,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 123 [2021-11-20 06:32:12,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:32:12,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:32:12,392 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [50, 50, 26, 26, 26, 26, 24, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2021-11-20 06:32:12,392 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [50, 50, 35, 35, 35, 35, 15, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:32:12,393 INFO L791 eck$LassoCheckResult]: Stem: 133199#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 133173#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 133174#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 133198#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 133184#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 133185#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 133642#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; 133638#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 133639#factENTRY ~n := #in~n; 133643#L25 assume ~n <= 0;#res := 1; 133641#factFINAL assume true; 133637#factEXIT >#68#return; 133633#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 133634#factENTRY ~n := #in~n; 133640#L25 assume ~n <= 0;#res := 1; 133636#factFINAL assume true; 133632#factEXIT >#70#return; 133628#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 133629#factENTRY ~n := #in~n; 133635#L25 assume ~n <= 0;#res := 1; 133631#factFINAL assume true; 133627#factEXIT >#72#return; 133624#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; 133623#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 133622#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 133617#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 133614#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; 133606#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 133607#factENTRY ~n := #in~n; 133626#L25 assume !(~n <= 0); 133620#L26 call #t~ret0 := fact(~n - 1);< 133621#factENTRY ~n := #in~n; 133630#L25 assume ~n <= 0;#res := 1; 133625#factFINAL assume true; 133619#factEXIT >#66#return; 133616#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133613#factFINAL assume true; 133605#factEXIT >#74#return; 133601#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 133602#factENTRY ~n := #in~n; 133611#L25 assume ~n <= 0;#res := 1; 133604#factFINAL assume true; 133600#factEXIT >#76#return; 133597#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 133598#factENTRY ~n := #in~n; 133612#L25 assume !(~n <= 0); 133609#L26 call #t~ret0 := fact(~n - 1);< 133610#factENTRY ~n := #in~n; 133618#L25 assume ~n <= 0;#res := 1; 133615#factFINAL assume true; 133608#factEXIT >#66#return; 133603#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133599#factFINAL assume true; 133596#factEXIT >#78#return; 133595#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; 133594#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 133593#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 133592#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 133591#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; 133582#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 133669#factENTRY ~n := #in~n; 133668#L25 assume !(~n <= 0); 133648#L26 call #t~ret0 := fact(~n - 1);< 133650#factENTRY ~n := #in~n; 133665#L25 assume !(~n <= 0); 133645#L26 call #t~ret0 := fact(~n - 1);< 133663#factENTRY ~n := #in~n; 133666#L25 assume ~n <= 0;#res := 1; 133664#factFINAL assume true; 133661#factEXIT >#66#return; 133662#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133675#factFINAL assume true; 133673#factEXIT >#66#return; 133672#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133671#factFINAL assume true; 133670#factEXIT >#74#return; 133657#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 133658#factENTRY ~n := #in~n; 133660#L25 assume ~n <= 0;#res := 1; 133659#factFINAL assume true; 133656#factEXIT >#76#return; 133580#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 133669#factENTRY ~n := #in~n; 133668#L25 assume !(~n <= 0); 133648#L26 call #t~ret0 := fact(~n - 1);< 133650#factENTRY ~n := #in~n; 133665#L25 assume !(~n <= 0); 133645#L26 call #t~ret0 := fact(~n - 1);< 133663#factENTRY ~n := #in~n; 133666#L25 assume ~n <= 0;#res := 1; 133664#factFINAL assume true; 133661#factEXIT >#66#return; 133662#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133675#factFINAL assume true; 133673#factEXIT >#66#return; 133672#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133671#factFINAL assume true; 133670#factEXIT >#78#return; 133583#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; 134171#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 134170#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 134169#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 133397#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; 133387#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 133389#factENTRY ~n := #in~n; 133408#L25 assume !(~n <= 0); 133402#L26 call #t~ret0 := fact(~n - 1);< 133406#factENTRY ~n := #in~n; 133414#L25 assume !(~n <= 0); 133403#L26 call #t~ret0 := fact(~n - 1);< 133412#factENTRY ~n := #in~n; 133423#L25 assume !(~n <= 0); 133404#L26 call #t~ret0 := fact(~n - 1);< 133421#factENTRY ~n := #in~n; 133424#L25 assume ~n <= 0;#res := 1; 133422#factFINAL assume true; 133420#factEXIT >#66#return; 133419#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133418#factFINAL assume true; 133416#factEXIT >#66#return; 133417#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 134140#factFINAL assume true; 134139#factEXIT >#66#return; 134138#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 134137#factFINAL assume true; 133384#factEXIT >#74#return; 133388#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 133394#factENTRY ~n := #in~n; 133396#L25 assume ~n <= 0;#res := 1; 133395#factFINAL assume true; 133393#factEXIT >#76#return; 133385#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 133389#factENTRY ~n := #in~n; 133408#L25 assume !(~n <= 0); 133402#L26 call #t~ret0 := fact(~n - 1);< 133406#factENTRY ~n := #in~n; 133414#L25 assume !(~n <= 0); 133403#L26 call #t~ret0 := fact(~n - 1);< 133412#factENTRY ~n := #in~n; 133423#L25 assume !(~n <= 0); 133404#L26 call #t~ret0 := fact(~n - 1);< 133421#factENTRY ~n := #in~n; 133424#L25 assume ~n <= 0;#res := 1; 133422#factFINAL assume true; 133420#factEXIT >#66#return; 133419#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133418#factFINAL assume true; 133416#factEXIT >#66#return; 133417#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 134140#factFINAL assume true; 134139#factEXIT >#66#return; 134138#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 134137#factFINAL assume true; 133384#factEXIT >#78#return; 133175#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; 133176#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 133356#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 133354#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 133350#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 133186#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 133187#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 133811#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; 133804#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 133806#factENTRY ~n := #in~n; 133825#L25 assume !(~n <= 0); 133817#L26 call #t~ret0 := fact(~n - 1);< 133818#factENTRY ~n := #in~n; 133823#L25 assume ~n <= 0;#res := 1; 133821#factFINAL assume true; 133816#factEXIT >#66#return; 133814#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133810#factFINAL assume true; 133803#factEXIT >#68#return; 133800#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 133801#factENTRY ~n := #in~n; 133809#L25 assume ~n <= 0;#res := 1; 133789#factFINAL assume true; 133797#factEXIT >#70#return; 133772#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 133775#factENTRY ~n := #in~n; 133786#L25 assume !(~n <= 0); 133780#L26 call #t~ret0 := fact(~n - 1);< 133782#factENTRY ~n := #in~n; 133787#L25 assume ~n <= 0;#res := 1; 133783#factFINAL assume true; 133778#factEXIT >#66#return; 133777#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133776#factFINAL assume true; 133771#factEXIT >#72#return; 133768#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; 133765#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 133762#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 133761#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 133734#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; 133707#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 133727#factENTRY ~n := #in~n; 133731#L25 assume !(~n <= 0); 133695#L26 call #t~ret0 := fact(~n - 1);< 133701#factENTRY ~n := #in~n; 133710#L25 assume ~n <= 0;#res := 1; 133706#factFINAL assume true; 133694#factEXIT >#66#return; 133699#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133729#factFINAL assume true; 133726#factEXIT >#68#return; 133722#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 133723#factENTRY ~n := #in~n; 133732#L25 assume !(~n <= 0); 133696#L26 call #t~ret0 := fact(~n - 1);< 133701#factENTRY ~n := #in~n; 133710#L25 assume ~n <= 0;#res := 1; 133706#factFINAL assume true; 133694#factEXIT >#66#return; 133700#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133725#factFINAL assume true; 133720#factEXIT >#70#return; 133716#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 133718#factENTRY ~n := #in~n; 133724#L25 assume ~n <= 0;#res := 1; 133719#factFINAL assume true; 133714#factEXIT >#72#return; 133717#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; 133747#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 133745#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 133739#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 133737#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; 133681#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 133223#factENTRY ~n := #in~n; 133746#L25 assume !(~n <= 0); 133697#L26 call #t~ret0 := fact(~n - 1);< 133744#factENTRY ~n := #in~n; 133755#L25 assume !(~n <= 0); 133742#L26 call #t~ret0 := fact(~n - 1);< 133754#factENTRY ~n := #in~n; 133759#L25 assume ~n <= 0;#res := 1; 133757#factFINAL assume true; 133753#factEXIT >#66#return; 133752#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133748#factFINAL assume true; 133740#factEXIT >#66#return; 133738#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133736#factFINAL assume true; 133735#factEXIT >#74#return; 133682#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 133692#factENTRY ~n := #in~n; 133751#L25 assume !(~n <= 0); 133698#L26 call #t~ret0 := fact(~n - 1);< 133701#factENTRY ~n := #in~n; 133710#L25 assume ~n <= 0;#res := 1; 133706#factFINAL assume true; 133694#factEXIT >#66#return; 133693#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133691#factFINAL assume true; 133680#factEXIT >#76#return; 133222#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 133223#factENTRY ~n := #in~n; 133746#L25 assume !(~n <= 0); 133697#L26 call #t~ret0 := fact(~n - 1);< 133744#factENTRY ~n := #in~n; 133710#L25 assume ~n <= 0;#res := 1; 133706#factFINAL assume true; 133694#factEXIT >#66#return; 133693#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133691#factFINAL assume true; 133680#factEXIT >#78#return; 133685#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; 134174#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 134173#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 134172#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 133202#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; 133204#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 133141#factENTRY ~n := #in~n; 134082#L25 assume !(~n <= 0); 134076#L26 call #t~ret0 := fact(~n - 1);< 134080#factENTRY ~n := #in~n; 134119#L25 assume !(~n <= 0); 133170#L26 call #t~ret0 := fact(~n - 1);< 133169#factENTRY ~n := #in~n; 133172#L25 assume !(~n <= 0); 134077#L26 call #t~ret0 := fact(~n - 1);< 134106#factENTRY ~n := #in~n; 134108#L25 assume ~n <= 0;#res := 1; 134107#factFINAL assume true; 134105#factEXIT >#66#return; 134104#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 134102#factFINAL assume true; 134100#factEXIT >#66#return; 134101#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 134162#factFINAL assume true; 134151#factEXIT >#66#return; 134074#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 134068#factFINAL assume true; 134069#factEXIT >#74#return; 133218#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 133219#factENTRY ~n := #in~n; 134111#L25 assume ~n <= 0;#res := 1; 134109#factFINAL assume true; 134110#factEXIT >#76#return; 133679#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 133141#factENTRY ~n := #in~n; 134082#L25 assume !(~n <= 0); 134076#L26 call #t~ret0 := fact(~n - 1);< 134080#factENTRY ~n := #in~n; 134119#L25 assume !(~n <= 0); 133170#L26 call #t~ret0 := fact(~n - 1);< 133169#factENTRY ~n := #in~n; 133172#L25 assume !(~n <= 0); 134077#L26 call #t~ret0 := fact(~n - 1);< 134106#factENTRY ~n := #in~n; 134108#L25 assume ~n <= 0;#res := 1; 134107#factFINAL assume true; 134105#factEXIT >#66#return; 134104#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 134102#factFINAL assume true; 134100#factEXIT >#66#return; 134101#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 134162#factFINAL assume true; 134151#factEXIT >#66#return; 134074#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 134068#factFINAL assume true; 134069#factEXIT >#78#return; 133572#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; 133573#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 133566#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 133567#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 133196#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 133197#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 133333#L42-3 [2021-11-20 06:32:12,393 INFO L793 eck$LassoCheckResult]: Loop: 133333#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 133224#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; 133160#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 133161#factENTRY ~n := #in~n; 133349#L25 assume !(~n <= 0); 133143#L26 call #t~ret0 := fact(~n - 1);< 133179#factENTRY ~n := #in~n; 133380#L25 assume !(~n <= 0); 133144#L26 call #t~ret0 := fact(~n - 1);< 133379#factENTRY ~n := #in~n; 133380#L25 assume !(~n <= 0); 133144#L26 call #t~ret0 := fact(~n - 1);< 133379#factENTRY ~n := #in~n; 133381#L25 assume ~n <= 0;#res := 1; 133377#factFINAL assume true; 133378#factEXIT >#66#return; 133382#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133383#factFINAL assume true; 133142#factEXIT >#66#return; 133145#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133153#factFINAL assume true; 133154#factEXIT >#66#return; 133355#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133353#factFINAL assume true; 133237#factEXIT >#68#return; 133212#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 133213#factENTRY ~n := #in~n; 133523#L25 assume ~n <= 0;#res := 1; 133515#factFINAL assume true; 133513#factEXIT >#70#return; 133502#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 133509#factENTRY ~n := #in~n; 133542#L25 assume !(~n <= 0); 133526#L26 call #t~ret0 := fact(~n - 1);< 133540#factENTRY ~n := #in~n; 133554#L25 assume !(~n <= 0); 133518#L26 call #t~ret0 := fact(~n - 1);< 133522#factENTRY ~n := #in~n; 133533#L25 assume !(~n <= 0); 133517#L26 call #t~ret0 := fact(~n - 1);< 133531#factENTRY ~n := #in~n; 133534#L25 assume ~n <= 0;#res := 1; 133532#factFINAL assume true; 133530#factEXIT >#66#return; 133528#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133524#factFINAL assume true; 133516#factEXIT >#66#return; 133521#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 134160#factFINAL assume true; 134159#factEXIT >#66#return; 133537#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133541#factFINAL assume true; 133499#factEXIT >#72#return; 133498#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; 133497#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 133496#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 133495#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 133494#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; 133493#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 133233#factENTRY ~n := #in~n; 133544#L25 assume !(~n <= 0); 133525#L26 call #t~ret0 := fact(~n - 1);< 133540#factENTRY ~n := #in~n; 133554#L25 assume !(~n <= 0); 133518#L26 call #t~ret0 := fact(~n - 1);< 133522#factENTRY ~n := #in~n; 133533#L25 assume !(~n <= 0); 133517#L26 call #t~ret0 := fact(~n - 1);< 133531#factENTRY ~n := #in~n; 133533#L25 assume !(~n <= 0); 133517#L26 call #t~ret0 := fact(~n - 1);< 133531#factENTRY ~n := #in~n; 133534#L25 assume ~n <= 0;#res := 1; 133532#factFINAL assume true; 133530#factEXIT >#66#return; 133528#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133524#factFINAL assume true; 133516#factEXIT >#66#return; 133521#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 134160#factFINAL assume true; 134159#factEXIT >#66#return; 133539#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133553#factFINAL assume true; 133536#factEXIT >#66#return; 133535#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133510#factFINAL assume true; 133511#factEXIT >#68#return; 133448#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 133483#factENTRY ~n := #in~n; 133529#L25 assume !(~n <= 0); 133444#L26 call #t~ret0 := fact(~n - 1);< 133451#factENTRY ~n := #in~n; 133453#L25 assume ~n <= 0;#res := 1; 133447#factFINAL assume true; 133441#factEXIT >#66#return; 133445#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133484#factFINAL assume true; 133482#factEXIT >#70#return; 133475#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 133481#factENTRY ~n := #in~n; 133527#L25 assume !(~n <= 0); 133519#L26 call #t~ret0 := fact(~n - 1);< 133522#factENTRY ~n := #in~n; 133533#L25 assume !(~n <= 0); 133517#L26 call #t~ret0 := fact(~n - 1);< 133531#factENTRY ~n := #in~n; 133534#L25 assume ~n <= 0;#res := 1; 133532#factFINAL assume true; 133530#factEXIT >#66#return; 133528#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133524#factFINAL assume true; 133516#factEXIT >#66#return; 133514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133512#factFINAL assume true; 133474#factEXIT >#72#return; 133479#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; 133470#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 133471#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 133466#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 133467#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; 133460#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 133463#factENTRY ~n := #in~n; 133462#L25 assume !(~n <= 0); 133442#L26 call #t~ret0 := fact(~n - 1);< 133446#factENTRY ~n := #in~n; 133533#L25 assume !(~n <= 0); 133517#L26 call #t~ret0 := fact(~n - 1);< 133531#factENTRY ~n := #in~n; 133533#L25 assume !(~n <= 0); 133517#L26 call #t~ret0 := fact(~n - 1);< 133531#factENTRY ~n := #in~n; 133533#L25 assume !(~n <= 0); 133517#L26 call #t~ret0 := fact(~n - 1);< 133531#factENTRY ~n := #in~n; 133534#L25 assume ~n <= 0;#res := 1; 133532#factFINAL assume true; 133530#factEXIT >#66#return; 133528#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133524#factFINAL assume true; 133516#factEXIT >#66#return; 133521#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 134160#factFINAL assume true; 134159#factEXIT >#66#return; 133539#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133553#factFINAL assume true; 133536#factEXIT >#66#return; 133535#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133510#factFINAL assume true; 133511#factEXIT >#68#return; 133456#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 133464#factENTRY ~n := #in~n; 133454#L25 assume !(~n <= 0); 133443#L26 call #t~ret0 := fact(~n - 1);< 133446#factENTRY ~n := #in~n; 133533#L25 assume !(~n <= 0); 133517#L26 call #t~ret0 := fact(~n - 1);< 133531#factENTRY ~n := #in~n; 133534#L25 assume ~n <= 0;#res := 1; 133532#factFINAL assume true; 133530#factEXIT >#66#return; 133528#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133524#factFINAL assume true; 133516#factEXIT >#66#return; 133520#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133556#factFINAL assume true; 133543#factEXIT >#70#return; 133430#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 133440#factENTRY ~n := #in~n; 133436#L25 assume !(~n <= 0); 133438#L26 call #t~ret0 := fact(~n - 1);< 133446#factENTRY ~n := #in~n; 133453#L25 assume ~n <= 0;#res := 1; 133447#factFINAL assume true; 133441#factEXIT >#66#return; 133439#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133433#factFINAL assume true; 133435#factEXIT >#72#return; 133555#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; 134163#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 134147#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 134146#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 134145#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; 133232#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 133234#factENTRY ~n := #in~n; 133318#L25 assume !(~n <= 0); 133168#L26 call #t~ret0 := fact(~n - 1);< 133164#factENTRY ~n := #in~n; 133166#L25 assume !(~n <= 0); 133280#L26 call #t~ret0 := fact(~n - 1);< 133296#factENTRY ~n := #in~n; 133313#L25 assume !(~n <= 0); 133281#L26 call #t~ret0 := fact(~n - 1);< 133312#factENTRY ~n := #in~n; 133313#L25 assume !(~n <= 0); 133281#L26 call #t~ret0 := fact(~n - 1);< 133312#factENTRY ~n := #in~n; 133319#L25 assume ~n <= 0;#res := 1; 133316#factFINAL assume true; 133311#factEXIT >#66#return; 133309#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133308#factFINAL assume true; 133303#factEXIT >#66#return; 133299#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133295#factFINAL assume true; 133279#factEXIT >#66#return; 133282#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133410#factFINAL assume true; 133287#factEXIT >#66#return; 133288#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133330#factFINAL assume true; 133331#factEXIT >#68#return; 133228#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 133229#factENTRY ~n := #in~n; 133320#L25 assume !(~n <= 0); 133263#L26 call #t~ret0 := fact(~n - 1);< 133265#factENTRY ~n := #in~n; 133313#L25 assume !(~n <= 0); 133281#L26 call #t~ret0 := fact(~n - 1);< 133312#factENTRY ~n := #in~n; 133313#L25 assume !(~n <= 0); 133281#L26 call #t~ret0 := fact(~n - 1);< 133312#factENTRY ~n := #in~n; 133319#L25 assume ~n <= 0;#res := 1; 133316#factFINAL assume true; 133311#factEXIT >#66#return; 133309#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133308#factFINAL assume true; 133303#factEXIT >#66#return; 133299#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133295#factFINAL assume true; 133279#factEXIT >#66#return; 133284#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133329#factFINAL assume true; 133227#factEXIT >#70#return; 133149#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 133150#factENTRY ~n := #in~n; 133206#L25 assume ~n <= 0;#res := 1; 133207#factFINAL assume true; 133328#factEXIT >#72#return; 133192#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; 133188#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 133189#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 133209#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 133200#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; 133201#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 133259#factENTRY ~n := #in~n; 133327#L25 assume !(~n <= 0); 133167#L26 call #t~ret0 := fact(~n - 1);< 133164#factENTRY ~n := #in~n; 133166#L25 assume !(~n <= 0); 133280#L26 call #t~ret0 := fact(~n - 1);< 133296#factENTRY ~n := #in~n; 133313#L25 assume !(~n <= 0); 133281#L26 call #t~ret0 := fact(~n - 1);< 133312#factENTRY ~n := #in~n; 133313#L25 assume !(~n <= 0); 133281#L26 call #t~ret0 := fact(~n - 1);< 133312#factENTRY ~n := #in~n; 133319#L25 assume ~n <= 0;#res := 1; 133316#factFINAL assume true; 133311#factEXIT >#66#return; 133309#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133308#factFINAL assume true; 133303#factEXIT >#66#return; 133299#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133295#factFINAL assume true; 133279#factEXIT >#66#return; 133282#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133410#factFINAL assume true; 133287#factEXIT >#66#return; 133285#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133278#factFINAL assume true; 133258#factEXIT >#74#return; 133251#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 133252#factENTRY ~n := #in~n; 133286#L25 assume !(~n <= 0); 133165#L26 call #t~ret0 := fact(~n - 1);< 133164#factENTRY ~n := #in~n; 133166#L25 assume !(~n <= 0); 133280#L26 call #t~ret0 := fact(~n - 1);< 133296#factENTRY ~n := #in~n; 133313#L25 assume !(~n <= 0); 133281#L26 call #t~ret0 := fact(~n - 1);< 133312#factENTRY ~n := #in~n; 133319#L25 assume ~n <= 0;#res := 1; 133316#factFINAL assume true; 133311#factEXIT >#66#return; 133309#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133308#factFINAL assume true; 133303#factEXIT >#66#return; 133299#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133295#factFINAL assume true; 133279#factEXIT >#66#return; 133277#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133268#factFINAL assume true; 133250#factEXIT >#76#return; 133244#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 133245#factENTRY ~n := #in~n; 133304#L25 assume !(~n <= 0); 133264#L26 call #t~ret0 := fact(~n - 1);< 133265#factENTRY ~n := #in~n; 133305#L25 assume ~n <= 0;#res := 1; 133301#factFINAL assume true; 133262#factEXIT >#66#return; 133257#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133249#factFINAL assume true; 133243#factEXIT >#78#return; 133241#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; 133181#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 133182#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 133226#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 133194#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 133195#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 133333#L42-3 [2021-11-20 06:32:12,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:32:12,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1711259888, now seen corresponding path program 25 times [2021-11-20 06:32:12,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:32:12,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23745909] [2021-11-20 06:32:12,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:32:12,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:32:12,402 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:32:12,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [103854595] [2021-11-20 06:32:12,402 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 06:32:12,403 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:32:12,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:32:12,418 INFO L229 MonitoredProcess]: Starting monitored process 200 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:32:12,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (200)] Waiting until timeout for monitored process [2021-11-20 06:32:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:32:12,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-20 06:32:12,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:32:13,175 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 1114 proven. 8 refuted. 0 times theorem prover too weak. 4598 trivial. 0 not checked. [2021-11-20 06:32:13,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:32:13,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 240 proven. 20 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2021-11-20 06:32:13,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:32:13,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23745909] [2021-11-20 06:32:13,911 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:32:13,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103854595] [2021-11-20 06:32:13,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103854595] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:32:13,912 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:32:13,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-11-20 06:32:13,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18444736] [2021-11-20 06:32:13,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:32:13,913 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 06:32:13,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:32:13,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1440370439, now seen corresponding path program 20 times [2021-11-20 06:32:13,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:32:13,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051373308] [2021-11-20 06:32:13,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:32:13,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:32:13,920 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:32:13,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [865632359] [2021-11-20 06:32:13,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:32:13,921 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:32:13,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:32:13,926 INFO L229 MonitoredProcess]: Starting monitored process 201 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:32:13,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (201)] Waiting until timeout for monitored process [2021-11-20 06:32:14,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:32:14,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:32:14,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-20 06:32:14,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:32:15,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6155 backedges. 2662 proven. 185 refuted. 0 times theorem prover too weak. 3308 trivial. 0 not checked. [2021-11-20 06:32:15,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:32:18,044 INFO L134 CoverageAnalysis]: Checked inductivity of 6155 backedges. 146 proven. 1417 refuted. 0 times theorem prover too weak. 4592 trivial. 0 not checked. [2021-11-20 06:32:18,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:32:18,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051373308] [2021-11-20 06:32:18,045 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:32:18,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865632359] [2021-11-20 06:32:18,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865632359] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:32:18,045 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:32:18,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21] total 24 [2021-11-20 06:32:18,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421801869] [2021-11-20 06:32:18,045 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:32:18,046 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 06:32:18,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:32:18,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-20 06:32:18,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2021-11-20 06:32:18,049 INFO L87 Difference]: Start difference. First operand 1037 states and 1307 transitions. cyclomatic complexity: 290 Second operand has 24 states, 21 states have (on average 3.142857142857143) internal successors, (66), 24 states have internal predecessors, (66), 15 states have call successors, (28), 2 states have call predecessors, (28), 10 states have return successors, (32), 10 states have call predecessors, (32), 15 states have call successors, (32) [2021-11-20 06:32:19,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:32:19,809 INFO L93 Difference]: Finished difference Result 1336 states and 1821 transitions. [2021-11-20 06:32:19,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-20 06:32:19,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1336 states and 1821 transitions. [2021-11-20 06:32:19,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 175 [2021-11-20 06:32:19,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1336 states to 1262 states and 1672 transitions. [2021-11-20 06:32:19,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 179 [2021-11-20 06:32:19,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2021-11-20 06:32:19,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1262 states and 1672 transitions. [2021-11-20 06:32:19,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:32:19,827 INFO L681 BuchiCegarLoop]: Abstraction has 1262 states and 1672 transitions. [2021-11-20 06:32:19,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states and 1672 transitions. [2021-11-20 06:32:19,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1059. [2021-11-20 06:32:19,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 707 states have (on average 1.0579915134370579) internal successors, (748), 703 states have internal predecessors, (748), 207 states have call successors, (210), 144 states have call predecessors, (210), 145 states have return successors, (368), 211 states have call predecessors, (368), 207 states have call successors, (368) [2021-11-20 06:32:19,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1326 transitions. [2021-11-20 06:32:19,873 INFO L704 BuchiCegarLoop]: Abstraction has 1059 states and 1326 transitions. [2021-11-20 06:32:19,873 INFO L587 BuchiCegarLoop]: Abstraction has 1059 states and 1326 transitions. [2021-11-20 06:32:19,874 INFO L425 BuchiCegarLoop]: ======== Iteration 35============ [2021-11-20 06:32:19,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1059 states and 1326 transitions. [2021-11-20 06:32:19,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 119 [2021-11-20 06:32:19,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:32:19,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:32:19,880 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [50, 50, 26, 26, 26, 26, 24, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2021-11-20 06:32:19,880 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [48, 48, 33, 33, 33, 33, 15, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:32:19,880 INFO L791 eck$LassoCheckResult]: Stem: 139459#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 139433#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 139434#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 139458#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 139444#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 139445#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 139946#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; 139941#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 139942#factENTRY ~n := #in~n; 139945#L25 assume ~n <= 0;#res := 1; 139944#factFINAL assume true; 139940#factEXIT >#68#return; 139936#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 139937#factENTRY ~n := #in~n; 139943#L25 assume ~n <= 0;#res := 1; 139939#factFINAL assume true; 139935#factEXIT >#70#return; 139932#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 139933#factENTRY ~n := #in~n; 139938#L25 assume ~n <= 0;#res := 1; 139934#factFINAL assume true; 139931#factEXIT >#72#return; 139930#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; 139929#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 139927#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 139925#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 139923#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; 139909#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 139910#factENTRY ~n := #in~n; 139920#L25 assume !(~n <= 0); 139918#L26 call #t~ret0 := fact(~n - 1);< 139919#factENTRY ~n := #in~n; 139922#L25 assume ~n <= 0;#res := 1; 139921#factFINAL assume true; 139917#factEXIT >#66#return; 139916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139915#factFINAL assume true; 139908#factEXIT >#74#return; 139904#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 139905#factENTRY ~n := #in~n; 139914#L25 assume ~n <= 0;#res := 1; 139907#factFINAL assume true; 139903#factEXIT >#76#return; 139900#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 139901#factENTRY ~n := #in~n; 139928#L25 assume !(~n <= 0); 139912#L26 call #t~ret0 := fact(~n - 1);< 139913#factENTRY ~n := #in~n; 139926#L25 assume ~n <= 0;#res := 1; 139924#factFINAL assume true; 139911#factEXIT >#66#return; 139906#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139902#factFINAL assume true; 139899#factEXIT >#78#return; 139898#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; 139897#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 139896#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 139895#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 139894#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; 139886#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 139955#factENTRY ~n := #in~n; 139956#L25 assume !(~n <= 0); 139948#L26 call #t~ret0 := fact(~n - 1);< 139953#factENTRY ~n := #in~n; 139958#L25 assume !(~n <= 0); 139950#L26 call #t~ret0 := fact(~n - 1);< 139963#factENTRY ~n := #in~n; 139965#L25 assume ~n <= 0;#res := 1; 139964#factFINAL assume true; 139961#factEXIT >#66#return; 139962#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139976#factFINAL assume true; 139974#factEXIT >#66#return; 139973#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139972#factFINAL assume true; 139970#factEXIT >#74#return; 139967#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 139968#factENTRY ~n := #in~n; 139971#L25 assume ~n <= 0;#res := 1; 139969#factFINAL assume true; 139966#factEXIT >#76#return; 139884#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 139955#factENTRY ~n := #in~n; 139956#L25 assume !(~n <= 0); 139948#L26 call #t~ret0 := fact(~n - 1);< 139953#factENTRY ~n := #in~n; 139958#L25 assume !(~n <= 0); 139950#L26 call #t~ret0 := fact(~n - 1);< 139963#factENTRY ~n := #in~n; 139965#L25 assume ~n <= 0;#res := 1; 139964#factFINAL assume true; 139961#factEXIT >#66#return; 139962#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139976#factFINAL assume true; 139974#factEXIT >#66#return; 139973#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139972#factFINAL assume true; 139970#factEXIT >#78#return; 139880#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; 139878#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 139876#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 139873#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 139874#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; 139748#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 139752#factENTRY ~n := #in~n; 139831#L25 assume !(~n <= 0); 139825#L26 call #t~ret0 := fact(~n - 1);< 139829#factENTRY ~n := #in~n; 139839#L25 assume !(~n <= 0); 139827#L26 call #t~ret0 := fact(~n - 1);< 139835#factENTRY ~n := #in~n; 139836#L25 assume !(~n <= 0); 139826#L26 call #t~ret0 := fact(~n - 1);< 139866#factENTRY ~n := #in~n; 139868#L25 assume ~n <= 0;#res := 1; 139867#factFINAL assume true; 139865#factEXIT >#66#return; 139864#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139863#factFINAL assume true; 139861#factEXIT >#66#return; 139862#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 140454#factFINAL assume true; 140444#factEXIT >#66#return; 140442#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 140440#factFINAL assume true; 139747#factEXIT >#74#return; 139751#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 139754#factENTRY ~n := #in~n; 139846#L25 assume ~n <= 0;#res := 1; 139842#factFINAL assume true; 139753#factEXIT >#76#return; 139749#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 139752#factENTRY ~n := #in~n; 139831#L25 assume !(~n <= 0); 139825#L26 call #t~ret0 := fact(~n - 1);< 139829#factENTRY ~n := #in~n; 139839#L25 assume !(~n <= 0); 139827#L26 call #t~ret0 := fact(~n - 1);< 139835#factENTRY ~n := #in~n; 139836#L25 assume !(~n <= 0); 139826#L26 call #t~ret0 := fact(~n - 1);< 139866#factENTRY ~n := #in~n; 139868#L25 assume ~n <= 0;#res := 1; 139867#factFINAL assume true; 139865#factEXIT >#66#return; 139864#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139863#factFINAL assume true; 139861#factEXIT >#66#return; 139862#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 140454#factFINAL assume true; 140444#factEXIT >#66#return; 140442#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 140440#factFINAL assume true; 139747#factEXIT >#78#return; 139435#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; 139436#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 139854#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 139852#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 139850#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 139446#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 139447#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 140094#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; 140087#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 140089#factENTRY ~n := #in~n; 140105#L25 assume !(~n <= 0); 140101#L26 call #t~ret0 := fact(~n - 1);< 140102#factENTRY ~n := #in~n; 140111#L25 assume ~n <= 0;#res := 1; 140109#factFINAL assume true; 140100#factEXIT >#66#return; 140098#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 140092#factFINAL assume true; 140086#factEXIT >#68#return; 140062#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 140066#factENTRY ~n := #in~n; 140081#L25 assume ~n <= 0;#res := 1; 140080#factFINAL assume true; 140061#factEXIT >#70#return; 140051#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 140055#factENTRY ~n := #in~n; 140107#L25 assume !(~n <= 0); 140068#L26 call #t~ret0 := fact(~n - 1);< 140071#factENTRY ~n := #in~n; 140085#L25 assume ~n <= 0;#res := 1; 140082#factFINAL assume true; 140067#factEXIT >#66#return; 140060#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 140059#factFINAL assume true; 140050#factEXIT >#72#return; 140054#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; 140057#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 140056#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 140049#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 140047#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; 140012#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 140041#factENTRY ~n := #in~n; 140074#L25 assume !(~n <= 0); 140002#L26 call #t~ret0 := fact(~n - 1);< 140007#factENTRY ~n := #in~n; 140015#L25 assume ~n <= 0;#res := 1; 140011#factFINAL assume true; 140000#factEXIT >#66#return; 140006#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 140058#factFINAL assume true; 140040#factEXIT >#68#return; 140020#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 140037#factENTRY ~n := #in~n; 140019#L25 assume !(~n <= 0); 140001#L26 call #t~ret0 := fact(~n - 1);< 140007#factENTRY ~n := #in~n; 140015#L25 assume ~n <= 0;#res := 1; 140011#factFINAL assume true; 140000#factEXIT >#66#return; 140005#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 140039#factFINAL assume true; 140036#factEXIT >#70#return; 140031#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 140034#factENTRY ~n := #in~n; 140038#L25 assume ~n <= 0;#res := 1; 140035#factFINAL assume true; 140030#factEXIT >#72#return; 140033#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; 140166#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 140165#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 140163#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 140124#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; 139988#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 139994#factENTRY ~n := #in~n; 140139#L25 assume !(~n <= 0); 140003#L26 call #t~ret0 := fact(~n - 1);< 140135#factENTRY ~n := #in~n; 140171#L25 assume !(~n <= 0); 140131#L26 call #t~ret0 := fact(~n - 1);< 140169#factENTRY ~n := #in~n; 140205#L25 assume ~n <= 0;#res := 1; 140197#factFINAL assume true; 140168#factEXIT >#66#return; 140167#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 140161#factFINAL assume true; 140157#factEXIT >#66#return; 140155#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 140144#factFINAL assume true; 140140#factEXIT >#74#return; 139989#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 139996#factENTRY ~n := #in~n; 140141#L25 assume !(~n <= 0); 140004#L26 call #t~ret0 := fact(~n - 1);< 140007#factENTRY ~n := #in~n; 140015#L25 assume ~n <= 0;#res := 1; 140011#factFINAL assume true; 140000#factEXIT >#66#return; 139998#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139995#factFINAL assume true; 139985#factEXIT >#76#return; 139986#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 139994#factENTRY ~n := #in~n; 140139#L25 assume !(~n <= 0); 140003#L26 call #t~ret0 := fact(~n - 1);< 140135#factENTRY ~n := #in~n; 140015#L25 assume ~n <= 0;#res := 1; 140011#factFINAL assume true; 140000#factEXIT >#66#return; 139998#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139995#factFINAL assume true; 139985#factEXIT >#78#return; 139991#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; 140460#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 140458#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 140456#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 139462#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; 139464#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 140122#factENTRY ~n := #in~n; 140384#L25 assume !(~n <= 0); 140378#L26 call #t~ret0 := fact(~n - 1);< 140382#factENTRY ~n := #in~n; 140417#L25 assume !(~n <= 0); 140379#L26 call #t~ret0 := fact(~n - 1);< 140402#factENTRY ~n := #in~n; 140418#L25 assume !(~n <= 0); 140380#L26 call #t~ret0 := fact(~n - 1);< 140414#factENTRY ~n := #in~n; 140416#L25 assume ~n <= 0;#res := 1; 140415#factFINAL assume true; 140413#factEXIT >#66#return; 140412#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 140411#factFINAL assume true; 140400#factEXIT >#66#return; 140401#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 140449#factFINAL assume true; 140448#factEXIT >#66#return; 140447#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 140446#factFINAL assume true; 140391#factEXIT >#74#return; 139410#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 139479#factENTRY ~n := #in~n; 140431#L25 assume ~n <= 0;#res := 1; 140432#factFINAL assume true; 139409#factEXIT >#76#return; 139411#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 140122#factENTRY ~n := #in~n; 140384#L25 assume !(~n <= 0); 140378#L26 call #t~ret0 := fact(~n - 1);< 140382#factENTRY ~n := #in~n; 140417#L25 assume !(~n <= 0); 140379#L26 call #t~ret0 := fact(~n - 1);< 140402#factENTRY ~n := #in~n; 140418#L25 assume !(~n <= 0); 140380#L26 call #t~ret0 := fact(~n - 1);< 140414#factENTRY ~n := #in~n; 140416#L25 assume ~n <= 0;#res := 1; 140415#factFINAL assume true; 140413#factEXIT >#66#return; 140412#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 140411#factFINAL assume true; 140400#factEXIT >#66#return; 140401#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 140449#factFINAL assume true; 140448#factEXIT >#66#return; 140447#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 140446#factFINAL assume true; 140391#factEXIT >#78#return; 140119#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; 140118#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 140117#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 140116#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 140115#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 140114#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 139739#L42-3 [2021-11-20 06:32:19,881 INFO L793 eck$LassoCheckResult]: Loop: 139739#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 139499#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; 139423#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 139424#factENTRY ~n := #in~n; 139699#L25 assume !(~n <= 0); 139696#L26 call #t~ret0 := fact(~n - 1);< 139698#factENTRY ~n := #in~n; 139703#L25 assume !(~n <= 0); 139695#L26 call #t~ret0 := fact(~n - 1);< 139702#factENTRY ~n := #in~n; 139703#L25 assume !(~n <= 0); 139695#L26 call #t~ret0 := fact(~n - 1);< 139702#factENTRY ~n := #in~n; 139704#L25 assume ~n <= 0;#res := 1; 139718#factFINAL assume true; 139717#factEXIT >#66#return; 139716#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139715#factFINAL assume true; 139714#factEXIT >#66#return; 139713#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139712#factFINAL assume true; 139710#factEXIT >#66#return; 139711#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139729#factFINAL assume true; 139726#factEXIT >#68#return; 139475#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 139476#factENTRY ~n := #in~n; 139687#L25 assume ~n <= 0;#res := 1; 139684#factFINAL assume true; 139680#factEXIT >#70#return; 139643#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 139674#factENTRY ~n := #in~n; 139671#L25 assume !(~n <= 0); 139614#L26 call #t~ret0 := fact(~n - 1);< 139644#factENTRY ~n := #in~n; 139665#L25 assume !(~n <= 0); 139608#L26 call #t~ret0 := fact(~n - 1);< 139640#factENTRY ~n := #in~n; 139649#L25 assume !(~n <= 0); 139605#L26 call #t~ret0 := fact(~n - 1);< 139629#factENTRY ~n := #in~n; 139648#L25 assume ~n <= 0;#res := 1; 139646#factFINAL assume true; 139627#factEXIT >#66#return; 139625#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139621#factFINAL assume true; 139604#factEXIT >#66#return; 139609#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139637#factFINAL assume true; 139611#factEXIT >#66#return; 139617#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139723#factFINAL assume true; 139659#factEXIT >#72#return; 139663#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; 139731#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 139730#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 139728#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 139727#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; 139598#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 139599#factENTRY ~n := #in~n; 139733#L25 assume !(~n <= 0); 139613#L26 call #t~ret0 := fact(~n - 1);< 139618#factENTRY ~n := #in~n; 139737#L25 assume !(~n <= 0); 139607#L26 call #t~ret0 := fact(~n - 1);< 139622#factENTRY ~n := #in~n; 139650#L25 assume !(~n <= 0); 139628#L26 call #t~ret0 := fact(~n - 1);< 139630#factENTRY ~n := #in~n; 139648#L25 assume ~n <= 0;#res := 1; 139646#factFINAL assume true; 139627#factEXIT >#66#return; 139625#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139621#factFINAL assume true; 139604#factEXIT >#66#return; 139609#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139637#factFINAL assume true; 139611#factEXIT >#66#return; 139603#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139601#factFINAL assume true; 139596#factEXIT >#68#return; 139567#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 139647#factENTRY ~n := #in~n; 139623#L25 assume !(~n <= 0); 139559#L26 call #t~ret0 := fact(~n - 1);< 139569#factENTRY ~n := #in~n; 139594#L25 assume ~n <= 0;#res := 1; 139565#factFINAL assume true; 139556#factEXIT >#66#return; 139561#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139668#factFINAL assume true; 139666#factEXIT >#70#return; 139638#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 139664#factENTRY ~n := #in~n; 139682#L25 assume !(~n <= 0); 139606#L26 call #t~ret0 := fact(~n - 1);< 139640#factENTRY ~n := #in~n; 139649#L25 assume !(~n <= 0); 139605#L26 call #t~ret0 := fact(~n - 1);< 139629#factENTRY ~n := #in~n; 139648#L25 assume ~n <= 0;#res := 1; 139646#factFINAL assume true; 139627#factEXIT >#66#return; 139625#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139621#factFINAL assume true; 139604#factEXIT >#66#return; 139610#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139693#factFINAL assume true; 139689#factEXIT >#72#return; 139690#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; 139722#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 139721#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 139720#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 139719#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; 139597#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 139599#factENTRY ~n := #in~n; 139733#L25 assume !(~n <= 0); 139613#L26 call #t~ret0 := fact(~n - 1);< 139618#factENTRY ~n := #in~n; 139737#L25 assume !(~n <= 0); 139607#L26 call #t~ret0 := fact(~n - 1);< 139622#factENTRY ~n := #in~n; 139650#L25 assume !(~n <= 0); 139628#L26 call #t~ret0 := fact(~n - 1);< 139630#factENTRY ~n := #in~n; 139648#L25 assume ~n <= 0;#res := 1; 139646#factFINAL assume true; 139627#factEXIT >#66#return; 139625#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139621#factFINAL assume true; 139604#factEXIT >#66#return; 139609#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139637#factFINAL assume true; 139611#factEXIT >#66#return; 139603#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139601#factFINAL assume true; 139596#factEXIT >#68#return; 139573#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 139576#factENTRY ~n := #in~n; 139619#L25 assume !(~n <= 0); 139557#L26 call #t~ret0 := fact(~n - 1);< 139562#factENTRY ~n := #in~n; 139649#L25 assume !(~n <= 0); 139605#L26 call #t~ret0 := fact(~n - 1);< 139629#factENTRY ~n := #in~n; 139648#L25 assume ~n <= 0;#res := 1; 139646#factFINAL assume true; 139627#factEXIT >#66#return; 139625#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139621#factFINAL assume true; 139604#factEXIT >#66#return; 139602#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139600#factFINAL assume true; 139580#factEXIT >#70#return; 139532#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 139549#factENTRY ~n := #in~n; 139564#L25 assume !(~n <= 0); 139558#L26 call #t~ret0 := fact(~n - 1);< 139562#factENTRY ~n := #in~n; 139594#L25 assume ~n <= 0;#res := 1; 139565#factFINAL assume true; 139556#factEXIT >#66#return; 139554#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139547#factFINAL assume true; 139531#factEXIT >#72#return; 139452#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; 139453#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 139456#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 139467#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 139468#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; 139483#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 139495#factENTRY ~n := #in~n; 139528#L25 assume !(~n <= 0); 139506#L26 call #t~ret0 := fact(~n - 1);< 139515#factENTRY ~n := #in~n; 139578#L25 assume !(~n <= 0); 139542#L26 call #t~ret0 := fact(~n - 1);< 139543#factENTRY ~n := #in~n; 139555#L25 assume !(~n <= 0); 139551#L26 call #t~ret0 := fact(~n - 1);< 139553#factENTRY ~n := #in~n; 139579#L25 assume ~n <= 0;#res := 1; 139577#factFINAL assume true; 139550#factEXIT >#66#return; 139546#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139545#factFINAL assume true; 139541#factEXIT >#66#return; 139524#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139517#factFINAL assume true; 139503#factEXIT >#66#return; 139501#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139496#factFINAL assume true; 139489#factEXIT >#68#return; 139486#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 139487#factENTRY ~n := #in~n; 139593#L25 assume !(~n <= 0); 139510#L26 call #t~ret0 := fact(~n - 1);< 139582#factENTRY ~n := #in~n; 139581#L25 assume !(~n <= 0); 139504#L26 call #t~ret0 := fact(~n - 1);< 139552#factENTRY ~n := #in~n; 139581#L25 assume !(~n <= 0); 139504#L26 call #t~ret0 := fact(~n - 1);< 139552#factENTRY ~n := #in~n; 139579#L25 assume ~n <= 0;#res := 1; 139577#factFINAL assume true; 139550#factEXIT >#66#return; 139546#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139545#factFINAL assume true; 139541#factEXIT >#66#return; 139524#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139517#factFINAL assume true; 139503#factEXIT >#66#return; 139514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139488#factFINAL assume true; 139485#factEXIT >#70#return; 139412#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 139413#factENTRY ~n := #in~n; 139741#L25 assume ~n <= 0;#res := 1; 139740#factFINAL assume true; 139738#factEXIT >#72#return; 139736#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; 139735#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 139734#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 139732#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 139460#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; 139461#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 139633#factENTRY ~n := #in~n; 139656#L25 assume !(~n <= 0); 139511#L26 call #t~ret0 := fact(~n - 1);< 139520#factENTRY ~n := #in~n; 139725#L25 assume !(~n <= 0); 139509#L26 call #t~ret0 := fact(~n - 1);< 139518#factENTRY ~n := #in~n; 139581#L25 assume !(~n <= 0); 139504#L26 call #t~ret0 := fact(~n - 1);< 139552#factENTRY ~n := #in~n; 139581#L25 assume !(~n <= 0); 139504#L26 call #t~ret0 := fact(~n - 1);< 139552#factENTRY ~n := #in~n; 139579#L25 assume ~n <= 0;#res := 1; 139577#factFINAL assume true; 139550#factEXIT >#66#return; 139546#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139545#factFINAL assume true; 139541#factEXIT >#66#return; 139524#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139517#factFINAL assume true; 139503#factEXIT >#66#return; 139512#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139724#factFINAL assume true; 139525#factEXIT >#66#return; 139526#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139652#factFINAL assume true; 139632#factEXIT >#74#return; 139519#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 139626#factENTRY ~n := #in~n; 139624#L25 assume !(~n <= 0); 139505#L26 call #t~ret0 := fact(~n - 1);< 139520#factENTRY ~n := #in~n; 139725#L25 assume !(~n <= 0); 139509#L26 call #t~ret0 := fact(~n - 1);< 139518#factENTRY ~n := #in~n; 139581#L25 assume !(~n <= 0); 139504#L26 call #t~ret0 := fact(~n - 1);< 139552#factENTRY ~n := #in~n; 139581#L25 assume !(~n <= 0); 139504#L26 call #t~ret0 := fact(~n - 1);< 139552#factENTRY ~n := #in~n; 139579#L25 assume ~n <= 0;#res := 1; 139577#factFINAL assume true; 139550#factEXIT >#66#return; 139546#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139545#factFINAL assume true; 139541#factEXIT >#66#return; 139524#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139517#factFINAL assume true; 139503#factEXIT >#66#return; 139512#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139724#factFINAL assume true; 139525#factEXIT >#66#return; 139526#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139652#factFINAL assume true; 139632#factEXIT >#76#return; 139591#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 139645#factENTRY ~n := #in~n; 139592#L25 assume !(~n <= 0); 139508#L26 call #t~ret0 := fact(~n - 1);< 139582#factENTRY ~n := #in~n; 139583#L25 assume ~n <= 0;#res := 1; 139768#factFINAL assume true; 139767#factEXIT >#66#return; 139766#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139765#factFINAL assume true; 139764#factEXIT >#78#return; 139759#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; 139441#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 139442#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 139484#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 139448#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 139449#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 139739#L42-3 [2021-11-20 06:32:19,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:32:19,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1711259888, now seen corresponding path program 26 times [2021-11-20 06:32:19,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:32:19,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918984486] [2021-11-20 06:32:19,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:32:19,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:32:19,890 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:32:19,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2035309643] [2021-11-20 06:32:19,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:32:19,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:32:19,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:32:19,893 INFO L229 MonitoredProcess]: Starting monitored process 202 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:32:19,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (202)] Waiting until timeout for monitored process [2021-11-20 06:32:20,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:32:20,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:32:20,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-20 06:32:20,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:32:20,623 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 1114 proven. 8 refuted. 0 times theorem prover too weak. 4598 trivial. 0 not checked. [2021-11-20 06:32:20,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:32:21,363 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 240 proven. 20 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2021-11-20 06:32:21,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:32:21,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918984486] [2021-11-20 06:32:21,363 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:32:21,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035309643] [2021-11-20 06:32:21,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035309643] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:32:21,363 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:32:21,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-11-20 06:32:21,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049654071] [2021-11-20 06:32:21,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:32:21,364 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 06:32:21,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:32:21,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1747747417, now seen corresponding path program 21 times [2021-11-20 06:32:21,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:32:21,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112818565] [2021-11-20 06:32:21,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:32:21,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:32:21,369 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:32:21,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1739968878] [2021-11-20 06:32:21,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 06:32:21,369 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:32:21,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:32:21,378 INFO L229 MonitoredProcess]: Starting monitored process 203 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:32:21,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (203)] Waiting until timeout for monitored process [2021-11-20 06:32:21,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-11-20 06:32:21,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:32:21,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 27 conjunts are in the unsatisfiable core [2021-11-20 06:32:21,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:32:22,608 INFO L134 CoverageAnalysis]: Checked inductivity of 5633 backedges. 1201 proven. 266 refuted. 0 times theorem prover too weak. 4166 trivial. 0 not checked. [2021-11-20 06:32:22,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:32:25,975 INFO L134 CoverageAnalysis]: Checked inductivity of 5633 backedges. 1201 proven. 284 refuted. 0 times theorem prover too weak. 4148 trivial. 0 not checked. [2021-11-20 06:32:25,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:32:25,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112818565] [2021-11-20 06:32:25,975 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:32:25,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739968878] [2021-11-20 06:32:25,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739968878] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:32:25,975 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:32:25,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25] total 33 [2021-11-20 06:32:25,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997149268] [2021-11-20 06:32:25,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:32:25,976 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 06:32:25,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:32:25,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-20 06:32:25,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2021-11-20 06:32:25,977 INFO L87 Difference]: Start difference. First operand 1059 states and 1326 transitions. cyclomatic complexity: 287 Second operand has 34 states, 29 states have (on average 2.310344827586207) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (24), 1 states have call predecessors, (24), 9 states have return successors, (28), 15 states have call predecessors, (28), 17 states have call successors, (28) [2021-11-20 06:32:30,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:32:30,897 INFO L93 Difference]: Finished difference Result 1338 states and 1823 transitions. [2021-11-20 06:32:30,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-20 06:32:30,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1338 states and 1823 transitions. [2021-11-20 06:32:30,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2021-11-20 06:32:30,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1338 states to 1312 states and 1786 transitions. [2021-11-20 06:32:30,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 221 [2021-11-20 06:32:30,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 221 [2021-11-20 06:32:30,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1312 states and 1786 transitions. [2021-11-20 06:32:30,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:32:30,914 INFO L681 BuchiCegarLoop]: Abstraction has 1312 states and 1786 transitions. [2021-11-20 06:32:30,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states and 1786 transitions. [2021-11-20 06:32:30,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1170. [2021-11-20 06:32:30,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 776 states have (on average 1.0541237113402062) internal successors, (818), 773 states have internal predecessors, (818), 247 states have call successors, (253), 144 states have call predecessors, (253), 147 states have return successors, (458), 252 states have call predecessors, (458), 247 states have call successors, (458) [2021-11-20 06:32:30,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1529 transitions. [2021-11-20 06:32:30,943 INFO L704 BuchiCegarLoop]: Abstraction has 1170 states and 1529 transitions. [2021-11-20 06:32:30,943 INFO L587 BuchiCegarLoop]: Abstraction has 1170 states and 1529 transitions. [2021-11-20 06:32:30,943 INFO L425 BuchiCegarLoop]: ======== Iteration 36============ [2021-11-20 06:32:30,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1170 states and 1529 transitions. [2021-11-20 06:32:30,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 224 [2021-11-20 06:32:30,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:32:30,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:32:30,950 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [50, 50, 26, 26, 26, 26, 24, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2021-11-20 06:32:30,950 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [54, 54, 39, 39, 39, 39, 15, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:32:30,951 INFO L791 eck$LassoCheckResult]: Stem: 145722#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 145695#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 145696#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 145721#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 145707#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 145708#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 146047#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; 146043#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 146044#factENTRY ~n := #in~n; 146048#L25 assume ~n <= 0;#res := 1; 146046#factFINAL assume true; 146042#factEXIT >#68#return; 146038#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 146039#factENTRY ~n := #in~n; 146045#L25 assume ~n <= 0;#res := 1; 146041#factFINAL assume true; 146037#factEXIT >#70#return; 146034#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 146035#factENTRY ~n := #in~n; 146040#L25 assume ~n <= 0;#res := 1; 146036#factFINAL assume true; 146033#factEXIT >#72#return; 146032#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; 146031#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 146030#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 146026#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 146023#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; 146011#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 146012#factENTRY ~n := #in~n; 146022#L25 assume !(~n <= 0); 146020#L26 call #t~ret0 := fact(~n - 1);< 146021#factENTRY ~n := #in~n; 146029#L25 assume ~n <= 0;#res := 1; 146025#factFINAL assume true; 146019#factEXIT >#66#return; 146018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146017#factFINAL assume true; 146010#factEXIT >#74#return; 146006#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 146007#factENTRY ~n := #in~n; 146016#L25 assume ~n <= 0;#res := 1; 146009#factFINAL assume true; 146005#factEXIT >#76#return; 146002#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 146003#factENTRY ~n := #in~n; 146028#L25 assume !(~n <= 0); 146014#L26 call #t~ret0 := fact(~n - 1);< 146015#factENTRY ~n := #in~n; 146027#L25 assume ~n <= 0;#res := 1; 146024#factFINAL assume true; 146013#factEXIT >#66#return; 146008#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146004#factFINAL assume true; 146001#factEXIT >#78#return; 146000#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; 145999#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 145998#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 145997#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 145996#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; 145988#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 146059#factENTRY ~n := #in~n; 146060#L25 assume !(~n <= 0); 146054#L26 call #t~ret0 := fact(~n - 1);< 146057#factENTRY ~n := #in~n; 146193#L25 assume !(~n <= 0); 146052#L26 call #t~ret0 := fact(~n - 1);< 146198#factENTRY ~n := #in~n; 146200#L25 assume ~n <= 0;#res := 1; 146199#factFINAL assume true; 146196#factEXIT >#66#return; 146197#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146206#factFINAL assume true; 146204#factEXIT >#66#return; 146203#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146202#factFINAL assume true; 146201#factEXIT >#74#return; 146063#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 146064#factENTRY ~n := #in~n; 146066#L25 assume ~n <= 0;#res := 1; 146065#factFINAL assume true; 146062#factEXIT >#76#return; 145989#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 146059#factENTRY ~n := #in~n; 146060#L25 assume !(~n <= 0); 146054#L26 call #t~ret0 := fact(~n - 1);< 146057#factENTRY ~n := #in~n; 146193#L25 assume !(~n <= 0); 146052#L26 call #t~ret0 := fact(~n - 1);< 146198#factENTRY ~n := #in~n; 146200#L25 assume ~n <= 0;#res := 1; 146199#factFINAL assume true; 146196#factEXIT >#66#return; 146197#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146206#factFINAL assume true; 146204#factEXIT >#66#return; 146203#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146202#factFINAL assume true; 146201#factEXIT >#78#return; 145990#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; 146814#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 146813#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 146812#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 146811#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; 145789#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 145793#factENTRY ~n := #in~n; 145973#L25 assume !(~n <= 0); 145970#L26 call #t~ret0 := fact(~n - 1);< 145972#factENTRY ~n := #in~n; 146071#L25 assume !(~n <= 0); 145968#L26 call #t~ret0 := fact(~n - 1);< 146069#factENTRY ~n := #in~n; 146070#L25 assume !(~n <= 0); 145969#L26 call #t~ret0 := fact(~n - 1);< 146077#factENTRY ~n := #in~n; 146079#L25 assume ~n <= 0;#res := 1; 146078#factFINAL assume true; 146076#factEXIT >#66#return; 146075#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146074#factFINAL assume true; 146072#factEXIT >#66#return; 146073#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146806#factFINAL assume true; 146805#factEXIT >#66#return; 146804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146803#factFINAL assume true; 145788#factEXIT >#74#return; 145792#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 145802#factENTRY ~n := #in~n; 145805#L25 assume ~n <= 0;#res := 1; 145804#factFINAL assume true; 145801#factEXIT >#76#return; 145791#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 145793#factENTRY ~n := #in~n; 145973#L25 assume !(~n <= 0); 145970#L26 call #t~ret0 := fact(~n - 1);< 145972#factENTRY ~n := #in~n; 146071#L25 assume !(~n <= 0); 145968#L26 call #t~ret0 := fact(~n - 1);< 146069#factENTRY ~n := #in~n; 146070#L25 assume !(~n <= 0); 145969#L26 call #t~ret0 := fact(~n - 1);< 146077#factENTRY ~n := #in~n; 146079#L25 assume ~n <= 0;#res := 1; 146078#factFINAL assume true; 146076#factEXIT >#66#return; 146075#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146074#factFINAL assume true; 146072#factEXIT >#66#return; 146073#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146806#factFINAL assume true; 146805#factEXIT >#66#return; 146804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146803#factFINAL assume true; 145788#factEXIT >#78#return; 145780#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; 145778#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 145776#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 145758#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 145756#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 145709#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 145710#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 146351#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; 146347#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 146349#factENTRY ~n := #in~n; 146380#L25 assume !(~n <= 0); 146377#L26 call #t~ret0 := fact(~n - 1);< 146378#factENTRY ~n := #in~n; 146391#L25 assume ~n <= 0;#res := 1; 146389#factFINAL assume true; 146376#factEXIT >#66#return; 146374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146372#factFINAL assume true; 146346#factEXIT >#68#return; 146313#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 146316#factENTRY ~n := #in~n; 146323#L25 assume ~n <= 0;#res := 1; 146319#factFINAL assume true; 146311#factEXIT >#70#return; 146295#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 146299#factENTRY ~n := #in~n; 146329#L25 assume !(~n <= 0); 146325#L26 call #t~ret0 := fact(~n - 1);< 146328#factENTRY ~n := #in~n; 146334#L25 assume ~n <= 0;#res := 1; 146331#factFINAL assume true; 146324#factEXIT >#66#return; 146321#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146310#factFINAL assume true; 146294#factEXIT >#72#return; 146292#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; 146290#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 146288#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 146287#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 146286#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; 146283#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 146284#factENTRY ~n := #in~n; 146322#L25 assume !(~n <= 0); 146305#L26 call #t~ret0 := fact(~n - 1);< 146308#factENTRY ~n := #in~n; 146318#L25 assume ~n <= 0;#res := 1; 146317#factFINAL assume true; 146301#factEXIT >#66#return; 146307#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146309#factFINAL assume true; 146281#factEXIT >#68#return; 146275#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 146277#factENTRY ~n := #in~n; 146320#L25 assume !(~n <= 0); 146303#L26 call #t~ret0 := fact(~n - 1);< 146308#factENTRY ~n := #in~n; 146318#L25 assume ~n <= 0;#res := 1; 146317#factFINAL assume true; 146301#factEXIT >#66#return; 146280#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146279#factFINAL assume true; 146274#factEXIT >#70#return; 146269#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 146271#factENTRY ~n := #in~n; 146278#L25 assume ~n <= 0;#res := 1; 146273#factFINAL assume true; 146267#factEXIT >#72#return; 146254#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; 146245#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 146233#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 146228#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 146224#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; 146216#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 146220#factENTRY ~n := #in~n; 146357#L25 assume !(~n <= 0); 146304#L26 call #t~ret0 := fact(~n - 1);< 146356#factENTRY ~n := #in~n; 146365#L25 assume !(~n <= 0); 146353#L26 call #t~ret0 := fact(~n - 1);< 146364#factENTRY ~n := #in~n; 146368#L25 assume ~n <= 0;#res := 1; 146366#factFINAL assume true; 146363#factEXIT >#66#return; 146362#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146358#factFINAL assume true; 146352#factEXIT >#66#return; 146350#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146345#factFINAL assume true; 146221#factEXIT >#74#return; 146218#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 146213#factENTRY ~n := #in~n; 146361#L25 assume !(~n <= 0); 146302#L26 call #t~ret0 := fact(~n - 1);< 146308#factENTRY ~n := #in~n; 146318#L25 assume ~n <= 0;#res := 1; 146317#factFINAL assume true; 146301#factEXIT >#66#return; 146306#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146214#factFINAL assume true; 146219#factEXIT >#76#return; 146215#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 146220#factENTRY ~n := #in~n; 146357#L25 assume !(~n <= 0); 146304#L26 call #t~ret0 := fact(~n - 1);< 146356#factENTRY ~n := #in~n; 146318#L25 assume ~n <= 0;#res := 1; 146317#factFINAL assume true; 146301#factEXIT >#66#return; 146306#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146214#factFINAL assume true; 146219#factEXIT >#78#return; 146222#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; 146815#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 146649#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 146635#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 146629#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; 146403#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 146190#factENTRY ~n := #in~n; 146613#L25 assume !(~n <= 0); 146593#L26 call #t~ret0 := fact(~n - 1);< 146608#factENTRY ~n := #in~n; 146606#L25 assume !(~n <= 0); 146586#L26 call #t~ret0 := fact(~n - 1);< 146589#factENTRY ~n := #in~n; 146603#L25 assume !(~n <= 0); 146585#L26 call #t~ret0 := fact(~n - 1);< 146602#factENTRY ~n := #in~n; 146605#L25 assume ~n <= 0;#res := 1; 146604#factFINAL assume true; 146601#factEXIT >#66#return; 146599#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146592#factFINAL assume true; 146584#factEXIT >#66#return; 146588#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146818#factFINAL assume true; 146817#factEXIT >#66#return; 146558#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146559#factFINAL assume true; 146400#factEXIT >#74#return; 146208#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 146211#factENTRY ~n := #in~n; 146564#L25 assume ~n <= 0;#res := 1; 146560#factFINAL assume true; 146207#factEXIT >#76#return; 146189#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 146190#factENTRY ~n := #in~n; 146613#L25 assume !(~n <= 0); 146593#L26 call #t~ret0 := fact(~n - 1);< 146608#factENTRY ~n := #in~n; 146606#L25 assume !(~n <= 0); 146586#L26 call #t~ret0 := fact(~n - 1);< 146589#factENTRY ~n := #in~n; 146603#L25 assume !(~n <= 0); 146585#L26 call #t~ret0 := fact(~n - 1);< 146602#factENTRY ~n := #in~n; 146605#L25 assume ~n <= 0;#res := 1; 146604#factFINAL assume true; 146601#factEXIT >#66#return; 146599#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146592#factFINAL assume true; 146584#factEXIT >#66#return; 146588#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146818#factFINAL assume true; 146817#factEXIT >#66#return; 146558#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146559#factFINAL assume true; 146400#factEXIT >#78#return; 146404#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; 146573#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 146383#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 146382#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 146381#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 146379#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 145750#L42-3 [2021-11-20 06:32:30,951 INFO L793 eck$LassoCheckResult]: Loop: 145750#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 145751#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; 145923#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 145924#factENTRY ~n := #in~n; 145952#L25 assume !(~n <= 0); 145937#L26 call #t~ret0 := fact(~n - 1);< 145939#factENTRY ~n := #in~n; 145954#L25 assume !(~n <= 0); 145936#L26 call #t~ret0 := fact(~n - 1);< 145951#factENTRY ~n := #in~n; 145954#L25 assume !(~n <= 0); 145936#L26 call #t~ret0 := fact(~n - 1);< 145951#factENTRY ~n := #in~n; 145954#L25 assume !(~n <= 0); 145936#L26 call #t~ret0 := fact(~n - 1);< 145951#factENTRY ~n := #in~n; 145956#L25 assume ~n <= 0;#res := 1; 145960#factFINAL assume true; 145959#factEXIT >#66#return; 145958#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 145957#factFINAL assume true; 145955#factEXIT >#66#return; 145953#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 145950#factFINAL assume true; 145935#factEXIT >#66#return; 145938#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 145962#factFINAL assume true; 145940#factEXIT >#66#return; 145934#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 145932#factFINAL assume true; 145930#factEXIT >#68#return; 145916#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 145918#factENTRY ~n := #in~n; 145929#L25 assume ~n <= 0;#res := 1; 145921#factFINAL assume true; 145915#factEXIT >#70#return; 145846#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 145891#factENTRY ~n := #in~n; 145888#L25 assume !(~n <= 0); 145840#L26 call #t~ret0 := fact(~n - 1);< 145849#factENTRY ~n := #in~n; 145877#L25 assume !(~n <= 0); 145837#L26 call #t~ret0 := fact(~n - 1);< 145857#factENTRY ~n := #in~n; 145878#L25 assume !(~n <= 0); 145836#L26 call #t~ret0 := fact(~n - 1);< 145870#factENTRY ~n := #in~n; 145874#L25 assume ~n <= 0;#res := 1; 145873#factFINAL assume true; 145868#factEXIT >#66#return; 145865#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 145859#factFINAL assume true; 145853#factEXIT >#66#return; 145850#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 145844#factFINAL assume true; 145834#factEXIT >#66#return; 145842#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 145963#factFINAL assume true; 145899#factEXIT >#72#return; 145904#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; 145946#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 145944#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 145943#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 145942#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; 145815#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 145832#factENTRY ~n := #in~n; 145880#L25 assume !(~n <= 0); 145835#L26 call #t~ret0 := fact(~n - 1);< 145849#factENTRY ~n := #in~n; 145877#L25 assume !(~n <= 0); 145837#L26 call #t~ret0 := fact(~n - 1);< 145857#factENTRY ~n := #in~n; 145878#L25 assume !(~n <= 0); 145836#L26 call #t~ret0 := fact(~n - 1);< 145870#factENTRY ~n := #in~n; 145878#L25 assume !(~n <= 0); 145836#L26 call #t~ret0 := fact(~n - 1);< 145870#factENTRY ~n := #in~n; 145874#L25 assume ~n <= 0;#res := 1; 145873#factFINAL assume true; 145868#factEXIT >#66#return; 145865#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 145859#factFINAL assume true; 145853#factEXIT >#66#return; 145850#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 145844#factFINAL assume true; 145834#factEXIT >#66#return; 145841#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 145974#factFINAL assume true; 145927#factEXIT >#66#return; 145926#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 145925#factFINAL assume true; 145920#factEXIT >#68#return; 145795#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 145914#factENTRY ~n := #in~n; 145941#L25 assume !(~n <= 0); 145782#L26 call #t~ret0 := fact(~n - 1);< 145799#factENTRY ~n := #in~n; 145803#L25 assume ~n <= 0;#res := 1; 145794#factFINAL assume true; 145781#factEXIT >#66#return; 145786#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 145919#factFINAL assume true; 145913#factEXIT >#70#return; 145863#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 145872#factENTRY ~n := #in~n; 145866#L25 assume !(~n <= 0); 145838#L26 call #t~ret0 := fact(~n - 1);< 145857#factENTRY ~n := #in~n; 145878#L25 assume !(~n <= 0); 145836#L26 call #t~ret0 := fact(~n - 1);< 145870#factENTRY ~n := #in~n; 145874#L25 assume ~n <= 0;#res := 1; 145873#factFINAL assume true; 145868#factEXIT >#66#return; 145865#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 145859#factFINAL assume true; 145853#factEXIT >#66#return; 145855#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 145909#factFINAL assume true; 145894#factEXIT >#72#return; 145898#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; 145949#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 145948#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 145947#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 145945#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; 145812#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 145830#factENTRY ~n := #in~n; 145887#L25 assume !(~n <= 0); 145783#L26 call #t~ret0 := fact(~n - 1);< 145787#factENTRY ~n := #in~n; 145878#L25 assume !(~n <= 0); 145836#L26 call #t~ret0 := fact(~n - 1);< 145870#factENTRY ~n := #in~n; 145878#L25 assume !(~n <= 0); 145836#L26 call #t~ret0 := fact(~n - 1);< 145870#factENTRY ~n := #in~n; 145878#L25 assume !(~n <= 0); 145836#L26 call #t~ret0 := fact(~n - 1);< 145870#factENTRY ~n := #in~n; 145874#L25 assume ~n <= 0;#res := 1; 145873#factFINAL assume true; 145868#factEXIT >#66#return; 145865#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 145859#factFINAL assume true; 145853#factEXIT >#66#return; 145850#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 145844#factFINAL assume true; 145834#factEXIT >#66#return; 145841#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 145974#factFINAL assume true; 145927#factEXIT >#66#return; 145926#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 145925#factFINAL assume true; 145920#factEXIT >#68#return; 145664#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 145809#factENTRY ~n := #in~n; 145851#L25 assume !(~n <= 0); 145785#L26 call #t~ret0 := fact(~n - 1);< 145787#factENTRY ~n := #in~n; 145878#L25 assume !(~n <= 0); 145836#L26 call #t~ret0 := fact(~n - 1);< 145870#factENTRY ~n := #in~n; 145878#L25 assume !(~n <= 0); 145836#L26 call #t~ret0 := fact(~n - 1);< 145870#factENTRY ~n := #in~n; 145878#L25 assume !(~n <= 0); 145836#L26 call #t~ret0 := fact(~n - 1);< 145870#factENTRY ~n := #in~n; 145874#L25 assume ~n <= 0;#res := 1; 145873#factFINAL assume true; 145868#factEXIT >#66#return; 145865#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 145859#factFINAL assume true; 145853#factEXIT >#66#return; 145850#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 145844#factFINAL assume true; 145834#factEXIT >#66#return; 145841#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 145974#factFINAL assume true; 145927#factEXIT >#66#return; 145928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146727#factFINAL assume true; 146728#factEXIT >#70#return; 145762#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 145806#factENTRY ~n := #in~n; 145807#L25 assume ~n <= 0;#res := 1; 146729#factFINAL assume true; 146757#factEXIT >#72#return; 145772#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; 146756#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 146752#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 146753#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 146186#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; 145813#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 146087#factENTRY ~n := #in~n; 146113#L25 assume !(~n <= 0); 146100#L26 call #t~ret0 := fact(~n - 1);< 146105#factENTRY ~n := #in~n; 146136#L25 assume !(~n <= 0); 146095#L26 call #t~ret0 := fact(~n - 1);< 146115#factENTRY ~n := #in~n; 146129#L25 assume !(~n <= 0); 146096#L26 call #t~ret0 := fact(~n - 1);< 146126#factENTRY ~n := #in~n; 146129#L25 assume !(~n <= 0); 146096#L26 call #t~ret0 := fact(~n - 1);< 146126#factENTRY ~n := #in~n; 146131#L25 assume ~n <= 0;#res := 1; 146128#factFINAL assume true; 146124#factEXIT >#66#return; 146123#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146121#factFINAL assume true; 146118#factEXIT >#66#return; 146117#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146114#factFINAL assume true; 146106#factEXIT >#66#return; 146102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146132#factFINAL assume true; 146094#factEXIT >#66#return; 146091#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146088#factFINAL assume true; 146082#factEXIT >#68#return; 145735#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 145736#factENTRY ~n := #in~n; 146141#L25 assume !(~n <= 0); 146101#L26 call #t~ret0 := fact(~n - 1);< 146137#factENTRY ~n := #in~n; 146129#L25 assume !(~n <= 0); 146096#L26 call #t~ret0 := fact(~n - 1);< 146126#factENTRY ~n := #in~n; 146129#L25 assume !(~n <= 0); 146096#L26 call #t~ret0 := fact(~n - 1);< 146126#factENTRY ~n := #in~n; 146129#L25 assume !(~n <= 0); 146096#L26 call #t~ret0 := fact(~n - 1);< 146126#factENTRY ~n := #in~n; 146131#L25 assume ~n <= 0;#res := 1; 146128#factFINAL assume true; 146124#factEXIT >#66#return; 146123#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146121#factFINAL assume true; 146118#factEXIT >#66#return; 146117#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146114#factFINAL assume true; 146106#factEXIT >#66#return; 146102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146132#factFINAL assume true; 146094#factEXIT >#66#return; 146104#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146796#factFINAL assume true; 146795#factEXIT >#70#return; 145653#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 145654#factENTRY ~n := #in~n; 145691#L25 assume ~n <= 0;#res := 1; 145734#factFINAL assume true; 146745#factEXIT >#72#return; 145711#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; 145712#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 145715#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 146740#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 146741#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; 146133#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 146142#factENTRY ~n := #in~n; 146135#L25 assume !(~n <= 0); 146097#L26 call #t~ret0 := fact(~n - 1);< 146105#factENTRY ~n := #in~n; 146136#L25 assume !(~n <= 0); 146095#L26 call #t~ret0 := fact(~n - 1);< 146115#factENTRY ~n := #in~n; 146129#L25 assume !(~n <= 0); 146096#L26 call #t~ret0 := fact(~n - 1);< 146126#factENTRY ~n := #in~n; 146129#L25 assume !(~n <= 0); 146096#L26 call #t~ret0 := fact(~n - 1);< 146126#factENTRY ~n := #in~n; 146131#L25 assume ~n <= 0;#res := 1; 146128#factFINAL assume true; 146124#factEXIT >#66#return; 146123#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146121#factFINAL assume true; 146118#factEXIT >#66#return; 146117#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146114#factFINAL assume true; 146106#factEXIT >#66#return; 146102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146132#factFINAL assume true; 146094#factEXIT >#66#return; 146103#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146148#factFINAL assume true; 146147#factEXIT >#74#return; 145676#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 146145#factENTRY ~n := #in~n; 146143#L25 assume !(~n <= 0); 146098#L26 call #t~ret0 := fact(~n - 1);< 146105#factENTRY ~n := #in~n; 146136#L25 assume !(~n <= 0); 146095#L26 call #t~ret0 := fact(~n - 1);< 146115#factENTRY ~n := #in~n; 146129#L25 assume !(~n <= 0); 146096#L26 call #t~ret0 := fact(~n - 1);< 146126#factENTRY ~n := #in~n; 146129#L25 assume !(~n <= 0); 146096#L26 call #t~ret0 := fact(~n - 1);< 146126#factENTRY ~n := #in~n; 146131#L25 assume ~n <= 0;#res := 1; 146128#factFINAL assume true; 146124#factEXIT >#66#return; 146123#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146121#factFINAL assume true; 146118#factEXIT >#66#return; 146117#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146114#factFINAL assume true; 146106#factEXIT >#66#return; 146102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146132#factFINAL assume true; 146094#factEXIT >#66#return; 146103#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146148#factFINAL assume true; 146147#factEXIT >#76#return; 146139#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 146146#factENTRY ~n := #in~n; 146144#L25 assume !(~n <= 0); 146099#L26 call #t~ret0 := fact(~n - 1);< 146137#factENTRY ~n := #in~n; 146138#L25 assume ~n <= 0;#res := 1; 146739#factFINAL assume true; 146738#factEXIT >#66#return; 146737#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 146736#factFINAL assume true; 146734#factEXIT >#78#return; 146735#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; 145697#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 145705#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 145748#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 145717#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 145718#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 145750#L42-3 [2021-11-20 06:32:30,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:32:30,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1711259888, now seen corresponding path program 27 times [2021-11-20 06:32:30,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:32:30,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465800760] [2021-11-20 06:32:30,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:32:30,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:32:30,959 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:32:30,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2134980017] [2021-11-20 06:32:30,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 06:32:30,960 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:32:30,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:32:30,973 INFO L229 MonitoredProcess]: Starting monitored process 204 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:32:30,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (204)] Waiting until timeout for monitored process [2021-11-20 06:32:31,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2021-11-20 06:32:31,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:32:31,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-20 06:32:31,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:32:32,151 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 664 proven. 11 refuted. 0 times theorem prover too weak. 5045 trivial. 0 not checked. [2021-11-20 06:32:32,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:32:33,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 664 proven. 15 refuted. 0 times theorem prover too weak. 5041 trivial. 0 not checked. [2021-11-20 06:32:33,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:32:33,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465800760] [2021-11-20 06:32:33,656 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:32:33,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134980017] [2021-11-20 06:32:33,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134980017] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:32:33,656 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:32:33,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 13 [2021-11-20 06:32:33,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329421543] [2021-11-20 06:32:33,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:32:33,657 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 06:32:33,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:32:33,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1640883129, now seen corresponding path program 22 times [2021-11-20 06:32:33,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:32:33,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959724179] [2021-11-20 06:32:33,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:32:33,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:32:33,665 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:32:33,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1187570176] [2021-11-20 06:32:33,665 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 06:32:33,665 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:32:33,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:32:33,673 INFO L229 MonitoredProcess]: Starting monitored process 205 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:32:33,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (205)] Waiting until timeout for monitored process [2021-11-20 06:32:33,864 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 06:32:33,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:32:33,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-20 06:32:33,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:32:34,805 INFO L134 CoverageAnalysis]: Checked inductivity of 7271 backedges. 2267 proven. 112 refuted. 0 times theorem prover too weak. 4892 trivial. 0 not checked. [2021-11-20 06:32:34,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:32:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 7271 backedges. 59 proven. 1769 refuted. 0 times theorem prover too weak. 5443 trivial. 0 not checked. [2021-11-20 06:32:37,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:32:37,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959724179] [2021-11-20 06:32:37,873 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:32:37,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187570176] [2021-11-20 06:32:37,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187570176] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:32:37,873 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:32:37,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20] total 23 [2021-11-20 06:32:37,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887801562] [2021-11-20 06:32:37,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:32:37,874 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 06:32:37,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:32:37,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 06:32:37,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-11-20 06:32:37,875 INFO L87 Difference]: Start difference. First operand 1170 states and 1529 transitions. cyclomatic complexity: 379 Second operand has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 8 states have call successors, (20), 1 states have call predecessors, (20), 4 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2021-11-20 06:32:38,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:32:38,648 INFO L93 Difference]: Finished difference Result 1262 states and 1656 transitions. [2021-11-20 06:32:38,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 06:32:38,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1262 states and 1656 transitions. [2021-11-20 06:32:38,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 252 [2021-11-20 06:32:38,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1262 states to 1258 states and 1645 transitions. [2021-11-20 06:32:38,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2021-11-20 06:32:38,661 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2021-11-20 06:32:38,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1258 states and 1645 transitions. [2021-11-20 06:32:38,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:32:38,661 INFO L681 BuchiCegarLoop]: Abstraction has 1258 states and 1645 transitions. [2021-11-20 06:32:38,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states and 1645 transitions. [2021-11-20 06:32:38,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1198. [2021-11-20 06:32:38,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 788 states have (on average 1.0571065989847717) internal successors, (833), 791 states have internal predecessors, (833), 263 states have call successors, (269), 144 states have call predecessors, (269), 147 states have return successors, (469), 262 states have call predecessors, (469), 263 states have call successors, (469) [2021-11-20 06:32:38,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1571 transitions. [2021-11-20 06:32:38,686 INFO L704 BuchiCegarLoop]: Abstraction has 1198 states and 1571 transitions. [2021-11-20 06:32:38,686 INFO L587 BuchiCegarLoop]: Abstraction has 1198 states and 1571 transitions. [2021-11-20 06:32:38,686 INFO L425 BuchiCegarLoop]: ======== Iteration 37============ [2021-11-20 06:32:38,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1198 states and 1571 transitions. [2021-11-20 06:32:38,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 234 [2021-11-20 06:32:38,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:32:38,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:32:38,692 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [50, 50, 26, 26, 26, 26, 24, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2021-11-20 06:32:38,692 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [48, 48, 33, 33, 33, 33, 15, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:32:38,693 INFO L791 eck$LassoCheckResult]: Stem: 152161#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 152131#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 152132#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 152160#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 152146#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 152147#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 152788#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; 152784#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 152785#factENTRY ~n := #in~n; 152789#L25 assume ~n <= 0;#res := 1; 152787#factFINAL assume true; 152783#factEXIT >#68#return; 152779#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 152780#factENTRY ~n := #in~n; 152786#L25 assume ~n <= 0;#res := 1; 152782#factFINAL assume true; 152778#factEXIT >#70#return; 152775#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 152776#factENTRY ~n := #in~n; 152781#L25 assume ~n <= 0;#res := 1; 152777#factFINAL assume true; 152774#factEXIT >#72#return; 152773#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; 152771#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 152768#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 152763#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 152760#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; 152752#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 152753#factENTRY ~n := #in~n; 152770#L25 assume !(~n <= 0); 152766#L26 call #t~ret0 := fact(~n - 1);< 152767#factENTRY ~n := #in~n; 152772#L25 assume ~n <= 0;#res := 1; 152769#factFINAL assume true; 152765#factEXIT >#66#return; 152762#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152759#factFINAL assume true; 152751#factEXIT >#74#return; 152747#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 152748#factENTRY ~n := #in~n; 152757#L25 assume ~n <= 0;#res := 1; 152750#factFINAL assume true; 152746#factEXIT >#76#return; 152742#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 152743#factENTRY ~n := #in~n; 152758#L25 assume !(~n <= 0); 152755#L26 call #t~ret0 := fact(~n - 1);< 152756#factENTRY ~n := #in~n; 152764#L25 assume ~n <= 0;#res := 1; 152761#factFINAL assume true; 152754#factEXIT >#66#return; 152749#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152745#factFINAL assume true; 152741#factEXIT >#78#return; 152739#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; 152737#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 152735#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 152733#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 152732#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; 152709#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 152713#factENTRY ~n := #in~n; 152714#L25 assume !(~n <= 0); 152705#L26 call #t~ret0 := fact(~n - 1);< 152710#factENTRY ~n := #in~n; 152719#L25 assume !(~n <= 0); 152704#L26 call #t~ret0 := fact(~n - 1);< 152725#factENTRY ~n := #in~n; 152791#L25 assume ~n <= 0;#res := 1; 152790#factFINAL assume true; 152723#factEXIT >#66#return; 152724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152744#factFINAL assume true; 152740#factEXIT >#66#return; 152738#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152736#factFINAL assume true; 152734#factEXIT >#74#return; 152633#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 152635#factENTRY ~n := #in~n; 152637#L25 assume ~n <= 0;#res := 1; 152636#factFINAL assume true; 152632#factEXIT >#76#return; 152634#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 152713#factENTRY ~n := #in~n; 152714#L25 assume !(~n <= 0); 152705#L26 call #t~ret0 := fact(~n - 1);< 152710#factENTRY ~n := #in~n; 152719#L25 assume !(~n <= 0); 152704#L26 call #t~ret0 := fact(~n - 1);< 152725#factENTRY ~n := #in~n; 152791#L25 assume ~n <= 0;#res := 1; 152790#factFINAL assume true; 152723#factEXIT >#66#return; 152724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152744#factFINAL assume true; 152740#factEXIT >#66#return; 152738#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152736#factFINAL assume true; 152734#factEXIT >#78#return; 152620#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; 152618#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 152616#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 152614#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 152549#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; 152259#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 152262#factENTRY ~n := #in~n; 152699#L25 assume !(~n <= 0); 152695#L26 call #t~ret0 := fact(~n - 1);< 152698#factENTRY ~n := #in~n; 152730#L25 assume !(~n <= 0); 152696#L26 call #t~ret0 := fact(~n - 1);< 152702#factENTRY ~n := #in~n; 152711#L25 assume !(~n <= 0); 152694#L26 call #t~ret0 := fact(~n - 1);< 152727#factENTRY ~n := #in~n; 152729#L25 assume ~n <= 0;#res := 1; 152728#factFINAL assume true; 152726#factEXIT >#66#return; 152722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152720#factFINAL assume true; 152717#factEXIT >#66#return; 152718#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153293#factFINAL assume true; 153288#factEXIT >#66#return; 153287#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153286#factFINAL assume true; 152257#factEXIT >#74#return; 152261#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 152268#factENTRY ~n := #in~n; 152275#L25 assume ~n <= 0;#res := 1; 152273#factFINAL assume true; 152267#factEXIT >#76#return; 152260#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 152262#factENTRY ~n := #in~n; 152699#L25 assume !(~n <= 0); 152695#L26 call #t~ret0 := fact(~n - 1);< 152698#factENTRY ~n := #in~n; 152730#L25 assume !(~n <= 0); 152696#L26 call #t~ret0 := fact(~n - 1);< 152702#factENTRY ~n := #in~n; 152711#L25 assume !(~n <= 0); 152694#L26 call #t~ret0 := fact(~n - 1);< 152727#factENTRY ~n := #in~n; 152729#L25 assume ~n <= 0;#res := 1; 152728#factFINAL assume true; 152726#factEXIT >#66#return; 152722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152720#factFINAL assume true; 152717#factEXIT >#66#return; 152718#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153293#factFINAL assume true; 153288#factEXIT >#66#return; 153287#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153286#factFINAL assume true; 152257#factEXIT >#78#return; 152133#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; 152134#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 152691#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 152690#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 152689#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 152148#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 152149#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 152936#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; 152929#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 152931#factENTRY ~n := #in~n; 152947#L25 assume !(~n <= 0); 152945#L26 call #t~ret0 := fact(~n - 1);< 152946#factENTRY ~n := #in~n; 152953#L25 assume ~n <= 0;#res := 1; 152952#factFINAL assume true; 152944#factEXIT >#66#return; 152941#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152935#factFINAL assume true; 152928#factEXIT >#68#return; 152911#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 152914#factENTRY ~n := #in~n; 152917#L25 assume ~n <= 0;#res := 1; 152909#factFINAL assume true; 152910#factEXIT >#70#return; 152888#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 152891#factENTRY ~n := #in~n; 152903#L25 assume !(~n <= 0); 152899#L26 call #t~ret0 := fact(~n - 1);< 152902#factENTRY ~n := #in~n; 152907#L25 assume ~n <= 0;#res := 1; 152904#factFINAL assume true; 152898#factEXIT >#66#return; 152897#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152894#factFINAL assume true; 152886#factEXIT >#72#return; 152890#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; 152892#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 152885#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 152883#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 152881#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; 152841#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 152876#factENTRY ~n := #in~n; 152895#L25 assume !(~n <= 0); 152831#L26 call #t~ret0 := fact(~n - 1);< 152837#factENTRY ~n := #in~n; 152851#L25 assume ~n <= 0;#res := 1; 152840#factFINAL assume true; 152830#factEXIT >#66#return; 152836#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152893#factFINAL assume true; 152875#factEXIT >#68#return; 152867#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 152869#factENTRY ~n := #in~n; 152896#L25 assume !(~n <= 0); 152834#L26 call #t~ret0 := fact(~n - 1);< 152837#factENTRY ~n := #in~n; 152851#L25 assume ~n <= 0;#res := 1; 152840#factFINAL assume true; 152830#factEXIT >#66#return; 152835#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152874#factFINAL assume true; 152866#factEXIT >#70#return; 152860#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 152863#factENTRY ~n := #in~n; 152871#L25 assume ~n <= 0;#res := 1; 152865#factFINAL assume true; 152859#factEXIT >#72#return; 152862#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; 152873#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 152872#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 152870#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 152864#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; 152819#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 152816#factENTRY ~n := #in~n; 152856#L25 assume !(~n <= 0); 152832#L26 call #t~ret0 := fact(~n - 1);< 152849#factENTRY ~n := #in~n; 152956#L25 assume !(~n <= 0); 152845#L26 call #t~ret0 := fact(~n - 1);< 152949#factENTRY ~n := #in~n; 152955#L25 assume ~n <= 0;#res := 1; 152954#factFINAL assume true; 152948#factEXIT >#66#return; 152942#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152938#factFINAL assume true; 152932#factEXIT >#66#return; 152926#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152924#factFINAL assume true; 152818#factEXIT >#74#return; 152813#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 152814#factENTRY ~n := #in~n; 152855#L25 assume !(~n <= 0); 152833#L26 call #t~ret0 := fact(~n - 1);< 152837#factENTRY ~n := #in~n; 152851#L25 assume ~n <= 0;#res := 1; 152840#factFINAL assume true; 152830#factEXIT >#66#return; 152826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152825#factFINAL assume true; 152821#factEXIT >#76#return; 152815#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 152816#factENTRY ~n := #in~n; 152856#L25 assume !(~n <= 0); 152832#L26 call #t~ret0 := fact(~n - 1);< 152849#factENTRY ~n := #in~n; 152851#L25 assume ~n <= 0;#res := 1; 152840#factFINAL assume true; 152830#factEXIT >#66#return; 152826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152825#factFINAL assume true; 152821#factEXIT >#78#return; 152823#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; 153225#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 153222#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 153220#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 153217#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; 153204#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 153205#factENTRY ~n := #in~n; 153229#L25 assume !(~n <= 0); 153211#L26 call #t~ret0 := fact(~n - 1);< 153216#factENTRY ~n := #in~n; 153236#L25 assume !(~n <= 0); 153212#L26 call #t~ret0 := fact(~n - 1);< 153219#factENTRY ~n := #in~n; 153235#L25 assume !(~n <= 0); 153213#L26 call #t~ret0 := fact(~n - 1);< 153231#factENTRY ~n := #in~n; 153234#L25 assume ~n <= 0;#res := 1; 153233#factFINAL assume true; 153230#factEXIT >#66#return; 153227#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153226#factFINAL assume true; 153223#factEXIT >#66#return; 153221#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153218#factFINAL assume true; 153210#factEXIT >#66#return; 153209#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153208#factFINAL assume true; 153202#factEXIT >#74#return; 152801#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 152810#factENTRY ~n := #in~n; 153174#L25 assume !(~n <= 0); 153175#L26 call #t~ret0 := fact(~n - 1);< 153179#factENTRY ~n := #in~n; 153181#L25 assume ~n <= 0;#res := 1; 153180#factFINAL assume true; 153178#factEXIT >#66#return; 153176#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153177#factFINAL assume true; 153232#factEXIT >#76#return; 152797#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 152799#factENTRY ~n := #in~n; 153228#L25 assume !(~n <= 0); 153214#L26 call #t~ret0 := fact(~n - 1);< 153219#factENTRY ~n := #in~n; 153235#L25 assume !(~n <= 0); 153213#L26 call #t~ret0 := fact(~n - 1);< 153231#factENTRY ~n := #in~n; 153234#L25 assume ~n <= 0;#res := 1; 153233#factFINAL assume true; 153230#factEXIT >#66#return; 153227#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153226#factFINAL assume true; 153223#factEXIT >#66#return; 153224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153249#factFINAL assume true; 152796#factEXIT >#78#return; 152795#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; 152794#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 152793#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 152792#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 152152#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 152153#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 152250#L42-3 [2021-11-20 06:32:38,693 INFO L793 eck$LassoCheckResult]: Loop: 152250#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 152244#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; 152121#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 152122#factENTRY ~n := #in~n; 152484#L25 assume !(~n <= 0); 152480#L26 call #t~ret0 := fact(~n - 1);< 152482#factENTRY ~n := #in~n; 152488#L25 assume !(~n <= 0); 152479#L26 call #t~ret0 := fact(~n - 1);< 152487#factENTRY ~n := #in~n; 152488#L25 assume !(~n <= 0); 152479#L26 call #t~ret0 := fact(~n - 1);< 152487#factENTRY ~n := #in~n; 152490#L25 assume ~n <= 0;#res := 1; 152496#factFINAL assume true; 152495#factEXIT >#66#return; 152493#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152492#factFINAL assume true; 152491#factEXIT >#66#return; 152489#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152486#factFINAL assume true; 152478#factEXIT >#66#return; 152477#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152476#factFINAL assume true; 152475#factEXIT >#68#return; 152474#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 152173#factENTRY ~n := #in~n; 152485#L25 assume ~n <= 0;#res := 1; 152483#factFINAL assume true; 152473#factEXIT >#70#return; 152460#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 152472#factENTRY ~n := #in~n; 152543#L25 assume !(~n <= 0); 152396#L26 call #t~ret0 := fact(~n - 1);< 152411#factENTRY ~n := #in~n; 152548#L25 assume !(~n <= 0); 152399#L26 call #t~ret0 := fact(~n - 1);< 152406#factENTRY ~n := #in~n; 152522#L25 assume !(~n <= 0); 152398#L26 call #t~ret0 := fact(~n - 1);< 152521#factENTRY ~n := #in~n; 152526#L25 assume ~n <= 0;#res := 1; 152525#factFINAL assume true; 152518#factEXIT >#66#return; 152517#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152515#factFINAL assume true; 152509#factEXIT >#66#return; 152508#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152502#factFINAL assume true; 152497#factEXIT >#66#return; 152401#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152494#factFINAL assume true; 152459#factEXIT >#72#return; 152457#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; 152455#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 152453#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 152451#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 152450#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; 152439#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 152441#factENTRY ~n := #in~n; 152505#L25 assume !(~n <= 0); 152498#L26 call #t~ret0 := fact(~n - 1);< 152503#factENTRY ~n := #in~n; 152514#L25 assume !(~n <= 0); 152510#L26 call #t~ret0 := fact(~n - 1);< 152513#factENTRY ~n := #in~n; 152523#L25 assume !(~n <= 0); 152519#L26 call #t~ret0 := fact(~n - 1);< 152520#factENTRY ~n := #in~n; 152526#L25 assume ~n <= 0;#res := 1; 152525#factFINAL assume true; 152518#factEXIT >#66#return; 152517#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152515#factFINAL assume true; 152509#factEXIT >#66#return; 152508#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152502#factFINAL assume true; 152497#factEXIT >#66#return; 152499#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152531#factFINAL assume true; 152437#factEXIT >#68#return; 152317#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 152410#factENTRY ~n := #in~n; 152408#L25 assume !(~n <= 0); 152307#L26 call #t~ret0 := fact(~n - 1);< 152318#factENTRY ~n := #in~n; 152320#L25 assume ~n <= 0;#res := 1; 152313#factFINAL assume true; 152306#factEXIT >#66#return; 152311#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152540#factFINAL assume true; 152436#factEXIT >#70#return; 152423#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 152429#factENTRY ~n := #in~n; 152516#L25 assume !(~n <= 0); 152397#L26 call #t~ret0 := fact(~n - 1);< 152406#factENTRY ~n := #in~n; 152522#L25 assume !(~n <= 0); 152398#L26 call #t~ret0 := fact(~n - 1);< 152521#factENTRY ~n := #in~n; 152526#L25 assume ~n <= 0;#res := 1; 152525#factFINAL assume true; 152518#factEXIT >#66#return; 152517#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152515#factFINAL assume true; 152509#factEXIT >#66#return; 152511#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152541#factFINAL assume true; 152422#factEXIT >#72#return; 152425#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; 152448#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 152446#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 152444#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 152442#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; 152438#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 152441#factENTRY ~n := #in~n; 152505#L25 assume !(~n <= 0); 152498#L26 call #t~ret0 := fact(~n - 1);< 152503#factENTRY ~n := #in~n; 152514#L25 assume !(~n <= 0); 152510#L26 call #t~ret0 := fact(~n - 1);< 152513#factENTRY ~n := #in~n; 152523#L25 assume !(~n <= 0); 152519#L26 call #t~ret0 := fact(~n - 1);< 152520#factENTRY ~n := #in~n; 152526#L25 assume ~n <= 0;#res := 1; 152525#factFINAL assume true; 152518#factEXIT >#66#return; 152517#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152515#factFINAL assume true; 152509#factEXIT >#66#return; 152508#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152502#factFINAL assume true; 152497#factEXIT >#66#return; 152499#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152531#factFINAL assume true; 152437#factEXIT >#68#return; 152369#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 152373#factENTRY ~n := #in~n; 152553#L25 assume !(~n <= 0); 152308#L26 call #t~ret0 := fact(~n - 1);< 152312#factENTRY ~n := #in~n; 152320#L25 assume ~n <= 0;#res := 1; 152313#factFINAL assume true; 152306#factEXIT >#66#return; 152311#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152540#factFINAL assume true; 152436#factEXIT >#70#return; 152293#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 152302#factENTRY ~n := #in~n; 152319#L25 assume !(~n <= 0); 152309#L26 call #t~ret0 := fact(~n - 1);< 152312#factENTRY ~n := #in~n; 152320#L25 assume ~n <= 0;#res := 1; 152313#factFINAL assume true; 152306#factEXIT >#66#return; 152305#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152303#factFINAL assume true; 152284#factEXIT >#72#return; 152283#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; 152281#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 152279#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 152277#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 152183#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; 152184#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 152242#factENTRY ~n := #in~n; 152240#L25 assume !(~n <= 0); 152204#L26 call #t~ret0 := fact(~n - 1);< 152228#factENTRY ~n := #in~n; 152226#L25 assume !(~n <= 0); 152222#L26 call #t~ret0 := fact(~n - 1);< 152224#factENTRY ~n := #in~n; 152235#L25 assume !(~n <= 0); 152230#L26 call #t~ret0 := fact(~n - 1);< 152231#factENTRY ~n := #in~n; 152234#L25 assume ~n <= 0;#res := 1; 152233#factFINAL assume true; 152229#factEXIT >#66#return; 152227#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152225#factFINAL assume true; 152221#factEXIT >#66#return; 152223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152547#factFINAL assume true; 152196#factEXIT >#66#return; 152206#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152342#factFINAL assume true; 152338#factEXIT >#68#return; 152187#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 152191#factENTRY ~n := #in~n; 152210#L25 assume !(~n <= 0); 152197#L26 call #t~ret0 := fact(~n - 1);< 152209#factENTRY ~n := #in~n; 152220#L25 assume !(~n <= 0); 152200#L26 call #t~ret0 := fact(~n - 1);< 152232#factENTRY ~n := #in~n; 152220#L25 assume !(~n <= 0); 152200#L26 call #t~ret0 := fact(~n - 1);< 152232#factENTRY ~n := #in~n; 152220#L25 assume !(~n <= 0); 152200#L26 call #t~ret0 := fact(~n - 1);< 152232#factENTRY ~n := #in~n; 152234#L25 assume ~n <= 0;#res := 1; 152233#factFINAL assume true; 152229#factEXIT >#66#return; 152227#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152225#factFINAL assume true; 152221#factEXIT >#66#return; 152223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152547#factFINAL assume true; 152196#factEXIT >#66#return; 152207#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152211#factFINAL assume true; 152212#factEXIT >#66#return; 152194#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152195#factFINAL assume true; 152185#factEXIT >#70#return; 152190#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 152116#factENTRY ~n := #in~n; 152336#L25 assume ~n <= 0;#res := 1; 152335#factFINAL assume true; 152332#factEXIT >#72#return; 152334#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; 152331#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 152329#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 152327#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 152325#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; 152266#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 152271#factENTRY ~n := #in~n; 152560#L25 assume !(~n <= 0); 152198#L26 call #t~ret0 := fact(~n - 1);< 152218#factENTRY ~n := #in~n; 152236#L25 assume !(~n <= 0); 152201#L26 call #t~ret0 := fact(~n - 1);< 152219#factENTRY ~n := #in~n; 152220#L25 assume !(~n <= 0); 152200#L26 call #t~ret0 := fact(~n - 1);< 152232#factENTRY ~n := #in~n; 152220#L25 assume !(~n <= 0); 152200#L26 call #t~ret0 := fact(~n - 1);< 152232#factENTRY ~n := #in~n; 152234#L25 assume ~n <= 0;#res := 1; 152233#factFINAL assume true; 152229#factEXIT >#66#return; 152227#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152225#factFINAL assume true; 152221#factEXIT >#66#return; 152223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152547#factFINAL assume true; 152196#factEXIT >#66#return; 152207#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152211#factFINAL assume true; 152212#factEXIT >#66#return; 152272#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152270#factFINAL assume true; 152264#factEXIT >#74#return; 152248#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 152249#factENTRY ~n := #in~n; 152304#L25 assume !(~n <= 0); 152202#L26 call #t~ret0 := fact(~n - 1);< 152218#factENTRY ~n := #in~n; 152236#L25 assume !(~n <= 0); 152201#L26 call #t~ret0 := fact(~n - 1);< 152219#factENTRY ~n := #in~n; 152220#L25 assume !(~n <= 0); 152200#L26 call #t~ret0 := fact(~n - 1);< 152232#factENTRY ~n := #in~n; 152220#L25 assume !(~n <= 0); 152200#L26 call #t~ret0 := fact(~n - 1);< 152232#factENTRY ~n := #in~n; 152234#L25 assume ~n <= 0;#res := 1; 152233#factFINAL assume true; 152229#factEXIT >#66#return; 152227#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152225#factFINAL assume true; 152221#factEXIT >#66#return; 152223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152547#factFINAL assume true; 152196#factEXIT >#66#return; 152207#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152211#factFINAL assume true; 152212#factEXIT >#66#return; 152272#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152270#factFINAL assume true; 152264#factEXIT >#76#return; 152238#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 152243#factENTRY ~n := #in~n; 152241#L25 assume !(~n <= 0); 152203#L26 call #t~ret0 := fact(~n - 1);< 152209#factENTRY ~n := #in~n; 152237#L25 assume ~n <= 0;#res := 1; 152322#factFINAL assume true; 152321#factEXIT >#66#return; 152269#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 152263#factFINAL assume true; 152254#factEXIT >#78#return; 152256#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; 152143#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 152144#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 152169#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 152150#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 152151#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 152250#L42-3 [2021-11-20 06:32:38,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:32:38,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1832113088, now seen corresponding path program 28 times [2021-11-20 06:32:38,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:32:38,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516080380] [2021-11-20 06:32:38,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:32:38,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:32:38,701 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:32:38,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1771623231] [2021-11-20 06:32:38,702 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 06:32:38,702 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:32:38,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:32:38,721 INFO L229 MonitoredProcess]: Starting monitored process 206 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:32:38,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (206)] Waiting until timeout for monitored process [2021-11-20 06:32:39,186 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 06:32:39,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-20 06:32:39,186 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:32:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:32:39,410 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:32:39,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:32:39,410 INFO L85 PathProgramCache]: Analyzing trace with hash -988771047, now seen corresponding path program 23 times [2021-11-20 06:32:39,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:32:39,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957618695] [2021-11-20 06:32:39,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:32:39,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:32:39,416 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:32:39,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [396717525] [2021-11-20 06:32:39,422 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-20 06:32:39,422 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:32:39,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:32:39,429 INFO L229 MonitoredProcess]: Starting monitored process 207 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:32:39,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (207)] Waiting until timeout for monitored process [2021-11-20 06:32:39,672 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2021-11-20 06:32:39,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:32:39,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-20 06:32:39,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:32:40,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5633 backedges. 3112 proven. 44 refuted. 0 times theorem prover too weak. 2477 trivial. 0 not checked. [2021-11-20 06:32:40,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:32:41,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5633 backedges. 264 proven. 329 refuted. 0 times theorem prover too weak. 5040 trivial. 0 not checked. [2021-11-20 06:32:41,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:32:41,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957618695] [2021-11-20 06:32:41,490 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:32:41,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396717525] [2021-11-20 06:32:41,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396717525] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:32:41,491 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:32:41,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 15 [2021-11-20 06:32:41,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014471985] [2021-11-20 06:32:41,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:32:41,491 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 06:32:41,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:32:41,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 06:32:41,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-11-20 06:32:41,492 INFO L87 Difference]: Start difference. First operand 1198 states and 1571 transitions. cyclomatic complexity: 393 Second operand has 15 states, 12 states have (on average 4.083333333333333) internal successors, (49), 15 states have internal predecessors, (49), 9 states have call successors, (27), 2 states have call predecessors, (27), 5 states have return successors, (27), 8 states have call predecessors, (27), 9 states have call successors, (27) [2021-11-20 06:32:42,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:32:42,404 INFO L93 Difference]: Finished difference Result 1195 states and 1536 transitions. [2021-11-20 06:32:42,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 06:32:42,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1195 states and 1536 transitions. [2021-11-20 06:32:42,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 233 [2021-11-20 06:32:42,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1195 states to 1195 states and 1535 transitions. [2021-11-20 06:32:42,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 185 [2021-11-20 06:32:42,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 185 [2021-11-20 06:32:42,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1195 states and 1535 transitions. [2021-11-20 06:32:42,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:32:42,420 INFO L681 BuchiCegarLoop]: Abstraction has 1195 states and 1535 transitions. [2021-11-20 06:32:42,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states and 1535 transitions. [2021-11-20 06:32:42,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1184. [2021-11-20 06:32:42,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 781 states have (on average 1.056338028169014) internal successors, (825), 785 states have internal predecessors, (825), 256 states have call successors, (262), 143 states have call predecessors, (262), 147 states have return successors, (435), 255 states have call predecessors, (435), 256 states have call successors, (435) [2021-11-20 06:32:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1522 transitions. [2021-11-20 06:32:42,447 INFO L704 BuchiCegarLoop]: Abstraction has 1184 states and 1522 transitions. [2021-11-20 06:32:42,447 INFO L587 BuchiCegarLoop]: Abstraction has 1184 states and 1522 transitions. [2021-11-20 06:32:42,448 INFO L425 BuchiCegarLoop]: ======== Iteration 38============ [2021-11-20 06:32:42,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1184 states and 1522 transitions. [2021-11-20 06:32:42,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2021-11-20 06:32:42,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:32:42,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:32:42,466 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [50, 50, 26, 26, 26, 26, 24, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2021-11-20 06:32:42,466 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [49, 49, 34, 34, 34, 34, 15, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:32:42,466 INFO L791 eck$LassoCheckResult]: Stem: 156383#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 156356#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 156357#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 156382#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 156369#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 156370#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 156976#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; 156973#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 156974#factENTRY ~n := #in~n; 156977#L25 assume ~n <= 0;#res := 1; 156975#factFINAL assume true; 156972#factEXIT >#68#return; 156964#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 156965#factENTRY ~n := #in~n; 156968#L25 assume ~n <= 0;#res := 1; 156967#factFINAL assume true; 156963#factEXIT >#70#return; 156961#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 156962#factENTRY ~n := #in~n; 156970#L25 assume ~n <= 0;#res := 1; 156969#factFINAL assume true; 156960#factEXIT >#72#return; 156957#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; 156956#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 156955#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 156953#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 156948#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; 156940#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 156941#factENTRY ~n := #in~n; 156954#L25 assume !(~n <= 0); 156951#L26 call #t~ret0 := fact(~n - 1);< 156952#factENTRY ~n := #in~n; 156966#L25 assume ~n <= 0;#res := 1; 156959#factFINAL assume true; 156950#factEXIT >#66#return; 156947#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156946#factFINAL assume true; 156939#factEXIT >#74#return; 156935#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 156936#factENTRY ~n := #in~n; 156945#L25 assume ~n <= 0;#res := 1; 156938#factFINAL assume true; 156934#factEXIT >#76#return; 156931#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 156932#factENTRY ~n := #in~n; 156971#L25 assume !(~n <= 0); 156943#L26 call #t~ret0 := fact(~n - 1);< 156944#factENTRY ~n := #in~n; 156958#L25 assume ~n <= 0;#res := 1; 156949#factFINAL assume true; 156942#factEXIT >#66#return; 156937#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156933#factFINAL assume true; 156930#factEXIT >#78#return; 156929#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; 156928#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 156927#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 156926#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 156925#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; 156912#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 156991#factENTRY ~n := #in~n; 156992#L25 assume !(~n <= 0); 156984#L26 call #t~ret0 := fact(~n - 1);< 156989#factENTRY ~n := #in~n; 156994#L25 assume !(~n <= 0); 156987#L26 call #t~ret0 := fact(~n - 1);< 157000#factENTRY ~n := #in~n; 157002#L25 assume ~n <= 0;#res := 1; 157001#factFINAL assume true; 156998#factEXIT >#66#return; 156999#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 157007#factFINAL assume true; 157006#factEXIT >#66#return; 157005#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 157004#factFINAL assume true; 156911#factEXIT >#74#return; 156914#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 156919#factENTRY ~n := #in~n; 156921#L25 assume ~n <= 0;#res := 1; 156920#factFINAL assume true; 156917#factEXIT >#76#return; 156913#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 156991#factENTRY ~n := #in~n; 156992#L25 assume !(~n <= 0); 156984#L26 call #t~ret0 := fact(~n - 1);< 156989#factENTRY ~n := #in~n; 156994#L25 assume !(~n <= 0); 156987#L26 call #t~ret0 := fact(~n - 1);< 157000#factENTRY ~n := #in~n; 157002#L25 assume ~n <= 0;#res := 1; 157001#factFINAL assume true; 156998#factEXIT >#66#return; 156999#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 157007#factFINAL assume true; 157006#factEXIT >#66#return; 157005#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 157004#factFINAL assume true; 156911#factEXIT >#78#return; 156910#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; 156909#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 156907#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 156905#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 156901#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; 156419#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 156423#factENTRY ~n := #in~n; 156848#L25 assume !(~n <= 0); 156844#L26 call #t~ret0 := fact(~n - 1);< 156847#factENTRY ~n := #in~n; 156895#L25 assume !(~n <= 0); 156845#L26 call #t~ret0 := fact(~n - 1);< 156855#factENTRY ~n := #in~n; 156890#L25 assume !(~n <= 0); 156843#L26 call #t~ret0 := fact(~n - 1);< 156900#factENTRY ~n := #in~n; 156904#L25 assume ~n <= 0;#res := 1; 156903#factFINAL assume true; 156899#factEXIT >#66#return; 156898#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156897#factFINAL assume true; 156893#factEXIT >#66#return; 156894#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 157502#factFINAL assume true; 157500#factEXIT >#66#return; 157499#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 157498#factFINAL assume true; 156417#factEXIT >#74#return; 156421#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 156433#factENTRY ~n := #in~n; 156439#L25 assume ~n <= 0;#res := 1; 156438#factFINAL assume true; 156432#factEXIT >#76#return; 156418#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 156423#factENTRY ~n := #in~n; 156848#L25 assume !(~n <= 0); 156844#L26 call #t~ret0 := fact(~n - 1);< 156847#factENTRY ~n := #in~n; 156895#L25 assume !(~n <= 0); 156845#L26 call #t~ret0 := fact(~n - 1);< 156855#factENTRY ~n := #in~n; 156890#L25 assume !(~n <= 0); 156843#L26 call #t~ret0 := fact(~n - 1);< 156900#factENTRY ~n := #in~n; 156904#L25 assume ~n <= 0;#res := 1; 156903#factFINAL assume true; 156899#factEXIT >#66#return; 156898#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156897#factFINAL assume true; 156893#factEXIT >#66#return; 156894#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 157502#factFINAL assume true; 157500#factEXIT >#66#return; 157499#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 157498#factFINAL assume true; 156417#factEXIT >#78#return; 156422#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; 156794#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 156793#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 156786#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 156381#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 156371#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 156372#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 157130#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; 157115#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 157116#factENTRY ~n := #in~n; 157136#L25 assume !(~n <= 0); 157133#L26 call #t~ret0 := fact(~n - 1);< 157134#factENTRY ~n := #in~n; 157147#L25 assume ~n <= 0;#res := 1; 157145#factFINAL assume true; 157132#factEXIT >#66#return; 157128#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 157127#factFINAL assume true; 157113#factEXIT >#68#return; 157084#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 157086#factENTRY ~n := #in~n; 157097#L25 assume ~n <= 0;#res := 1; 157092#factFINAL assume true; 157081#factEXIT >#70#return; 157075#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 157078#factENTRY ~n := #in~n; 157093#L25 assume !(~n <= 0); 157089#L26 call #t~ret0 := fact(~n - 1);< 157091#factENTRY ~n := #in~n; 157098#L25 assume ~n <= 0;#res := 1; 157095#factFINAL assume true; 157087#factEXIT >#66#return; 157080#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 157079#factFINAL assume true; 157073#factEXIT >#72#return; 157071#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; 157069#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 157064#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 157063#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 157060#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; 157047#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 157050#factENTRY ~n := #in~n; 157068#L25 assume !(~n <= 0); 157056#L26 call #t~ret0 := fact(~n - 1);< 157058#factENTRY ~n := #in~n; 157066#L25 assume ~n <= 0;#res := 1; 157062#factFINAL assume true; 157052#factEXIT >#66#return; 157057#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 157059#factFINAL assume true; 157046#factEXIT >#68#return; 157043#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 157044#factENTRY ~n := #in~n; 157067#L25 assume !(~n <= 0); 157054#L26 call #t~ret0 := fact(~n - 1);< 157058#factENTRY ~n := #in~n; 157066#L25 assume ~n <= 0;#res := 1; 157062#factFINAL assume true; 157052#factEXIT >#66#return; 157051#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 157045#factFINAL assume true; 157041#factEXIT >#70#return; 157038#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 157040#factENTRY ~n := #in~n; 157159#L25 assume ~n <= 0;#res := 1; 157158#factFINAL assume true; 157037#factEXIT >#72#return; 157035#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; 157033#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 157031#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 157029#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 157027#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; 157015#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 157019#factENTRY ~n := #in~n; 157149#L25 assume !(~n <= 0); 157053#L26 call #t~ret0 := fact(~n - 1);< 157121#factENTRY ~n := #in~n; 157143#L25 assume !(~n <= 0); 157119#L26 call #t~ret0 := fact(~n - 1);< 157142#factENTRY ~n := #in~n; 157146#L25 assume ~n <= 0;#res := 1; 157144#factFINAL assume true; 157141#factEXIT >#66#return; 157131#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 157124#factFINAL assume true; 157117#factEXIT >#66#return; 157110#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 157107#factFINAL assume true; 157023#factEXIT >#74#return; 157014#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 157021#factENTRY ~n := #in~n; 157123#L25 assume !(~n <= 0); 157055#L26 call #t~ret0 := fact(~n - 1);< 157058#factENTRY ~n := #in~n; 157066#L25 assume ~n <= 0;#res := 1; 157062#factFINAL assume true; 157052#factEXIT >#66#return; 157022#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 157020#factFINAL assume true; 157011#factEXIT >#76#return; 157016#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 157019#factENTRY ~n := #in~n; 157149#L25 assume !(~n <= 0); 157053#L26 call #t~ret0 := fact(~n - 1);< 157121#factENTRY ~n := #in~n; 157066#L25 assume ~n <= 0;#res := 1; 157062#factFINAL assume true; 157052#factEXIT >#66#return; 157022#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 157020#factFINAL assume true; 157011#factEXIT >#78#return; 157018#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; 157452#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 157450#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 157448#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 157446#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; 157177#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 157168#factENTRY ~n := #in~n; 157461#L25 assume !(~n <= 0); 157428#L26 call #t~ret0 := fact(~n - 1);< 157457#factENTRY ~n := #in~n; 157455#L25 assume !(~n <= 0); 157421#L26 call #t~ret0 := fact(~n - 1);< 157425#factENTRY ~n := #in~n; 157444#L25 assume !(~n <= 0); 157422#L26 call #t~ret0 := fact(~n - 1);< 157442#factENTRY ~n := #in~n; 157451#L25 assume ~n <= 0;#res := 1; 157449#factFINAL assume true; 157441#factEXIT >#66#return; 157440#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 157427#factFINAL assume true; 157420#factEXIT >#66#return; 157424#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 157465#factFINAL assume true; 157464#factEXIT >#66#return; 157463#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 157176#factFINAL assume true; 157179#factEXIT >#74#return; 157413#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 157414#factENTRY ~n := #in~n; 157445#L25 assume !(~n <= 0); 157437#L26 call #t~ret0 := fact(~n - 1);< 157438#factENTRY ~n := #in~n; 157454#L25 assume ~n <= 0;#res := 1; 157453#factFINAL assume true; 157436#factEXIT >#66#return; 157434#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 157432#factFINAL assume true; 157426#factEXIT >#76#return; 157165#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 157418#factENTRY ~n := #in~n; 157439#L25 assume !(~n <= 0); 157423#L26 call #t~ret0 := fact(~n - 1);< 157425#factENTRY ~n := #in~n; 157444#L25 assume !(~n <= 0); 157422#L26 call #t~ret0 := fact(~n - 1);< 157442#factENTRY ~n := #in~n; 157451#L25 assume ~n <= 0;#res := 1; 157449#factFINAL assume true; 157441#factEXIT >#66#return; 157440#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 157427#factFINAL assume true; 157420#factEXIT >#66#return; 157419#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 157417#factFINAL assume true; 157164#factEXIT >#78#return; 156787#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; 156785#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 156784#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 156782#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 156783#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 157137#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 156413#L42-3 [2021-11-20 06:32:42,467 INFO L793 eck$LassoCheckResult]: Loop: 156413#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 156412#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; 156345#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 156346#factENTRY ~n := #in~n; 156689#L25 assume !(~n <= 0); 156686#L26 call #t~ret0 := fact(~n - 1);< 156688#factENTRY ~n := #in~n; 156692#L25 assume !(~n <= 0); 156685#L26 call #t~ret0 := fact(~n - 1);< 156691#factENTRY ~n := #in~n; 156692#L25 assume !(~n <= 0); 156685#L26 call #t~ret0 := fact(~n - 1);< 156691#factENTRY ~n := #in~n; 156694#L25 assume ~n <= 0;#res := 1; 156702#factFINAL assume true; 156698#factEXIT >#66#return; 156697#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156696#factFINAL assume true; 156695#factEXIT >#66#return; 156693#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156690#factFINAL assume true; 156684#factEXIT >#66#return; 156682#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156680#factFINAL assume true; 156679#factEXIT >#68#return; 156678#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 156398#factENTRY ~n := #in~n; 156683#L25 assume ~n <= 0;#res := 1; 156681#factFINAL assume true; 156677#factEXIT >#70#return; 156586#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 156676#factENTRY ~n := #in~n; 156735#L25 assume !(~n <= 0); 156572#L26 call #t~ret0 := fact(~n - 1);< 156589#factENTRY ~n := #in~n; 156713#L25 assume !(~n <= 0); 156574#L26 call #t~ret0 := fact(~n - 1);< 156614#factENTRY ~n := #in~n; 156721#L25 assume !(~n <= 0); 156573#L26 call #t~ret0 := fact(~n - 1);< 156638#factENTRY ~n := #in~n; 156650#L25 assume ~n <= 0;#res := 1; 156647#factFINAL assume true; 156635#factEXIT >#66#return; 156634#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156613#factFINAL assume true; 156607#factEXIT >#66#return; 156610#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156585#factFINAL assume true; 156570#factEXIT >#66#return; 156580#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156699#factFINAL assume true; 156664#factEXIT >#72#return; 156663#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; 156661#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 156659#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 156657#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 156655#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; 156547#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 156622#factENTRY ~n := #in~n; 156621#L25 assume !(~n <= 0); 156579#L26 call #t~ret0 := fact(~n - 1);< 156618#factENTRY ~n := #in~n; 156617#L25 assume !(~n <= 0); 156608#L26 call #t~ret0 := fact(~n - 1);< 156615#factENTRY ~n := #in~n; 156640#L25 assume !(~n <= 0); 156636#L26 call #t~ret0 := fact(~n - 1);< 156637#factENTRY ~n := #in~n; 156650#L25 assume ~n <= 0;#res := 1; 156647#factFINAL assume true; 156635#factEXIT >#66#return; 156634#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156613#factFINAL assume true; 156607#factEXIT >#66#return; 156610#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156585#factFINAL assume true; 156570#factEXIT >#66#return; 156569#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156567#factFINAL assume true; 156537#factEXIT >#68#return; 156552#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 156611#factENTRY ~n := #in~n; 156605#L25 assume !(~n <= 0); 156596#L26 call #t~ret0 := fact(~n - 1);< 156603#factENTRY ~n := #in~n; 156616#L25 assume ~n <= 0;#res := 1; 156600#factFINAL assume true; 156595#factEXIT >#66#return; 156597#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156716#factFINAL assume true; 156714#factEXIT >#70#return; 156665#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 156710#factENTRY ~n := #in~n; 156703#L25 assume !(~n <= 0); 156571#L26 call #t~ret0 := fact(~n - 1);< 156614#factENTRY ~n := #in~n; 156721#L25 assume !(~n <= 0); 156573#L26 call #t~ret0 := fact(~n - 1);< 156638#factENTRY ~n := #in~n; 156650#L25 assume ~n <= 0;#res := 1; 156647#factFINAL assume true; 156635#factEXIT >#66#return; 156634#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156613#factFINAL assume true; 156607#factEXIT >#66#return; 156609#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156711#factFINAL assume true; 156704#factEXIT >#72#return; 156700#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; 156631#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 156629#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 156628#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 156626#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; 156551#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 156622#factENTRY ~n := #in~n; 156621#L25 assume !(~n <= 0); 156579#L26 call #t~ret0 := fact(~n - 1);< 156618#factENTRY ~n := #in~n; 156617#L25 assume !(~n <= 0); 156608#L26 call #t~ret0 := fact(~n - 1);< 156615#factENTRY ~n := #in~n; 156640#L25 assume !(~n <= 0); 156636#L26 call #t~ret0 := fact(~n - 1);< 156637#factENTRY ~n := #in~n; 156650#L25 assume ~n <= 0;#res := 1; 156647#factFINAL assume true; 156635#factEXIT >#66#return; 156634#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156613#factFINAL assume true; 156607#factEXIT >#66#return; 156610#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156585#factFINAL assume true; 156570#factEXIT >#66#return; 156569#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156567#factFINAL assume true; 156537#factEXIT >#68#return; 156525#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 156535#factENTRY ~n := #in~n; 156612#L25 assume !(~n <= 0); 156575#L26 call #t~ret0 := fact(~n - 1);< 156583#factENTRY ~n := #in~n; 156721#L25 assume !(~n <= 0); 156573#L26 call #t~ret0 := fact(~n - 1);< 156638#factENTRY ~n := #in~n; 156650#L25 assume ~n <= 0;#res := 1; 156647#factFINAL assume true; 156635#factEXIT >#66#return; 156634#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156613#factFINAL assume true; 156607#factEXIT >#66#return; 156604#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156594#factFINAL assume true; 156522#factEXIT >#70#return; 156513#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 156520#factENTRY ~n := #in~n; 156648#L25 assume !(~n <= 0); 156576#L26 call #t~ret0 := fact(~n - 1);< 156583#factENTRY ~n := #in~n; 156616#L25 assume ~n <= 0;#res := 1; 156600#factFINAL assume true; 156595#factEXIT >#66#return; 156593#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156592#factFINAL assume true; 156506#factEXIT >#72#return; 156505#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; 156504#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 156503#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 156502#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 156501#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; 156492#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 156496#factENTRY ~n := #in~n; 156494#L25 assume !(~n <= 0); 156475#L26 call #t~ret0 := fact(~n - 1);< 156493#factENTRY ~n := #in~n; 156500#L25 assume !(~n <= 0); 156498#L26 call #t~ret0 := fact(~n - 1);< 156499#factENTRY ~n := #in~n; 156559#L25 assume !(~n <= 0); 156555#L26 call #t~ret0 := fact(~n - 1);< 156556#factENTRY ~n := #in~n; 156566#L25 assume ~n <= 0;#res := 1; 156565#factFINAL assume true; 156554#factEXIT >#66#return; 156536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156521#factFINAL assume true; 156497#factEXIT >#66#return; 156495#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156491#factFINAL assume true; 156474#factEXIT >#66#return; 156477#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156644#factFINAL assume true; 156619#factEXIT >#68#return; 156469#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 156473#factENTRY ~n := #in~n; 156562#L25 assume !(~n <= 0); 156445#L26 call #t~ret0 := fact(~n - 1);< 156487#factENTRY ~n := #in~n; 156560#L25 assume !(~n <= 0); 156448#L26 call #t~ret0 := fact(~n - 1);< 156557#factENTRY ~n := #in~n; 156560#L25 assume !(~n <= 0); 156448#L26 call #t~ret0 := fact(~n - 1);< 156557#factENTRY ~n := #in~n; 156560#L25 assume !(~n <= 0); 156448#L26 call #t~ret0 := fact(~n - 1);< 156557#factENTRY ~n := #in~n; 156566#L25 assume ~n <= 0;#res := 1; 156565#factFINAL assume true; 156554#factEXIT >#66#return; 156536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156521#factFINAL assume true; 156497#factEXIT >#66#return; 156495#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156491#factFINAL assume true; 156474#factEXIT >#66#return; 156452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156478#factFINAL assume true; 156443#factEXIT >#66#return; 156451#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156598#factFINAL assume true; 156584#factEXIT >#70#return; 156464#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 156337#factENTRY ~n := #in~n; 156490#L25 assume ~n <= 0;#res := 1; 156489#factFINAL assume true; 156463#factEXIT >#72#return; 156466#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; 156467#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 156462#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 156460#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 156458#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; 156429#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 156435#factENTRY ~n := #in~n; 156488#L25 assume !(~n <= 0); 156446#L26 call #t~ret0 := fact(~n - 1);< 156454#factENTRY ~n := #in~n; 156749#L25 assume !(~n <= 0); 156449#L26 call #t~ret0 := fact(~n - 1);< 156484#factENTRY ~n := #in~n; 156560#L25 assume !(~n <= 0); 156448#L26 call #t~ret0 := fact(~n - 1);< 156557#factENTRY ~n := #in~n; 156560#L25 assume !(~n <= 0); 156448#L26 call #t~ret0 := fact(~n - 1);< 156557#factENTRY ~n := #in~n; 156566#L25 assume ~n <= 0;#res := 1; 156565#factFINAL assume true; 156554#factEXIT >#66#return; 156536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156521#factFINAL assume true; 156497#factEXIT >#66#return; 156495#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156491#factFINAL assume true; 156474#factEXIT >#66#return; 156452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156478#factFINAL assume true; 156443#factEXIT >#66#return; 156442#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156434#factFINAL assume true; 156424#factEXIT >#74#return; 156426#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 156430#factENTRY ~n := #in~n; 156485#L25 assume !(~n <= 0); 156447#L26 call #t~ret0 := fact(~n - 1);< 156454#factENTRY ~n := #in~n; 156749#L25 assume !(~n <= 0); 156449#L26 call #t~ret0 := fact(~n - 1);< 156484#factENTRY ~n := #in~n; 156560#L25 assume !(~n <= 0); 156448#L26 call #t~ret0 := fact(~n - 1);< 156557#factENTRY ~n := #in~n; 156560#L25 assume !(~n <= 0); 156448#L26 call #t~ret0 := fact(~n - 1);< 156557#factENTRY ~n := #in~n; 156566#L25 assume ~n <= 0;#res := 1; 156565#factFINAL assume true; 156554#factEXIT >#66#return; 156536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156521#factFINAL assume true; 156497#factEXIT >#66#return; 156495#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156491#factFINAL assume true; 156474#factEXIT >#66#return; 156452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156478#factFINAL assume true; 156443#factEXIT >#66#return; 156442#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156434#factFINAL assume true; 156424#factEXIT >#76#return; 156415#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 156405#factENTRY ~n := #in~n; 156620#L25 assume !(~n <= 0); 156444#L26 call #t~ret0 := fact(~n - 1);< 156487#factENTRY ~n := #in~n; 156561#L25 assume ~n <= 0;#res := 1; 156599#factFINAL assume true; 156486#factEXIT >#66#return; 156436#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 156431#factFINAL assume true; 156414#factEXIT >#78#return; 156416#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; 156365#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 156366#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 156409#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 156379#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 156380#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 156413#L42-3 [2021-11-20 06:32:42,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:32:42,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1832113088, now seen corresponding path program 29 times [2021-11-20 06:32:42,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:32:42,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429737574] [2021-11-20 06:32:42,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:32:42,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:32:42,475 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:32:42,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1724532158] [2021-11-20 06:32:42,476 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-20 06:32:42,476 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:32:42,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:32:42,490 INFO L229 MonitoredProcess]: Starting monitored process 208 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:32:42,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (208)] Waiting until timeout for monitored process [2021-11-20 06:32:42,857 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2021-11-20 06:32:42,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-20 06:32:42,858 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:32:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:32:43,056 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:32:43,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:32:43,057 INFO L85 PathProgramCache]: Analyzing trace with hash -891038175, now seen corresponding path program 24 times [2021-11-20 06:32:43,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:32:43,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945196782] [2021-11-20 06:32:43,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:32:43,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:32:43,061 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:32:43,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [508242822] [2021-11-20 06:32:43,062 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-20 06:32:43,062 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:32:43,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:32:43,068 INFO L229 MonitoredProcess]: Starting monitored process 209 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:32:43,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (209)] Waiting until timeout for monitored process [2021-11-20 06:32:43,409 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2021-11-20 06:32:43,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:32:43,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-20 06:32:43,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:32:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5891 backedges. 1215 proven. 769 refuted. 0 times theorem prover too weak. 3907 trivial. 0 not checked. [2021-11-20 06:32:44,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:32:47,642 INFO L134 CoverageAnalysis]: Checked inductivity of 5891 backedges. 782 proven. 849 refuted. 0 times theorem prover too weak. 4260 trivial. 0 not checked. [2021-11-20 06:32:47,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:32:47,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945196782] [2021-11-20 06:32:47,642 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:32:47,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508242822] [2021-11-20 06:32:47,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508242822] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:32:47,643 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:32:47,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22] total 26 [2021-11-20 06:32:47,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261026063] [2021-11-20 06:32:47,643 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:32:47,643 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 06:32:47,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:32:47,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-20 06:32:47,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2021-11-20 06:32:47,644 INFO L87 Difference]: Start difference. First operand 1184 states and 1522 transitions. cyclomatic complexity: 358 Second operand has 26 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 24 states have internal predecessors, (62), 17 states have call successors, (24), 2 states have call predecessors, (24), 10 states have return successors, (28), 15 states have call predecessors, (28), 17 states have call successors, (28) [2021-11-20 06:32:50,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:32:50,451 INFO L93 Difference]: Finished difference Result 1505 states and 2034 transitions. [2021-11-20 06:32:50,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-20 06:32:50,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1505 states and 2034 transitions. [2021-11-20 06:32:50,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2021-11-20 06:32:50,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1505 states to 1467 states and 1968 transitions. [2021-11-20 06:32:50,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2021-11-20 06:32:50,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 257 [2021-11-20 06:32:50,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1467 states and 1968 transitions. [2021-11-20 06:32:50,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:32:50,471 INFO L681 BuchiCegarLoop]: Abstraction has 1467 states and 1968 transitions. [2021-11-20 06:32:50,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states and 1968 transitions. [2021-11-20 06:32:50,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1292. [2021-11-20 06:32:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 851 states have (on average 1.0564042303172738) internal successors, (899), 853 states have internal predecessors, (899), 293 states have call successors, (301), 156 states have call predecessors, (301), 148 states have return successors, (511), 282 states have call predecessors, (511), 293 states have call successors, (511) [2021-11-20 06:32:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1711 transitions. [2021-11-20 06:32:50,503 INFO L704 BuchiCegarLoop]: Abstraction has 1292 states and 1711 transitions. [2021-11-20 06:32:50,503 INFO L587 BuchiCegarLoop]: Abstraction has 1292 states and 1711 transitions. [2021-11-20 06:32:50,503 INFO L425 BuchiCegarLoop]: ======== Iteration 39============ [2021-11-20 06:32:50,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1292 states and 1711 transitions. [2021-11-20 06:32:50,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 294 [2021-11-20 06:32:50,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:32:50,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:32:50,510 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [50, 50, 26, 26, 26, 26, 24, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2021-11-20 06:32:50,510 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [47, 47, 32, 32, 32, 32, 15, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:32:50,510 INFO L791 eck$LassoCheckResult]: Stem: 160989#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 160961#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;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 160962#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 160988#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 160972#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 160973#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 161395#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; 161391#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 161392#factENTRY ~n := #in~n; 161394#L25 assume ~n <= 0;#res := 1; 161393#factFINAL assume true; 161390#factEXIT >#68#return; 161385#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 161386#factENTRY ~n := #in~n; 161388#L25 assume ~n <= 0;#res := 1; 161387#factFINAL assume true; 161384#factEXIT >#70#return; 161380#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 161381#factENTRY ~n := #in~n; 161389#L25 assume ~n <= 0;#res := 1; 161382#factFINAL assume true; 161379#factEXIT >#72#return; 161377#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; 161376#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 161375#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 161373#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 161370#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; 161358#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 161359#factENTRY ~n := #in~n; 161369#L25 assume !(~n <= 0); 161367#L26 call #t~ret0 := fact(~n - 1);< 161368#factENTRY ~n := #in~n; 161383#L25 assume ~n <= 0;#res := 1; 161372#factFINAL assume true; 161366#factEXIT >#66#return; 161365#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161364#factFINAL assume true; 161357#factEXIT >#74#return; 161353#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 161354#factENTRY ~n := #in~n; 161363#L25 assume ~n <= 0;#res := 1; 161356#factFINAL assume true; 161352#factEXIT >#76#return; 161349#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 161350#factENTRY ~n := #in~n; 161378#L25 assume !(~n <= 0); 161361#L26 call #t~ret0 := fact(~n - 1);< 161362#factENTRY ~n := #in~n; 161374#L25 assume ~n <= 0;#res := 1; 161371#factFINAL assume true; 161360#factEXIT >#66#return; 161355#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161351#factFINAL assume true; 161348#factEXIT >#78#return; 161347#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; 161346#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 161345#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 161344#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 161343#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; 161292#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 161288#factENTRY ~n := #in~n; 161409#L25 assume !(~n <= 0); 161406#L26 call #t~ret0 := fact(~n - 1);< 161415#factENTRY ~n := #in~n; 161699#L25 assume !(~n <= 0); 161405#L26 call #t~ret0 := fact(~n - 1);< 161698#factENTRY ~n := #in~n; 161701#L25 assume ~n <= 0;#res := 1; 161700#factFINAL assume true; 161696#factEXIT >#66#return; 161697#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161708#factFINAL assume true; 161706#factEXIT >#66#return; 161705#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161704#factFINAL assume true; 161702#factEXIT >#74#return; 161290#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 161291#factENTRY ~n := #in~n; 161294#L25 assume ~n <= 0;#res := 1; 161293#factFINAL assume true; 161289#factEXIT >#76#return; 161287#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 161288#factENTRY ~n := #in~n; 161409#L25 assume !(~n <= 0); 161406#L26 call #t~ret0 := fact(~n - 1);< 161415#factENTRY ~n := #in~n; 161699#L25 assume !(~n <= 0); 161405#L26 call #t~ret0 := fact(~n - 1);< 161698#factENTRY ~n := #in~n; 161701#L25 assume ~n <= 0;#res := 1; 161700#factFINAL assume true; 161696#factEXIT >#66#return; 161697#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161708#factFINAL assume true; 161706#factEXIT >#66#return; 161705#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161704#factFINAL assume true; 161702#factEXIT >#78#return; 161703#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; 162209#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 162208#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 162206#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 162204#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; 161075#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 161078#factENTRY ~n := #in~n; 161281#L25 assume !(~n <= 0); 161275#L26 call #t~ret0 := fact(~n - 1);< 161279#factENTRY ~n := #in~n; 161329#L25 assume !(~n <= 0); 161276#L26 call #t~ret0 := fact(~n - 1);< 161327#factENTRY ~n := #in~n; 161328#L25 assume !(~n <= 0); 161277#L26 call #t~ret0 := fact(~n - 1);< 161338#factENTRY ~n := #in~n; 161340#L25 assume ~n <= 0;#res := 1; 161339#factFINAL assume true; 161337#factEXIT >#66#return; 161336#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161335#factFINAL assume true; 161333#factEXIT >#66#return; 161334#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 162210#factFINAL assume true; 162207#factEXIT >#66#return; 162205#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 162203#factFINAL assume true; 161073#factEXIT >#74#return; 161077#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 161087#factENTRY ~n := #in~n; 161103#L25 assume ~n <= 0;#res := 1; 161099#factFINAL assume true; 161086#factEXIT >#76#return; 161074#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 161078#factENTRY ~n := #in~n; 161281#L25 assume !(~n <= 0); 161275#L26 call #t~ret0 := fact(~n - 1);< 161279#factENTRY ~n := #in~n; 161329#L25 assume !(~n <= 0); 161276#L26 call #t~ret0 := fact(~n - 1);< 161327#factENTRY ~n := #in~n; 161328#L25 assume !(~n <= 0); 161277#L26 call #t~ret0 := fact(~n - 1);< 161338#factENTRY ~n := #in~n; 161340#L25 assume ~n <= 0;#res := 1; 161339#factFINAL assume true; 161337#factEXIT >#66#return; 161336#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161335#factFINAL assume true; 161333#factEXIT >#66#return; 161334#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 162210#factFINAL assume true; 162207#factEXIT >#66#return; 162205#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 162203#factFINAL assume true; 161073#factEXIT >#78#return; 161063#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; 161060#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 161039#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 161019#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 161017#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 160974#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 160975#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 161845#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; 161821#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 161822#factENTRY ~n := #in~n; 161831#L25 assume !(~n <= 0); 161829#L26 call #t~ret0 := fact(~n - 1);< 161830#factENTRY ~n := #in~n; 161833#L25 assume ~n <= 0;#res := 1; 161832#factFINAL assume true; 161828#factEXIT >#66#return; 161825#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161824#factFINAL assume true; 161819#factEXIT >#68#return; 161790#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 161792#factENTRY ~n := #in~n; 161801#L25 assume ~n <= 0;#res := 1; 161794#factFINAL assume true; 161787#factEXIT >#70#return; 161781#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 161785#factENTRY ~n := #in~n; 161808#L25 assume !(~n <= 0); 161798#L26 call #t~ret0 := fact(~n - 1);< 161800#factENTRY ~n := #in~n; 161807#L25 assume ~n <= 0;#res := 1; 161804#factFINAL assume true; 161796#factEXIT >#66#return; 161793#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161786#factFINAL assume true; 161780#factEXIT >#72#return; 161784#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; 161779#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 161776#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 161774#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 161771#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; 161764#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 161767#factENTRY ~n := #in~n; 161777#L25 assume !(~n <= 0); 161733#L26 call #t~ret0 := fact(~n - 1);< 161737#factENTRY ~n := #in~n; 161817#L25 assume ~n <= 0;#res := 1; 161816#factFINAL assume true; 161730#factEXIT >#66#return; 161736#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161769#factFINAL assume true; 161763#factEXIT >#68#return; 161759#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 161760#factENTRY ~n := #in~n; 161773#L25 assume !(~n <= 0); 161731#L26 call #t~ret0 := fact(~n - 1);< 161737#factENTRY ~n := #in~n; 161817#L25 assume ~n <= 0;#res := 1; 161816#factFINAL assume true; 161730#factEXIT >#66#return; 161735#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161762#factFINAL assume true; 161757#factEXIT >#70#return; 161753#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 161755#factENTRY ~n := #in~n; 161761#L25 assume ~n <= 0;#res := 1; 161756#factFINAL assume true; 161752#factEXIT >#72#return; 161750#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; 161748#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 161746#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 161744#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 161742#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; 161721#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 161009#factENTRY ~n := #in~n; 161858#L25 assume !(~n <= 0); 161734#L26 call #t~ret0 := fact(~n - 1);< 161853#factENTRY ~n := #in~n; 161862#L25 assume !(~n <= 0); 161851#L26 call #t~ret0 := fact(~n - 1);< 161860#factENTRY ~n := #in~n; 161864#L25 assume ~n <= 0;#res := 1; 161861#factFINAL assume true; 161859#factEXIT >#66#return; 161857#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161854#factFINAL assume true; 161849#factEXIT >#66#return; 161823#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161818#factFINAL assume true; 161738#factEXIT >#74#return; 161722#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 161728#factENTRY ~n := #in~n; 161867#L25 assume !(~n <= 0); 161732#L26 call #t~ret0 := fact(~n - 1);< 161737#factENTRY ~n := #in~n; 161817#L25 assume ~n <= 0;#res := 1; 161816#factFINAL assume true; 161730#factEXIT >#66#return; 161729#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161727#factFINAL assume true; 161719#factEXIT >#76#return; 161008#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 161009#factENTRY ~n := #in~n; 161858#L25 assume !(~n <= 0); 161734#L26 call #t~ret0 := fact(~n - 1);< 161853#factENTRY ~n := #in~n; 161817#L25 assume ~n <= 0;#res := 1; 161816#factFINAL assume true; 161730#factEXIT >#66#return; 161729#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161727#factFINAL assume true; 161719#factEXIT >#78#return; 161725#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; 162189#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 162188#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 162187#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 160992#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; 160994#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 161715#factENTRY ~n := #in~n; 162132#L25 assume !(~n <= 0); 162126#L26 call #t~ret0 := fact(~n - 1);< 162130#factENTRY ~n := #in~n; 162184#L25 assume !(~n <= 0); 162128#L26 call #t~ret0 := fact(~n - 1);< 162178#factENTRY ~n := #in~n; 162183#L25 assume !(~n <= 0); 162125#L26 call #t~ret0 := fact(~n - 1);< 162182#factENTRY ~n := #in~n; 162186#L25 assume ~n <= 0;#res := 1; 162185#factFINAL assume true; 162181#factEXIT >#66#return; 162180#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 162179#factFINAL assume true; 162176#factEXIT >#66#return; 162177#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 162200#factFINAL assume true; 162124#factEXIT >#66#return; 162122#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 162009#factFINAL assume true; 162012#factEXIT >#74#return; 160931#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 160959#factENTRY ~n := #in~n; 160960#L25 assume !(~n <= 0); 160968#L26 call #t~ret0 := fact(~n - 1);< 160969#factENTRY ~n := #in~n; 162195#L25 assume ~n <= 0;#res := 1; 162194#factFINAL assume true; 162193#factEXIT >#66#return; 162192#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 162191#factFINAL assume true; 162190#factEXIT >#76#return; 161714#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 162174#factENTRY ~n := #in~n; 162131#L25 assume !(~n <= 0); 162127#L26 call #t~ret0 := fact(~n - 1);< 162178#factENTRY ~n := #in~n; 162183#L25 assume !(~n <= 0); 162125#L26 call #t~ret0 := fact(~n - 1);< 162182#factENTRY ~n := #in~n; 162186#L25 assume ~n <= 0;#res := 1; 162185#factFINAL assume true; 162181#factEXIT >#66#return; 162180#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 162179#factFINAL assume true; 162176#factEXIT >#66#return; 162175#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 162173#factFINAL assume true; 161712#factEXIT >#78#return; 161342#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; 161341#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 161332#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 161330#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 161331#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 161842#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 161012#L42-3 [2021-11-20 06:32:50,511 INFO L793 eck$LassoCheckResult]: Loop: 161012#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 161010#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; 161011#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 161204#factENTRY ~n := #in~n; 161224#L25 assume !(~n <= 0); 161211#L26 call #t~ret0 := fact(~n - 1);< 161213#factENTRY ~n := #in~n; 161229#L25 assume !(~n <= 0); 161210#L26 call #t~ret0 := fact(~n - 1);< 161223#factENTRY ~n := #in~n; 161229#L25 assume !(~n <= 0); 161210#L26 call #t~ret0 := fact(~n - 1);< 161223#factENTRY ~n := #in~n; 161231#L25 assume ~n <= 0;#res := 1; 161242#factFINAL assume true; 161239#factEXIT >#66#return; 161237#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161234#factFINAL assume true; 161230#factEXIT >#66#return; 161228#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161222#factFINAL assume true; 161209#factEXIT >#66#return; 161208#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161207#factFINAL assume true; 161205#factEXIT >#68#return; 161198#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 161200#factENTRY ~n := #in~n; 161260#L25 assume ~n <= 0;#res := 1; 161202#factFINAL assume true; 161197#factEXIT >#70#return; 161161#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 161166#factENTRY ~n := #in~n; 161165#L25 assume !(~n <= 0); 161146#L26 call #t~ret0 := fact(~n - 1);< 161163#factENTRY ~n := #in~n; 161167#L25 assume !(~n <= 0); 161091#L26 call #t~ret0 := fact(~n - 1);< 161157#factENTRY ~n := #in~n; 161164#L25 assume !(~n <= 0); 161094#L26 call #t~ret0 := fact(~n - 1);< 161158#factENTRY ~n := #in~n; 161110#L25 assume ~n <= 0;#res := 1; 161109#factFINAL assume true; 161105#factEXIT >#66#return; 161104#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161100#factFINAL assume true; 161090#factEXIT >#66#return; 161096#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161151#factFINAL assume true; 161144#factEXIT >#66#return; 161149#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161298#factFINAL assume true; 161186#factEXIT >#72#return; 161184#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; 161182#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 161180#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 161178#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 161177#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; 161115#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 161141#factENTRY ~n := #in~n; 161297#L25 assume !(~n <= 0); 161101#L26 call #t~ret0 := fact(~n - 1);< 161150#factENTRY ~n := #in~n; 161299#L25 assume !(~n <= 0); 161095#L26 call #t~ret0 := fact(~n - 1);< 161102#factENTRY ~n := #in~n; 161295#L25 assume !(~n <= 0); 161106#L26 call #t~ret0 := fact(~n - 1);< 161107#factENTRY ~n := #in~n; 161110#L25 assume ~n <= 0;#res := 1; 161109#factFINAL assume true; 161105#factEXIT >#66#return; 161104#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161100#factFINAL assume true; 161090#factEXIT >#66#return; 161096#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161151#factFINAL assume true; 161144#factEXIT >#66#return; 161143#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161142#factFINAL assume true; 161113#factEXIT >#68#return; 161082#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 161227#factENTRY ~n := #in~n; 161111#L25 assume !(~n <= 0); 161067#L26 call #t~ret0 := fact(~n - 1);< 161083#factENTRY ~n := #in~n; 161098#L25 assume ~n <= 0;#res := 1; 161079#factFINAL assume true; 161064#factEXIT >#66#return; 161070#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161232#factFINAL assume true; 161226#factEXIT >#70#return; 161156#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 161169#factENTRY ~n := #in~n; 161168#L25 assume !(~n <= 0); 161092#L26 call #t~ret0 := fact(~n - 1);< 161157#factENTRY ~n := #in~n; 161164#L25 assume !(~n <= 0); 161094#L26 call #t~ret0 := fact(~n - 1);< 161158#factENTRY ~n := #in~n; 161110#L25 assume ~n <= 0;#res := 1; 161109#factFINAL assume true; 161105#factEXIT >#66#return; 161104#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161100#factFINAL assume true; 161090#factEXIT >#66#return; 161097#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161225#factFINAL assume true; 161214#factEXIT >#72#return; 161221#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; 161256#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 161255#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 161251#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 161247#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; 161122#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 161141#factENTRY ~n := #in~n; 161297#L25 assume !(~n <= 0); 161101#L26 call #t~ret0 := fact(~n - 1);< 161150#factENTRY ~n := #in~n; 161299#L25 assume !(~n <= 0); 161095#L26 call #t~ret0 := fact(~n - 1);< 161102#factENTRY ~n := #in~n; 161295#L25 assume !(~n <= 0); 161106#L26 call #t~ret0 := fact(~n - 1);< 161107#factENTRY ~n := #in~n; 161110#L25 assume ~n <= 0;#res := 1; 161109#factFINAL assume true; 161105#factEXIT >#66#return; 161104#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161100#factFINAL assume true; 161090#factEXIT >#66#return; 161096#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161151#factFINAL assume true; 161144#factEXIT >#66#return; 161143#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161142#factFINAL assume true; 161113#factEXIT >#68#return; 161044#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 161059#factENTRY ~n := #in~n; 161175#L25 assume !(~n <= 0); 161066#L26 call #t~ret0 := fact(~n - 1);< 161173#factENTRY ~n := #in~n; 161172#L25 assume !(~n <= 0); 161093#L26 call #t~ret0 := fact(~n - 1);< 161108#factENTRY ~n := #in~n; 161110#L25 assume ~n <= 0;#res := 1; 161109#factFINAL assume true; 161105#factEXIT >#66#return; 161104#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161100#factFINAL assume true; 161090#factEXIT >#66#return; 161072#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161062#factFINAL assume true; 161041#factEXIT >#70#return; 161022#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 161038#factENTRY ~n := #in~n; 161088#L25 assume !(~n <= 0); 161068#L26 call #t~ret0 := fact(~n - 1);< 161071#factENTRY ~n := #in~n; 161098#L25 assume ~n <= 0;#res := 1; 161079#factFINAL assume true; 161064#factEXIT >#66#return; 161061#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161040#factFINAL assume true; 161020#factEXIT >#72#return; 161018#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; 161016#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 161013#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 161014#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 161206#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; 160952#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 160953#factENTRY ~n := #in~n; 161497#L25 assume !(~n <= 0); 161434#L26 call #t~ret0 := fact(~n - 1);< 161441#factENTRY ~n := #in~n; 161572#L25 assume !(~n <= 0); 161501#L26 call #t~ret0 := fact(~n - 1);< 161502#factENTRY ~n := #in~n; 161515#L25 assume !(~n <= 0); 161509#L26 call #t~ret0 := fact(~n - 1);< 161511#factENTRY ~n := #in~n; 161514#L25 assume ~n <= 0;#res := 1; 161513#factFINAL assume true; 161508#factEXIT >#66#return; 161506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161504#factFINAL assume true; 161500#factEXIT >#66#return; 161499#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161479#factFINAL assume true; 161427#factEXIT >#66#return; 161438#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161464#factFINAL assume true; 161460#factEXIT >#68#return; 161421#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 161443#factENTRY ~n := #in~n; 161444#L25 assume !(~n <= 0); 161428#L26 call #t~ret0 := fact(~n - 1);< 161441#factENTRY ~n := #in~n; 161572#L25 assume !(~n <= 0); 161501#L26 call #t~ret0 := fact(~n - 1);< 161502#factENTRY ~n := #in~n; 161515#L25 assume !(~n <= 0); 161509#L26 call #t~ret0 := fact(~n - 1);< 161511#factENTRY ~n := #in~n; 161514#L25 assume ~n <= 0;#res := 1; 161513#factFINAL assume true; 161508#factEXIT >#66#return; 161506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161504#factFINAL assume true; 161500#factEXIT >#66#return; 161499#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161479#factFINAL assume true; 161427#factEXIT >#66#return; 161425#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161426#factFINAL assume true; 161417#factEXIT >#70#return; 161314#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 160935#factENTRY ~n := #in~n; 161318#L25 assume ~n <= 0;#res := 1; 161317#factFINAL assume true; 161312#factEXIT >#72#return; 161315#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; 161498#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 161496#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 161495#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 161494#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; 161452#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 161489#factENTRY ~n := #in~n; 161487#L25 assume !(~n <= 0); 161430#L26 call #t~ret0 := fact(~n - 1);< 161450#factENTRY ~n := #in~n; 161451#L25 assume !(~n <= 0); 161432#L26 call #t~ret0 := fact(~n - 1);< 161448#factENTRY ~n := #in~n; 161449#L25 assume !(~n <= 0); 161431#L26 call #t~ret0 := fact(~n - 1);< 161510#factENTRY ~n := #in~n; 161449#L25 assume !(~n <= 0); 161431#L26 call #t~ret0 := fact(~n - 1);< 161510#factENTRY ~n := #in~n; 161514#L25 assume ~n <= 0;#res := 1; 161513#factFINAL assume true; 161508#factEXIT >#66#return; 161506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161504#factFINAL assume true; 161500#factEXIT >#66#return; 161499#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161479#factFINAL assume true; 161427#factEXIT >#66#return; 161439#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161445#factFINAL assume true; 161446#factEXIT >#66#return; 161471#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161493#factFINAL assume true; 161491#factEXIT >#74#return; 161447#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 161490#factENTRY ~n := #in~n; 161488#L25 assume !(~n <= 0); 161435#L26 call #t~ret0 := fact(~n - 1);< 161441#factENTRY ~n := #in~n; 161572#L25 assume !(~n <= 0); 161501#L26 call #t~ret0 := fact(~n - 1);< 161502#factENTRY ~n := #in~n; 161515#L25 assume !(~n <= 0); 161509#L26 call #t~ret0 := fact(~n - 1);< 161511#factENTRY ~n := #in~n; 161514#L25 assume ~n <= 0;#res := 1; 161513#factFINAL assume true; 161508#factEXIT >#66#return; 161506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161504#factFINAL assume true; 161500#factEXIT >#66#return; 161499#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161479#factFINAL assume true; 161427#factEXIT >#66#return; 161440#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161566#factFINAL assume true; 161565#factEXIT >#76#return; 161454#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 161458#factENTRY ~n := #in~n; 161457#L25 assume !(~n <= 0); 161433#L26 call #t~ret0 := fact(~n - 1);< 161456#factENTRY ~n := #in~n; 161516#L25 assume ~n <= 0;#res := 1; 161638#factFINAL assume true; 161637#factEXIT >#66#return; 161636#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161635#factFINAL assume true; 161633#factEXIT >#78#return; 161632#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; 160963#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 160970#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 160998#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 160976#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 160977#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 161012#L42-3 [2021-11-20 06:32:50,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:32:50,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1832113088, now seen corresponding path program 30 times [2021-11-20 06:32:50,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:32:50,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287660594] [2021-11-20 06:32:50,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:32:50,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:32:50,519 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:32:50,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [343545844] [2021-11-20 06:32:50,519 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-20 06:32:50,520 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:32:50,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:32:50,530 INFO L229 MonitoredProcess]: Starting monitored process 210 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:32:50,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (210)] Waiting until timeout for monitored process [2021-11-20 06:32:51,392 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2021-11-20 06:32:51,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-20 06:32:51,392 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:32:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:32:51,609 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:32:51,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:32:51,609 INFO L85 PathProgramCache]: Analyzing trace with hash 10230353, now seen corresponding path program 25 times [2021-11-20 06:32:51,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:32:51,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120115437] [2021-11-20 06:32:51,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:32:51,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:32:51,616 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:32:51,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1114839156] [2021-11-20 06:32:51,616 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 06:32:51,617 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:32:51,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:32:51,623 INFO L229 MonitoredProcess]: Starting monitored process 211 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:32:51,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (211)] Waiting until timeout for monitored process [2021-11-20 06:32:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:32:51,969 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:32:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:32:52,297 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:32:52,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:32:52,298 INFO L85 PathProgramCache]: Analyzing trace with hash -982084302, now seen corresponding path program 31 times [2021-11-20 06:32:52,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:32:52,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447237961] [2021-11-20 06:32:52,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:32:52,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:32:52,308 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:32:52,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [14928246] [2021-11-20 06:32:52,308 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 06:32:52,308 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:32:52,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:32:52,327 INFO L229 MonitoredProcess]: Starting monitored process 212 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:32:52,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (212)] Waiting until timeout for monitored process [2021-11-20 06:32:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:32:52,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 1392 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-20 06:32:52,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:32:53,717 INFO L134 CoverageAnalysis]: Checked inductivity of 22395 backedges. 11812 proven. 127 refuted. 0 times theorem prover too weak. 10456 trivial. 0 not checked. [2021-11-20 06:32:53,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:32:55,476 INFO L134 CoverageAnalysis]: Checked inductivity of 22395 backedges. 842 proven. 692 refuted. 0 times theorem prover too weak. 20861 trivial. 0 not checked. [2021-11-20 06:32:55,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:32:55,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447237961] [2021-11-20 06:32:55,476 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:32:55,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14928246] [2021-11-20 06:32:55,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14928246] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:32:55,476 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:32:55,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 13 [2021-11-20 06:32:55,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314775040] [2021-11-20 06:32:55,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:36:01,778 WARN L227 SmtUtils]: Spent 3.01m on a formula simplification. DAG size of input: 366 DAG size of output: 333 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-20 06:36:07,266 WARN L227 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-20 06:36:10,017 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:36:10,018 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:36:10,018 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:36:10,018 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:36:10,018 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-11-20 06:36:10,018 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:36:10,018 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:36:10,018 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:36:10,018 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration39_Loop [2021-11-20 06:36:10,018 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:36:10,018 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:36:10,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:36:10,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:36:10,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:36:10,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:36:10,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:36:10,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:36:10,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:36:10,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:36:49,780 WARN L227 SmtUtils]: Spent 39.60s on a formula simplification. DAG size of input: 84 DAG size of output: 69 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2021-11-20 06:36:56,530 WARN L227 SmtUtils]: Spent 6.74s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2021-11-20 06:36:56,536 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:36:56,536 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-11-20 06:36:56,536 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:36:56,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:36:56,538 INFO L229 MonitoredProcess]: Starting monitored process 213 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:36:56,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Waiting until timeout for monitored process [2021-11-20 06:36:56,539 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:36:56,539 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:36:56,547 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-20 06:36:56,547 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: [] [2021-11-20 06:36:56,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Ended with exit code 0 [2021-11-20 06:36:56,567 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:36:56,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:36:56,568 INFO L229 MonitoredProcess]: Starting monitored process 214 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:36:56,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Waiting until timeout for monitored process [2021-11-20 06:36:56,569 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-20 06:36:56,569 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:36:56,596 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Ended with exit code 0 [2021-11-20 06:36:56,597 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:36:56,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:36:56,598 INFO L229 MonitoredProcess]: Starting monitored process 215 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:36:56,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Waiting until timeout for monitored process [2021-11-20 06:36:56,599 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-11-20 06:36:56,599 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-20 06:36:56,639 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-11-20 06:36:56,672 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Forceful destruction successful, exit code 0 [2021-11-20 06:36:56,672 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:36:56,672 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:36:56,673 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:36:56,673 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:36:56,673 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-20 06:36:56,673 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:36:56,673 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:36:56,673 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:36:56,673 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration39_Loop [2021-11-20 06:36:56,673 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:36:56,673 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:36:56,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:36:56,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:36:56,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:36:56,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:36:56,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:36:56,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:36:56,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:36:56,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:37:15,793 WARN L227 SmtUtils]: Spent 18.92s on a formula simplification. DAG size of input: 84 DAG size of output: 69 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2021-11-20 06:37:18,435 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:37:18,435 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-20 06:37:18,435 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:37:18,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:37:18,436 INFO L229 MonitoredProcess]: Starting monitored process 216 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:37:18,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Waiting until timeout for monitored process [2021-11-20 06:37:18,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:37:18,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:37:18,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:37:18,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:37:18,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:37:18,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:37:18,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:37:18,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:37:18,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:37:18,465 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Forceful destruction successful, exit code 0 [2021-11-20 06:37:18,466 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:37:18,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:37:18,467 INFO L229 MonitoredProcess]: Starting monitored process 217 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:37:18,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Waiting until timeout for monitored process [2021-11-20 06:37:18,468 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:37:18,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:37:18,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:37:18,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:37:18,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:37:18,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:37:18,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:37:18,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:37:18,476 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:37:18,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Forceful destruction successful, exit code 0 [2021-11-20 06:37:18,496 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:37:18,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:37:18,497 INFO L229 MonitoredProcess]: Starting monitored process 218 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:37:18,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Waiting until timeout for monitored process [2021-11-20 06:37:18,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:37:18,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:37:18,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:37:18,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:37:18,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:37:18,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:37:18,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:37:18,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:37:18,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:37:18,526 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Ended with exit code 0 [2021-11-20 06:37:18,526 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:37:18,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:37:18,527 INFO L229 MonitoredProcess]: Starting monitored process 219 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:37:18,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Waiting until timeout for monitored process [2021-11-20 06:37:18,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:37:18,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:37:18,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:37:18,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:37:18,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:37:18,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:37:18,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:37:18,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:37:18,548 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-20 06:37:18,551 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-11-20 06:37:18,551 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-11-20 06:37:18,552 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:37:18,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:37:18,553 INFO L229 MonitoredProcess]: Starting monitored process 220 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:37:18,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Waiting until timeout for monitored process [2021-11-20 06:37:18,556 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-20 06:37:18,556 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-11-20 06:37:18,557 INFO L513 LassoAnalysis]: Proved termination. [2021-11-20 06:37:18,557 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_~x~0#1) = -1*ULTIMATE.start_main_~n~0#1 + 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2021-11-20 06:37:18,576 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Ended with exit code 0 [2021-11-20 06:37:18,576 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-11-20 06:37:18,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:37:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:37:18,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 2147 conjuncts, 102 conjunts are in the unsatisfiable core [2021-11-20 06:37:18,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:37:19,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Forceful destruction successful, exit code 0 [2021-11-20 06:37:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:37:22,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 1963 conjuncts, 115 conjunts are in the unsatisfiable core [2021-11-20 06:37:22,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:37:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5381 backedges. 123 proven. 647 refuted. 0 times theorem prover too weak. 4611 trivial. 0 not checked. [2021-11-20 06:37:27,272 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 15 loop predicates [2021-11-20 06:37:27,272 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1292 states and 1711 transitions. cyclomatic complexity: 439 Second operand has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 18 states have internal predecessors, (64), 9 states have call successors, (24), 2 states have call predecessors, (24), 6 states have return successors, (26), 12 states have call predecessors, (26), 9 states have call successors, (26) [2021-11-20 06:37:29,742 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1292 states and 1711 transitions. cyclomatic complexity: 439. Second operand has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 18 states have internal predecessors, (64), 9 states have call successors, (24), 2 states have call predecessors, (24), 6 states have return successors, (26), 12 states have call predecessors, (26), 9 states have call successors, (26) Result 4713 states and 6408 transitions. Complement of second has 92 states. [2021-11-20 06:37:29,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2021-11-20 06:37:29,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 18 states have internal predecessors, (64), 9 states have call successors, (24), 2 states have call predecessors, (24), 6 states have return successors, (26), 12 states have call predecessors, (26), 9 states have call successors, (26) [2021-11-20 06:37:29,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 170 transitions. [2021-11-20 06:37:29,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 170 transitions. Stem has 327 letters. Loop has 295 letters. [2021-11-20 06:37:29,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:37:29,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 170 transitions. Stem has 622 letters. Loop has 295 letters. [2021-11-20 06:37:29,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:37:29,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 170 transitions. Stem has 327 letters. Loop has 590 letters. [2021-11-20 06:37:29,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:37:29,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4713 states and 6408 transitions. [2021-11-20 06:37:29,789 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-11-20 06:37:29,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4713 states to 0 states and 0 transitions. [2021-11-20 06:37:29,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-11-20 06:37:29,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-11-20 06:37:29,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-11-20 06:37:29,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:37:29,789 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-20 06:37:29,789 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-20 06:37:29,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:37:29,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 06:37:29,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-11-20 06:37:29,790 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 9 states have call successors, (31), 2 states have call predecessors, (31), 5 states have return successors, (32), 7 states have call predecessors, (32), 9 states have call successors, (32) [2021-11-20 06:37:29,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:37:29,790 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-11-20 06:37:29,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-20 06:37:29,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2021-11-20 06:37:29,791 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-11-20 06:37:29,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2021-11-20 06:37:29,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-11-20 06:37:29,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-11-20 06:37:29,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-11-20 06:37:29,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:37:29,791 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-20 06:37:29,791 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-20 06:37:29,791 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-20 06:37:29,791 INFO L425 BuchiCegarLoop]: ======== Iteration 40============ [2021-11-20 06:37:29,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-11-20 06:37:29,792 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-11-20 06:37:29,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-11-20 06:37:29,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 06:37:29 BoogieIcfgContainer [2021-11-20 06:37:29,798 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-11-20 06:37:29,798 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-20 06:37:29,798 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-20 06:37:29,799 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-20 06:37:29,799 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:26:44" (3/4) ... [2021-11-20 06:37:29,802 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-20 06:37:29,802 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-20 06:37:29,802 INFO L158 Benchmark]: Toolchain (without parser) took 645678.80ms. Allocated memory was 92.3MB in the beginning and 241.2MB in the end (delta: 148.9MB). Free memory was 57.5MB in the beginning and 51.5MB in the end (delta: 6.0MB). Peak memory consumption was 154.3MB. Max. memory is 16.1GB. [2021-11-20 06:37:29,803 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 92.3MB. Free memory was 69.3MB in the beginning and 69.2MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 06:37:29,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.12ms. Allocated memory is still 92.3MB. Free memory was 57.3MB in the beginning and 68.5MB in the end (delta: -11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-20 06:37:29,803 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.84ms. Allocated memory is still 92.3MB. Free memory was 68.5MB in the beginning and 66.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 06:37:29,804 INFO L158 Benchmark]: Boogie Preprocessor took 24.58ms. Allocated memory is still 92.3MB. Free memory was 66.9MB in the beginning and 65.9MB in the end (delta: 936.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 06:37:29,804 INFO L158 Benchmark]: RCFGBuilder took 396.17ms. Allocated memory is still 92.3MB. Free memory was 65.9MB in the beginning and 56.4MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-20 06:37:29,804 INFO L158 Benchmark]: BuchiAutomizer took 644922.75ms. Allocated memory was 92.3MB in the beginning and 241.2MB in the end (delta: 148.9MB). Free memory was 55.9MB in the beginning and 52.6MB in the end (delta: 3.4MB). Peak memory consumption was 153.2MB. Max. memory is 16.1GB. [2021-11-20 06:37:29,805 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 241.2MB. Free memory was 52.6MB in the beginning and 51.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 06:37:29,807 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 92.3MB. Free memory was 69.3MB in the beginning and 69.2MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.12ms. Allocated memory is still 92.3MB. Free memory was 57.3MB in the beginning and 68.5MB in the end (delta: -11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.84ms. Allocated memory is still 92.3MB. Free memory was 68.5MB in the beginning and 66.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.58ms. Allocated memory is still 92.3MB. Free memory was 66.9MB in the beginning and 65.9MB in the end (delta: 936.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 396.17ms. Allocated memory is still 92.3MB. Free memory was 65.9MB in the beginning and 56.4MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 644922.75ms. Allocated memory was 92.3MB in the beginning and 241.2MB in the end (delta: 148.9MB). Free memory was 55.9MB in the beginning and 52.6MB in the end (delta: 3.4MB). Peak memory consumption was 153.2MB. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 241.2MB. Free memory was 52.6MB in the beginning and 51.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 52 terminating modules (38 trivial, 11 deterministic, 3 nondeterministic). One deterministic module has affine ranking function -1 * n and consists of 6 locations. One deterministic module has affine ranking function -2 * n + 1 and consists of 8 locations. One deterministic module has affine ranking function k and consists of 16 locations. One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function -1 * k and consists of 9 locations. One deterministic module has affine ranking function -2 * k + 1 and consists of 10 locations. One deterministic module has affine ranking function k and consists of 13 locations. One deterministic module has affine ranking function x + -1 * k and consists of 6 locations. One deterministic module has affine ranking function 3 + -2 * n and consists of 9 locations. One deterministic module has affine ranking function 5 + -2 * n and consists of 10 locations. One deterministic module has affine ranking function x + -1 * n and consists of 17 locations. One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. One nondeterministic module has affine ranking function n + -1 * k and consists of 6 locations. One nondeterministic module has affine ranking function x + -1 * k and consists of 6 locations. 38 modules have a trivial ranking function, the largest among these consists of 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 644.8s and 40 iterations. TraceHistogramMax:54. Analysis of lassos took 567.0s. Construction of modules took 20.5s. Büchi inclusion checks took 53.0s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 49. Automata minimization 2.0s AutomataMinimizationTime, 50 MinimizatonAttempts, 6557 StatesRemovedByMinimization, 49 NontrivialMinimizations. Non-live state removal took 1.5s Buchi closure took 0.0s. Biggest automaton had 2028 states and ocurred in iteration 9. Nontrivial modules had stage [11, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 7472/8594 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3793 SdHoareTripleChecker+Valid, 25.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3419 mSDsluCounter, 10608 SdHoareTripleChecker+Invalid, 20.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8551 mSDsCounter, 4747 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22396 IncrementalHoareTripleChecker+Invalid, 27143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4747 mSolverCounterUnsat, 2057 mSDtfsCounter, 22396 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI18 SFLT1 conc0 concLT7 SILN0 SILU0 SILI7 SILT6 lasso0 LassoPreprocessingBenchmarks: Lassos: inital48 mio100 ax100 hnf99 lsp93 ukn100 mio100 lsp100 div157 bol100 ite100 ukn100 eq150 hnf95 smp84 dnf100 smp100 tf104 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 44ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 41 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 14 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 6.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-11-20 06:37:29,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (212)] Ended with exit code 0 [2021-11-20 06:37:30,050 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (211)] Ended with exit code 0 [2021-11-20 06:37:30,250 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (210)] Ended with exit code 0 [2021-11-20 06:37:30,449 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (209)] Ended with exit code 0 [2021-11-20 06:37:30,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (208)] Ended with exit code 0 [2021-11-20 06:37:30,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (207)] Ended with exit code 0 [2021-11-20 06:37:31,068 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (206)] Ended with exit code 0 [2021-11-20 06:37:31,267 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (205)] Ended with exit code 0 [2021-11-20 06:37:31,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (204)] Forceful destruction successful, exit code 0 [2021-11-20 06:37:31,669 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (203)] Forceful destruction successful, exit code 0 [2021-11-20 06:37:31,868 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (202)] Ended with exit code 0 [2021-11-20 06:37:32,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (201)] Ended with exit code 0 [2021-11-20 06:37:32,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (200)] Ended with exit code 0 [2021-11-20 06:37:32,467 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (199)] Ended with exit code 0 [2021-11-20 06:37:32,668 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (198)] Ended with exit code 0 [2021-11-20 06:37:32,868 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (197)] Ended with exit code 0 [2021-11-20 06:37:33,068 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (196)] Ended with exit code 0 [2021-11-20 06:37:33,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (177)] Ended with exit code 0 [2021-11-20 06:37:33,469 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (176)] Ended with exit code 0 [2021-11-20 06:37:33,669 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (175)] Forceful destruction successful, exit code 0 [2021-11-20 06:37:33,869 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (174)] Ended with exit code 0 [2021-11-20 06:37:34,070 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (173)] Ended with exit code 0 [2021-11-20 06:37:34,269 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (172)] Forceful destruction successful, exit code 0 [2021-11-20 06:37:34,470 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (171)] Ended with exit code 0 [2021-11-20 06:37:34,669 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (170)] Ended with exit code 0 [2021-11-20 06:37:34,870 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (169)] Ended with exit code 0 [2021-11-20 06:37:35,069 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (168)] Ended with exit code 0 [2021-11-20 06:37:35,270 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (167)] Ended with exit code 0 [2021-11-20 06:37:35,470 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (166)] Ended with exit code 0 [2021-11-20 06:37:35,671 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (165)] Ended with exit code 0 [2021-11-20 06:37:35,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (164)] Ended with exit code 0 [2021-11-20 06:37:36,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (163)] Forceful destruction successful, exit code 0 [2021-11-20 06:37:36,270 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (162)] Ended with exit code 0 [2021-11-20 06:37:36,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (161)] Forceful destruction successful, exit code 0 [2021-11-20 06:37:36,671 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (153)] Ended with exit code 0 [2021-11-20 06:37:36,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (152)] Ended with exit code 0 [2021-11-20 06:37:37,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Forceful destruction successful, exit code 0 [2021-11-20 06:37:37,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Ended with exit code 0 [2021-11-20 06:37:37,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Ended with exit code 0 [2021-11-20 06:37:37,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Forceful destruction successful, exit code 0 [2021-11-20 06:37:37,872 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Ended with exit code 0 [2021-11-20 06:37:38,071 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Ended with exit code 0 [2021-11-20 06:37:38,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Ended with exit code 0 [2021-11-20 06:37:38,472 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Ended with exit code 0 [2021-11-20 06:37:38,672 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Ended with exit code 0 [2021-11-20 06:37:38,872 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Ended with exit code 0 [2021-11-20 06:37:39,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Forceful destruction successful, exit code 0 [2021-11-20 06:37:39,273 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Forceful destruction successful, exit code 0 [2021-11-20 06:37:39,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Forceful destruction successful, exit code 0 [2021-11-20 06:37:39,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Forceful destruction successful, exit code 0 [2021-11-20 06:37:39,873 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Ended with exit code 0 [2021-11-20 06:37:40,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Forceful destruction successful, exit code 0 [2021-11-20 06:37:40,273 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Ended with exit code 0 [2021-11-20 06:37:40,474 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Ended with exit code 0 [2021-11-20 06:37:40,673 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Ended with exit code 0 [2021-11-20 06:37:40,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Forceful destruction successful, exit code 0 [2021-11-20 06:37:41,073 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Ended with exit code 0 [2021-11-20 06:37:41,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Forceful destruction successful, exit code 0 [2021-11-20 06:37:41,474 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Ended with exit code 0 [2021-11-20 06:37:41,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Forceful destruction successful, exit code 0 [2021-11-20 06:37:41,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Forceful destruction successful, exit code 0 [2021-11-20 06:37:42,074 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Ended with exit code 0 [2021-11-20 06:37:42,274 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Ended with exit code 0 [2021-11-20 06:37:42,475 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2021-11-20 06:37:42,675 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2021-11-20 06:37:42,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2021-11-20 06:37:43,075 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2021-11-20 06:37:43,275 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2021-11-20 06:37:43,477 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2021-11-20 06:37:43,676 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2021-11-20 06:37:43,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2021-11-20 06:37:44,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-11-20 06:37:44,276 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2021-11-20 06:37:44,476 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2021-11-20 06:37:44,677 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-11-20 06:37:44,877 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-11-20 06:37:45,140 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa821cd-0b4e-4c29-9228-ad3ee8131d35/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE