./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 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-numeric/Binomial.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 16:57:01,547 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:57:01,550 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:57:01,573 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:57:01,574 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:57:01,575 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:57:01,576 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:57:01,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:57:01,581 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:57:01,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:57:01,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:57:01,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:57:01,590 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:57:01,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:57:01,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:57:01,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:57:01,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:57:01,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:57:01,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:57:01,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:57:01,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:57:01,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:57:01,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:57:01,618 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:57:01,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:57:01,625 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:57:01,626 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:57:01,627 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:57:01,628 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:57:01,629 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:57:01,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:57:01,632 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:57:01,633 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:57:01,634 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:57:01,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:57:01,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:57:01,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:57:01,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:57:01,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:57:01,640 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:57:01,641 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:57:01,642 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-11-25 16:57:01,684 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:57:01,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:57:01,685 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:57:01,685 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:57:01,687 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:57:01,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:57:01,688 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:57:01,688 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-25 16:57:01,688 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-25 16:57:01,688 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-25 16:57:01,689 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-25 16:57:01,690 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-25 16:57:01,690 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-25 16:57:01,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:57:01,691 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 16:57:01,691 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:57:01,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:57:01,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-25 16:57:01,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-25 16:57:01,691 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-25 16:57:01,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:57:01,692 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-25 16:57:01,692 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:57:01,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-25 16:57:01,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:57:01,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:57:01,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:57:01,693 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:57:01,695 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-25 16:57:01,695 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_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/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_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R 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 [2022-11-25 16:57:02,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:57:02,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:57:02,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:57:02,030 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:57:02,031 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:57:02,032 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/termination-numeric/Binomial.c [2022-11-25 16:57:05,335 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:57:05,560 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:57:05,561 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/sv-benchmarks/c/termination-numeric/Binomial.c [2022-11-25 16:57:05,582 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/data/741260703/8dcabc0e3e124552b440aec5837e85b5/FLAG06850d18a [2022-11-25 16:57:05,608 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/data/741260703/8dcabc0e3e124552b440aec5837e85b5 [2022-11-25 16:57:05,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:57:05,614 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:57:05,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:57:05,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:57:05,620 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:57:05,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:57:05" (1/1) ... [2022-11-25 16:57:05,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b08e1d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:05, skipping insertion in model container [2022-11-25 16:57:05,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:57:05" (1/1) ... [2022-11-25 16:57:05,632 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:57:05,656 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:57:05,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:57:05,896 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:57:05,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:57:05,937 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:57:05,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:05 WrapperNode [2022-11-25 16:57:05,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:57:05,940 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:57:05,941 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:57:05,941 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:57:05,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:05" (1/1) ... [2022-11-25 16:57:05,961 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:05" (1/1) ... [2022-11-25 16:57:05,994 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2022-11-25 16:57:05,994 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:57:05,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:57:05,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:57:05,996 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:57:06,005 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:05" (1/1) ... [2022-11-25 16:57:06,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:05" (1/1) ... [2022-11-25 16:57:06,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:05" (1/1) ... [2022-11-25 16:57:06,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:05" (1/1) ... [2022-11-25 16:57:06,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:05" (1/1) ... [2022-11-25 16:57:06,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:05" (1/1) ... [2022-11-25 16:57:06,020 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:05" (1/1) ... [2022-11-25 16:57:06,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:05" (1/1) ... [2022-11-25 16:57:06,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:57:06,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:57:06,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:57:06,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:57:06,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:05" (1/1) ... [2022-11-25 16:57:06,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:06,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:06,068 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:06,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-25 16:57:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2022-11-25 16:57:06,118 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2022-11-25 16:57:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:57:06,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:57:06,175 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:57:06,177 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:57:06,342 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:57:06,356 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:57:06,357 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 16:57:06,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:57:06 BoogieIcfgContainer [2022-11-25 16:57:06,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:57:06,360 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-25 16:57:06,360 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-25 16:57:06,364 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-25 16:57:06,365 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 16:57:06,365 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 04:57:05" (1/3) ... [2022-11-25 16:57:06,366 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@140c2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 04:57:06, skipping insertion in model container [2022-11-25 16:57:06,366 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 16:57:06,366 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:05" (2/3) ... [2022-11-25 16:57:06,367 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@140c2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 04:57:06, skipping insertion in model container [2022-11-25 16:57:06,367 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 16:57:06,367 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:57:06" (3/3) ... [2022-11-25 16:57:06,369 INFO L332 chiAutomizerObserver]: Analyzing ICFG Binomial.c [2022-11-25 16:57:06,432 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-25 16:57:06,432 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-25 16:57:06,432 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-25 16:57:06,432 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-25 16:57:06,433 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-25 16:57:06,433 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-25 16:57:06,433 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-25 16:57:06,433 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-25 16:57:06,438 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) [2022-11-25 16:57:06,462 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2022-11-25 16:57:06,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:57:06,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:57:06,467 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-25 16:57:06,467 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-25 16:57:06,468 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-25 16:57:06,468 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) [2022-11-25 16:57:06,472 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2022-11-25 16:57:06,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:57:06,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:57:06,473 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-25 16:57:06,473 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-25 16:57:06,481 INFO L748 eck$LassoCheckResult]: Stem: 18#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 9#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; 17#L35true assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 27#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; 13#L41-3true [2022-11-25 16:57:06,481 INFO L750 eck$LassoCheckResult]: Loop: 13#L41-3true assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 22#L42-3true assume !(main_~k~0#1 <= main_~x~0#1); 14#L41-2true main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 13#L41-3true [2022-11-25 16:57:06,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:06,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 1 times [2022-11-25 16:57:06,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:06,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26539103] [2022-11-25 16:57:06,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:06,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:06,583 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:57:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:06,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:57:06,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:06,615 INFO L85 PathProgramCache]: Analyzing trace with hash 57812, now seen corresponding path program 1 times [2022-11-25 16:57:06,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:06,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228467372] [2022-11-25 16:57:06,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:06,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:06,633 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:57:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:06,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:57:06,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:06,643 INFO L85 PathProgramCache]: Analyzing trace with hash 553673357, now seen corresponding path program 1 times [2022-11-25 16:57:06,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:06,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094364558] [2022-11-25 16:57:06,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:06,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:06,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:06,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:06,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094364558] [2022-11-25 16:57:06,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094364558] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:57:06,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:57:06,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:57:06,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74080882] [2022-11-25 16:57:06,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:57:06,802 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:57:06,803 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:57:06,803 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:57:06,804 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:57:06,804 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-25 16:57:06,804 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:06,804 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:57:06,804 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:57:06,805 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2022-11-25 16:57:06,805 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:57:06,805 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:57:06,845 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:06,865 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:07,005 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:57:07,006 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-25 16:57:07,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:07,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:07,012 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:07,022 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:57:07,023 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:57:07,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-25 16:57:07,051 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-25 16:57:07,051 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: [] [2022-11-25 16:57:07,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:07,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:07,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:07,063 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:07,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-25 16:57:07,071 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:57:07,071 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:57:07,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:07,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:07,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:07,109 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:07,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-25 16:57:07,112 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-25 16:57:07,112 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:57:07,322 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-25 16:57:07,327 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-11-25 16:57:07,327 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:57:07,328 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:57:07,328 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:57:07,328 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:57:07,328 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-25 16:57:07,328 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:07,329 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:57:07,329 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:57:07,329 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2022-11-25 16:57:07,329 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:57:07,329 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:57:07,331 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:07,342 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:07,430 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:57:07,436 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-25 16:57:07,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:07,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:07,441 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:07,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:07,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-25 16:57:07,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:07,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:07,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:07,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:07,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:57:07,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:57:07,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:07,499 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:07,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:07,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:07,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:07,528 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:07,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-25 16:57:07,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:07,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:07,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:07,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:07,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:07,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:57:07,563 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:57:07,563 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:07,583 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-25 16:57:07,596 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-11-25 16:57:07,596 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-11-25 16:57:07,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:07,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:07,622 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:07,631 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-25 16:57:07,631 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-25 16:57:07,631 INFO L513 LassoAnalysis]: Proved termination. [2022-11-25 16:57:07,632 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 [] [2022-11-25 16:57:07,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-11-25 16:57:07,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:07,665 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-25 16:57:07,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:07,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 16:57:07,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:07,760 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 16:57:07,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:07,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-11-25 16:57:07,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:07,944 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-11-25 16:57:07,946 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) [2022-11-25 16:57:08,083 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. [2022-11-25 16:57:08,085 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 [2022-11-25 16:57:08,095 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) [2022-11-25 16:57:08,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2022-11-25 16:57:08,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 3 letters. [2022-11-25 16:57:08,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:57:08,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 7 letters. Loop has 3 letters. [2022-11-25 16:57:08,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:57:08,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 6 letters. [2022-11-25 16:57:08,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:57:08,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 106 transitions. [2022-11-25 16:57:08,120 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2022-11-25 16:57:08,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 33 states and 48 transitions. [2022-11-25 16:57:08,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-11-25 16:57:08,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-11-25 16:57:08,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 48 transitions. [2022-11-25 16:57:08,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:57:08,138 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 48 transitions. [2022-11-25 16:57:08,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 48 transitions. [2022-11-25 16:57:08,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2022-11-25 16:57:08,182 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) [2022-11-25 16:57:08,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2022-11-25 16:57:08,191 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 42 transitions. [2022-11-25 16:57:08,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:08,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:57:08,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:57:08,196 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) [2022-11-25 16:57:08,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:08,284 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-11-25 16:57:08,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2022-11-25 16:57:08,292 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2022-11-25 16:57:08,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 37 transitions. [2022-11-25 16:57:08,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-11-25 16:57:08,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2022-11-25 16:57:08,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2022-11-25 16:57:08,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:57:08,301 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-11-25 16:57:08,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2022-11-25 16:57:08,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-11-25 16:57:08,304 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) [2022-11-25 16:57:08,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-11-25 16:57:08,305 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-11-25 16:57:08,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:57:08,307 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-11-25 16:57:08,307 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-25 16:57:08,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2022-11-25 16:57:08,309 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2022-11-25 16:57:08,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:57:08,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:57:08,310 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-25 16:57:08,310 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:08,311 INFO L748 eck$LassoCheckResult]: Stem: 241#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 232#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; 233#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 240#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; 236#L41-3 [2022-11-25 16:57:08,311 INFO L750 eck$LassoCheckResult]: Loop: 236#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 237#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 242#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 218#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 219#factENTRY ~n := #in~n; 231#L25 assume ~n <= 0;#res := 1; 230#factFINAL assume true; 220#factEXIT >#74#return; 225#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 219#factENTRY ~n := #in~n; 231#L25 assume ~n <= 0;#res := 1; 230#factFINAL assume true; 220#factEXIT >#76#return; 221#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 219#factENTRY ~n := #in~n; 231#L25 assume ~n <= 0;#res := 1; 230#factFINAL assume true; 220#factEXIT >#78#return; 227#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; 234#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 235#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 243#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 239#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 236#L41-3 [2022-11-25 16:57:08,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:08,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 2 times [2022-11-25 16:57:08,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:08,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376573142] [2022-11-25 16:57:08,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:08,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:08,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:57:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:08,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:57:08,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:08,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1284911041, now seen corresponding path program 1 times [2022-11-25 16:57:08,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:08,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709500362] [2022-11-25 16:57:08,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:08,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:08,351 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:08,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [298039378] [2022-11-25 16:57:08,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:08,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:08,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:08,369 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:08,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 16:57:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:08,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 16:57:08,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:08,562 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 16:57:08,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:57:08,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:08,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709500362] [2022-11-25 16:57:08,563 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:57:08,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298039378] [2022-11-25 16:57:08,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298039378] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:57:08,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:57:08,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:57:08,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370305027] [2022-11-25 16:57:08,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:57:08,566 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:57:08,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:08,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:57:08,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:57:08,568 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 16:57:08,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:08,702 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2022-11-25 16:57:08,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2022-11-25 16:57:08,707 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2022-11-25 16:57:08,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 50 transitions. [2022-11-25 16:57:08,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2022-11-25 16:57:08,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2022-11-25 16:57:08,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2022-11-25 16:57:08,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:57:08,714 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 50 transitions. [2022-11-25 16:57:08,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2022-11-25 16:57:08,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2022-11-25 16:57:08,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2022-11-25 16:57:08,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-11-25 16:57:08,730 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 42 transitions. [2022-11-25 16:57:08,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:57:08,732 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2022-11-25 16:57:08,733 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-25 16:57:08,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 42 transitions. [2022-11-25 16:57:08,736 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2022-11-25 16:57:08,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:57:08,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:57:08,739 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-25 16:57:08,740 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:08,740 INFO L748 eck$LassoCheckResult]: Stem: 377#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 367#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; 368#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 376#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; 372#L41-3 [2022-11-25 16:57:08,740 INFO L750 eck$LassoCheckResult]: Loop: 372#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 373#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 378#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 354#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 355#factENTRY ~n := #in~n; 366#L25 assume ~n <= 0;#res := 1; 365#factFINAL assume true; 356#factEXIT >#74#return; 362#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 355#factENTRY ~n := #in~n; 366#L25 assume ~n <= 0;#res := 1; 365#factFINAL assume true; 356#factEXIT >#76#return; 358#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 355#factENTRY ~n := #in~n; 366#L25 assume !(~n <= 0); 360#L26 call #t~ret0 := fact(~n - 1);< 355#factENTRY ~n := #in~n; 366#L25 assume ~n <= 0;#res := 1; 365#factFINAL assume true; 356#factEXIT >#66#return; 364#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 379#factFINAL assume true; 381#factEXIT >#78#return; 369#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; 370#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 371#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 380#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 375#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 372#L41-3 [2022-11-25 16:57:08,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:08,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 3 times [2022-11-25 16:57:08,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:08,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567116424] [2022-11-25 16:57:08,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:08,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:08,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:57:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:08,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:57:08,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:08,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1183838151, now seen corresponding path program 1 times [2022-11-25 16:57:08,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:08,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207818980] [2022-11-25 16:57:08,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:08,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:08,798 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:08,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1771209358] [2022-11-25 16:57:08,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:08,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:08,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:08,802 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:08,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 16:57:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:08,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:57:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:08,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:57:08,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:08,921 INFO L85 PathProgramCache]: Analyzing trace with hash 2107943858, now seen corresponding path program 1 times [2022-11-25 16:57:08,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:08,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751075839] [2022-11-25 16:57:08,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:08,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:08,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:08,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751075839] [2022-11-25 16:57:08,967 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-11-25 16:57:08,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381044554] [2022-11-25 16:57:08,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:08,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:08,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:08,979 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:08,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 16:57:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:09,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 16:57:09,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:09,109 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-25 16:57:09,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:57:09,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381044554] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:57:09,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:57:09,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:57:09,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571551065] [2022-11-25 16:57:09,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:57:09,685 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:57:09,685 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:57:09,685 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:57:09,685 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:57:09,686 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-25 16:57:09,686 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:09,686 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:57:09,686 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:57:09,686 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2022-11-25 16:57:09,686 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:57:09,686 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:57:09,688 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:09,692 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:09,735 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:09,738 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:09,741 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:09,743 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:09,760 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:10,177 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:57:10,177 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-25 16:57:10,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:10,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:10,181 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:10,193 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:57:10,193 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:57:10,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-11-25 16:57:10,218 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-25 16:57:10,218 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: [] [2022-11-25 16:57:10,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:10,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:10,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:10,234 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:10,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-11-25 16:57:10,252 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:57:10,253 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:57:10,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:10,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:10,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:10,295 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:10,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-11-25 16:57:10,299 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-25 16:57:10,299 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:57:10,347 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-25 16:57:10,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:10,358 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:57:10,359 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:57:10,359 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:57:10,359 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:57:10,359 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-25 16:57:10,359 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:10,359 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:57:10,360 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:57:10,360 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2022-11-25 16:57:10,360 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:57:10,360 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:57:10,362 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:10,366 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:10,369 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:10,371 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:10,374 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:10,377 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:10,380 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:10,838 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:57:10,839 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-25 16:57:10,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:10,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:10,841 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:10,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:10,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-11-25 16:57:10,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:10,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:10,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:10,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:10,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:57:10,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:57:10,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:10,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:10,893 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:10,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:10,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:10,895 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:10,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:10,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-11-25 16:57:10,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:10,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:10,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:10,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:10,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:57:10,920 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:57:10,920 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:10,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:10,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:10,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:10,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:10,953 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:10,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-11-25 16:57:10,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:10,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:10,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:10,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:10,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:10,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:57:10,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:57:10,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:11,003 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:11,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:11,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:11,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:11,008 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:11,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-11-25 16:57:11,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:11,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:11,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:11,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:11,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:11,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:57:11,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:57:11,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:11,047 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:11,050 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:11,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:11,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:11,053 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:11,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-11-25 16:57:11,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:11,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:11,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:11,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:11,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:11,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:57:11,082 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:57:11,083 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:11,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:11,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:11,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:11,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:11,104 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:11,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:11,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:11,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:11,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:11,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:11,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:57:11,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-11-25 16:57:11,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:57:11,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:11,147 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:11,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:11,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:11,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:11,158 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:11,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:11,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-11-25 16:57:11,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:11,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:11,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:11,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:11,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:57:11,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:57:11,193 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:11,211 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:11,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:11,220 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-11-25 16:57:11,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:11,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:11,221 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:11,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:11,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:11,238 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:11,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:11,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:11,239 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-25 16:57:11,240 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-25 16:57:11,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:11,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-11-25 16:57:11,249 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:11,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:11,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:11,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:11,260 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:11,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:11,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-11-25 16:57:11,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:11,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:11,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:11,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:11,287 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-25 16:57:11,288 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-25 16:57:11,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:11,297 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:11,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:11,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:11,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:11,309 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:11,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:11,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-11-25 16:57:11,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:11,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:11,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:11,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:11,329 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-25 16:57:11,330 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-25 16:57:11,330 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:11,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:11,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:11,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:11,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:11,353 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:11,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:11,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-11-25 16:57:11,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:11,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:11,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:11,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:11,373 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-25 16:57:11,374 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-25 16:57:11,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:11,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:11,413 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:11,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:11,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:11,415 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:11,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:11,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-11-25 16:57:11,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:11,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:11,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:11,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:11,440 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-25 16:57:11,441 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-25 16:57:11,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:11,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:11,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:11,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:11,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:11,469 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:11,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:11,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-11-25 16:57:11,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:11,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:11,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:11,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:11,492 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-25 16:57:11,496 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-25 16:57:11,497 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:11,506 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:11,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:11,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:11,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:11,519 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:11,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:11,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-11-25 16:57:11,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:11,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:11,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:11,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:11,542 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-25 16:57:11,551 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-25 16:57:11,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:11,568 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:11,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:11,578 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-11-25 16:57:11,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:11,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:11,580 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:11,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:11,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-11-25 16:57:11,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:11,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:11,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:11,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:11,602 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:57:11,603 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:57:11,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:11,618 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:11,628 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:11,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:11,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:11,630 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:11,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:11,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-11-25 16:57:11,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:11,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:11,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:11,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:11,652 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:57:11,653 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:57:11,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:11,667 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:11,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:11,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:11,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:11,677 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:11,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:11,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-11-25 16:57:11,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:11,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:11,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:11,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:11,698 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:57:11,701 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:57:11,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:11,718 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:11,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:11,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:11,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:11,730 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:11,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:11,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-11-25 16:57:11,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:11,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:11,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:11,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:11,753 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:57:11,754 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:57:11,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:11,764 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:11,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:11,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:11,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:11,770 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:11,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:11,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:11,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:11,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:11,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:11,790 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:57:11,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-11-25 16:57:11,791 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:57:11,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:11,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:11,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:11,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:11,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:11,819 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:11,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:11,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-11-25 16:57:11,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:11,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:11,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:11,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:11,836 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:57:11,837 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:57:11,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:11,849 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:11,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:11,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:11,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:11,856 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:11,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:11,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-11-25 16:57:11,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:11,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:11,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:11,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:11,875 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:57:11,884 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:57:11,884 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:11,903 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:11,908 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:11,909 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-11-25 16:57:11,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:11,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:11,911 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:11,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 [2022-11-25 16:57:11,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-11-25 16:57:11,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:11,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:11,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:11,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:11,930 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-25 16:57:11,931 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-25 16:57:11,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:11,951 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:11,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:11,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:11,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:11,956 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:11,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:11,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-11-25 16:57:11,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:11,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:11,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:11,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:11,978 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-25 16:57:11,979 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-25 16:57:11,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:11,989 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:11,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:11,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:11,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:11,994 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:11,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:12,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:12,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:12,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:12,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:12,012 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-25 16:57:12,014 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-25 16:57:12,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:12,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-11-25 16:57:12,036 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:12,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:12,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:12,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:12,041 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:12,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:12,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-11-25 16:57:12,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:12,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:12,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:12,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:12,062 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-25 16:57:12,064 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-25 16:57:12,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:12,086 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:12,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:12,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:12,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:12,097 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:12,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:12,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-11-25 16:57:12,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:12,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:12,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:12,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:12,119 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-25 16:57:12,121 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-25 16:57:12,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:12,131 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:12,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:12,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:12,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:12,137 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:12,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:12,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-11-25 16:57:12,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:12,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:12,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:12,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:12,158 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-25 16:57:12,159 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-25 16:57:12,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:12,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:12,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:12,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:12,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:12,176 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:12,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-11-25 16:57:12,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:12,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:12,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:12,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:12,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:12,196 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-25 16:57:12,206 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-25 16:57:12,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:12,222 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:12,227 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:12,227 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-11-25 16:57:12,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:12,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:12,229 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:12,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:12,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-11-25 16:57:12,255 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:12,255 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-25 16:57:12,255 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:12,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:12,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:12,255 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-25 16:57:12,260 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-25 16:57:12,260 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:12,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:12,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:12,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:12,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:12,294 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:12,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:12,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-11-25 16:57:12,319 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:12,319 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-25 16:57:12,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:12,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:12,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:12,319 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-25 16:57:12,321 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-25 16:57:12,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:12,336 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:12,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:12,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:12,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:12,349 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:12,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:12,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-11-25 16:57:12,366 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:12,367 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-25 16:57:12,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:12,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:12,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:12,367 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-25 16:57:12,368 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-25 16:57:12,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:12,371 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:12,378 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:12,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:12,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:12,379 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:12,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-11-25 16:57:12,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 [2022-11-25 16:57:12,394 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:12,395 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-25 16:57:12,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:12,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:12,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:12,395 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-25 16:57:12,396 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-25 16:57:12,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:12,407 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:12,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:12,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:12,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:12,412 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:12,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-11-25 16:57:12,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:12,434 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:12,434 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-25 16:57:12,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:12,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:12,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:12,434 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-25 16:57:12,436 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-25 16:57:12,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:12,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:12,449 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-11-25 16:57:12,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:12,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:12,451 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:12,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-11-25 16:57:12,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:12,471 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:12,471 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-25 16:57:12,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:12,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:12,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:12,471 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-25 16:57:12,473 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-25 16:57:12,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:12,483 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:12,488 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:12,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:12,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:12,490 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:12,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:12,515 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:12,516 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-25 16:57:12,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:12,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:12,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:12,516 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-25 16:57:12,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-11-25 16:57:12,523 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-25 16:57:12,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:12,542 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:12,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:12,546 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-11-25 16:57:12,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:12,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:12,548 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:12,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:12,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-11-25 16:57:12,567 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:12,567 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-25 16:57:12,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:12,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:12,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:12,568 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:57:12,569 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:57:12,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:12,591 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:12,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:12,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:12,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:12,596 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:12,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:12,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-11-25 16:57:12,620 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:12,620 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-25 16:57:12,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:12,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:12,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:12,620 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:57:12,622 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:57:12,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:12,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:12,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:12,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:12,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:12,657 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:12,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:12,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-11-25 16:57:12,703 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:12,704 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-25 16:57:12,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:12,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:12,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:12,704 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:57:12,707 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:57:12,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:12,727 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:12,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:12,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:12,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:12,733 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:12,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:12,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-11-25 16:57:12,753 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:12,754 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-25 16:57:12,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:12,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:12,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:12,754 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:57:12,756 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:57:12,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:12,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:12,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:12,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:12,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:12,781 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:12,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:12,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-11-25 16:57:12,801 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:12,802 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-25 16:57:12,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:12,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:12,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:12,802 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:57:12,804 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:57:12,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:12,823 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:12,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:12,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:12,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:12,829 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:12,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:12,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-11-25 16:57:12,849 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:12,849 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-25 16:57:12,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:12,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:12,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:12,850 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:57:12,851 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:57:12,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:12,863 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:12,868 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:12,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:12,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:12,870 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:12,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:12,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-11-25 16:57:12,891 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:12,891 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-25 16:57:12,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:12,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:12,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:12,892 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:57:12,901 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:57:12,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:12,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:12,935 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:12,935 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-11-25 16:57:12,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:12,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:12,936 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:12,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:12,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-11-25 16:57:12,955 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:12,955 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-25 16:57:12,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:12,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:12,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:12,956 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-25 16:57:12,958 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-25 16:57:12,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:12,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:12,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:12,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:12,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:12,984 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:12,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:13,003 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:13,004 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-25 16:57:13,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:13,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:13,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:13,004 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-25 16:57:13,006 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-25 16:57:13,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:13,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-11-25 16:57:13,027 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:13,030 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:13,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:13,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:13,032 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:13,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:13,050 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:13,050 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-25 16:57:13,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:13,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:13,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:13,051 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-25 16:57:13,052 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-25 16:57:13,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:13,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-11-25 16:57:13,071 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:13,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:13,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:13,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:13,076 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:13,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-11-25 16:57:13,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:13,093 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:13,094 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-25 16:57:13,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:13,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:13,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:13,094 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-25 16:57:13,096 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-25 16:57:13,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:13,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:13,115 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-11-25 16:57:13,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:13,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:13,117 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:13,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-11-25 16:57:13,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:13,133 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:13,133 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-25 16:57:13,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:13,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:13,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:13,134 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-25 16:57:13,136 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-25 16:57:13,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:13,149 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:13,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:13,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:13,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:13,155 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:13,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-11-25 16:57:13,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:13,174 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:13,174 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-25 16:57:13,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:13,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:13,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:13,175 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-25 16:57:13,177 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-25 16:57:13,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:13,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:13,210 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:13,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:13,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:13,212 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:13,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:13,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-11-25 16:57:13,237 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:13,237 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-25 16:57:13,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:13,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:13,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:13,238 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-25 16:57:13,251 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-25 16:57:13,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:13,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:13,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:13,308 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-11-25 16:57:13,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:13,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:13,309 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:13,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 [2022-11-25 16:57:13,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-11-25 16:57:13,337 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:13,337 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-25 16:57:13,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:13,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:13,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:13,337 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:57:13,339 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:57:13,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:13,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:13,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:13,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:13,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:13,362 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:13,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-11-25 16:57:13,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:13,382 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:13,383 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-25 16:57:13,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:13,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:13,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:13,383 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:57:13,384 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:57:13,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:13,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:13,407 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:13,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:13,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:13,408 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:13,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:13,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-11-25 16:57:13,428 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:13,428 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-25 16:57:13,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:13,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:13,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:13,429 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:57:13,430 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:57:13,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:13,451 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:13,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:13,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:13,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:13,457 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:13,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:13,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-11-25 16:57:13,479 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:13,479 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-25 16:57:13,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:13,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:13,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:13,479 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:57:13,480 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:57:13,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:13,499 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:13,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:13,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:13,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:13,506 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:13,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:13,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-11-25 16:57:13,522 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:13,522 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-25 16:57:13,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:13,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:13,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:13,523 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:57:13,524 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:57:13,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:13,534 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:13,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:13,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:13,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:13,540 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:13,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-11-25 16:57:13,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:13,558 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:13,558 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-25 16:57:13,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:13,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:13,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:13,558 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:57:13,559 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:57:13,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:13,569 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:13,573 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:13,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:13,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:13,576 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:13,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:13,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-11-25 16:57:13,600 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:13,600 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-25 16:57:13,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:13,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:13,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:13,601 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:57:13,609 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:57:13,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:13,626 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:13,631 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:13,631 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-11-25 16:57:13,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:13,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:13,633 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:13,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:13,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-11-25 16:57:13,652 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:13,653 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-25 16:57:13,653 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:13,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:13,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:13,653 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-25 16:57:13,654 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 16:57:13,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:13,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:13,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:13,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:13,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:13,676 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:13,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:13,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-11-25 16:57:13,701 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:13,701 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-25 16:57:13,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:13,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:13,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:13,702 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-25 16:57:13,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 16:57:13,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:13,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:13,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:13,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:13,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:13,728 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:13,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-11-25 16:57:13,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:13,750 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:13,750 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-25 16:57:13,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:13,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:13,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:13,750 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-25 16:57:13,752 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 16:57:13,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:13,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:13,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:13,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:13,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:13,780 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:13,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 [2022-11-25 16:57:13,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-11-25 16:57:13,803 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:13,803 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-25 16:57:13,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:13,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:13,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:13,804 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-25 16:57:13,806 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 16:57:13,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:13,823 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:13,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:13,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:13,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:13,830 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:13,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:13,850 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:13,850 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-25 16:57:13,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:13,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:13,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:13,850 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-25 16:57:13,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 16:57:13,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:13,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-11-25 16:57:13,864 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:13,868 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:13,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:13,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:13,870 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:13,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:13,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-11-25 16:57:13,889 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:13,889 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-25 16:57:13,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:13,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:13,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:13,889 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-25 16:57:13,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 16:57:13,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:13,902 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:13,906 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:13,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:13,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:13,907 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:13,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-11-25 16:57:13,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:13,923 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:57:13,924 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-25 16:57:13,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:13,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:13,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:13,924 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-25 16:57:13,937 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 16:57:13,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:13,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:13,972 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:13,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:13,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:57:13,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:57:13,974 INFO L87 Difference]: Start difference. First operand 28 states and 42 transitions. cyclomatic complexity: 16 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2022-11-25 16:57:14,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:14,035 INFO L93 Difference]: Finished difference Result 35 states and 55 transitions. [2022-11-25 16:57:14,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 55 transitions. [2022-11-25 16:57:14,037 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2022-11-25 16:57:14,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 55 transitions. [2022-11-25 16:57:14,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-11-25 16:57:14,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2022-11-25 16:57:14,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 55 transitions. [2022-11-25 16:57:14,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:57:14,041 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 55 transitions. [2022-11-25 16:57:14,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 55 transitions. [2022-11-25 16:57:14,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2022-11-25 16:57:14,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2022-11-25 16:57:14,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-11-25 16:57:14,047 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2022-11-25 16:57:14,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:57:14,048 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2022-11-25 16:57:14,048 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-25 16:57:14,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 43 transitions. [2022-11-25 16:57:14,049 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-11-25 16:57:14,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:57:14,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:57:14,051 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-25 16:57:14,051 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:14,051 INFO L748 eck$LassoCheckResult]: Stem: 545#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 535#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; 536#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 544#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; 540#L41-3 [2022-11-25 16:57:14,052 INFO L750 eck$LassoCheckResult]: Loop: 540#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 541#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 546#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 530#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 523#factENTRY ~n := #in~n; 534#L25 assume !(~n <= 0); 527#L26 call #t~ret0 := fact(~n - 1);< 523#factENTRY ~n := #in~n; 534#L25 assume ~n <= 0;#res := 1; 533#factFINAL assume true; 525#factEXIT >#66#return; 531#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 547#factFINAL assume true; 550#factEXIT >#68#return; 528#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 523#factENTRY ~n := #in~n; 534#L25 assume !(~n <= 0); 527#L26 call #t~ret0 := fact(~n - 1);< 523#factENTRY ~n := #in~n; 534#L25 assume ~n <= 0;#res := 1; 533#factFINAL assume true; 525#factEXIT >#66#return; 531#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 547#factFINAL assume true; 550#factEXIT >#70#return; 524#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 523#factENTRY ~n := #in~n; 534#L25 assume !(~n <= 0); 527#L26 call #t~ret0 := fact(~n - 1);< 523#factENTRY ~n := #in~n; 534#L25 assume ~n <= 0;#res := 1; 533#factFINAL assume true; 525#factEXIT >#66#return; 531#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 547#factFINAL assume true; 550#factEXIT >#72#return; 532#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 542#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 539#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 548#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 543#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 540#L41-3 [2022-11-25 16:57:14,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:14,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 4 times [2022-11-25 16:57:14,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:14,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092575701] [2022-11-25 16:57:14,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:14,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:14,058 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:57:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:14,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:57:14,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:14,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1909923709, now seen corresponding path program 1 times [2022-11-25 16:57:14,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:14,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140894692] [2022-11-25 16:57:14,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:14,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:14,074 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:14,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1551617135] [2022-11-25 16:57:14,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:14,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:14,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:14,076 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:14,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-11-25 16:57:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:14,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 16:57:14,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:14,215 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 47 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 16:57:14,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:57:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-25 16:57:14,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:14,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140894692] [2022-11-25 16:57:14,328 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:57:14,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551617135] [2022-11-25 16:57:14,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551617135] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:57:14,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:57:14,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-11-25 16:57:14,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717882785] [2022-11-25 16:57:14,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:57:14,330 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:57:14,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:14,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:57:14,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:57:14,332 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. cyclomatic complexity: 16 Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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) [2022-11-25 16:57:14,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:14,550 INFO L93 Difference]: Finished difference Result 41 states and 62 transitions. [2022-11-25 16:57:14,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 62 transitions. [2022-11-25 16:57:14,552 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2022-11-25 16:57:14,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 62 transitions. [2022-11-25 16:57:14,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2022-11-25 16:57:14,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2022-11-25 16:57:14,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 62 transitions. [2022-11-25 16:57:14,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:57:14,567 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 62 transitions. [2022-11-25 16:57:14,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 62 transitions. [2022-11-25 16:57:14,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2022-11-25 16:57:14,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) [2022-11-25 16:57:14,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. [2022-11-25 16:57:14,581 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 48 transitions. [2022-11-25 16:57:14,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:57:14,583 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 48 transitions. [2022-11-25 16:57:14,584 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-25 16:57:14,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 48 transitions. [2022-11-25 16:57:14,585 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2022-11-25 16:57:14,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:57:14,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:57:14,588 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-25 16:57:14,589 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:14,589 INFO L748 eck$LassoCheckResult]: Stem: 871#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 861#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; 862#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 870#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; 866#L41-3 [2022-11-25 16:57:14,589 INFO L750 eck$LassoCheckResult]: Loop: 866#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 867#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 872#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 855#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 847#factENTRY ~n := #in~n; 860#L25 assume ~n <= 0;#res := 1; 859#factFINAL assume true; 849#factEXIT >#68#return; 851#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 847#factENTRY ~n := #in~n; 860#L25 assume ~n <= 0;#res := 1; 859#factFINAL assume true; 849#factEXIT >#70#return; 848#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 847#factENTRY ~n := #in~n; 860#L25 assume ~n <= 0;#res := 1; 859#factFINAL assume true; 849#factEXIT >#72#return; 858#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 868#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 865#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 874#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 869#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 866#L41-3 [2022-11-25 16:57:14,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:14,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 5 times [2022-11-25 16:57:14,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:14,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644414537] [2022-11-25 16:57:14,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:14,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:14,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:57:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:14,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:57:14,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:14,608 INFO L85 PathProgramCache]: Analyzing trace with hash -743603515, now seen corresponding path program 1 times [2022-11-25 16:57:14,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:14,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332724461] [2022-11-25 16:57:14,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:14,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:14,617 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:14,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1310285856] [2022-11-25 16:57:14,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:14,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:14,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:14,624 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:14,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-11-25 16:57:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:14,677 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:57:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:14,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:57:14,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:14,696 INFO L85 PathProgramCache]: Analyzing trace with hash 343305470, now seen corresponding path program 1 times [2022-11-25 16:57:14,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:14,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290382386] [2022-11-25 16:57:14,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:14,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:14,706 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:14,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1216423116] [2022-11-25 16:57:14,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:14,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:14,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:14,715 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:14,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-11-25 16:57:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:14,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:57:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:14,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:57:15,153 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:57:15,153 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:57:15,154 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:57:15,154 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:57:15,154 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-25 16:57:15,154 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:15,154 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:57:15,154 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:57:15,154 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration5_Loop [2022-11-25 16:57:15,154 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:57:15,155 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:57:15,156 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:15,161 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:15,187 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:15,190 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:15,193 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:15,195 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:15,198 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:15,201 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:15,329 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:57:15,329 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-25 16:57:15,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:15,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:15,339 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:15,345 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:57:15,346 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:57:15,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-11-25 16:57:15,375 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-25 16:57:15,375 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: [] [2022-11-25 16:57:15,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:15,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:15,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:15,381 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:15,387 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:57:15,387 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:57:15,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-11-25 16:57:15,414 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2022-11-25 16:57:15,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:15,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:15,415 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:15,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-11-25 16:57:15,421 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-25 16:57:15,421 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:57:15,975 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-25 16:57:15,979 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2022-11-25 16:57:15,980 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:57:15,980 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:57:15,980 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:57:15,980 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:57:15,980 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-25 16:57:15,980 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:15,980 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:57:15,980 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:57:15,980 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration5_Loop [2022-11-25 16:57:15,980 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:57:15,980 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:57:15,982 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:15,986 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:16,012 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:16,015 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:16,017 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:16,020 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:16,022 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:16,024 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:16,137 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:57:16,137 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-25 16:57:16,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:16,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:16,138 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:16,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-11-25 16:57:16,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:16,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:16,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:16,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:16,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:16,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:57:16,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:57:16,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:16,174 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:16,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:16,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:16,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:16,178 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:16,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-11-25 16:57:16,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:16,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:16,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:16,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:16,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:16,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:57:16,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:57:16,200 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:16,211 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-25 16:57:16,216 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-25 16:57:16,216 INFO L444 ModelExtractionUtils]: 6 out of 9 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-25 16:57:16,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:16,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:16,235 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:16,236 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-25 16:57:16,236 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-25 16:57:16,236 INFO L513 LassoAnalysis]: Proved termination. [2022-11-25 16:57:16,236 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 [] [2022-11-25 16:57:16,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-11-25 16:57:16,240 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:16,241 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-25 16:57:16,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:16,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 16:57:16,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:16,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 16:57:16,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:16,491 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 16:57:16,492 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2022-11-25 16:57:16,492 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 48 transitions. cyclomatic complexity: 19 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) [2022-11-25 16:57:16,815 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 48 transitions. cyclomatic complexity: 19. 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 123 states and 190 transitions. Complement of second has 26 states. [2022-11-25 16:57:16,815 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 [2022-11-25 16:57:16,816 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) [2022-11-25 16:57:16,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2022-11-25 16:57:16,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 71 transitions. Stem has 4 letters. Loop has 23 letters. [2022-11-25 16:57:16,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:57:16,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 71 transitions. Stem has 27 letters. Loop has 23 letters. [2022-11-25 16:57:16,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:57:16,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 71 transitions. Stem has 4 letters. Loop has 46 letters. [2022-11-25 16:57:16,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:57:16,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 190 transitions. [2022-11-25 16:57:16,823 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2022-11-25 16:57:16,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 122 states and 189 transitions. [2022-11-25 16:57:16,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2022-11-25 16:57:16,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2022-11-25 16:57:16,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 189 transitions. [2022-11-25 16:57:16,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:57:16,829 INFO L218 hiAutomatonCegarLoop]: Abstraction has 122 states and 189 transitions. [2022-11-25 16:57:16,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 189 transitions. [2022-11-25 16:57:16,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 117. [2022-11-25 16:57:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 76 states have internal predecessors, (86), 36 states have call successors, (36), 6 states have call predecessors, (36), 10 states have return successors, (58), 34 states have call predecessors, (58), 36 states have call successors, (58) [2022-11-25 16:57:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 180 transitions. [2022-11-25 16:57:16,843 INFO L240 hiAutomatonCegarLoop]: Abstraction has 117 states and 180 transitions. [2022-11-25 16:57:16,843 INFO L428 stractBuchiCegarLoop]: Abstraction has 117 states and 180 transitions. [2022-11-25 16:57:16,843 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-25 16:57:16,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 180 transitions. [2022-11-25 16:57:16,845 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2022-11-25 16:57:16,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:57:16,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:57:16,848 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-25 16:57:16,848 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:16,848 INFO L748 eck$LassoCheckResult]: Stem: 1203#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1181#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; 1182#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1202#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; 1213#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1192#L42-3 [2022-11-25 16:57:16,849 INFO L750 eck$LassoCheckResult]: Loop: 1192#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1209#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1171#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1152#factENTRY ~n := #in~n; 1234#L25 assume !(~n <= 0); 1138#L26 call #t~ret0 := fact(~n - 1);< 1187#factENTRY ~n := #in~n; 1230#L25 assume ~n <= 0;#res := 1; 1229#factFINAL assume true; 1137#factEXIT >#66#return; 1141#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1232#factFINAL assume true; 1221#factEXIT >#68#return; 1210#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1152#factENTRY ~n := #in~n; 1234#L25 assume ~n <= 0;#res := 1; 1233#factFINAL assume true; 1228#factEXIT >#70#return; 1151#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1152#factENTRY ~n := #in~n; 1234#L25 assume !(~n <= 0); 1138#L26 call #t~ret0 := fact(~n - 1);< 1187#factENTRY ~n := #in~n; 1230#L25 assume ~n <= 0;#res := 1; 1229#factFINAL assume true; 1137#factEXIT >#66#return; 1141#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1232#factFINAL assume true; 1221#factEXIT >#72#return; 1220#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1218#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1216#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1214#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1200#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1191#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1192#L42-3 [2022-11-25 16:57:16,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:16,849 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 1 times [2022-11-25 16:57:16,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:16,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641772961] [2022-11-25 16:57:16,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:16,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:16,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:57:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:16,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:57:16,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:16,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1403101825, now seen corresponding path program 2 times [2022-11-25 16:57:16,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:16,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377358991] [2022-11-25 16:57:16,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:16,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:16,886 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:16,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [940515607] [2022-11-25 16:57:16,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 16:57:16,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:16,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:16,891 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:16,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2022-11-25 16:57:16,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 16:57:16,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:57:16,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 16:57:16,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:17,041 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:17,149 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 16:57:17,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:57:17,427 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 16:57:17,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:17,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377358991] [2022-11-25 16:57:17,428 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:57:17,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940515607] [2022-11-25 16:57:17,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940515607] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:57:17,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:57:17,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-11-25 16:57:17,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081878536] [2022-11-25 16:57:17,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:57:17,430 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:57:17,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:17,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 16:57:17,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-11-25 16:57:17,431 INFO L87 Difference]: Start difference. First operand 117 states and 180 transitions. cyclomatic complexity: 68 Second operand has 20 states, 15 states have (on average 2.066666666666667) internal successors, (31), 18 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 16:57:18,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:18,481 INFO L93 Difference]: Finished difference Result 284 states and 438 transitions. [2022-11-25 16:57:18,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 284 states and 438 transitions. [2022-11-25 16:57:18,487 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 110 [2022-11-25 16:57:18,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 284 states to 271 states and 424 transitions. [2022-11-25 16:57:18,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2022-11-25 16:57:18,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2022-11-25 16:57:18,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 271 states and 424 transitions. [2022-11-25 16:57:18,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:57:18,496 INFO L218 hiAutomatonCegarLoop]: Abstraction has 271 states and 424 transitions. [2022-11-25 16:57:18,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states and 424 transitions. [2022-11-25 16:57:18,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 153. [2022-11-25 16:57:18,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 97 states have (on average 1.1546391752577319) internal successors, (112), 102 states have internal predecessors, (112), 46 states have call successors, (46), 6 states have call predecessors, (46), 10 states have return successors, (78), 44 states have call predecessors, (78), 46 states have call successors, (78) [2022-11-25 16:57:18,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 236 transitions. [2022-11-25 16:57:18,519 INFO L240 hiAutomatonCegarLoop]: Abstraction has 153 states and 236 transitions. [2022-11-25 16:57:18,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 16:57:18,521 INFO L428 stractBuchiCegarLoop]: Abstraction has 153 states and 236 transitions. [2022-11-25 16:57:18,521 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-25 16:57:18,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 153 states and 236 transitions. [2022-11-25 16:57:18,523 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 52 [2022-11-25 16:57:18,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:57:18,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:57:18,525 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-25 16:57:18,525 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 14, 9, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:18,525 INFO L748 eck$LassoCheckResult]: Stem: 1867#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1844#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; 1845#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1866#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; 1886#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1856#L42-3 [2022-11-25 16:57:18,525 INFO L750 eck$LassoCheckResult]: Loop: 1856#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1913#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1803#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1840#factENTRY ~n := #in~n; 1841#L25 assume !(~n <= 0); 1849#L26 call #t~ret0 := fact(~n - 1);< 1850#factENTRY ~n := #in~n; 1905#L25 assume ~n <= 0;#res := 1; 1904#factFINAL assume true; 1900#factEXIT >#66#return; 1903#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1909#factFINAL assume true; 1908#factEXIT >#68#return; 1796#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1840#factENTRY ~n := #in~n; 1841#L25 assume ~n <= 0;#res := 1; 1828#factFINAL assume true; 1795#factEXIT >#70#return; 1799#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1840#factENTRY ~n := #in~n; 1841#L25 assume ~n <= 0;#res := 1; 1828#factFINAL assume true; 1795#factEXIT >#72#return; 1808#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1859#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1885#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1877#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1868#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1805#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1840#factENTRY ~n := #in~n; 1841#L25 assume !(~n <= 0); 1849#L26 call #t~ret0 := fact(~n - 1);< 1850#factENTRY ~n := #in~n; 1905#L25 assume ~n <= 0;#res := 1; 1904#factFINAL assume true; 1900#factEXIT >#66#return; 1903#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1909#factFINAL assume true; 1908#factEXIT >#68#return; 1804#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1840#factENTRY ~n := #in~n; 1841#L25 assume !(~n <= 0); 1849#L26 call #t~ret0 := fact(~n - 1);< 1850#factENTRY ~n := #in~n; 1905#L25 assume ~n <= 0;#res := 1; 1904#factFINAL assume true; 1900#factEXIT >#66#return; 1903#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1909#factFINAL assume true; 1908#factEXIT >#70#return; 1801#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1840#factENTRY ~n := #in~n; 1841#L25 assume ~n <= 0;#res := 1; 1828#factFINAL assume true; 1795#factEXIT >#72#return; 1809#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1923#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1922#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1921#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1888#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1798#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1840#factENTRY ~n := #in~n; 1841#L25 assume !(~n <= 0); 1849#L26 call #t~ret0 := fact(~n - 1);< 1850#factENTRY ~n := #in~n; 1905#L25 assume ~n <= 0;#res := 1; 1904#factFINAL assume true; 1900#factEXIT >#66#return; 1903#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1909#factFINAL assume true; 1908#factEXIT >#74#return; 1802#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1840#factENTRY ~n := #in~n; 1841#L25 assume ~n <= 0;#res := 1; 1828#factFINAL assume true; 1795#factEXIT >#76#return; 1800#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1840#factENTRY ~n := #in~n; 1841#L25 assume !(~n <= 0); 1849#L26 call #t~ret0 := fact(~n - 1);< 1850#factENTRY ~n := #in~n; 1905#L25 assume ~n <= 0;#res := 1; 1904#factFINAL assume true; 1900#factEXIT >#66#return; 1903#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1909#factFINAL assume true; 1908#factEXIT >#78#return; 1907#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; 1906#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1889#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1887#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1863#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1855#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1856#L42-3 [2022-11-25 16:57:18,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:18,526 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 2 times [2022-11-25 16:57:18,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:18,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196971088] [2022-11-25 16:57:18,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:18,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:18,530 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:57:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:18,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:57:18,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:18,534 INFO L85 PathProgramCache]: Analyzing trace with hash 885226027, now seen corresponding path program 1 times [2022-11-25 16:57:18,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:18,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018305561] [2022-11-25 16:57:18,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:18,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:18,544 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:18,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1740828839] [2022-11-25 16:57:18,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:18,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:18,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:18,546 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:18,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2022-11-25 16:57:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:18,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 16:57:18,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:18,732 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 184 proven. 7 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-11-25 16:57:18,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:57:18,961 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 16 proven. 105 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-11-25 16:57:18,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:18,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018305561] [2022-11-25 16:57:18,961 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:57:18,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740828839] [2022-11-25 16:57:18,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740828839] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:57:18,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:57:18,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-11-25 16:57:18,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478730615] [2022-11-25 16:57:18,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:57:18,965 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:57:18,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:18,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 16:57:18,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-25 16:57:18,966 INFO L87 Difference]: Start difference. First operand 153 states and 236 transitions. cyclomatic complexity: 88 Second operand has 11 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 6 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2022-11-25 16:57:19,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:19,349 INFO L93 Difference]: Finished difference Result 285 states and 408 transitions. [2022-11-25 16:57:19,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 285 states and 408 transitions. [2022-11-25 16:57:19,357 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 105 [2022-11-25 16:57:19,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 285 states to 285 states and 408 transitions. [2022-11-25 16:57:19,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 140 [2022-11-25 16:57:19,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 [2022-11-25 16:57:19,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 285 states and 408 transitions. [2022-11-25 16:57:19,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:57:19,366 INFO L218 hiAutomatonCegarLoop]: Abstraction has 285 states and 408 transitions. [2022-11-25 16:57:19,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 408 transitions. [2022-11-25 16:57:19,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 165. [2022-11-25 16:57:19,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 105 states have (on average 1.1428571428571428) internal successors, (120), 106 states have internal predecessors, (120), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (82), 48 states have call predecessors, (82), 50 states have call successors, (82) [2022-11-25 16:57:19,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 252 transitions. [2022-11-25 16:57:19,417 INFO L240 hiAutomatonCegarLoop]: Abstraction has 165 states and 252 transitions. [2022-11-25 16:57:19,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 16:57:19,418 INFO L428 stractBuchiCegarLoop]: Abstraction has 165 states and 252 transitions. [2022-11-25 16:57:19,421 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-25 16:57:19,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 252 transitions. [2022-11-25 16:57:19,423 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2022-11-25 16:57:19,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:57:19,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:57:19,428 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-25 16:57:19,432 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [17, 17, 9, 8, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:19,432 INFO L748 eck$LassoCheckResult]: Stem: 2870#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2846#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; 2847#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 2869#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; 2891#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 2860#L42-3 [2022-11-25 16:57:19,433 INFO L750 eck$LassoCheckResult]: Loop: 2860#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2923#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 2903#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2913#factENTRY ~n := #in~n; 2922#L25 assume !(~n <= 0); 2916#L26 call #t~ret0 := fact(~n - 1);< 2853#factENTRY ~n := #in~n; 2925#L25 assume ~n <= 0;#res := 1; 2924#factFINAL assume true; 2915#factEXIT >#66#return; 2914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2912#factFINAL assume true; 2900#factEXIT >#68#return; 2904#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2913#factENTRY ~n := #in~n; 2922#L25 assume ~n <= 0;#res := 1; 2921#factFINAL assume true; 2920#factEXIT >#70#return; 2908#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2911#factENTRY ~n := #in~n; 2919#L25 assume !(~n <= 0); 2916#L26 call #t~ret0 := fact(~n - 1);< 2853#factENTRY ~n := #in~n; 2925#L25 assume ~n <= 0;#res := 1; 2924#factFINAL assume true; 2915#factEXIT >#66#return; 2914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2912#factFINAL assume true; 2900#factEXIT >#72#return; 2910#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 2929#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 2928#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2927#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2926#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 2907#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2913#factENTRY ~n := #in~n; 2922#L25 assume !(~n <= 0); 2916#L26 call #t~ret0 := fact(~n - 1);< 2853#factENTRY ~n := #in~n; 2925#L25 assume ~n <= 0;#res := 1; 2924#factFINAL assume true; 2915#factEXIT >#66#return; 2914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2912#factFINAL assume true; 2900#factEXIT >#68#return; 2905#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2913#factENTRY ~n := #in~n; 2922#L25 assume !(~n <= 0); 2916#L26 call #t~ret0 := fact(~n - 1);< 2853#factENTRY ~n := #in~n; 2925#L25 assume ~n <= 0;#res := 1; 2924#factFINAL assume true; 2915#factEXIT >#66#return; 2914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2912#factFINAL assume true; 2900#factEXIT >#70#return; 2906#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2913#factENTRY ~n := #in~n; 2922#L25 assume !(~n <= 0); 2916#L26 call #t~ret0 := fact(~n - 1);< 2853#factENTRY ~n := #in~n; 2925#L25 assume ~n <= 0;#res := 1; 2924#factFINAL assume true; 2915#factEXIT >#66#return; 2914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2912#factFINAL assume true; 2900#factEXIT >#72#return; 2909#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 2937#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 2936#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2935#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2894#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 2896#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2913#factENTRY ~n := #in~n; 2922#L25 assume !(~n <= 0); 2916#L26 call #t~ret0 := fact(~n - 1);< 2853#factENTRY ~n := #in~n; 2925#L25 assume ~n <= 0;#res := 1; 2924#factFINAL assume true; 2915#factEXIT >#66#return; 2914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2912#factFINAL assume true; 2900#factEXIT >#74#return; 2901#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2913#factENTRY ~n := #in~n; 2922#L25 assume !(~n <= 0); 2916#L26 call #t~ret0 := fact(~n - 1);< 2853#factENTRY ~n := #in~n; 2925#L25 assume ~n <= 0;#res := 1; 2924#factFINAL assume true; 2915#factEXIT >#66#return; 2914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2912#factFINAL assume true; 2900#factEXIT >#76#return; 2902#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2911#factENTRY ~n := #in~n; 2919#L25 assume !(~n <= 0); 2916#L26 call #t~ret0 := fact(~n - 1);< 2853#factENTRY ~n := #in~n; 2925#L25 assume ~n <= 0;#res := 1; 2924#factFINAL assume true; 2915#factEXIT >#66#return; 2914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2912#factFINAL assume true; 2900#factEXIT >#78#return; 2899#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; 2898#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 2897#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2893#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 2867#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 2859#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 2860#L42-3 [2022-11-25 16:57:19,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:19,437 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 3 times [2022-11-25 16:57:19,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:19,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312612969] [2022-11-25 16:57:19,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:19,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:19,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:57:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:19,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:57:19,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:19,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1877972557, now seen corresponding path program 2 times [2022-11-25 16:57:19,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:19,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102158288] [2022-11-25 16:57:19,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:19,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:19,466 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:19,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [923320781] [2022-11-25 16:57:19,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 16:57:19,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:19,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:19,479 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:19,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2022-11-25 16:57:19,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 16:57:19,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:57:19,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 16:57:19,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:19,766 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 355 proven. 48 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2022-11-25 16:57:19,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:57:20,106 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 61 proven. 115 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2022-11-25 16:57:20,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:20,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102158288] [2022-11-25 16:57:20,107 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:57:20,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923320781] [2022-11-25 16:57:20,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923320781] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:57:20,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:57:20,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 15 [2022-11-25 16:57:20,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805796082] [2022-11-25 16:57:20,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:57:20,108 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:57:20,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:20,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 16:57:20,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-11-25 16:57:20,110 INFO L87 Difference]: Start difference. First operand 165 states and 252 transitions. cyclomatic complexity: 92 Second operand has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 15 states have internal predecessors, (44), 8 states have call successors, (20), 2 states have call predecessors, (20), 5 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2022-11-25 16:57:20,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:20,542 INFO L93 Difference]: Finished difference Result 300 states and 489 transitions. [2022-11-25 16:57:20,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 300 states and 489 transitions. [2022-11-25 16:57:20,547 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 93 [2022-11-25 16:57:20,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 300 states to 288 states and 477 transitions. [2022-11-25 16:57:20,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2022-11-25 16:57:20,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 [2022-11-25 16:57:20,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 288 states and 477 transitions. [2022-11-25 16:57:20,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:57:20,553 INFO L218 hiAutomatonCegarLoop]: Abstraction has 288 states and 477 transitions. [2022-11-25 16:57:20,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states and 477 transitions. [2022-11-25 16:57:20,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 251. [2022-11-25 16:57:20,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 163 states have (on average 1.116564417177914) internal successors, (182), 162 states have internal predecessors, (182), 72 states have call successors, (72), 14 states have call predecessors, (72), 16 states have return successors, (178), 74 states have call predecessors, (178), 72 states have call successors, (178) [2022-11-25 16:57:20,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 432 transitions. [2022-11-25 16:57:20,569 INFO L240 hiAutomatonCegarLoop]: Abstraction has 251 states and 432 transitions. [2022-11-25 16:57:20,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 16:57:20,570 INFO L428 stractBuchiCegarLoop]: Abstraction has 251 states and 432 transitions. [2022-11-25 16:57:20,570 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-25 16:57:20,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 251 states and 432 transitions. [2022-11-25 16:57:20,572 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 85 [2022-11-25 16:57:20,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:57:20,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:57:20,574 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-25 16:57:20,574 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 20, 11, 11, 11, 11, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:20,574 INFO L748 eck$LassoCheckResult]: Stem: 4034#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4009#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; 4010#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 4033#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; 4050#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 4021#L42-3 [2022-11-25 16:57:20,575 INFO L750 eck$LassoCheckResult]: Loop: 4021#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4097#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 4079#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 3964#factENTRY ~n := #in~n; 4151#L25 assume !(~n <= 0); 3970#L26 call #t~ret0 := fact(~n - 1);< 4015#factENTRY ~n := #in~n; 4115#L25 assume !(~n <= 0); 3968#L26 call #t~ret0 := fact(~n - 1);< 4015#factENTRY ~n := #in~n; 4115#L25 assume ~n <= 0;#res := 1; 4114#factFINAL assume true; 4112#factEXIT >#66#return; 3971#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3987#factFINAL assume true; 3967#factEXIT >#66#return; 3972#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4109#factFINAL assume true; 4107#factEXIT >#68#return; 4083#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 3964#factENTRY ~n := #in~n; 4151#L25 assume ~n <= 0;#res := 1; 4094#factFINAL assume true; 4090#factEXIT >#70#return; 3981#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 3982#factENTRY ~n := #in~n; 4150#L25 assume !(~n <= 0); 3970#L26 call #t~ret0 := fact(~n - 1);< 4015#factENTRY ~n := #in~n; 4115#L25 assume ~n <= 0;#res := 1; 4114#factFINAL assume true; 4112#factEXIT >#66#return; 4111#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4110#factFINAL assume true; 4077#factEXIT >#72#return; 4086#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 4166#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 4155#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 4156#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4035#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 3985#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 3964#factENTRY ~n := #in~n; 4151#L25 assume !(~n <= 0); 3970#L26 call #t~ret0 := fact(~n - 1);< 4015#factENTRY ~n := #in~n; 4115#L25 assume !(~n <= 0); 3968#L26 call #t~ret0 := fact(~n - 1);< 4015#factENTRY ~n := #in~n; 4115#L25 assume ~n <= 0;#res := 1; 4114#factFINAL assume true; 4112#factEXIT >#66#return; 3971#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3987#factFINAL assume true; 3967#factEXIT >#66#return; 3972#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4109#factFINAL assume true; 4107#factEXIT >#68#return; 4046#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 3964#factENTRY ~n := #in~n; 4151#L25 assume !(~n <= 0); 3970#L26 call #t~ret0 := fact(~n - 1);< 4015#factENTRY ~n := #in~n; 4115#L25 assume !(~n <= 0); 3968#L26 call #t~ret0 := fact(~n - 1);< 4015#factENTRY ~n := #in~n; 4115#L25 assume ~n <= 0;#res := 1; 4114#factFINAL assume true; 4112#factEXIT >#66#return; 3971#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3987#factFINAL assume true; 3967#factEXIT >#66#return; 3972#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4109#factFINAL assume true; 4107#factEXIT >#70#return; 4087#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 4095#factENTRY ~n := #in~n; 4096#L25 assume ~n <= 0;#res := 1; 4094#factFINAL assume true; 4090#factEXIT >#72#return; 4088#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 4198#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 4168#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 4167#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4054#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 3963#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 3964#factENTRY ~n := #in~n; 4151#L25 assume !(~n <= 0); 3970#L26 call #t~ret0 := fact(~n - 1);< 4015#factENTRY ~n := #in~n; 4115#L25 assume !(~n <= 0); 3968#L26 call #t~ret0 := fact(~n - 1);< 4015#factENTRY ~n := #in~n; 4115#L25 assume ~n <= 0;#res := 1; 4114#factFINAL assume true; 4112#factEXIT >#66#return; 3971#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3987#factFINAL assume true; 3967#factEXIT >#66#return; 3972#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4109#factFINAL assume true; 4107#factEXIT >#74#return; 4080#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 3964#factENTRY ~n := #in~n; 4151#L25 assume ~n <= 0;#res := 1; 4094#factFINAL assume true; 4090#factEXIT >#76#return; 4051#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 3982#factENTRY ~n := #in~n; 4150#L25 assume !(~n <= 0); 3970#L26 call #t~ret0 := fact(~n - 1);< 4015#factENTRY ~n := #in~n; 4115#L25 assume !(~n <= 0); 3968#L26 call #t~ret0 := fact(~n - 1);< 4015#factENTRY ~n := #in~n; 4115#L25 assume ~n <= 0;#res := 1; 4114#factFINAL assume true; 4112#factEXIT >#66#return; 3971#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3987#factFINAL assume true; 3967#factEXIT >#66#return; 3972#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4109#factFINAL assume true; 4107#factEXIT >#78#return; 4011#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; 4012#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 4055#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 4053#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 4030#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 4020#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 4021#L42-3 [2022-11-25 16:57:20,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:20,575 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 4 times [2022-11-25 16:57:20,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:20,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444732880] [2022-11-25 16:57:20,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:20,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:20,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:57:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:20,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:57:20,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:20,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1233557403, now seen corresponding path program 3 times [2022-11-25 16:57:20,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:20,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960079272] [2022-11-25 16:57:20,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:20,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:20,593 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:20,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [612436705] [2022-11-25 16:57:20,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 16:57:20,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:20,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:20,598 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:20,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2022-11-25 16:57:20,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-25 16:57:20,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:57:20,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 16:57:20,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:20,766 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 160 proven. 3 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2022-11-25 16:57:20,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:57:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 160 proven. 4 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2022-11-25 16:57:21,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:21,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960079272] [2022-11-25 16:57:21,054 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:57:21,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612436705] [2022-11-25 16:57:21,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612436705] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:57:21,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:57:21,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2022-11-25 16:57:21,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717389359] [2022-11-25 16:57:21,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:57:21,056 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:57:21,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:21,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 16:57:21,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-25 16:57:21,057 INFO L87 Difference]: Start difference. First operand 251 states and 432 transitions. cyclomatic complexity: 188 Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 6 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2022-11-25 16:57:21,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:21,277 INFO L93 Difference]: Finished difference Result 305 states and 530 transitions. [2022-11-25 16:57:21,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 305 states and 530 transitions. [2022-11-25 16:57:21,281 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 109 [2022-11-25 16:57:21,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 305 states to 305 states and 530 transitions. [2022-11-25 16:57:21,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2022-11-25 16:57:21,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2022-11-25 16:57:21,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 305 states and 530 transitions. [2022-11-25 16:57:21,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:57:21,287 INFO L218 hiAutomatonCegarLoop]: Abstraction has 305 states and 530 transitions. [2022-11-25 16:57:21,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states and 530 transitions. [2022-11-25 16:57:21,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 269. [2022-11-25 16:57:21,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 169 states have (on average 1.136094674556213) internal successors, (192), 172 states have internal predecessors, (192), 84 states have call successors, (84), 14 states have call predecessors, (84), 16 states have return successors, (206), 82 states have call predecessors, (206), 84 states have call successors, (206) [2022-11-25 16:57:21,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 482 transitions. [2022-11-25 16:57:21,311 INFO L240 hiAutomatonCegarLoop]: Abstraction has 269 states and 482 transitions. [2022-11-25 16:57:21,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 16:57:21,313 INFO L428 stractBuchiCegarLoop]: Abstraction has 269 states and 482 transitions. [2022-11-25 16:57:21,313 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-25 16:57:21,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 269 states and 482 transitions. [2022-11-25 16:57:21,315 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 95 [2022-11-25 16:57:21,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:57:21,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:57:21,317 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-25 16:57:21,317 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [24, 24, 15, 15, 15, 15, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:21,317 INFO L748 eck$LassoCheckResult]: Stem: 5382#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5359#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; 5360#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 5381#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; 5395#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 5370#L42-3 [2022-11-25 16:57:21,318 INFO L750 eck$LassoCheckResult]: Loop: 5370#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 5448#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 5410#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 5426#factENTRY ~n := #in~n; 5463#L25 assume !(~n <= 0); 5317#L26 call #t~ret0 := fact(~n - 1);< 5365#factENTRY ~n := #in~n; 5466#L25 assume !(~n <= 0); 5315#L26 call #t~ret0 := fact(~n - 1);< 5365#factENTRY ~n := #in~n; 5466#L25 assume ~n <= 0;#res := 1; 5465#factFINAL assume true; 5461#factEXIT >#66#return; 5318#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5330#factFINAL assume true; 5314#factEXIT >#66#return; 5319#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5424#factFINAL assume true; 5425#factEXIT >#68#return; 5418#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 5426#factENTRY ~n := #in~n; 5463#L25 assume ~n <= 0;#res := 1; 5445#factFINAL assume true; 5444#factEXIT >#70#return; 5416#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 5423#factENTRY ~n := #in~n; 5464#L25 assume !(~n <= 0); 5317#L26 call #t~ret0 := fact(~n - 1);< 5365#factENTRY ~n := #in~n; 5466#L25 assume !(~n <= 0); 5315#L26 call #t~ret0 := fact(~n - 1);< 5365#factENTRY ~n := #in~n; 5466#L25 assume ~n <= 0;#res := 1; 5465#factFINAL assume true; 5461#factEXIT >#66#return; 5318#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5330#factFINAL assume true; 5314#factEXIT >#66#return; 5319#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5424#factFINAL assume true; 5425#factEXIT >#72#return; 5458#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 5456#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 5454#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 5452#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 5450#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 5406#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 5426#factENTRY ~n := #in~n; 5463#L25 assume !(~n <= 0); 5317#L26 call #t~ret0 := fact(~n - 1);< 5365#factENTRY ~n := #in~n; 5466#L25 assume !(~n <= 0); 5315#L26 call #t~ret0 := fact(~n - 1);< 5365#factENTRY ~n := #in~n; 5466#L25 assume ~n <= 0;#res := 1; 5465#factFINAL assume true; 5461#factEXIT >#66#return; 5318#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5330#factFINAL assume true; 5314#factEXIT >#66#return; 5319#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5424#factFINAL assume true; 5425#factEXIT >#68#return; 5412#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 5426#factENTRY ~n := #in~n; 5463#L25 assume !(~n <= 0); 5317#L26 call #t~ret0 := fact(~n - 1);< 5365#factENTRY ~n := #in~n; 5466#L25 assume !(~n <= 0); 5315#L26 call #t~ret0 := fact(~n - 1);< 5365#factENTRY ~n := #in~n; 5466#L25 assume ~n <= 0;#res := 1; 5465#factFINAL assume true; 5461#factEXIT >#66#return; 5318#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5330#factFINAL assume true; 5314#factEXIT >#66#return; 5319#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5424#factFINAL assume true; 5425#factEXIT >#70#return; 5405#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 5426#factENTRY ~n := #in~n; 5463#L25 assume !(~n <= 0); 5317#L26 call #t~ret0 := fact(~n - 1);< 5365#factENTRY ~n := #in~n; 5466#L25 assume !(~n <= 0); 5315#L26 call #t~ret0 := fact(~n - 1);< 5365#factENTRY ~n := #in~n; 5466#L25 assume ~n <= 0;#res := 1; 5465#factFINAL assume true; 5461#factEXIT >#66#return; 5318#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5330#factFINAL assume true; 5314#factEXIT >#66#return; 5319#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5424#factFINAL assume true; 5425#factEXIT >#72#return; 5457#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 5455#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 5453#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 5451#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 5449#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 5415#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 5426#factENTRY ~n := #in~n; 5463#L25 assume !(~n <= 0); 5317#L26 call #t~ret0 := fact(~n - 1);< 5365#factENTRY ~n := #in~n; 5466#L25 assume !(~n <= 0); 5315#L26 call #t~ret0 := fact(~n - 1);< 5365#factENTRY ~n := #in~n; 5466#L25 assume ~n <= 0;#res := 1; 5465#factFINAL assume true; 5461#factEXIT >#66#return; 5318#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5330#factFINAL assume true; 5314#factEXIT >#66#return; 5319#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5424#factFINAL assume true; 5425#factEXIT >#74#return; 5407#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 5426#factENTRY ~n := #in~n; 5463#L25 assume !(~n <= 0); 5317#L26 call #t~ret0 := fact(~n - 1);< 5365#factENTRY ~n := #in~n; 5466#L25 assume !(~n <= 0); 5315#L26 call #t~ret0 := fact(~n - 1);< 5365#factENTRY ~n := #in~n; 5466#L25 assume ~n <= 0;#res := 1; 5465#factFINAL assume true; 5461#factEXIT >#66#return; 5318#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5330#factFINAL assume true; 5314#factEXIT >#66#return; 5319#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5424#factFINAL assume true; 5425#factEXIT >#76#return; 5417#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 5423#factENTRY ~n := #in~n; 5464#L25 assume !(~n <= 0); 5317#L26 call #t~ret0 := fact(~n - 1);< 5365#factENTRY ~n := #in~n; 5466#L25 assume ~n <= 0;#res := 1; 5465#factFINAL assume true; 5461#factEXIT >#66#return; 5460#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5459#factFINAL assume true; 5403#factEXIT >#78#return; 5402#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; 5401#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 5400#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 5398#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 5379#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 5369#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 5370#L42-3 [2022-11-25 16:57:21,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:21,318 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 5 times [2022-11-25 16:57:21,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:21,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252657042] [2022-11-25 16:57:21,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:21,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:21,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:57:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:21,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:57:21,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:21,326 INFO L85 PathProgramCache]: Analyzing trace with hash -103094629, now seen corresponding path program 4 times [2022-11-25 16:57:21,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:21,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858723581] [2022-11-25 16:57:21,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:21,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:21,337 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:21,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [910503298] [2022-11-25 16:57:21,338 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 16:57:21,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:21,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:21,341 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:21,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2022-11-25 16:57:21,442 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 16:57:21,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:57:21,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 16:57:21,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:21,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 791 proven. 32 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2022-11-25 16:57:21,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:57:21,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 107 proven. 160 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2022-11-25 16:57:21,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:21,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858723581] [2022-11-25 16:57:21,925 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:57:21,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910503298] [2022-11-25 16:57:21,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910503298] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:57:21,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:57:21,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 15 [2022-11-25 16:57:21,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684530417] [2022-11-25 16:57:21,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:57:21,926 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:57:21,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:21,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 16:57:21,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-11-25 16:57:21,927 INFO L87 Difference]: Start difference. First operand 269 states and 482 transitions. cyclomatic complexity: 220 Second operand has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 15 states have internal predecessors, (44), 9 states have call successors, (20), 2 states have call predecessors, (20), 5 states have return successors, (20), 8 states have call predecessors, (20), 9 states have call successors, (20) [2022-11-25 16:57:22,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:22,479 INFO L93 Difference]: Finished difference Result 421 states and 736 transitions. [2022-11-25 16:57:22,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 421 states and 736 transitions. [2022-11-25 16:57:22,485 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 167 [2022-11-25 16:57:22,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 421 states to 421 states and 736 transitions. [2022-11-25 16:57:22,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 211 [2022-11-25 16:57:22,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 211 [2022-11-25 16:57:22,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 421 states and 736 transitions. [2022-11-25 16:57:22,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:57:22,493 INFO L218 hiAutomatonCegarLoop]: Abstraction has 421 states and 736 transitions. [2022-11-25 16:57:22,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states and 736 transitions. [2022-11-25 16:57:22,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 313. [2022-11-25 16:57:22,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 189 states have (on average 1.1428571428571428) internal successors, (216), 194 states have internal predecessors, (216), 108 states have call successors, (108), 14 states have call predecessors, (108), 16 states have return successors, (252), 104 states have call predecessors, (252), 108 states have call successors, (252) [2022-11-25 16:57:22,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 576 transitions. [2022-11-25 16:57:22,510 INFO L240 hiAutomatonCegarLoop]: Abstraction has 313 states and 576 transitions. [2022-11-25 16:57:22,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 16:57:22,511 INFO L428 stractBuchiCegarLoop]: Abstraction has 313 states and 576 transitions. [2022-11-25 16:57:22,511 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-11-25 16:57:22,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 313 states and 576 transitions. [2022-11-25 16:57:22,514 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 117 [2022-11-25 16:57:22,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:57:22,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:57:22,515 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-25 16:57:22,515 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 18, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:22,515 INFO L748 eck$LassoCheckResult]: Stem: 7063#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 7019#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; 7020#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 7062#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; 7075#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 7051#L42-3 [2022-11-25 16:57:22,516 INFO L750 eck$LassoCheckResult]: Loop: 7051#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 7100#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 6960#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 7089#factENTRY ~n := #in~n; 7099#L25 assume !(~n <= 0); 7094#L26 call #t~ret0 := fact(~n - 1);< 7045#factENTRY ~n := #in~n; 7123#L25 assume ~n <= 0;#res := 1; 7122#factFINAL assume true; 7121#factEXIT >#66#return; 7120#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7087#factFINAL assume true; 7088#factEXIT >#68#return; 6949#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 7089#factENTRY ~n := #in~n; 7099#L25 assume ~n <= 0;#res := 1; 7013#factFINAL assume true; 6948#factEXIT >#70#return; 6965#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 7086#factENTRY ~n := #in~n; 7098#L25 assume !(~n <= 0); 7094#L26 call #t~ret0 := fact(~n - 1);< 7045#factENTRY ~n := #in~n; 7123#L25 assume !(~n <= 0); 7095#L26 call #t~ret0 := fact(~n - 1);< 7045#factENTRY ~n := #in~n; 7123#L25 assume ~n <= 0;#res := 1; 7122#factFINAL assume true; 7121#factEXIT >#66#return; 7097#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7110#factFINAL assume true; 7093#factEXIT >#66#return; 7090#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7091#factFINAL assume true; 7083#factEXIT >#72#return; 7084#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 7161#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 7160#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 7158#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 7157#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 6964#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 7089#factENTRY ~n := #in~n; 7099#L25 assume !(~n <= 0); 7094#L26 call #t~ret0 := fact(~n - 1);< 7045#factENTRY ~n := #in~n; 7123#L25 assume ~n <= 0;#res := 1; 7122#factFINAL assume true; 7121#factEXIT >#66#return; 7120#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7087#factFINAL assume true; 7088#factEXIT >#68#return; 6951#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 7089#factENTRY ~n := #in~n; 7099#L25 assume !(~n <= 0); 7094#L26 call #t~ret0 := fact(~n - 1);< 7045#factENTRY ~n := #in~n; 7123#L25 assume ~n <= 0;#res := 1; 7122#factFINAL assume true; 7121#factEXIT >#66#return; 7120#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7087#factFINAL assume true; 7088#factEXIT >#70#return; 6952#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 7089#factENTRY ~n := #in~n; 7099#L25 assume !(~n <= 0); 7094#L26 call #t~ret0 := fact(~n - 1);< 7045#factENTRY ~n := #in~n; 7123#L25 assume ~n <= 0;#res := 1; 7122#factFINAL assume true; 7121#factEXIT >#66#return; 7120#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7087#factFINAL assume true; 7088#factEXIT >#72#return; 6966#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 7179#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 7171#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 7167#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 7114#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 6956#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 7089#factENTRY ~n := #in~n; 7099#L25 assume !(~n <= 0); 7094#L26 call #t~ret0 := fact(~n - 1);< 7045#factENTRY ~n := #in~n; 7123#L25 assume ~n <= 0;#res := 1; 7122#factFINAL assume true; 7121#factEXIT >#66#return; 7120#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7087#factFINAL assume true; 7088#factEXIT >#74#return; 6958#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 7089#factENTRY ~n := #in~n; 7099#L25 assume !(~n <= 0); 7094#L26 call #t~ret0 := fact(~n - 1);< 7045#factENTRY ~n := #in~n; 7123#L25 assume ~n <= 0;#res := 1; 7122#factFINAL assume true; 7121#factEXIT >#66#return; 7120#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7087#factFINAL assume true; 7088#factEXIT >#76#return; 6972#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 7086#factENTRY ~n := #in~n; 7098#L25 assume !(~n <= 0); 7094#L26 call #t~ret0 := fact(~n - 1);< 7045#factENTRY ~n := #in~n; 7123#L25 assume ~n <= 0;#res := 1; 7122#factFINAL assume true; 7121#factEXIT >#66#return; 7120#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7087#factFINAL assume true; 7088#factEXIT >#78#return; 7082#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; 7081#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 7080#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 7078#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 7059#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 7050#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 7051#L42-3 [2022-11-25 16:57:22,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:22,516 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 6 times [2022-11-25 16:57:22,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:22,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490110458] [2022-11-25 16:57:22,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:22,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:22,521 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:57:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:22,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:57:22,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:22,525 INFO L85 PathProgramCache]: Analyzing trace with hash -530535317, now seen corresponding path program 5 times [2022-11-25 16:57:22,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:22,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115045945] [2022-11-25 16:57:22,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:22,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:22,534 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:22,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [488563897] [2022-11-25 16:57:22,534 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 16:57:22,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:22,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:22,539 INFO L229 MonitoredProcess]: Starting monitored process 91 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:22,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2022-11-25 16:57:22,637 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-11-25 16:57:22,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:57:22,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 16:57:22,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:22,784 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 391 proven. 80 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2022-11-25 16:57:22,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:57:23,205 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 67 proven. 171 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2022-11-25 16:57:23,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:23,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115045945] [2022-11-25 16:57:23,206 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:57:23,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488563897] [2022-11-25 16:57:23,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488563897] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:57:23,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:57:23,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 16 [2022-11-25 16:57:23,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349064479] [2022-11-25 16:57:23,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:57:23,207 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:57:23,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:23,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 16:57:23,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-11-25 16:57:23,208 INFO L87 Difference]: Start difference. First operand 313 states and 576 transitions. cyclomatic complexity: 270 Second operand has 16 states, 11 states have (on average 4.0) internal successors, (44), 14 states have internal predecessors, (44), 11 states have call successors, (19), 2 states have call predecessors, (19), 5 states have return successors, (20), 8 states have call predecessors, (20), 11 states have call successors, (20) [2022-11-25 16:57:23,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:23,832 INFO L93 Difference]: Finished difference Result 513 states and 886 transitions. [2022-11-25 16:57:23,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 513 states and 886 transitions. [2022-11-25 16:57:23,843 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 174 [2022-11-25 16:57:23,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 513 states to 497 states and 856 transitions. [2022-11-25 16:57:23,850 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 249 [2022-11-25 16:57:23,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 249 [2022-11-25 16:57:23,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 497 states and 856 transitions. [2022-11-25 16:57:23,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:57:23,853 INFO L218 hiAutomatonCegarLoop]: Abstraction has 497 states and 856 transitions. [2022-11-25 16:57:23,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states and 856 transitions. [2022-11-25 16:57:23,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 399. [2022-11-25 16:57:23,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 235 states have (on average 1.148936170212766) internal successors, (270), 242 states have internal predecessors, (270), 148 states have call successors, (148), 20 states have call predecessors, (148), 16 states have return successors, (306), 136 states have call predecessors, (306), 148 states have call successors, (306) [2022-11-25 16:57:23,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 724 transitions. [2022-11-25 16:57:23,880 INFO L240 hiAutomatonCegarLoop]: Abstraction has 399 states and 724 transitions. [2022-11-25 16:57:23,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 16:57:23,883 INFO L428 stractBuchiCegarLoop]: Abstraction has 399 states and 724 transitions. [2022-11-25 16:57:23,883 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-11-25 16:57:23,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 399 states and 724 transitions. [2022-11-25 16:57:23,886 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 148 [2022-11-25 16:57:23,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:57:23,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:57:23,887 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:23,887 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-25 16:57:23,887 INFO L748 eck$LassoCheckResult]: Stem: 8638#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8612#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; 8613#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 8637#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; 8653#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 8743#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 8742#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 8698#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 8595#factENTRY ~n := #in~n; 8715#L25 assume ~n <= 0;#res := 1; 8714#factFINAL assume true; 8680#factEXIT >#68#return; 8520#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 8670#factENTRY ~n := #in~n; 8679#L25 assume !(~n <= 0); 8618#L26 call #t~ret0 := fact(~n - 1);< 8620#factENTRY [2022-11-25 16:57:23,888 INFO L750 eck$LassoCheckResult]: Loop: 8620#factENTRY ~n := #in~n; 8660#L25 assume !(~n <= 0); 8617#L26 call #t~ret0 := fact(~n - 1);< 8620#factENTRY [2022-11-25 16:57:23,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:23,888 INFO L85 PathProgramCache]: Analyzing trace with hash 960037668, now seen corresponding path program 1 times [2022-11-25 16:57:23,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:23,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134746644] [2022-11-25 16:57:23,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:23,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:23,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 16:57:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:23,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:23,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:23,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134746644] [2022-11-25 16:57:23,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134746644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:57:23,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:57:23,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:57:23,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084644890] [2022-11-25 16:57:23,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:57:23,967 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 16:57:23,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:23,967 INFO L85 PathProgramCache]: Analyzing trace with hash 29980, now seen corresponding path program 1 times [2022-11-25 16:57:23,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:23,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885664807] [2022-11-25 16:57:23,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:23,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:23,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:57:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:23,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:57:23,998 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:57:23,999 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:57:23,999 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:57:23,999 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:57:23,999 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-25 16:57:23,999 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:23,999 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:57:23,999 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:57:23,999 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2022-11-25 16:57:24,000 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:57:24,000 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:57:24,001 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:24,003 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:24,005 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:24,007 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:24,039 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:57:24,039 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-25 16:57:24,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:24,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:24,043 INFO L229 MonitoredProcess]: Starting monitored process 92 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:24,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2022-11-25 16:57:24,044 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:57:24,044 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:57:24,056 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-25 16:57:24,056 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#res=0} Honda state: {fact_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-25 16:57:24,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:24,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:24,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:24,060 INFO L229 MonitoredProcess]: Starting monitored process 93 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:24,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2022-11-25 16:57:24,063 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:57:24,063 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:57:24,075 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-25 16:57:24,075 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#t~ret0=0} Honda state: {fact_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-25 16:57:24,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:24,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:24,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:24,079 INFO L229 MonitoredProcess]: Starting monitored process 94 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:24,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2022-11-25 16:57:24,082 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:57:24,083 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:57:24,110 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-25 16:57:24,110 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_~n=0} Honda state: {fact_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-25 16:57:24,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:24,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:24,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:24,115 INFO L229 MonitoredProcess]: Starting monitored process 95 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:24,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2022-11-25 16:57:24,118 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:57:24,118 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:57:24,150 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:24,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:24,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:24,152 INFO L229 MonitoredProcess]: Starting monitored process 96 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:24,155 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-25 16:57:24,155 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:57:24,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2022-11-25 16:57:24,177 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-25 16:57:24,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:24,180 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:57:24,180 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:57:24,180 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:57:24,180 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:57:24,181 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-25 16:57:24,181 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:24,181 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:57:24,181 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:57:24,181 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2022-11-25 16:57:24,181 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:57:24,181 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:57:24,182 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:24,183 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:24,185 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:24,187 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:24,218 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:57:24,218 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-25 16:57:24,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:24,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:24,219 INFO L229 MonitoredProcess]: Starting monitored process 97 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:24,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2022-11-25 16:57:24,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:24,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:24,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:24,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:24,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:24,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:57:24,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:57:24,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:24,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:24,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:24,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:24,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:24,260 INFO L229 MonitoredProcess]: Starting monitored process 98 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:24,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2022-11-25 16:57:24,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:24,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:24,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:24,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:24,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:24,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:57:24,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:57:24,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:24,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:24,281 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2022-11-25 16:57:24,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:24,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:24,282 INFO L229 MonitoredProcess]: Starting monitored process 99 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:24,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2022-11-25 16:57:24,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:24,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:24,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:24,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:24,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:24,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:57:24,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:57:24,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:24,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:24,307 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2022-11-25 16:57:24,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:24,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:24,308 INFO L229 MonitoredProcess]: Starting monitored process 100 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:24,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2022-11-25 16:57:24,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:24,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:24,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:24,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:24,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:24,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:57:24,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:57:24,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:24,342 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-25 16:57:24,346 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-25 16:57:24,346 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-11-25 16:57:24,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:24,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:24,349 INFO L229 MonitoredProcess]: Starting monitored process 101 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:24,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2022-11-25 16:57:24,351 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-25 16:57:24,351 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-25 16:57:24,351 INFO L513 LassoAnalysis]: Proved termination. [2022-11-25 16:57:24,351 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2022-11-25 16:57:24,353 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2022-11-25 16:57:24,354 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-25 16:57:24,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:24,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 16:57:24,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:24,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 16:57:24,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:24,494 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-11-25 16:57:24,495 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 399 states and 724 transitions. cyclomatic complexity: 333 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 16:57:24,605 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 399 states and 724 transitions. cyclomatic complexity: 333. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 501 states and 876 transitions. Complement of second has 13 states. [2022-11-25 16:57:24,606 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 [2022-11-25 16:57:24,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 16:57:24,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-11-25 16:57:24,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 16 letters. Loop has 3 letters. [2022-11-25 16:57:24,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:57:24,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 19 letters. Loop has 3 letters. [2022-11-25 16:57:24,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:57:24,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 16 letters. Loop has 6 letters. [2022-11-25 16:57:24,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:57:24,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 501 states and 876 transitions. [2022-11-25 16:57:24,616 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 156 [2022-11-25 16:57:24,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 501 states to 487 states and 860 transitions. [2022-11-25 16:57:24,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 237 [2022-11-25 16:57:24,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 240 [2022-11-25 16:57:24,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 487 states and 860 transitions. [2022-11-25 16:57:24,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:57:24,625 INFO L218 hiAutomatonCegarLoop]: Abstraction has 487 states and 860 transitions. [2022-11-25 16:57:24,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states and 860 transitions. [2022-11-25 16:57:24,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 481. [2022-11-25 16:57:24,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 285 states have (on average 1.1649122807017545) internal successors, (332), 294 states have internal predecessors, (332), 172 states have call successors, (172), 36 states have call predecessors, (172), 24 states have return successors, (346), 150 states have call predecessors, (346), 172 states have call successors, (346) [2022-11-25 16:57:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 850 transitions. [2022-11-25 16:57:24,646 INFO L240 hiAutomatonCegarLoop]: Abstraction has 481 states and 850 transitions. [2022-11-25 16:57:24,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:24,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:57:24,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:57:24,646 INFO L87 Difference]: Start difference. First operand 481 states and 850 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 16:57:24,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:24,716 INFO L93 Difference]: Finished difference Result 581 states and 964 transitions. [2022-11-25 16:57:24,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 581 states and 964 transitions. [2022-11-25 16:57:24,724 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 178 [2022-11-25 16:57:24,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 581 states to 581 states and 964 transitions. [2022-11-25 16:57:24,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 289 [2022-11-25 16:57:24,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 289 [2022-11-25 16:57:24,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 581 states and 964 transitions. [2022-11-25 16:57:24,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:57:24,733 INFO L218 hiAutomatonCegarLoop]: Abstraction has 581 states and 964 transitions. [2022-11-25 16:57:24,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states and 964 transitions. [2022-11-25 16:57:24,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:24,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 505. [2022-11-25 16:57:24,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 303 states have (on average 1.155115511551155) internal successors, (350), 312 states have internal predecessors, (350), 172 states have call successors, (172), 42 states have call predecessors, (172), 30 states have return successors, (346), 150 states have call predecessors, (346), 172 states have call successors, (346) [2022-11-25 16:57:24,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 868 transitions. [2022-11-25 16:57:24,780 INFO L240 hiAutomatonCegarLoop]: Abstraction has 505 states and 868 transitions. [2022-11-25 16:57:24,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 16:57:24,781 INFO L428 stractBuchiCegarLoop]: Abstraction has 505 states and 868 transitions. [2022-11-25 16:57:24,781 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-11-25 16:57:24,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 505 states and 868 transitions. [2022-11-25 16:57:24,785 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 156 [2022-11-25 16:57:24,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:57:24,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:57:24,786 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:24,787 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 9, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:24,787 INFO L748 eck$LassoCheckResult]: Stem: 10631#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 10598#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; 10599#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 10630#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; 10616#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 10617#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 10922#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 10588#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 10589#factENTRY ~n := #in~n; 10809#L25 assume !(~n <= 0); 10752#L26 call #t~ret0 := fact(~n - 1);< 10750#factENTRY ~n := #in~n; 10766#L25 assume ~n <= 0;#res := 1; 10789#factFINAL assume true; 10759#factEXIT >#66#return; 10751#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10745#factFINAL assume true; 10705#factEXIT >#68#return; 10736#L30-1 [2022-11-25 16:57:24,787 INFO L750 eck$LassoCheckResult]: Loop: 10736#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 10879#factENTRY ~n := #in~n; 10884#L25 assume ~n <= 0;#res := 1; 10883#factFINAL assume true; 10878#factEXIT >#70#return; 10714#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 10655#factENTRY ~n := #in~n; 10790#L25 assume !(~n <= 0); 10606#L26 call #t~ret0 := fact(~n - 1);< 10607#factENTRY ~n := #in~n; 10951#L25 assume ~n <= 0;#res := 1; 10782#factFINAL assume true; 10777#factEXIT >#66#return; 10751#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10745#factFINAL assume true; 10705#factEXIT >#72#return; 10738#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 10939#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 10938#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 10937#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 10936#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 10706#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 10786#factENTRY ~n := #in~n; 10783#L25 assume !(~n <= 0); 10779#L26 call #t~ret0 := fact(~n - 1);< 10780#factENTRY ~n := #in~n; 10785#L25 assume ~n <= 0;#res := 1; 10782#factFINAL assume true; 10777#factEXIT >#66#return; 10751#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10745#factFINAL assume true; 10705#factEXIT >#68#return; 10724#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 10575#factENTRY ~n := #in~n; 10829#L25 assume !(~n <= 0); 10606#L26 call #t~ret0 := fact(~n - 1);< 10607#factENTRY ~n := #in~n; 10951#L25 assume ~n <= 0;#res := 1; 10782#factFINAL assume true; 10777#factEXIT >#66#return; 10751#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10745#factFINAL assume true; 10705#factEXIT >#70#return; 10737#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 10788#factENTRY ~n := #in~n; 10828#L25 assume ~n <= 0;#res := 1; 10784#factFINAL assume true; 10775#factEXIT >#72#return; 10776#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 10825#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 10824#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 10814#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 10815#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 10729#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 10575#factENTRY ~n := #in~n; 10829#L25 assume !(~n <= 0); 10606#L26 call #t~ret0 := fact(~n - 1);< 10607#factENTRY ~n := #in~n; 10951#L25 assume ~n <= 0;#res := 1; 10782#factFINAL assume true; 10777#factEXIT >#66#return; 10751#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10745#factFINAL assume true; 10705#factEXIT >#74#return; 10718#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 10575#factENTRY ~n := #in~n; 10829#L25 assume ~n <= 0;#res := 1; 10784#factFINAL assume true; 10775#factEXIT >#76#return; 10723#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 10655#factENTRY ~n := #in~n; 10790#L25 assume !(~n <= 0); 10606#L26 call #t~ret0 := fact(~n - 1);< 10607#factENTRY ~n := #in~n; 10951#L25 assume ~n <= 0;#res := 1; 10782#factFINAL assume true; 10777#factEXIT >#66#return; 10751#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10745#factFINAL assume true; 10705#factEXIT >#78#return; 10741#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; 10820#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 10818#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 10816#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 10627#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 10628#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 10830#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 10827#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 10716#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 10575#factENTRY ~n := #in~n; 10829#L25 assume !(~n <= 0); 10606#L26 call #t~ret0 := fact(~n - 1);< 10607#factENTRY ~n := #in~n; 10951#L25 assume ~n <= 0;#res := 1; 10782#factFINAL assume true; 10777#factEXIT >#66#return; 10751#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10745#factFINAL assume true; 10705#factEXIT >#68#return; 10736#L30-1 [2022-11-25 16:57:24,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:24,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1862517908, now seen corresponding path program 1 times [2022-11-25 16:57:24,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:24,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049072618] [2022-11-25 16:57:24,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:24,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:24,793 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:24,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [409516346] [2022-11-25 16:57:24,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:24,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:24,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:24,795 INFO L229 MonitoredProcess]: Starting monitored process 102 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:24,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2022-11-25 16:57:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:24,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 16:57:24,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:24,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 16:57:24,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:57:24,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 16:57:24,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:24,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049072618] [2022-11-25 16:57:24,934 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:57:24,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409516346] [2022-11-25 16:57:24,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409516346] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:57:24,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:57:24,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2022-11-25 16:57:24,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840556753] [2022-11-25 16:57:24,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:57:24,935 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 16:57:24,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:24,935 INFO L85 PathProgramCache]: Analyzing trace with hash 476188443, now seen corresponding path program 6 times [2022-11-25 16:57:24,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:24,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779787113] [2022-11-25 16:57:24,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:24,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:24,949 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:24,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1953424756] [2022-11-25 16:57:24,950 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-25 16:57:24,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:24,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:24,951 INFO L229 MonitoredProcess]: Starting monitored process 103 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:24,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2022-11-25 16:57:25,025 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-11-25 16:57:25,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:57:25,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 16:57:25,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:25,132 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 299 proven. 14 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-11-25 16:57:25,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:57:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 83 proven. 68 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-11-25 16:57:25,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:25,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779787113] [2022-11-25 16:57:25,438 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:57:25,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953424756] [2022-11-25 16:57:25,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953424756] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:57:25,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:57:25,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 15 [2022-11-25 16:57:25,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745723729] [2022-11-25 16:57:25,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:57:25,439 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:57:25,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:25,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:57:25,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:57:25,440 INFO L87 Difference]: Start difference. First operand 505 states and 868 transitions. cyclomatic complexity: 375 Second operand has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 16:57:25,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:25,631 INFO L93 Difference]: Finished difference Result 584 states and 1026 transitions. [2022-11-25 16:57:25,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 584 states and 1026 transitions. [2022-11-25 16:57:25,639 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 195 [2022-11-25 16:57:25,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 584 states to 578 states and 1012 transitions. [2022-11-25 16:57:25,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 287 [2022-11-25 16:57:25,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 287 [2022-11-25 16:57:25,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 578 states and 1012 transitions. [2022-11-25 16:57:25,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:57:25,649 INFO L218 hiAutomatonCegarLoop]: Abstraction has 578 states and 1012 transitions. [2022-11-25 16:57:25,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states and 1012 transitions. [2022-11-25 16:57:25,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 573. [2022-11-25 16:57:25,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 337 states have (on average 1.1543026706231454) internal successors, (389), 350 states have internal predecessors, (389), 206 states have call successors, (206), 38 states have call predecessors, (206), 30 states have return successors, (412), 184 states have call predecessors, (412), 206 states have call successors, (412) [2022-11-25 16:57:25,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1007 transitions. [2022-11-25 16:57:25,679 INFO L240 hiAutomatonCegarLoop]: Abstraction has 573 states and 1007 transitions. [2022-11-25 16:57:25,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:57:25,681 INFO L428 stractBuchiCegarLoop]: Abstraction has 573 states and 1007 transitions. [2022-11-25 16:57:25,681 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-11-25 16:57:25,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 573 states and 1007 transitions. [2022-11-25 16:57:25,685 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 195 [2022-11-25 16:57:25,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:57:25,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:57:25,686 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:25,686 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:25,687 INFO L748 eck$LassoCheckResult]: Stem: 12447#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 12408#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; 12409#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 12446#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; 12432#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 12433#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 12657#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 12653#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 12655#factENTRY ~n := #in~n; 12658#L25 assume ~n <= 0;#res := 1; 12656#factFINAL assume true; 12652#factEXIT >#68#return; 12654#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 12664#factENTRY ~n := #in~n; 12679#L25 assume ~n <= 0;#res := 1; 12677#factFINAL assume true; 12663#factEXIT >#70#return; 12495#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 12475#factENTRY ~n := #in~n; 12678#L25 assume ~n <= 0;#res := 1; 12675#factFINAL assume true; 12661#factEXIT >#72#return; 12662#L30-3 [2022-11-25 16:57:25,687 INFO L750 eck$LassoCheckResult]: Loop: 12662#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 12670#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 12668#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 12666#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 12665#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 12398#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 12399#factENTRY ~n := #in~n; 12405#L25 assume ~n <= 0;#res := 1; 12675#factFINAL assume true; 12661#factEXIT >#68#return; 12522#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 12475#factENTRY ~n := #in~n; 12678#L25 assume ~n <= 0;#res := 1; 12675#factFINAL assume true; 12661#factEXIT >#70#return; 12404#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 12399#factENTRY ~n := #in~n; 12405#L25 assume ~n <= 0;#res := 1; 12675#factFINAL assume true; 12661#factEXIT >#72#return; 12662#L30-3 [2022-11-25 16:57:25,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:25,689 INFO L85 PathProgramCache]: Analyzing trace with hash -455324880, now seen corresponding path program 1 times [2022-11-25 16:57:25,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:25,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317085959] [2022-11-25 16:57:25,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:25,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:25,708 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:57:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:25,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:57:25,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:25,728 INFO L85 PathProgramCache]: Analyzing trace with hash 467014384, now seen corresponding path program 1 times [2022-11-25 16:57:25,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:25,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591347413] [2022-11-25 16:57:25,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:25,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:25,731 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:25,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [890300994] [2022-11-25 16:57:25,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:25,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:25,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:25,735 INFO L229 MonitoredProcess]: Starting monitored process 104 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:25,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2022-11-25 16:57:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:25,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:57:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:25,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:57:25,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:25,804 INFO L85 PathProgramCache]: Analyzing trace with hash 448000159, now seen corresponding path program 1 times [2022-11-25 16:57:25,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:25,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448178300] [2022-11-25 16:57:25,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:25,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:25,809 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:25,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1648276153] [2022-11-25 16:57:25,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:25,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:25,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:25,814 INFO L229 MonitoredProcess]: Starting monitored process 105 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:25,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2022-11-25 16:57:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:25,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 16:57:25,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:25,929 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-25 16:57:25,930 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:57:25,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:25,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448178300] [2022-11-25 16:57:25,930 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:57:25,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648276153] [2022-11-25 16:57:25,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648276153] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:57:25,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:57:25,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:57:25,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428985831] [2022-11-25 16:57:25,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:57:26,411 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:57:26,411 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:57:26,411 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:57:26,411 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:57:26,412 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-25 16:57:26,412 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:26,412 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:57:26,412 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:57:26,412 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration14_Loop [2022-11-25 16:57:26,412 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:57:26,412 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:57:26,413 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:26,437 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:26,440 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:26,444 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:26,447 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:26,450 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:26,453 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:26,581 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:57:26,581 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-25 16:57:26,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:26,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:26,582 INFO L229 MonitoredProcess]: Starting monitored process 106 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:26,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2022-11-25 16:57:26,585 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:57:26,585 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:57:26,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2022-11-25 16:57:26,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:26,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:26,603 INFO L229 MonitoredProcess]: Starting monitored process 107 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:26,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2022-11-25 16:57:26,606 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-25 16:57:26,606 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:57:27,591 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-25 16:57:27,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:27,596 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:57:27,596 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:57:27,596 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:57:27,596 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:57:27,597 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-25 16:57:27,597 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:27,597 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:57:27,597 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:57:27,597 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration14_Loop [2022-11-25 16:57:27,597 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:57:27,597 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:57:27,598 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:27,601 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:27,604 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:27,608 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:27,610 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:27,613 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:27,632 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:27,724 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:57:27,724 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-25 16:57:27,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:27,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:27,726 INFO L229 MonitoredProcess]: Starting monitored process 108 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:27,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2022-11-25 16:57:27,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:27,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:27,742 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:27,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:27,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:27,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:57:27,743 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:57:27,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:27,744 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:27,747 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2022-11-25 16:57:27,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:27,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:27,748 INFO L229 MonitoredProcess]: Starting monitored process 109 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:27,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2022-11-25 16:57:27,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:27,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:27,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:27,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:27,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:27,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:57:27,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:57:27,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:27,765 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:27,767 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2022-11-25 16:57:27,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:27,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:27,769 INFO L229 MonitoredProcess]: Starting monitored process 110 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:27,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2022-11-25 16:57:27,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:27,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:27,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:27,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:27,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:27,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:57:27,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:57:27,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:27,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:27,794 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2022-11-25 16:57:27,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:27,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:27,795 INFO L229 MonitoredProcess]: Starting monitored process 111 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:27,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2022-11-25 16:57:27,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:27,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:27,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:27,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:27,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:27,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:57:27,810 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:57:27,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:27,812 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:27,814 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2022-11-25 16:57:27,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:27,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:27,816 INFO L229 MonitoredProcess]: Starting monitored process 112 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:27,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2022-11-25 16:57:27,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:27,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:27,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:27,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:27,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:27,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:57:27,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:57:27,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:27,834 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:27,836 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2022-11-25 16:57:27,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:27,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:27,838 INFO L229 MonitoredProcess]: Starting monitored process 113 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:27,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2022-11-25 16:57:27,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:27,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:27,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:27,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:27,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:27,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:57:27,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:57:27,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:27,861 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-25 16:57:27,866 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-25 16:57:27,866 INFO L444 ModelExtractionUtils]: 6 out of 9 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-11-25 16:57:27,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:27,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:27,869 INFO L229 MonitoredProcess]: Starting monitored process 114 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:27,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2022-11-25 16:57:27,870 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-25 16:57:27,870 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-25 16:57:27,871 INFO L513 LassoAnalysis]: Proved termination. [2022-11-25 16:57:27,871 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 [] [2022-11-25 16:57:27,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:27,874 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-25 16:57:27,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:27,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 16:57:27,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:28,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 16:57:28,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 16:57:28,234 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2022-11-25 16:57:28,234 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 573 states and 1007 transitions. cyclomatic complexity: 450 Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 16:57:28,597 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 573 states and 1007 transitions. cyclomatic complexity: 450. Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Result 1034 states and 1629 transitions. Complement of second has 35 states. [2022-11-25 16:57:28,598 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 [2022-11-25 16:57:28,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 16:57:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2022-11-25 16:57:28,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 63 transitions. Stem has 22 letters. Loop has 20 letters. [2022-11-25 16:57:28,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:57:28,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 63 transitions. Stem has 42 letters. Loop has 20 letters. [2022-11-25 16:57:28,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:57:28,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 63 transitions. Stem has 22 letters. Loop has 40 letters. [2022-11-25 16:57:28,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:57:28,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1034 states and 1629 transitions. [2022-11-25 16:57:28,624 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 160 [2022-11-25 16:57:28,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1034 states to 1000 states and 1569 transitions. [2022-11-25 16:57:28,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 356 [2022-11-25 16:57:28,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 361 [2022-11-25 16:57:28,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1000 states and 1569 transitions. [2022-11-25 16:57:28,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:57:28,641 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1000 states and 1569 transitions. [2022-11-25 16:57:28,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states and 1569 transitions. [2022-11-25 16:57:28,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 973. [2022-11-25 16:57:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 593 states have (on average 1.148397976391231) internal successors, (681), 614 states have internal predecessors, (681), 282 states have call successors, (296), 90 states have call predecessors, (296), 98 states have return successors, (564), 268 states have call predecessors, (564), 282 states have call successors, (564) [2022-11-25 16:57:28,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1541 transitions. [2022-11-25 16:57:28,696 INFO L240 hiAutomatonCegarLoop]: Abstraction has 973 states and 1541 transitions. [2022-11-25 16:57:28,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:28,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:57:28,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:57:28,697 INFO L87 Difference]: Start difference. First operand 973 states and 1541 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 16:57:28,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:28,743 INFO L93 Difference]: Finished difference Result 856 states and 1320 transitions. [2022-11-25 16:57:28,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 856 states and 1320 transitions. [2022-11-25 16:57:28,752 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 160 [2022-11-25 16:57:28,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 856 states to 825 states and 1278 transitions. [2022-11-25 16:57:28,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 320 [2022-11-25 16:57:28,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 320 [2022-11-25 16:57:28,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 825 states and 1278 transitions. [2022-11-25 16:57:28,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:57:28,763 INFO L218 hiAutomatonCegarLoop]: Abstraction has 825 states and 1278 transitions. [2022-11-25 16:57:28,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states and 1278 transitions. [2022-11-25 16:57:28,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 808. [2022-11-25 16:57:28,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 493 states have (on average 1.13184584178499) internal successors, (558), 519 states have internal predecessors, (558), 235 states have call successors, (241), 74 states have call predecessors, (241), 80 states have return successors, (460), 214 states have call predecessors, (460), 234 states have call successors, (460) [2022-11-25 16:57:28,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1259 transitions. [2022-11-25 16:57:28,796 INFO L240 hiAutomatonCegarLoop]: Abstraction has 808 states and 1259 transitions. [2022-11-25 16:57:28,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:57:28,796 INFO L428 stractBuchiCegarLoop]: Abstraction has 808 states and 1259 transitions. [2022-11-25 16:57:28,797 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-11-25 16:57:28,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 808 states and 1259 transitions. [2022-11-25 16:57:28,802 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 160 [2022-11-25 16:57:28,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:57:28,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:57:28,803 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:28,803 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-25 16:57:28,803 INFO L748 eck$LassoCheckResult]: Stem: 16202#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 16171#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; 16172#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 16201#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; 16231#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 16369#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 16367#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 16150#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 16151#factENTRY ~n := #in~n; 16403#L25 assume ~n <= 0;#res := 1; 16401#factFINAL assume true; 16397#factEXIT >#68#return; 16222#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 16223#factENTRY ~n := #in~n; 16399#L25 assume ~n <= 0;#res := 1; 16398#factFINAL assume true; 16395#factEXIT >#70#return; 16146#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 16147#factENTRY ~n := #in~n; 16773#L25 assume !(~n <= 0); 16775#L26 call #t~ret0 := fact(~n - 1);< 16778#factENTRY ~n := #in~n; 16784#L25 assume ~n <= 0;#res := 1; 16785#factFINAL assume true; 16777#factEXIT >#66#return; 16776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 16772#factFINAL assume true; 16771#factEXIT >#72#return; 16189#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 16190#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 16229#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 16230#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 16656#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 16657#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 16137#factENTRY ~n := #in~n; 16806#L25 assume !(~n <= 0); 16209#L26 call #t~ret0 := fact(~n - 1);< 16178#factENTRY [2022-11-25 16:57:28,803 INFO L750 eck$LassoCheckResult]: Loop: 16178#factENTRY ~n := #in~n; 16832#L25 assume !(~n <= 0); 16208#L26 call #t~ret0 := fact(~n - 1);< 16178#factENTRY [2022-11-25 16:57:28,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:28,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1580397628, now seen corresponding path program 1 times [2022-11-25 16:57:28,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:28,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196199755] [2022-11-25 16:57:28,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:28,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:28,810 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:28,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1293895411] [2022-11-25 16:57:28,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:28,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:28,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:28,812 INFO L229 MonitoredProcess]: Starting monitored process 115 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:28,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2022-11-25 16:57:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:28,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 16:57:28,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 16:57:28,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:57:29,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:29,078 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 16:57:29,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:29,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196199755] [2022-11-25 16:57:29,079 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:57:29,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293895411] [2022-11-25 16:57:29,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293895411] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:57:29,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:57:29,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-11-25 16:57:29,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463209467] [2022-11-25 16:57:29,080 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:57:29,080 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 16:57:29,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:29,080 INFO L85 PathProgramCache]: Analyzing trace with hash 29980, now seen corresponding path program 2 times [2022-11-25 16:57:29,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:29,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111799073] [2022-11-25 16:57:29,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:29,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:29,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:57:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:29,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:57:29,111 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:57:29,111 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:57:29,111 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:57:29,111 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:57:29,111 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-25 16:57:29,111 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:29,111 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:57:29,111 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:57:29,111 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration15_Loop [2022-11-25 16:57:29,111 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:57:29,111 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:57:29,112 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:29,114 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:29,116 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:29,118 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:29,142 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:57:29,142 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-25 16:57:29,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:29,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:29,143 INFO L229 MonitoredProcess]: Starting monitored process 116 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:29,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2022-11-25 16:57:29,146 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:57:29,146 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:57:29,158 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-25 16:57:29,158 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#res=0} Honda state: {fact_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-25 16:57:29,161 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2022-11-25 16:57:29,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:29,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:29,162 INFO L229 MonitoredProcess]: Starting monitored process 117 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:29,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2022-11-25 16:57:29,165 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:57:29,165 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:57:29,178 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-25 16:57:29,178 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#t~ret0=0} Honda state: {fact_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-25 16:57:29,181 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2022-11-25 16:57:29,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:29,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:29,182 INFO L229 MonitoredProcess]: Starting monitored process 118 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:29,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2022-11-25 16:57:29,188 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:57:29,188 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:57:29,200 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-25 16:57:29,200 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_~n=0} Honda state: {fact_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-25 16:57:29,205 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2022-11-25 16:57:29,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:29,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:29,206 INFO L229 MonitoredProcess]: Starting monitored process 119 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:29,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2022-11-25 16:57:29,210 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:57:29,210 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:57:29,226 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2022-11-25 16:57:29,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:29,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:29,227 INFO L229 MonitoredProcess]: Starting monitored process 120 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:29,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2022-11-25 16:57:29,230 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-25 16:57:29,230 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:57:29,252 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-25 16:57:29,255 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2022-11-25 16:57:29,255 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:57:29,255 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:57:29,255 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:57:29,255 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:57:29,255 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-25 16:57:29,256 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:29,256 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:57:29,256 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:57:29,256 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration15_Loop [2022-11-25 16:57:29,256 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:57:29,256 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:57:29,257 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:29,259 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:29,268 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:29,273 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:29,298 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:57:29,298 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-25 16:57:29,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:29,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:29,299 INFO L229 MonitoredProcess]: Starting monitored process 121 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:29,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2022-11-25 16:57:29,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:29,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:29,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:29,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:29,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:29,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:57:29,314 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:57:29,314 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:29,315 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:29,318 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2022-11-25 16:57:29,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:29,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:29,320 INFO L229 MonitoredProcess]: Starting monitored process 122 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:29,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2022-11-25 16:57:29,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:29,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:29,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:29,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:29,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:29,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:57:29,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:57:29,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:29,336 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:29,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:29,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:29,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:29,341 INFO L229 MonitoredProcess]: Starting monitored process 123 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:29,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2022-11-25 16:57:29,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:29,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:29,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:29,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:29,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:29,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:57:29,356 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:57:29,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:29,359 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-25 16:57:29,380 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-25 16:57:29,380 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-11-25 16:57:29,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:29,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:29,383 INFO L229 MonitoredProcess]: Starting monitored process 124 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:29,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2022-11-25 16:57:29,384 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-25 16:57:29,384 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-25 16:57:29,384 INFO L513 LassoAnalysis]: Proved termination. [2022-11-25 16:57:29,384 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2022-11-25 16:57:29,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2022-11-25 16:57:29,388 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-25 16:57:29,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:29,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 16:57:29,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:29,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 16:57:29,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:29,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:29,773 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-11-25 16:57:29,773 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 808 states and 1259 transitions. cyclomatic complexity: 473 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 16:57:29,907 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 808 states and 1259 transitions. cyclomatic complexity: 473. 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 880 states and 1343 transitions. Complement of second has 13 states. [2022-11-25 16:57:29,908 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 [2022-11-25 16:57:29,908 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 16:57:29,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-11-25 16:57:29,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 37 letters. Loop has 3 letters. [2022-11-25 16:57:29,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:57:29,909 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-25 16:57:29,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:29,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 16:57:29,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:30,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 16:57:30,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:30,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:30,240 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2022-11-25 16:57:30,240 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 808 states and 1259 transitions. cyclomatic complexity: 473 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 16:57:30,362 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 808 states and 1259 transitions. cyclomatic complexity: 473. 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 880 states and 1343 transitions. Complement of second has 13 states. [2022-11-25 16:57:30,363 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 [2022-11-25 16:57:30,363 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 16:57:30,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-11-25 16:57:30,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 37 letters. Loop has 3 letters. [2022-11-25 16:57:30,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:57:30,364 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-25 16:57:30,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:30,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 16:57:30,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:30,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:30,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 16:57:30,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:30,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:30,717 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-11-25 16:57:30,717 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 808 states and 1259 transitions. cyclomatic complexity: 473 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 16:57:30,839 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 808 states and 1259 transitions. cyclomatic complexity: 473. 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 996 states and 1473 transitions. Complement of second has 16 states. [2022-11-25 16:57:30,840 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 [2022-11-25 16:57:30,840 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 16:57:30,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-11-25 16:57:30,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 37 letters. Loop has 3 letters. [2022-11-25 16:57:30,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:57:30,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 40 letters. Loop has 3 letters. [2022-11-25 16:57:30,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:57:30,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 37 letters. Loop has 6 letters. [2022-11-25 16:57:30,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:57:30,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 996 states and 1473 transitions. [2022-11-25 16:57:30,858 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 154 [2022-11-25 16:57:30,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 996 states to 861 states and 1335 transitions. [2022-11-25 16:57:30,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 310 [2022-11-25 16:57:30,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 319 [2022-11-25 16:57:30,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 861 states and 1335 transitions. [2022-11-25 16:57:30,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:57:30,873 INFO L218 hiAutomatonCegarLoop]: Abstraction has 861 states and 1335 transitions. [2022-11-25 16:57:30,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states and 1335 transitions. [2022-11-25 16:57:30,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 811. [2022-11-25 16:57:30,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 499 states have (on average 1.1322645290581161) internal successors, (565), 520 states have internal predecessors, (565), 230 states have call successors, (236), 76 states have call predecessors, (236), 82 states have return successors, (452), 214 states have call predecessors, (452), 230 states have call successors, (452) [2022-11-25 16:57:30,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1253 transitions. [2022-11-25 16:57:30,910 INFO L240 hiAutomatonCegarLoop]: Abstraction has 811 states and 1253 transitions. [2022-11-25 16:57:30,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:30,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 16:57:30,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-25 16:57:30,911 INFO L87 Difference]: Start difference. First operand 811 states and 1253 transitions. Second operand has 10 states, 8 states have (on average 3.25) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 16:57:31,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:31,209 INFO L93 Difference]: Finished difference Result 852 states and 1328 transitions. [2022-11-25 16:57:31,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 852 states and 1328 transitions. [2022-11-25 16:57:31,219 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 188 [2022-11-25 16:57:31,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 852 states to 818 states and 1288 transitions. [2022-11-25 16:57:31,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 328 [2022-11-25 16:57:31,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 328 [2022-11-25 16:57:31,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 818 states and 1288 transitions. [2022-11-25 16:57:31,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:57:31,230 INFO L218 hiAutomatonCegarLoop]: Abstraction has 818 states and 1288 transitions. [2022-11-25 16:57:31,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states and 1288 transitions. [2022-11-25 16:57:31,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 749. [2022-11-25 16:57:31,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 459 states have (on average 1.1263616557734204) internal successors, (517), 474 states have internal predecessors, (517), 216 states have call successors, (220), 72 states have call predecessors, (220), 74 states have return successors, (424), 202 states have call predecessors, (424), 216 states have call successors, (424) [2022-11-25 16:57:31,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1161 transitions. [2022-11-25 16:57:31,265 INFO L240 hiAutomatonCegarLoop]: Abstraction has 749 states and 1161 transitions. [2022-11-25 16:57:31,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 16:57:31,266 INFO L428 stractBuchiCegarLoop]: Abstraction has 749 states and 1161 transitions. [2022-11-25 16:57:31,266 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-11-25 16:57:31,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 749 states and 1161 transitions. [2022-11-25 16:57:31,272 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 154 [2022-11-25 16:57:31,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:57:31,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:57:31,273 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:31,273 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [16, 16, 9, 7, 7, 7, 7, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:31,274 INFO L748 eck$LassoCheckResult]: Stem: 22089#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 22060#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; 22061#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 22088#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; 22118#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 22283#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 22550#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 22046#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 22047#factENTRY ~n := #in~n; 22551#L25 assume ~n <= 0;#res := 1; 22548#factFINAL assume true; 22546#factEXIT >#68#return; 22110#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 22111#factENTRY ~n := #in~n; 22506#L25 assume ~n <= 0;#res := 1; 22504#factFINAL assume true; 22502#factEXIT >#70#return; 22042#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 22043#factENTRY ~n := #in~n; 22748#L25 assume ~n <= 0;#res := 1; 22747#factFINAL assume true; 22746#factEXIT >#72#return; 22080#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 22082#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 22084#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 22117#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 22092#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 22032#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 22033#factENTRY ~n := #in~n; 22713#L25 assume ~n <= 0;#res := 1; 22710#factFINAL assume true; 22705#factEXIT >#74#return; 22642#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 22652#factENTRY ~n := #in~n; 22711#L25 assume ~n <= 0;#res := 1; 22708#factFINAL assume true; 22641#factEXIT >#76#return; 22375#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 22376#factENTRY ~n := #in~n; 22724#L25 assume !(~n <= 0); 22670#L26 call #t~ret0 := fact(~n - 1);< 22676#factENTRY ~n := #in~n; 22720#L25 assume ~n <= 0;#res := 1; 22716#factFINAL assume true; 22715#factEXIT >#66#return; 22681#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22707#factFINAL assume true; 22695#factEXIT >#78#return; 22319#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; 22318#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 22317#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 22127#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 22086#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 22087#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 22075#L42-3 [2022-11-25 16:57:31,274 INFO L750 eck$LassoCheckResult]: Loop: 22075#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 22286#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 22175#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 22200#factENTRY ~n := #in~n; 22245#L25 assume !(~n <= 0); 22204#L26 call #t~ret0 := fact(~n - 1);< 22220#factENTRY ~n := #in~n; 22219#L25 assume !(~n <= 0); 22206#L26 call #t~ret0 := fact(~n - 1);< 22218#factENTRY ~n := #in~n; 22222#L25 assume ~n <= 0;#res := 1; 22235#factFINAL assume true; 22234#factEXIT >#66#return; 22208#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22226#factFINAL assume true; 22203#factEXIT >#66#return; 22201#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22202#factFINAL assume true; 22158#factEXIT >#68#return; 22190#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 22248#factENTRY ~n := #in~n; 22250#L25 assume ~n <= 0;#res := 1; 22249#factFINAL assume true; 22247#factEXIT >#70#return; 22161#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 22120#factENTRY ~n := #in~n; 22223#L25 assume !(~n <= 0); 22204#L26 call #t~ret0 := fact(~n - 1);< 22220#factENTRY ~n := #in~n; 22221#L25 assume ~n <= 0;#res := 1; 22211#factFINAL assume true; 22213#factEXIT >#66#return; 22225#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22195#factFINAL assume true; 22199#factEXIT >#72#return; 22237#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 22386#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 22384#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 22382#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 22380#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 22181#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 22200#factENTRY ~n := #in~n; 22245#L25 assume !(~n <= 0); 22204#L26 call #t~ret0 := fact(~n - 1);< 22220#factENTRY ~n := #in~n; 22221#L25 assume ~n <= 0;#res := 1; 22211#factFINAL assume true; 22213#factEXIT >#66#return; 22225#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22195#factFINAL assume true; 22199#factEXIT >#68#return; 22166#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 22200#factENTRY ~n := #in~n; 22245#L25 assume !(~n <= 0); 22204#L26 call #t~ret0 := fact(~n - 1);< 22220#factENTRY ~n := #in~n; 22221#L25 assume ~n <= 0;#res := 1; 22211#factFINAL assume true; 22213#factEXIT >#66#return; 22225#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22195#factFINAL assume true; 22199#factEXIT >#70#return; 22188#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 22244#factENTRY ~n := #in~n; 22246#L25 assume ~n <= 0;#res := 1; 22228#factFINAL assume true; 22241#factEXIT >#72#return; 22242#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 22305#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 22304#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 22303#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 22300#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 22176#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 22200#factENTRY ~n := #in~n; 22245#L25 assume !(~n <= 0); 22204#L26 call #t~ret0 := fact(~n - 1);< 22220#factENTRY ~n := #in~n; 22221#L25 assume ~n <= 0;#res := 1; 22211#factFINAL assume true; 22213#factEXIT >#66#return; 22225#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22195#factFINAL assume true; 22199#factEXIT >#74#return; 22163#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 22200#factENTRY ~n := #in~n; 22245#L25 assume ~n <= 0;#res := 1; 22228#factFINAL assume true; 22241#factEXIT >#76#return; 22183#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 22120#factENTRY ~n := #in~n; 22223#L25 assume !(~n <= 0); 22204#L26 call #t~ret0 := fact(~n - 1);< 22220#factENTRY ~n := #in~n; 22221#L25 assume ~n <= 0;#res := 1; 22211#factFINAL assume true; 22213#factEXIT >#66#return; 22225#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22195#factFINAL assume true; 22199#factEXIT >#78#return; 22062#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; 22063#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 22123#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 22124#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 22085#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 22074#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 22075#L42-3 [2022-11-25 16:57:31,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:31,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1078509977, now seen corresponding path program 1 times [2022-11-25 16:57:31,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:31,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861643400] [2022-11-25 16:57:31,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:31,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:31,282 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:31,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1999508198] [2022-11-25 16:57:31,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:31,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:31,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:31,284 INFO L229 MonitoredProcess]: Starting monitored process 125 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:31,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2022-11-25 16:57:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:31,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 16:57:31,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:31,408 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 16:57:31,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:57:31,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:31,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861643400] [2022-11-25 16:57:31,409 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:57:31,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999508198] [2022-11-25 16:57:31,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999508198] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:57:31,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:57:31,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:57:31,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588810040] [2022-11-25 16:57:31,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:57:31,411 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 16:57:31,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:31,411 INFO L85 PathProgramCache]: Analyzing trace with hash 118585963, now seen corresponding path program 7 times [2022-11-25 16:57:31,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:31,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084266060] [2022-11-25 16:57:31,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:31,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:31,419 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:31,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [666667854] [2022-11-25 16:57:31,419 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 16:57:31,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:31,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:31,421 INFO L229 MonitoredProcess]: Starting monitored process 126 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:31,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2022-11-25 16:57:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:31,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 16:57:31,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:31,630 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 288 proven. 29 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-11-25 16:57:31,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:57:32,041 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 24 proven. 206 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2022-11-25 16:57:32,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:32,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084266060] [2022-11-25 16:57:32,042 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:57:32,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666667854] [2022-11-25 16:57:32,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666667854] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:57:32,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:57:32,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2022-11-25 16:57:32,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657289396] [2022-11-25 16:57:32,043 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:57:32,045 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:57:32,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:32,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:57:32,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:57:32,046 INFO L87 Difference]: Start difference. First operand 749 states and 1161 transitions. cyclomatic complexity: 428 Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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) [2022-11-25 16:57:32,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:32,211 INFO L93 Difference]: Finished difference Result 683 states and 1003 transitions. [2022-11-25 16:57:32,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 683 states and 1003 transitions. [2022-11-25 16:57:32,217 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 146 [2022-11-25 16:57:32,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 683 states to 579 states and 863 transitions. [2022-11-25 16:57:32,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 285 [2022-11-25 16:57:32,240 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 285 [2022-11-25 16:57:32,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 579 states and 863 transitions. [2022-11-25 16:57:32,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:57:32,240 INFO L218 hiAutomatonCegarLoop]: Abstraction has 579 states and 863 transitions. [2022-11-25 16:57:32,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states and 863 transitions. [2022-11-25 16:57:32,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 517. [2022-11-25 16:57:32,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 327 states have (on average 1.1345565749235473) internal successors, (371), 332 states have internal predecessors, (371), 150 states have call successors, (150), 40 states have call predecessors, (150), 40 states have return successors, (264), 144 states have call predecessors, (264), 150 states have call successors, (264) [2022-11-25 16:57:32,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 785 transitions. [2022-11-25 16:57:32,259 INFO L240 hiAutomatonCegarLoop]: Abstraction has 517 states and 785 transitions. [2022-11-25 16:57:32,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 16:57:32,259 INFO L428 stractBuchiCegarLoop]: Abstraction has 517 states and 785 transitions. [2022-11-25 16:57:32,260 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-11-25 16:57:32,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 517 states and 785 transitions. [2022-11-25 16:57:32,263 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2022-11-25 16:57:32,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:57:32,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:57:32,264 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:32,264 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 18, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:32,265 INFO L748 eck$LassoCheckResult]: Stem: 24338#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 24303#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; 24304#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 24337#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; 24321#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 24322#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 24782#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 24291#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 24292#factENTRY ~n := #in~n; 24723#L25 assume ~n <= 0;#res := 1; 24722#factFINAL assume true; 24718#factEXIT >#68#return; 24715#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 24716#factENTRY ~n := #in~n; 24721#L25 assume ~n <= 0;#res := 1; 24720#factFINAL assume true; 24714#factEXIT >#70#return; 24287#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 24288#factENTRY ~n := #in~n; 24767#L25 assume ~n <= 0;#res := 1; 24766#factFINAL assume true; 24757#factEXIT >#72#return; 24756#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 24755#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 24753#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 24750#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 24745#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 24729#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 24359#factENTRY ~n := #in~n; 24775#L25 assume !(~n <= 0); 24316#L26 call #t~ret0 := fact(~n - 1);< 24748#factENTRY ~n := #in~n; 24754#L25 assume ~n <= 0;#res := 1; 24777#factFINAL assume true; 24747#factEXIT >#66#return; 24744#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 24736#factFINAL assume true; 24724#factEXIT >#74#return; 24355#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 24277#factENTRY ~n := #in~n; 24749#L25 assume ~n <= 0;#res := 1; 24740#factFINAL assume true; 24739#factEXIT >#76#return; 24358#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 24359#factENTRY ~n := #in~n; 24775#L25 assume !(~n <= 0); 24316#L26 call #t~ret0 := fact(~n - 1);< 24748#factENTRY ~n := #in~n; 24754#L25 assume ~n <= 0;#res := 1; 24777#factFINAL assume true; 24747#factEXIT >#66#return; 24744#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 24736#factFINAL assume true; 24724#factEXIT >#78#return; 24307#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; 24308#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 24320#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 24489#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 24335#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 24336#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 24486#L42-3 [2022-11-25 16:57:32,265 INFO L750 eck$LassoCheckResult]: Loop: 24486#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 24471#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 24370#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 24408#factENTRY ~n := #in~n; 24479#L25 assume !(~n <= 0); 24413#L26 call #t~ret0 := fact(~n - 1);< 24426#factENTRY ~n := #in~n; 24425#L25 assume !(~n <= 0); 24419#L26 call #t~ret0 := fact(~n - 1);< 24424#factENTRY ~n := #in~n; 24428#L25 assume ~n <= 0;#res := 1; 24456#factFINAL assume true; 24448#factEXIT >#66#return; 24445#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 24418#factFINAL assume true; 24420#factEXIT >#66#return; 24409#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 24406#factFINAL assume true; 24407#factEXIT >#68#return; 24498#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 24574#factENTRY ~n := #in~n; 24577#L25 assume ~n <= 0;#res := 1; 24575#factFINAL assume true; 24573#factEXIT >#70#return; 24373#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 24357#factENTRY ~n := #in~n; 24455#L25 assume !(~n <= 0); 24413#L26 call #t~ret0 := fact(~n - 1);< 24426#factENTRY ~n := #in~n; 24427#L25 assume ~n <= 0;#res := 1; 24444#factFINAL assume true; 24410#factEXIT >#66#return; 24416#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 24501#factFINAL assume true; 24368#factEXIT >#72#return; 24400#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 24569#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 24568#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 24566#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 24536#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 24380#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 24408#factENTRY ~n := #in~n; 24479#L25 assume !(~n <= 0); 24413#L26 call #t~ret0 := fact(~n - 1);< 24426#factENTRY ~n := #in~n; 24427#L25 assume ~n <= 0;#res := 1; 24444#factFINAL assume true; 24410#factEXIT >#66#return; 24416#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 24501#factFINAL assume true; 24368#factEXIT >#68#return; 24393#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 24408#factENTRY ~n := #in~n; 24479#L25 assume !(~n <= 0); 24413#L26 call #t~ret0 := fact(~n - 1);< 24426#factENTRY ~n := #in~n; 24427#L25 assume ~n <= 0;#res := 1; 24444#factFINAL assume true; 24410#factEXIT >#66#return; 24416#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 24501#factFINAL assume true; 24368#factEXIT >#70#return; 24404#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 24472#factENTRY ~n := #in~n; 24480#L25 assume ~n <= 0;#res := 1; 24452#factFINAL assume true; 24469#factEXIT >#72#return; 24470#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 24534#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 24532#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 24530#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 24528#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 24388#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 24408#factENTRY ~n := #in~n; 24479#L25 assume !(~n <= 0); 24413#L26 call #t~ret0 := fact(~n - 1);< 24426#factENTRY ~n := #in~n; 24425#L25 assume !(~n <= 0); 24419#L26 call #t~ret0 := fact(~n - 1);< 24424#factENTRY ~n := #in~n; 24428#L25 assume ~n <= 0;#res := 1; 24456#factFINAL assume true; 24448#factEXIT >#66#return; 24445#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 24418#factFINAL assume true; 24420#factEXIT >#66#return; 24409#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 24406#factFINAL assume true; 24407#factEXIT >#74#return; 24392#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 24408#factENTRY ~n := #in~n; 24479#L25 assume !(~n <= 0); 24413#L26 call #t~ret0 := fact(~n - 1);< 24426#factENTRY ~n := #in~n; 24427#L25 assume ~n <= 0;#res := 1; 24444#factFINAL assume true; 24410#factEXIT >#66#return; 24416#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 24501#factFINAL assume true; 24368#factEXIT >#76#return; 24356#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 24357#factENTRY ~n := #in~n; 24455#L25 assume !(~n <= 0); 24413#L26 call #t~ret0 := fact(~n - 1);< 24426#factENTRY ~n := #in~n; 24427#L25 assume ~n <= 0;#res := 1; 24444#factFINAL assume true; 24410#factEXIT >#66#return; 24416#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 24501#factFINAL assume true; 24368#factEXIT >#78#return; 24305#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; 24306#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 24361#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 24362#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 24333#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 24334#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 24486#L42-3 [2022-11-25 16:57:32,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:32,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 2 times [2022-11-25 16:57:32,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:32,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695907712] [2022-11-25 16:57:32,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:32,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:32,273 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:32,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1846368520] [2022-11-25 16:57:32,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 16:57:32,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:32,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:32,281 INFO L229 MonitoredProcess]: Starting monitored process 127 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:32,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2022-11-25 16:57:32,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 16:57:32,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 16:57:32,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:57:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:32,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:57:32,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:32,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1114573861, now seen corresponding path program 8 times [2022-11-25 16:57:32,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:32,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399486775] [2022-11-25 16:57:32,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:32,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:32,399 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:32,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1978788087] [2022-11-25 16:57:32,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 16:57:32,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:32,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:32,407 INFO L229 MonitoredProcess]: Starting monitored process 128 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:32,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2022-11-25 16:57:32,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 16:57:32,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:57:32,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 16:57:32,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:32,631 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 348 proven. 29 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2022-11-25 16:57:32,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:57:33,081 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 24 proven. 248 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2022-11-25 16:57:33,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:33,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399486775] [2022-11-25 16:57:33,081 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:57:33,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978788087] [2022-11-25 16:57:33,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978788087] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:57:33,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:57:33,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2022-11-25 16:57:33,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518796542] [2022-11-25 16:57:33,082 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:57:33,083 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:57:33,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:33,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 16:57:33,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-11-25 16:57:33,084 INFO L87 Difference]: Start difference. First operand 517 states and 785 transitions. cyclomatic complexity: 278 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) [2022-11-25 16:57:33,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:33,602 INFO L93 Difference]: Finished difference Result 753 states and 1101 transitions. [2022-11-25 16:57:33,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 753 states and 1101 transitions. [2022-11-25 16:57:33,609 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 212 [2022-11-25 16:57:33,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 753 states to 741 states and 1079 transitions. [2022-11-25 16:57:33,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 360 [2022-11-25 16:57:33,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 360 [2022-11-25 16:57:33,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 741 states and 1079 transitions. [2022-11-25 16:57:33,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:57:33,618 INFO L218 hiAutomatonCegarLoop]: Abstraction has 741 states and 1079 transitions. [2022-11-25 16:57:33,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states and 1079 transitions. [2022-11-25 16:57:33,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 533. [2022-11-25 16:57:33,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 333 states have (on average 1.132132132132132) internal successors, (377), 334 states have internal predecessors, (377), 160 states have call successors, (160), 50 states have call predecessors, (160), 40 states have return successors, (260), 148 states have call predecessors, (260), 160 states have call successors, (260) [2022-11-25 16:57:33,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 797 transitions. [2022-11-25 16:57:33,638 INFO L240 hiAutomatonCegarLoop]: Abstraction has 533 states and 797 transitions. [2022-11-25 16:57:33,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 16:57:33,639 INFO L428 stractBuchiCegarLoop]: Abstraction has 533 states and 797 transitions. [2022-11-25 16:57:33,640 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-11-25 16:57:33,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 533 states and 797 transitions. [2022-11-25 16:57:33,643 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 121 [2022-11-25 16:57:33,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:57:33,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:57:33,644 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:33,644 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:33,645 INFO L748 eck$LassoCheckResult]: Stem: 26322#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 26299#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; 26300#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 26321#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; 26343#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 26505#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 26504#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 26290#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 26291#factENTRY ~n := #in~n; 26528#L25 assume ~n <= 0;#res := 1; 26526#factFINAL assume true; 26501#factEXIT >#68#return; 26334#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 26335#factENTRY ~n := #in~n; 26534#L25 assume ~n <= 0;#res := 1; 26532#factFINAL assume true; 26531#factEXIT >#70#return; 26281#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 26282#factENTRY ~n := #in~n; 26547#L25 assume ~n <= 0;#res := 1; 26546#factFINAL assume true; 26544#factEXIT >#72#return; 26315#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 26316#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 26319#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 26574#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 26573#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 26271#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 26272#factENTRY ~n := #in~n; 26348#L25 assume !(~n <= 0); 26327#L26 call #t~ret0 := fact(~n - 1);< 26548#factENTRY ~n := #in~n; 26549#L25 assume ~n <= 0;#res := 1; 26567#factFINAL assume true; 26566#factEXIT >#66#return; 26565#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26564#factFINAL assume true; 26563#factEXIT >#74#return; 26552#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 26339#factENTRY ~n := #in~n; 26559#L25 assume ~n <= 0;#res := 1; 26557#factFINAL assume true; 26556#factEXIT >#76#return; 26344#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 26272#factENTRY ~n := #in~n; 26348#L25 assume !(~n <= 0); 26327#L26 call #t~ret0 := fact(~n - 1);< 26548#factENTRY ~n := #in~n; 26549#L25 assume ~n <= 0;#res := 1; 26567#factFINAL assume true; 26566#factEXIT >#66#return; 26565#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26564#factFINAL assume true; 26563#factEXIT >#78#return; 26301#L30-8 [2022-11-25 16:57:33,645 INFO L750 eck$LassoCheckResult]: Loop: 26301#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; 26302#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 26307#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 26332#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 26323#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 26324#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 26339#factENTRY ~n := #in~n; 26559#L25 assume !(~n <= 0); 26327#L26 call #t~ret0 := fact(~n - 1);< 26548#factENTRY ~n := #in~n; 26296#L25 assume !(~n <= 0); 26276#L26 call #t~ret0 := fact(~n - 1);< 26550#factENTRY ~n := #in~n; 26329#L25 assume ~n <= 0;#res := 1; 26285#factFINAL assume true; 26275#factEXIT >#66#return; 26277#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26328#factFINAL assume true; 26562#factEXIT >#66#return; 26561#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26560#factFINAL assume true; 26558#factEXIT >#74#return; 26551#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 26339#factENTRY ~n := #in~n; 26559#L25 assume ~n <= 0;#res := 1; 26557#factFINAL assume true; 26556#factEXIT >#76#return; 26305#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 26555#factENTRY ~n := #in~n; 26554#L25 assume !(~n <= 0); 26295#L26 call #t~ret0 := fact(~n - 1);< 26294#factENTRY ~n := #in~n; 26296#L25 assume !(~n <= 0); 26276#L26 call #t~ret0 := fact(~n - 1);< 26550#factENTRY ~n := #in~n; 26329#L25 assume ~n <= 0;#res := 1; 26285#factFINAL assume true; 26275#factEXIT >#66#return; 26277#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26328#factFINAL assume true; 26562#factEXIT >#66#return; 26561#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26560#factFINAL assume true; 26558#factEXIT >#78#return; 26301#L30-8 [2022-11-25 16:57:33,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:33,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1908361933, now seen corresponding path program 1 times [2022-11-25 16:57:33,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:33,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087721308] [2022-11-25 16:57:33,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:33,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:33,651 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:33,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1751699319] [2022-11-25 16:57:33,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:33,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:33,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:33,656 INFO L229 MonitoredProcess]: Starting monitored process 129 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:33,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2022-11-25 16:57:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:33,730 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:57:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:33,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:57:33,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:33,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1514306572, now seen corresponding path program 1 times [2022-11-25 16:57:33,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:33,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366338849] [2022-11-25 16:57:33,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:33,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:33,762 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:33,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2110008600] [2022-11-25 16:57:33,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:33,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:33,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:33,767 INFO L229 MonitoredProcess]: Starting monitored process 130 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:33,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Waiting until timeout for monitored process [2022-11-25 16:57:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:33,835 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:57:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:33,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:57:33,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:33,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1326926298, now seen corresponding path program 1 times [2022-11-25 16:57:33,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:33,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908186941] [2022-11-25 16:57:33,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:33,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:33,871 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:33,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [659860929] [2022-11-25 16:57:33,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:33,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:33,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:33,879 INFO L229 MonitoredProcess]: Starting monitored process 131 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:33,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Waiting until timeout for monitored process [2022-11-25 16:57:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:33,969 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:57:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:34,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:57:34,719 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:57:34,719 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:57:34,719 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:57:34,719 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:57:34,719 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-25 16:57:34,719 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:34,719 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:57:34,719 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:57:34,719 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration18_Loop [2022-11-25 16:57:34,720 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:57:34,720 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:57:34,721 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:34,723 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:34,754 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:34,756 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:34,759 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:34,897 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:57:34,898 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-25 16:57:34,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:34,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:34,903 INFO L229 MonitoredProcess]: Starting monitored process 132 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:34,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2022-11-25 16:57:34,906 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:57:34,906 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:57:34,918 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-25 16:57:34,918 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: [] [2022-11-25 16:57:34,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:34,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:34,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:34,922 INFO L229 MonitoredProcess]: Starting monitored process 133 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:34,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2022-11-25 16:57:34,925 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:57:34,925 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:57:34,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:34,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:34,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:34,944 INFO L229 MonitoredProcess]: Starting monitored process 134 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:34,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2022-11-25 16:57:34,947 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-25 16:57:34,947 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:57:34,972 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-25 16:57:34,974 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2022-11-25 16:57:34,974 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:57:34,974 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:57:34,975 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:57:34,975 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:57:34,975 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-25 16:57:34,975 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:34,975 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:57:34,975 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:57:34,975 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration18_Loop [2022-11-25 16:57:34,975 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:57:34,975 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:57:34,976 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:34,978 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:34,980 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:35,012 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:35,014 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:57:35,139 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:57:35,139 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-25 16:57:35,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:35,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:35,141 INFO L229 MonitoredProcess]: Starting monitored process 135 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:35,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2022-11-25 16:57:35,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:35,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:35,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:35,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:35,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:35,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:57:35,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:57:35,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:35,155 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:35,158 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2022-11-25 16:57:35,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:35,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:35,159 INFO L229 MonitoredProcess]: Starting monitored process 136 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:35,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2022-11-25 16:57:35,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:35,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:35,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:35,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:35,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:35,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:57:35,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:57:35,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:35,173 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:57:35,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:35,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:35,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:35,178 INFO L229 MonitoredProcess]: Starting monitored process 137 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:35,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2022-11-25 16:57:35,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:57:35,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:57:35,192 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:57:35,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:57:35,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:57:35,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:57:35,194 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:57:35,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:57:35,200 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-25 16:57:35,203 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-25 16:57:35,204 INFO L444 ModelExtractionUtils]: 8 out of 11 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-25 16:57:35,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:57:35,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:35,207 INFO L229 MonitoredProcess]: Starting monitored process 138 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:35,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2022-11-25 16:57:35,208 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-25 16:57:35,208 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-25 16:57:35,208 INFO L513 LassoAnalysis]: Proved termination. [2022-11-25 16:57:35,208 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 3 Supporting invariants [] [2022-11-25 16:57:35,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:35,212 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-25 16:57:35,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:35,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 16:57:35,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:35,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-25 16:57:35,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:35,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-25 16:57:35,962 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2022-11-25 16:57:35,963 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 533 states and 797 transitions. cyclomatic complexity: 274 Second operand has 12 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-11-25 16:57:36,256 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 533 states and 797 transitions. cyclomatic complexity: 274. Second operand has 12 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Result 844 states and 1219 transitions. Complement of second has 49 states. [2022-11-25 16:57:36,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2022-11-25 16:57:36,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-11-25 16:57:36,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2022-11-25 16:57:36,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 78 transitions. Stem has 54 letters. Loop has 44 letters. [2022-11-25 16:57:36,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:57:36,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 78 transitions. Stem has 98 letters. Loop has 44 letters. [2022-11-25 16:57:36,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:57:36,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 78 transitions. Stem has 54 letters. Loop has 88 letters. [2022-11-25 16:57:36,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:57:36,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 844 states and 1219 transitions. [2022-11-25 16:57:36,269 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 120 [2022-11-25 16:57:36,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 844 states to 842 states and 1217 transitions. [2022-11-25 16:57:36,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 327 [2022-11-25 16:57:36,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 329 [2022-11-25 16:57:36,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 842 states and 1217 transitions. [2022-11-25 16:57:36,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:57:36,279 INFO L218 hiAutomatonCegarLoop]: Abstraction has 842 states and 1217 transitions. [2022-11-25 16:57:36,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states and 1217 transitions. [2022-11-25 16:57:36,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 779. [2022-11-25 16:57:36,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 491 states have (on average 1.1262729124236253) internal successors, (553), 496 states have internal predecessors, (553), 200 states have call successors, (204), 82 states have call predecessors, (204), 88 states have return successors, (372), 200 states have call predecessors, (372), 200 states have call successors, (372) [2022-11-25 16:57:36,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1129 transitions. [2022-11-25 16:57:36,304 INFO L240 hiAutomatonCegarLoop]: Abstraction has 779 states and 1129 transitions. [2022-11-25 16:57:36,304 INFO L428 stractBuchiCegarLoop]: Abstraction has 779 states and 1129 transitions. [2022-11-25 16:57:36,304 INFO L335 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2022-11-25 16:57:36,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 779 states and 1129 transitions. [2022-11-25 16:57:36,309 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 120 [2022-11-25 16:57:36,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:57:36,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:57:36,310 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:36,310 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:36,310 INFO L748 eck$LassoCheckResult]: Stem: 28095#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 28068#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; 28069#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 28094#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; 28117#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 28231#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 28223#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 28052#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 28053#factENTRY ~n := #in~n; 28280#L25 assume ~n <= 0;#res := 1; 28278#factFINAL assume true; 28276#factEXIT >#68#return; 28107#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 28108#factENTRY ~n := #in~n; 28307#L25 assume ~n <= 0;#res := 1; 28305#factFINAL assume true; 28303#factEXIT >#70#return; 28048#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 28049#factENTRY ~n := #in~n; 28383#L25 assume ~n <= 0;#res := 1; 28377#factFINAL assume true; 28323#factEXIT >#72#return; 28085#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 28086#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 28089#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 28104#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 28105#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 28324#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 28382#factENTRY ~n := #in~n; 28396#L25 assume !(~n <= 0); 28391#L26 call #t~ret0 := fact(~n - 1);< 28395#factENTRY ~n := #in~n; 28403#L25 assume ~n <= 0;#res := 1; 28406#factFINAL assume true; 28405#factEXIT >#66#return; 28404#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28384#factFINAL assume true; 28378#factEXIT >#74#return; 28111#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 28112#factENTRY ~n := #in~n; 28390#L25 assume ~n <= 0;#res := 1; 28388#factFINAL assume true; 28385#factEXIT >#76#return; 28379#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 28382#factENTRY ~n := #in~n; 28396#L25 assume !(~n <= 0); 28391#L26 call #t~ret0 := fact(~n - 1);< 28395#factENTRY ~n := #in~n; 28403#L25 assume ~n <= 0;#res := 1; 28406#factFINAL assume true; 28405#factEXIT >#66#return; 28404#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28384#factFINAL assume true; 28378#factEXIT >#78#return; 28381#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; 28071#L30-9 [2022-11-25 16:57:36,310 INFO L750 eck$LassoCheckResult]: Loop: 28071#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 28079#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 28401#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 28399#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 28026#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 28027#factENTRY ~n := #in~n; 28628#L25 assume !(~n <= 0); 28031#L26 call #t~ret0 := fact(~n - 1);< 28595#factENTRY ~n := #in~n; 28417#L25 assume !(~n <= 0); 28409#L26 call #t~ret0 := fact(~n - 1);< 28416#factENTRY ~n := #in~n; 28417#L25 assume !(~n <= 0); 28409#L26 call #t~ret0 := fact(~n - 1);< 28416#factENTRY ~n := #in~n; 28418#L25 assume ~n <= 0;#res := 1; 28438#factFINAL assume true; 28437#factEXIT >#66#return; 28436#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28435#factFINAL assume true; 28433#factEXIT >#66#return; 28411#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28415#factFINAL assume true; 28408#factEXIT >#66#return; 28407#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28375#factFINAL assume true; 28371#factEXIT >#74#return; 28373#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 28027#factENTRY ~n := #in~n; 28628#L25 assume ~n <= 0;#res := 1; 28627#factFINAL assume true; 28439#factEXIT >#76#return; 28372#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 28376#factENTRY ~n := #in~n; 28419#L25 assume !(~n <= 0); 28410#L26 call #t~ret0 := fact(~n - 1);< 28076#factENTRY ~n := #in~n; 28417#L25 assume !(~n <= 0); 28409#L26 call #t~ret0 := fact(~n - 1);< 28416#factENTRY ~n := #in~n; 28418#L25 assume ~n <= 0;#res := 1; 28438#factFINAL assume true; 28437#factEXIT >#66#return; 28436#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28435#factFINAL assume true; 28433#factEXIT >#66#return; 28434#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28593#factFINAL assume true; 28657#factEXIT >#78#return; 28070#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; 28071#L30-9 [2022-11-25 16:57:36,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:36,311 INFO L85 PathProgramCache]: Analyzing trace with hash 970322272, now seen corresponding path program 1 times [2022-11-25 16:57:36,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:36,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420030073] [2022-11-25 16:57:36,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:36,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:36,316 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:36,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1861682902] [2022-11-25 16:57:36,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:36,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:36,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:36,318 INFO L229 MonitoredProcess]: Starting monitored process 139 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:36,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Waiting until timeout for monitored process [2022-11-25 16:57:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:36,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:57:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:36,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:57:36,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:36,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1595042406, now seen corresponding path program 2 times [2022-11-25 16:57:36,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:36,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878743957] [2022-11-25 16:57:36,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:36,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:36,427 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:36,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1763734912] [2022-11-25 16:57:36,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 16:57:36,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:36,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:36,429 INFO L229 MonitoredProcess]: Starting monitored process 140 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:36,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Waiting until timeout for monitored process [2022-11-25 16:57:36,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 16:57:36,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:57:36,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 16:57:36,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:36,615 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 27 proven. 64 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-25 16:57:36,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:57:37,231 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 27 proven. 74 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-25 16:57:37,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:37,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878743957] [2022-11-25 16:57:37,232 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:57:37,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763734912] [2022-11-25 16:57:37,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763734912] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:57:37,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:57:37,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 19 [2022-11-25 16:57:37,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762409698] [2022-11-25 16:57:37,232 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:57:37,232 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:57:37,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:57:37,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 16:57:37,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-11-25 16:57:37,233 INFO L87 Difference]: Start difference. First operand 779 states and 1129 transitions. cyclomatic complexity: 366 Second operand has 19 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (14), 9 states have call predecessors, (14), 11 states have call successors, (14) [2022-11-25 16:57:37,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:57:37,943 INFO L93 Difference]: Finished difference Result 1299 states and 1947 transitions. [2022-11-25 16:57:37,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1299 states and 1947 transitions. [2022-11-25 16:57:37,961 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 268 [2022-11-25 16:57:37,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1299 states to 1293 states and 1941 transitions. [2022-11-25 16:57:37,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 521 [2022-11-25 16:57:37,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 521 [2022-11-25 16:57:37,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1293 states and 1941 transitions. [2022-11-25 16:57:37,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:57:37,979 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1293 states and 1941 transitions. [2022-11-25 16:57:37,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states and 1941 transitions. [2022-11-25 16:57:38,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 843. [2022-11-25 16:57:38,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 521 states have (on average 1.1190019193857965) internal successors, (583), 524 states have internal predecessors, (583), 230 states have call successors, (234), 94 states have call predecessors, (234), 92 states have return successors, (498), 224 states have call predecessors, (498), 230 states have call successors, (498) [2022-11-25 16:57:38,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1315 transitions. [2022-11-25 16:57:38,034 INFO L240 hiAutomatonCegarLoop]: Abstraction has 843 states and 1315 transitions. [2022-11-25 16:57:38,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 16:57:38,035 INFO L428 stractBuchiCegarLoop]: Abstraction has 843 states and 1315 transitions. [2022-11-25 16:57:38,035 INFO L335 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2022-11-25 16:57:38,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 843 states and 1315 transitions. [2022-11-25 16:57:38,043 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 130 [2022-11-25 16:57:38,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:57:38,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:57:38,047 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:38,047 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 9, 6, 6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:38,048 INFO L748 eck$LassoCheckResult]: Stem: 30496#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 30470#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; 30471#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 30495#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; 30519#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 30710#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 30709#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 30456#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 30457#factENTRY ~n := #in~n; 30684#L25 assume ~n <= 0;#res := 1; 30682#factFINAL assume true; 30681#factEXIT >#68#return; 30679#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 30680#factENTRY ~n := #in~n; 30685#L25 assume ~n <= 0;#res := 1; 30683#factFINAL assume true; 30678#factEXIT >#70#return; 30452#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 30453#factENTRY ~n := #in~n; 30809#L25 assume ~n <= 0;#res := 1; 30808#factFINAL assume true; 30807#factEXIT >#72#return; 30806#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 30805#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 30804#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 30803#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 30522#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 30523#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 30752#factENTRY ~n := #in~n; 30764#L25 assume !(~n <= 0); 30760#L26 call #t~ret0 := fact(~n - 1);< 30761#factENTRY ~n := #in~n; 30775#L25 assume ~n <= 0;#res := 1; 30763#factFINAL assume true; 30759#factEXIT >#66#return; 30757#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30753#factFINAL assume true; 30750#factEXIT >#74#return; 30514#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 30515#factENTRY ~n := #in~n; 30781#L25 assume ~n <= 0;#res := 1; 30780#factFINAL assume true; 30779#factEXIT >#76#return; 30745#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 30752#factENTRY ~n := #in~n; 30764#L25 assume !(~n <= 0); 30760#L26 call #t~ret0 := fact(~n - 1);< 30761#factENTRY ~n := #in~n; 30775#L25 assume ~n <= 0;#res := 1; 30763#factFINAL assume true; 30759#factEXIT >#66#return; 30757#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30753#factFINAL assume true; 30750#factEXIT >#78#return; 30751#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; 30894#L30-9 [2022-11-25 16:57:38,048 INFO L750 eck$LassoCheckResult]: Loop: 30894#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 30893#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 30892#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 30756#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 30442#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 30443#factENTRY ~n := #in~n; 30802#L25 assume !(~n <= 0); 30767#L26 call #t~ret0 := fact(~n - 1);< 30791#factENTRY ~n := #in~n; 30786#L25 assume !(~n <= 0); 30769#L26 call #t~ret0 := fact(~n - 1);< 30795#factENTRY ~n := #in~n; 30786#L25 assume !(~n <= 0); 30769#L26 call #t~ret0 := fact(~n - 1);< 30795#factENTRY ~n := #in~n; 30799#L25 assume ~n <= 0;#res := 1; 30797#factFINAL assume true; 30794#factEXIT >#66#return; 30792#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30790#factFINAL assume true; 30788#factEXIT >#66#return; 30773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30782#factFINAL assume true; 30765#factEXIT >#66#return; 30762#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30758#factFINAL assume true; 30754#factEXIT >#74#return; 30747#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 30443#factENTRY ~n := #in~n; 30802#L25 assume ~n <= 0;#res := 1; 30801#factFINAL assume true; 30778#factEXIT >#76#return; 30755#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 30796#factENTRY ~n := #in~n; 30793#L25 assume !(~n <= 0); 30768#L26 call #t~ret0 := fact(~n - 1);< 30774#factENTRY ~n := #in~n; 30798#L25 assume !(~n <= 0); 30770#L26 call #t~ret0 := fact(~n - 1);< 30783#factENTRY ~n := #in~n; 30786#L25 assume !(~n <= 0); 30769#L26 call #t~ret0 := fact(~n - 1);< 30795#factENTRY ~n := #in~n; 30799#L25 assume ~n <= 0;#res := 1; 30797#factFINAL assume true; 30794#factEXIT >#66#return; 30792#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30790#factFINAL assume true; 30788#factEXIT >#66#return; 30773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30782#factFINAL assume true; 30765#factEXIT >#66#return; 30762#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30758#factFINAL assume true; 30754#factEXIT >#78#return; 30448#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; 30894#L30-9 [2022-11-25 16:57:38,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:38,048 INFO L85 PathProgramCache]: Analyzing trace with hash 970322272, now seen corresponding path program 2 times [2022-11-25 16:57:38,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:38,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679060867] [2022-11-25 16:57:38,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:38,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:38,065 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:38,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [497480894] [2022-11-25 16:57:38,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 16:57:38,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:38,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:38,075 INFO L229 MonitoredProcess]: Starting monitored process 141 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:38,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Waiting until timeout for monitored process [2022-11-25 16:57:38,151 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 16:57:38,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 16:57:38,151 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:57:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:38,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:57:38,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:38,186 INFO L85 PathProgramCache]: Analyzing trace with hash -856179490, now seen corresponding path program 3 times [2022-11-25 16:57:38,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:38,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775950294] [2022-11-25 16:57:38,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:38,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:38,192 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:38,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [740150951] [2022-11-25 16:57:38,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 16:57:38,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:38,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:38,199 INFO L229 MonitoredProcess]: Starting monitored process 142 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:38,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Waiting until timeout for monitored process [2022-11-25 16:57:38,277 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-11-25 16:57:38,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 16:57:38,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:57:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:38,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:57:38,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:38,321 INFO L85 PathProgramCache]: Analyzing trace with hash -768211651, now seen corresponding path program 2 times [2022-11-25 16:57:38,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:57:38,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645444348] [2022-11-25 16:57:38,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:38,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:57:38,328 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:57:38,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [211561722] [2022-11-25 16:57:38,329 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 16:57:38,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:57:38,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:38,333 INFO L229 MonitoredProcess]: Starting monitored process 143 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:57:38,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Waiting until timeout for monitored process [2022-11-25 16:57:38,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 16:57:38,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:57:38,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 16:57:38,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 372 proven. 13 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2022-11-25 16:57:38,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:57:38,930 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 102 proven. 80 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2022-11-25 16:57:38,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:57:38,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645444348] [2022-11-25 16:57:38,930 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:57:38,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211561722] [2022-11-25 16:57:38,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211561722] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:57:38,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:57:38,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 13 [2022-11-25 16:57:38,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858886554] [2022-11-25 16:57:38,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:57:48,141 WARN L233 SmtUtils]: Spent 7.94s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 16:58:00,175 WARN L233 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 16:58:12,354 WARN L233 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 16:58:12,775 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:58:12,775 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:58:12,775 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:58:12,775 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:58:12,775 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-25 16:58:12,775 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:12,775 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:58:12,776 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:58:12,776 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration20_Loop [2022-11-25 16:58:12,776 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:58:12,776 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:58:12,777 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:12,780 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:12,782 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:12,784 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:13,051 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:13,053 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:13,762 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:58:13,762 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-25 16:58:13,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:13,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:13,767 INFO L229 MonitoredProcess]: Starting monitored process 144 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:13,772 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:58:13,772 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:58:13,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2022-11-25 16:58:13,794 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-25 16:58:13,794 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: [] [2022-11-25 16:58:13,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Forceful destruction successful, exit code 0 [2022-11-25 16:58:13,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:13,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:13,800 INFO L229 MonitoredProcess]: Starting monitored process 145 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:13,807 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:58:13,807 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:58:13,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2022-11-25 16:58:13,832 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-25 16:58:13,832 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: [] [2022-11-25 16:58:13,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2022-11-25 16:58:13,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:13,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:13,838 INFO L229 MonitoredProcess]: Starting monitored process 146 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:13,843 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:58:13,843 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:58:13,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2022-11-25 16:58:13,868 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-25 16:58:13,868 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: [] [2022-11-25 16:58:13,872 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2022-11-25 16:58:13,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:13,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:13,874 INFO L229 MonitoredProcess]: Starting monitored process 147 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:13,879 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:58:13,879 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:58:13,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2022-11-25 16:58:13,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2022-11-25 16:58:13,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:13,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:13,909 INFO L229 MonitoredProcess]: Starting monitored process 148 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:13,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2022-11-25 16:58:13,912 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-25 16:58:13,912 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:58:13,950 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-25 16:58:13,953 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Forceful destruction successful, exit code 0 [2022-11-25 16:58:13,953 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:58:13,953 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:58:13,953 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:58:13,953 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:58:13,954 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-25 16:58:13,954 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:13,954 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:58:13,954 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:58:13,954 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration20_Loop [2022-11-25 16:58:13,954 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:58:13,954 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:58:13,955 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:13,958 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:14,174 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:14,176 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:14,178 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:14,181 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:14,893 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:58:14,893 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-25 16:58:14,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:14,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:14,901 INFO L229 MonitoredProcess]: Starting monitored process 149 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:14,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:58:14,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:58:14,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:58:14,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:58:14,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:58:14,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:58:14,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:58:14,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:58:14,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2022-11-25 16:58:14,924 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:58:14,926 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2022-11-25 16:58:14,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:14,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:14,927 INFO L229 MonitoredProcess]: Starting monitored process 150 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:14,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2022-11-25 16:58:14,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:58:14,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:58:14,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:58:14,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:58:14,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:58:14,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:58:14,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:58:14,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:58:14,948 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-25 16:58:14,952 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-25 16:58:14,952 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-25 16:58:14,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:14,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:14,955 INFO L229 MonitoredProcess]: Starting monitored process 151 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:14,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2022-11-25 16:58:14,956 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-25 16:58:14,956 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-25 16:58:14,956 INFO L513 LassoAnalysis]: Proved termination. [2022-11-25 16:58:14,956 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 5 Supporting invariants [] [2022-11-25 16:58:14,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Forceful destruction successful, exit code 0 [2022-11-25 16:58:14,960 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-25 16:58:14,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:15,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 16:58:15,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:58:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:15,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-25 16:58:15,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:58:15,703 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-11-25 16:58:15,704 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2022-11-25 16:58:15,704 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 843 states and 1315 transitions. cyclomatic complexity: 488 Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-11-25 16:58:16,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Forceful destruction successful, exit code 0 [2022-11-25 16:58:16,122 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 843 states and 1315 transitions. cyclomatic complexity: 488. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Result 1655 states and 2502 transitions. Complement of second has 57 states. [2022-11-25 16:58:16,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2022-11-25 16:58:16,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-11-25 16:58:16,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 87 transitions. [2022-11-25 16:58:16,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 87 transitions. Stem has 55 letters. Loop has 56 letters. [2022-11-25 16:58:16,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:58:16,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 87 transitions. Stem has 111 letters. Loop has 56 letters. [2022-11-25 16:58:16,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:58:16,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 87 transitions. Stem has 55 letters. Loop has 112 letters. [2022-11-25 16:58:16,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:58:16,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1655 states and 2502 transitions. [2022-11-25 16:58:16,147 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 130 [2022-11-25 16:58:16,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1655 states to 1385 states and 2112 transitions. [2022-11-25 16:58:16,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 405 [2022-11-25 16:58:16,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 407 [2022-11-25 16:58:16,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1385 states and 2112 transitions. [2022-11-25 16:58:16,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:58:16,166 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1385 states and 2112 transitions. [2022-11-25 16:58:16,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states and 2112 transitions. [2022-11-25 16:58:16,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1151. [2022-11-25 16:58:16,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 711 states have (on average 1.109704641350211) internal successors, (789), 722 states have internal predecessors, (789), 290 states have call successors, (300), 132 states have call predecessors, (300), 150 states have return successors, (712), 296 states have call predecessors, (712), 290 states have call successors, (712) [2022-11-25 16:58:16,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1801 transitions. [2022-11-25 16:58:16,210 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1151 states and 1801 transitions. [2022-11-25 16:58:16,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:16,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 16:58:16,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-11-25 16:58:16,211 INFO L87 Difference]: Start difference. First operand 1151 states and 1801 transitions. Second operand has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 9 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (18), 7 states have call predecessors, (18), 9 states have call successors, (18) [2022-11-25 16:58:16,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:16,687 INFO L93 Difference]: Finished difference Result 1729 states and 2769 transitions. [2022-11-25 16:58:16,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1729 states and 2769 transitions. [2022-11-25 16:58:16,703 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 250 [2022-11-25 16:58:16,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1729 states to 1696 states and 2728 transitions. [2022-11-25 16:58:16,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 576 [2022-11-25 16:58:16,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 576 [2022-11-25 16:58:16,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1696 states and 2728 transitions. [2022-11-25 16:58:16,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:58:16,724 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1696 states and 2728 transitions. [2022-11-25 16:58:16,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states and 2728 transitions. [2022-11-25 16:58:16,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1288. [2022-11-25 16:58:16,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 800 states have (on average 1.1075) internal successors, (886), 815 states have internal predecessors, (886), 338 states have call successors, (348), 132 states have call predecessors, (348), 150 states have return successors, (790), 340 states have call predecessors, (790), 338 states have call successors, (790) [2022-11-25 16:58:16,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 2024 transitions. [2022-11-25 16:58:16,774 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1288 states and 2024 transitions. [2022-11-25 16:58:16,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 16:58:16,775 INFO L428 stractBuchiCegarLoop]: Abstraction has 1288 states and 2024 transitions. [2022-11-25 16:58:16,775 INFO L335 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2022-11-25 16:58:16,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1288 states and 2024 transitions. [2022-11-25 16:58:16,781 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 174 [2022-11-25 16:58:16,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:58:16,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:58:16,782 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:16,782 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [26, 26, 17, 17, 17, 17, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:16,783 INFO L748 eck$LassoCheckResult]: Stem: 36995#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 36961#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; 36962#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 36994#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; 36978#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 36980#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 37772#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 36948#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 36949#factENTRY ~n := #in~n; 37844#L25 assume ~n <= 0;#res := 1; 37843#factFINAL assume true; 37841#factEXIT >#68#return; 37838#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 37839#factENTRY ~n := #in~n; 37842#L25 assume ~n <= 0;#res := 1; 37840#factFINAL assume true; 37837#factEXIT >#70#return; 36937#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 36938#factENTRY ~n := #in~n; 37917#L25 assume ~n <= 0;#res := 1; 37916#factFINAL assume true; 37915#factEXIT >#72#return; 37914#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 36985#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 36986#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 37939#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 37935#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 37927#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 37930#factENTRY ~n := #in~n; 37945#L25 assume !(~n <= 0); 37937#L26 call #t~ret0 := fact(~n - 1);< 37938#factENTRY ~n := #in~n; 37944#L25 assume ~n <= 0;#res := 1; 37943#factFINAL assume true; 37936#factEXIT >#66#return; 37934#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37931#factFINAL assume true; 37925#factEXIT >#74#return; 37929#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 37932#factENTRY ~n := #in~n; 37942#L25 assume ~n <= 0;#res := 1; 37941#factFINAL assume true; 37933#factEXIT >#76#return; 37928#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 37930#factENTRY ~n := #in~n; 37945#L25 assume !(~n <= 0); 37937#L26 call #t~ret0 := fact(~n - 1);< 37938#factENTRY ~n := #in~n; 37944#L25 assume ~n <= 0;#res := 1; 37943#factFINAL assume true; 37936#factEXIT >#66#return; 37934#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37931#factFINAL assume true; 37925#factEXIT >#78#return; 37922#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; 37924#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 37958#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 37621#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 36992#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 36993#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 37192#L42-3 [2022-11-25 16:58:16,783 INFO L750 eck$LassoCheckResult]: Loop: 37192#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 37184#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 37032#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 37089#factENTRY ~n := #in~n; 37157#L25 assume !(~n <= 0); 37095#L26 call #t~ret0 := fact(~n - 1);< 37124#factENTRY ~n := #in~n; 37112#L25 assume !(~n <= 0); 37103#L26 call #t~ret0 := fact(~n - 1);< 37170#factENTRY ~n := #in~n; 37112#L25 assume !(~n <= 0); 37103#L26 call #t~ret0 := fact(~n - 1);< 37170#factENTRY ~n := #in~n; 37174#L25 assume ~n <= 0;#res := 1; 37171#factFINAL assume true; 37168#factEXIT >#66#return; 37169#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37099#factFINAL assume true; 37104#factEXIT >#66#return; 37119#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37120#factFINAL assume true; 37189#factEXIT >#66#return; 37188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37187#factFINAL assume true; 37185#factEXIT >#68#return; 37186#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 37011#factENTRY ~n := #in~n; 37281#L25 assume ~n <= 0;#res := 1; 37280#factFINAL assume true; 37279#factEXIT >#70#return; 37154#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 37081#factENTRY ~n := #in~n; 37152#L25 assume !(~n <= 0); 37110#L26 call #t~ret0 := fact(~n - 1);< 37173#factENTRY ~n := #in~n; 37172#L25 assume !(~n <= 0); 37101#L26 call #t~ret0 := fact(~n - 1);< 37111#factENTRY ~n := #in~n; 37112#L25 assume !(~n <= 0); 37103#L26 call #t~ret0 := fact(~n - 1);< 37170#factENTRY ~n := #in~n; 37174#L25 assume ~n <= 0;#res := 1; 37171#factFINAL assume true; 37168#factEXIT >#66#return; 37169#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37099#factFINAL assume true; 37104#factEXIT >#66#return; 37119#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37120#factFINAL assume true; 37189#factEXIT >#66#return; 37188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37187#factFINAL assume true; 37185#factEXIT >#72#return; 37073#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 37277#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 37274#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 37271#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 37268#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 37062#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 37089#factENTRY ~n := #in~n; 37157#L25 assume !(~n <= 0); 37095#L26 call #t~ret0 := fact(~n - 1);< 37124#factENTRY ~n := #in~n; 37112#L25 assume !(~n <= 0); 37103#L26 call #t~ret0 := fact(~n - 1);< 37170#factENTRY ~n := #in~n; 37112#L25 assume !(~n <= 0); 37103#L26 call #t~ret0 := fact(~n - 1);< 37170#factENTRY ~n := #in~n; 37174#L25 assume ~n <= 0;#res := 1; 37171#factFINAL assume true; 37168#factEXIT >#66#return; 37169#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37099#factFINAL assume true; 37104#factEXIT >#66#return; 37119#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37120#factFINAL assume true; 37189#factEXIT >#66#return; 37188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37187#factFINAL assume true; 37185#factEXIT >#68#return; 37065#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 37089#factENTRY ~n := #in~n; 37157#L25 assume !(~n <= 0); 37095#L26 call #t~ret0 := fact(~n - 1);< 37124#factENTRY ~n := #in~n; 37117#L25 assume ~n <= 0;#res := 1; 37118#factFINAL assume true; 37092#factEXIT >#66#return; 37091#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37082#factFINAL assume true; 37088#factEXIT >#70#return; 37037#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 37089#factENTRY ~n := #in~n; 37157#L25 assume !(~n <= 0); 37095#L26 call #t~ret0 := fact(~n - 1);< 37124#factENTRY ~n := #in~n; 37112#L25 assume !(~n <= 0); 37103#L26 call #t~ret0 := fact(~n - 1);< 37170#factENTRY ~n := #in~n; 37112#L25 assume !(~n <= 0); 37103#L26 call #t~ret0 := fact(~n - 1);< 37170#factENTRY ~n := #in~n; 37174#L25 assume ~n <= 0;#res := 1; 37171#factFINAL assume true; 37168#factEXIT >#66#return; 37169#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37099#factFINAL assume true; 37104#factEXIT >#66#return; 37119#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37120#factFINAL assume true; 37189#factEXIT >#66#return; 37188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37187#factFINAL assume true; 37185#factEXIT >#72#return; 37077#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 37443#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 37442#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 37440#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 37405#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 37064#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 37089#factENTRY ~n := #in~n; 37157#L25 assume !(~n <= 0); 37095#L26 call #t~ret0 := fact(~n - 1);< 37124#factENTRY ~n := #in~n; 37112#L25 assume !(~n <= 0); 37103#L26 call #t~ret0 := fact(~n - 1);< 37170#factENTRY ~n := #in~n; 37174#L25 assume ~n <= 0;#res := 1; 37171#factFINAL assume true; 37168#factEXIT >#66#return; 37169#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37099#factFINAL assume true; 37104#factEXIT >#66#return; 37167#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37196#factFINAL assume true; 37026#factEXIT >#74#return; 37030#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 37089#factENTRY ~n := #in~n; 37157#L25 assume !(~n <= 0); 37095#L26 call #t~ret0 := fact(~n - 1);< 37124#factENTRY ~n := #in~n; 37117#L25 assume ~n <= 0;#res := 1; 37118#factFINAL assume true; 37092#factEXIT >#66#return; 37091#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37082#factFINAL assume true; 37088#factEXIT >#76#return; 37040#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 37163#factENTRY ~n := #in~n; 37149#L25 assume !(~n <= 0); 37095#L26 call #t~ret0 := fact(~n - 1);< 37124#factENTRY ~n := #in~n; 37117#L25 assume ~n <= 0;#res := 1; 37118#factFINAL assume true; 37092#factEXIT >#66#return; 37091#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37082#factFINAL assume true; 37088#factEXIT >#78#return; 37079#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; 37022#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 37023#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 37018#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 36990#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 36991#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 37192#L42-3 [2022-11-25 16:58:16,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:16,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 3 times [2022-11-25 16:58:16,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:16,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941550876] [2022-11-25 16:58:16,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:16,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:16,789 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:58:16,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [698787179] [2022-11-25 16:58:16,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 16:58:16,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:58:16,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:16,791 INFO L229 MonitoredProcess]: Starting monitored process 152 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:58:16,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (152)] Waiting until timeout for monitored process [2022-11-25 16:58:16,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-25 16:58:16,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 16:58:16,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:58:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:58:16,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:58:16,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:16,911 INFO L85 PathProgramCache]: Analyzing trace with hash 233649515, now seen corresponding path program 9 times [2022-11-25 16:58:16,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:16,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303930534] [2022-11-25 16:58:16,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:16,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:16,925 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:58:16,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1130637347] [2022-11-25 16:58:16,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 16:58:16,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:58:16,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:16,927 INFO L229 MonitoredProcess]: Starting monitored process 153 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:58:16,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (153)] Waiting until timeout for monitored process [2022-11-25 16:58:17,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-25 16:58:17,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:58:17,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 16:58:17,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:58:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1589 backedges. 476 proven. 103 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2022-11-25 16:58:17,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:58:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1589 backedges. 252 proven. 135 refuted. 0 times theorem prover too weak. 1202 trivial. 0 not checked. [2022-11-25 16:58:17,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:17,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303930534] [2022-11-25 16:58:17,658 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:58:17,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130637347] [2022-11-25 16:58:17,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130637347] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:58:17,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:58:17,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 16 [2022-11-25 16:58:17,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235390963] [2022-11-25 16:58:17,658 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:58:17,659 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:58:17,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:17,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 16:58:17,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-11-25 16:58:17,659 INFO L87 Difference]: Start difference. First operand 1288 states and 2024 transitions. cyclomatic complexity: 756 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) [2022-11-25 16:58:18,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:18,487 INFO L93 Difference]: Finished difference Result 1885 states and 2969 transitions. [2022-11-25 16:58:18,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1885 states and 2969 transitions. [2022-11-25 16:58:18,508 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 341 [2022-11-25 16:58:18,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1885 states to 1869 states and 2927 transitions. [2022-11-25 16:58:18,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 661 [2022-11-25 16:58:18,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 661 [2022-11-25 16:58:18,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1869 states and 2927 transitions. [2022-11-25 16:58:18,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:58:18,535 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1869 states and 2927 transitions. [2022-11-25 16:58:18,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states and 2927 transitions. [2022-11-25 16:58:18,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1522. [2022-11-25 16:58:18,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 950 states have (on average 1.1073684210526316) internal successors, (1052), 971 states have internal predecessors, (1052), 422 states have call successors, (432), 132 states have call predecessors, (432), 150 states have return successors, (918), 418 states have call predecessors, (918), 422 states have call successors, (918) [2022-11-25 16:58:18,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 2402 transitions. [2022-11-25 16:58:18,605 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1522 states and 2402 transitions. [2022-11-25 16:58:18,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 16:58:18,611 INFO L428 stractBuchiCegarLoop]: Abstraction has 1522 states and 2402 transitions. [2022-11-25 16:58:18,611 INFO L335 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2022-11-25 16:58:18,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1522 states and 2402 transitions. [2022-11-25 16:58:18,620 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 260 [2022-11-25 16:58:18,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:58:18,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:58:18,624 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:18,624 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 9, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:18,625 INFO L748 eck$LassoCheckResult]: Stem: 41188#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 41157#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; 41158#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 41187#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; 41212#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 41595#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 41990#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 41144#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 41145#factENTRY ~n := #in~n; 41996#L25 assume ~n <= 0;#res := 1; 41993#factFINAL assume true; 41992#factEXIT >#68#return; 41206#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 41207#factENTRY ~n := #in~n; 41939#L25 assume ~n <= 0;#res := 1; 41938#factFINAL assume true; 41933#factEXIT >#70#return; 41133#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 41134#factENTRY ~n := #in~n; 42109#L25 assume ~n <= 0;#res := 1; 42108#factFINAL assume true; 42107#factEXIT >#72#return; 41184#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 41181#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 41182#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 42375#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 42373#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 42359#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 42364#factENTRY ~n := #in~n; 42381#L25 assume !(~n <= 0); 42377#L26 call #t~ret0 := fact(~n - 1);< 42379#factENTRY ~n := #in~n; 42388#L25 assume ~n <= 0;#res := 1; 42412#factFINAL assume true; 42394#factEXIT >#66#return; 42389#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42390#factFINAL assume true; 42361#factEXIT >#74#return; 42358#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 42391#factENTRY ~n := #in~n; 42392#L25 assume ~n <= 0;#res := 1; 42440#factFINAL assume true; 42439#factEXIT >#76#return; 42357#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 42364#factENTRY ~n := #in~n; 42381#L25 assume !(~n <= 0); 42377#L26 call #t~ret0 := fact(~n - 1);< 42379#factENTRY ~n := #in~n; 42388#L25 assume ~n <= 0;#res := 1; 42412#factFINAL assume true; 42394#factEXIT >#66#return; 42389#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42390#factFINAL assume true; 42361#factEXIT >#78#return; 42362#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; 42502#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 42493#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 42295#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 41617#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 42284#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 41176#L42-3 [2022-11-25 16:58:18,625 INFO L750 eck$LassoCheckResult]: Loop: 41176#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 41198#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 41228#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 41298#factENTRY ~n := #in~n; 41488#L25 assume !(~n <= 0); 41304#L26 call #t~ret0 := fact(~n - 1);< 41426#factENTRY ~n := #in~n; 41328#L25 assume ~n <= 0;#res := 1; 41329#factFINAL assume true; 41303#factEXIT >#66#return; 41302#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 41296#factFINAL assume true; 41219#factEXIT >#68#return; 41282#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 41750#factENTRY ~n := #in~n; 41752#L25 assume ~n <= 0;#res := 1; 41751#factFINAL assume true; 41749#factEXIT >#70#return; 41248#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 41295#factENTRY ~n := #in~n; 41437#L25 assume !(~n <= 0); 41304#L26 call #t~ret0 := fact(~n - 1);< 41426#factENTRY ~n := #in~n; 41328#L25 assume ~n <= 0;#res := 1; 41329#factFINAL assume true; 41303#factEXIT >#66#return; 41302#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 41296#factFINAL assume true; 41219#factEXIT >#72#return; 41285#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 41918#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 41915#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 41913#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 41911#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 41220#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 41297#factENTRY ~n := #in~n; 41568#L25 assume !(~n <= 0); 41307#L26 call #t~ret0 := fact(~n - 1);< 41331#factENTRY ~n := #in~n; 41328#L25 assume ~n <= 0;#res := 1; 41329#factFINAL assume true; 41303#factEXIT >#66#return; 41302#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 41296#factFINAL assume true; 41219#factEXIT >#68#return; 41272#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 41298#factENTRY ~n := #in~n; 41488#L25 assume !(~n <= 0); 41304#L26 call #t~ret0 := fact(~n - 1);< 41426#factENTRY ~n := #in~n; 41328#L25 assume ~n <= 0;#res := 1; 41329#factFINAL assume true; 41303#factEXIT >#66#return; 41302#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 41296#factFINAL assume true; 41219#factEXIT >#70#return; 41293#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 41479#factENTRY ~n := #in~n; 41497#L25 assume ~n <= 0;#res := 1; 41478#factFINAL assume true; 41402#factEXIT >#72#return; 41408#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 41598#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 41596#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 41565#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 41508#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 41268#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 41298#factENTRY ~n := #in~n; 41488#L25 assume !(~n <= 0); 41304#L26 call #t~ret0 := fact(~n - 1);< 41426#factENTRY ~n := #in~n; 41328#L25 assume ~n <= 0;#res := 1; 41329#factFINAL assume true; 41303#factEXIT >#66#return; 41302#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 41296#factFINAL assume true; 41219#factEXIT >#74#return; 41260#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 41298#factENTRY ~n := #in~n; 41488#L25 assume ~n <= 0;#res := 1; 41478#factFINAL assume true; 41402#factEXIT >#76#return; 41265#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 41295#factENTRY ~n := #in~n; 41437#L25 assume !(~n <= 0); 41304#L26 call #t~ret0 := fact(~n - 1);< 41426#factENTRY ~n := #in~n; 41328#L25 assume ~n <= 0;#res := 1; 41329#factFINAL assume true; 41303#factEXIT >#66#return; 41302#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 41296#factFINAL assume true; 41219#factEXIT >#78#return; 41218#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; 41217#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 41216#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 41214#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 41185#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 41175#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 41176#L42-3 [2022-11-25 16:58:18,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:18,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 4 times [2022-11-25 16:58:18,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:18,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465501522] [2022-11-25 16:58:18,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:18,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:18,635 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:58:18,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1043026498] [2022-11-25 16:58:18,636 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 16:58:18,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:58:18,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:18,643 INFO L229 MonitoredProcess]: Starting monitored process 154 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:58:18,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (154)] Waiting until timeout for monitored process [2022-11-25 16:58:18,733 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 16:58:18,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 16:58:18,733 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:58:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:58:18,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:58:18,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:18,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1813506637, now seen corresponding path program 10 times [2022-11-25 16:58:18,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:18,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797824884] [2022-11-25 16:58:18,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:18,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:18,780 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:58:18,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1335629289] [2022-11-25 16:58:18,780 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 16:58:18,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:58:18,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:18,787 INFO L229 MonitoredProcess]: Starting monitored process 155 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:58:18,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (155)] Waiting until timeout for monitored process [2022-11-25 16:58:18,883 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 16:58:18,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:58:18,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-25 16:58:18,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:58:19,044 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 230 proven. 82 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-11-25 16:58:19,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:58:19,515 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 79 proven. 134 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2022-11-25 16:58:19,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:19,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797824884] [2022-11-25 16:58:19,516 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:58:19,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335629289] [2022-11-25 16:58:19,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335629289] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:58:19,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:58:19,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 18 [2022-11-25 16:58:19,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863810875] [2022-11-25 16:58:19,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:58:19,517 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:58:19,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:19,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 16:58:19,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-11-25 16:58:19,520 INFO L87 Difference]: Start difference. First operand 1522 states and 2402 transitions. cyclomatic complexity: 904 Second operand has 18 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 16 states have internal predecessors, (45), 11 states have call successors, (19), 2 states have call predecessors, (19), 5 states have return successors, (19), 8 states have call predecessors, (19), 11 states have call successors, (19) [2022-11-25 16:58:20,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:20,287 INFO L93 Difference]: Finished difference Result 1540 states and 2273 transitions. [2022-11-25 16:58:20,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1540 states and 2273 transitions. [2022-11-25 16:58:20,300 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 176 [2022-11-25 16:58:20,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1540 states to 1428 states and 2111 transitions. [2022-11-25 16:58:20,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 473 [2022-11-25 16:58:20,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 473 [2022-11-25 16:58:20,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1428 states and 2111 transitions. [2022-11-25 16:58:20,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:58:20,318 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1428 states and 2111 transitions. [2022-11-25 16:58:20,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states and 2111 transitions. [2022-11-25 16:58:20,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1262. [2022-11-25 16:58:20,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 790 states have (on average 1.0886075949367089) internal successors, (860), 803 states have internal predecessors, (860), 322 states have call successors, (328), 132 states have call predecessors, (328), 150 states have return successors, (728), 326 states have call predecessors, (728), 322 states have call successors, (728) [2022-11-25 16:58:20,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1916 transitions. [2022-11-25 16:58:20,360 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1262 states and 1916 transitions. [2022-11-25 16:58:20,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 16:58:20,361 INFO L428 stractBuchiCegarLoop]: Abstraction has 1262 states and 1916 transitions. [2022-11-25 16:58:20,362 INFO L335 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2022-11-25 16:58:20,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1262 states and 1916 transitions. [2022-11-25 16:58:20,367 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 155 [2022-11-25 16:58:20,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:58:20,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:58:20,369 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:20,369 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [17, 17, 9, 8, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:20,369 INFO L748 eck$LassoCheckResult]: Stem: 44884#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 44856#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; 44857#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 44883#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; 44905#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 45094#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 45695#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 44841#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 44842#factENTRY ~n := #in~n; 45517#L25 assume ~n <= 0;#res := 1; 45514#factFINAL assume true; 45512#factEXIT >#68#return; 44898#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 44899#factENTRY ~n := #in~n; 45747#L25 assume ~n <= 0;#res := 1; 45746#factFINAL assume true; 45743#factEXIT >#70#return; 44837#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 44838#factENTRY ~n := #in~n; 45801#L25 assume ~n <= 0;#res := 1; 45799#factFINAL assume true; 45795#factEXIT >#72#return; 44877#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 44878#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 44880#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 45815#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 45814#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 45472#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 45475#factENTRY ~n := #in~n; 45822#L25 assume !(~n <= 0); 45813#L26 call #t~ret0 := fact(~n - 1);< 45820#factENTRY ~n := #in~n; 45832#L25 assume ~n <= 0;#res := 1; 45833#factFINAL assume true; 45830#factEXIT >#66#return; 45827#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 45824#factFINAL assume true; 45469#factEXIT >#74#return; 45473#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 45809#factENTRY ~n := #in~n; 45812#L25 assume ~n <= 0;#res := 1; 45810#factFINAL assume true; 45808#factEXIT >#76#return; 45470#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 45475#factENTRY ~n := #in~n; 45822#L25 assume !(~n <= 0); 45813#L26 call #t~ret0 := fact(~n - 1);< 45820#factENTRY ~n := #in~n; 45832#L25 assume ~n <= 0;#res := 1; 45833#factFINAL assume true; 45830#factEXIT >#66#return; 45827#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 45824#factFINAL assume true; 45469#factEXIT >#78#return; 45474#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; 45465#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 45466#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 45462#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 45320#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 45461#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 44872#L42-3 [2022-11-25 16:58:20,369 INFO L750 eck$LassoCheckResult]: Loop: 44872#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 45148#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 44954#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 44969#factENTRY ~n := #in~n; 45080#L25 assume !(~n <= 0); 44983#L26 call #t~ret0 := fact(~n - 1);< 45009#factENTRY ~n := #in~n; 45005#L25 assume ~n <= 0;#res := 1; 45006#factFINAL assume true; 44982#factEXIT >#66#return; 44987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44968#factFINAL assume true; 44918#factEXIT >#68#return; 44966#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 45116#factENTRY ~n := #in~n; 45120#L25 assume ~n <= 0;#res := 1; 45119#factFINAL assume true; 45115#factEXIT >#70#return; 44943#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 44967#factENTRY ~n := #in~n; 45034#L25 assume !(~n <= 0); 44983#L26 call #t~ret0 := fact(~n - 1);< 45009#factENTRY ~n := #in~n; 45005#L25 assume ~n <= 0;#res := 1; 45006#factFINAL assume true; 44982#factEXIT >#66#return; 44987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44968#factFINAL assume true; 44918#factEXIT >#72#return; 44962#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 45781#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 45772#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 45771#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 45770#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 44927#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 45036#factENTRY ~n := #in~n; 45032#L25 assume !(~n <= 0); 44984#L26 call #t~ret0 := fact(~n - 1);< 45008#factENTRY ~n := #in~n; 45005#L25 assume ~n <= 0;#res := 1; 45006#factFINAL assume true; 44982#factEXIT >#66#return; 44987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44968#factFINAL assume true; 44918#factEXIT >#68#return; 44953#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 44969#factENTRY ~n := #in~n; 45080#L25 assume !(~n <= 0); 44983#L26 call #t~ret0 := fact(~n - 1);< 45009#factENTRY ~n := #in~n; 45005#L25 assume ~n <= 0;#res := 1; 45006#factFINAL assume true; 44982#factEXIT >#66#return; 44987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44968#factFINAL assume true; 44918#factEXIT >#70#return; 44965#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 45070#factENTRY ~n := #in~n; 45079#L25 assume ~n <= 0;#res := 1; 45069#factFINAL assume true; 45060#factEXIT >#72#return; 45061#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 45539#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 45538#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 45537#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 45536#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 44925#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 44967#factENTRY ~n := #in~n; 45034#L25 assume !(~n <= 0); 44983#L26 call #t~ret0 := fact(~n - 1);< 45009#factENTRY ~n := #in~n; 45002#L25 assume !(~n <= 0); 44996#L26 call #t~ret0 := fact(~n - 1);< 45041#factENTRY ~n := #in~n; 45043#L25 assume ~n <= 0;#res := 1; 45042#factFINAL assume true; 45038#factEXIT >#66#return; 45039#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 45091#factFINAL assume true; 45086#factEXIT >#66#return; 45087#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 45083#factFINAL assume true; 45071#factEXIT >#74#return; 44929#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 44969#factENTRY ~n := #in~n; 45080#L25 assume !(~n <= 0); 44983#L26 call #t~ret0 := fact(~n - 1);< 45009#factENTRY ~n := #in~n; 45005#L25 assume ~n <= 0;#res := 1; 45006#factFINAL assume true; 44982#factEXIT >#66#return; 44987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44968#factFINAL assume true; 44918#factEXIT >#76#return; 44930#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 44967#factENTRY ~n := #in~n; 45034#L25 assume !(~n <= 0); 44983#L26 call #t~ret0 := fact(~n - 1);< 45009#factENTRY ~n := #in~n; 45005#L25 assume ~n <= 0;#res := 1; 45006#factFINAL assume true; 44982#factEXIT >#66#return; 44987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44968#factFINAL assume true; 44918#factEXIT >#78#return; 44956#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; 45090#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 45088#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 45085#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 44881#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 44871#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 44872#L42-3 [2022-11-25 16:58:20,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:20,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 5 times [2022-11-25 16:58:20,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:20,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524046948] [2022-11-25 16:58:20,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:20,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:20,376 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:58:20,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1510322569] [2022-11-25 16:58:20,377 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 16:58:20,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:58:20,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:20,381 INFO L229 MonitoredProcess]: Starting monitored process 156 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:58:20,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (156)] Waiting until timeout for monitored process [2022-11-25 16:58:20,470 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-11-25 16:58:20,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 16:58:20,470 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:58:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:58:20,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:58:20,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:20,507 INFO L85 PathProgramCache]: Analyzing trace with hash 590406435, now seen corresponding path program 11 times [2022-11-25 16:58:20,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:20,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319141983] [2022-11-25 16:58:20,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:20,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:20,514 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:58:20,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1791575436] [2022-11-25 16:58:20,514 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 16:58:20,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:58:20,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:20,519 INFO L229 MonitoredProcess]: Starting monitored process 157 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:58:20,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (157)] Waiting until timeout for monitored process [2022-11-25 16:58:20,645 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-11-25 16:58:20,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 16:58:20,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:58:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:58:20,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:58:20,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:20,707 INFO L85 PathProgramCache]: Analyzing trace with hash 736681859, now seen corresponding path program 6 times [2022-11-25 16:58:20,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:20,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640969667] [2022-11-25 16:58:20,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:20,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:20,716 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:58:20,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [740845720] [2022-11-25 16:58:20,716 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-25 16:58:20,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:58:20,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:20,722 INFO L229 MonitoredProcess]: Starting monitored process 158 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:58:20,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (158)] Waiting until timeout for monitored process [2022-11-25 16:58:20,861 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-11-25 16:58:20,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:58:20,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 16:58:20,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:58:21,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1355 backedges. 66 proven. 85 refuted. 0 times theorem prover too weak. 1204 trivial. 0 not checked. [2022-11-25 16:58:21,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:58:21,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1355 backedges. 51 proven. 100 refuted. 0 times theorem prover too weak. 1204 trivial. 0 not checked. [2022-11-25 16:58:21,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:21,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640969667] [2022-11-25 16:58:21,296 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:58:21,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740845720] [2022-11-25 16:58:21,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740845720] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:58:21,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:58:21,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-11-25 16:58:21,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113943933] [2022-11-25 16:58:21,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:58:25,451 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:58:25,451 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:58:25,451 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:58:25,451 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:58:25,451 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-25 16:58:25,451 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:25,452 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:58:25,452 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:58:25,452 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration23_Loop [2022-11-25 16:58:25,452 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:58:25,452 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:58:25,453 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:25,460 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:25,462 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:25,464 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:25,465 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:25,467 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:25,469 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:25,471 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:25,957 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:58:25,957 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-25 16:58:25,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:25,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:25,959 INFO L229 MonitoredProcess]: Starting monitored process 159 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:25,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2022-11-25 16:58:25,961 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:58:25,961 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:58:25,973 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-25 16:58:25,973 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: [] [2022-11-25 16:58:25,975 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Ended with exit code 0 [2022-11-25 16:58:25,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:25,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:25,976 INFO L229 MonitoredProcess]: Starting monitored process 160 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:25,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2022-11-25 16:58:25,980 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:58:25,980 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:58:25,992 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-25 16:58:25,992 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: [] [2022-11-25 16:58:25,994 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2022-11-25 16:58:25,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:25,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:25,996 INFO L229 MonitoredProcess]: Starting monitored process 161 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:25,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2022-11-25 16:58:26,001 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:58:26,001 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:58:26,012 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-25 16:58:26,012 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: [] [2022-11-25 16:58:26,015 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2022-11-25 16:58:26,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:26,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:26,016 INFO L229 MonitoredProcess]: Starting monitored process 162 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:26,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2022-11-25 16:58:26,019 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:58:26,019 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:58:26,031 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-25 16:58:26,032 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: [] [2022-11-25 16:58:26,034 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2022-11-25 16:58:26,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:26,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:26,036 INFO L229 MonitoredProcess]: Starting monitored process 163 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:26,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2022-11-25 16:58:26,038 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:58:26,038 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:58:26,050 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-25 16:58:26,050 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: [] [2022-11-25 16:58:26,053 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2022-11-25 16:58:26,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:26,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:26,054 INFO L229 MonitoredProcess]: Starting monitored process 164 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:26,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2022-11-25 16:58:26,057 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:58:26,057 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:58:26,068 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-25 16:58:26,069 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: [] [2022-11-25 16:58:26,071 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2022-11-25 16:58:26,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:26,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:26,073 INFO L229 MonitoredProcess]: Starting monitored process 165 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:26,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2022-11-25 16:58:26,075 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:58:26,075 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:58:26,087 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-25 16:58:26,088 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: [] [2022-11-25 16:58:26,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Forceful destruction successful, exit code 0 [2022-11-25 16:58:26,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:26,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:26,093 INFO L229 MonitoredProcess]: Starting monitored process 166 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:26,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2022-11-25 16:58:26,098 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:58:26,098 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:58:26,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Forceful destruction successful, exit code 0 [2022-11-25 16:58:26,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:26,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:26,119 INFO L229 MonitoredProcess]: Starting monitored process 167 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:26,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2022-11-25 16:58:26,123 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-25 16:58:26,123 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:58:26,175 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-25 16:58:26,178 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2022-11-25 16:58:26,179 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:58:26,179 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:58:26,179 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:58:26,179 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:58:26,179 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-25 16:58:26,179 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:26,179 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:58:26,179 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:58:26,179 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration23_Loop [2022-11-25 16:58:26,179 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:58:26,179 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:58:26,181 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:26,186 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:26,188 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:26,190 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:26,193 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:26,195 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:26,197 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:26,199 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:26,726 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:58:26,726 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-25 16:58:26,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:26,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:26,732 INFO L229 MonitoredProcess]: Starting monitored process 168 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:26,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2022-11-25 16:58:26,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:58:26,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:58:26,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:58:26,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:58:26,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:58:26,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:58:26,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:58:26,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:58:26,754 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:58:26,757 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2022-11-25 16:58:26,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:26,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:26,758 INFO L229 MonitoredProcess]: Starting monitored process 169 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:26,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:58:26,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2022-11-25 16:58:26,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:58:26,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:58:26,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:58:26,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:58:26,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:58:26,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:58:26,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:58:26,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:58:26,790 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Ended with exit code 0 [2022-11-25 16:58:26,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:26,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:26,792 INFO L229 MonitoredProcess]: Starting monitored process 170 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:26,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2022-11-25 16:58:26,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:58:26,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:58:26,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:58:26,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:58:26,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:58:26,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:58:26,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:58:26,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:58:26,810 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:58:26,814 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0 [2022-11-25 16:58:26,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:26,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:26,816 INFO L229 MonitoredProcess]: Starting monitored process 171 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:26,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2022-11-25 16:58:26,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:58:26,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:58:26,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:58:26,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:58:26,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:58:26,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:58:26,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:58:26,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:58:26,834 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:58:26,837 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2022-11-25 16:58:26,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:26,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:26,838 INFO L229 MonitoredProcess]: Starting monitored process 172 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:26,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2022-11-25 16:58:26,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:58:26,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:58:26,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:58:26,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:58:26,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:58:26,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:58:26,854 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:58:26,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:58:26,856 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:58:26,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0 [2022-11-25 16:58:26,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:26,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:26,860 INFO L229 MonitoredProcess]: Starting monitored process 173 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:26,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2022-11-25 16:58:26,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:58:26,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:58:26,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:58:26,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:58:26,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:58:26,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:58:26,876 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:58:26,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:58:26,878 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:58:26,885 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Ended with exit code 0 [2022-11-25 16:58:26,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:26,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:26,887 INFO L229 MonitoredProcess]: Starting monitored process 174 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:26,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2022-11-25 16:58:26,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:58:26,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:58:26,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:58:26,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:58:26,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:58:26,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:58:26,906 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:58:26,906 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:58:26,908 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:58:26,911 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Ended with exit code 0 [2022-11-25 16:58:26,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:26,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:26,913 INFO L229 MonitoredProcess]: Starting monitored process 175 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:26,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2022-11-25 16:58:26,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:58:26,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:58:26,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:58:26,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:58:26,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:58:26,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:58:26,932 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:58:26,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:58:26,939 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-25 16:58:26,944 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-25 16:58:26,944 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-25 16:58:26,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:26,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:26,947 INFO L229 MonitoredProcess]: Starting monitored process 176 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:26,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2022-11-25 16:58:26,949 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-25 16:58:26,949 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-25 16:58:26,949 INFO L513 LassoAnalysis]: Proved termination. [2022-11-25 16:58:26,949 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 [] [2022-11-25 16:58:26,952 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Ended with exit code 0 [2022-11-25 16:58:26,953 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-25 16:58:26,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:27,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 16:58:27,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:58:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:27,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-25 16:58:27,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:58:27,922 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 5 proven. 107 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2022-11-25 16:58:27,922 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2022-11-25 16:58:27,923 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1262 states and 1916 transitions. cyclomatic complexity: 676 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) [2022-11-25 16:58:28,300 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1262 states and 1916 transitions. cyclomatic complexity: 676. 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 2767 states and 4092 transitions. Complement of second has 32 states. [2022-11-25 16:58:28,301 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 [2022-11-25 16:58:28,302 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) [2022-11-25 16:58:28,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 80 transitions. [2022-11-25 16:58:28,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 80 transitions. Stem has 60 letters. Loop has 111 letters. [2022-11-25 16:58:28,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:58:28,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 80 transitions. Stem has 171 letters. Loop has 111 letters. [2022-11-25 16:58:28,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:58:28,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 80 transitions. Stem has 60 letters. Loop has 222 letters. [2022-11-25 16:58:28,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:58:28,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2767 states and 4092 transitions. [2022-11-25 16:58:28,344 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Forceful destruction successful, exit code 0 [2022-11-25 16:58:28,361 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 114 [2022-11-25 16:58:28,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2767 states to 1598 states and 2388 transitions. [2022-11-25 16:58:28,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 455 [2022-11-25 16:58:28,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 458 [2022-11-25 16:58:28,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1598 states and 2388 transitions. [2022-11-25 16:58:28,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:58:28,383 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1598 states and 2388 transitions. [2022-11-25 16:58:28,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states and 2388 transitions. [2022-11-25 16:58:28,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1527. [2022-11-25 16:58:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1527 states, 962 states have (on average 1.0893970893970895) internal successors, (1048), 972 states have internal predecessors, (1048), 391 states have call successors, (397), 162 states have call predecessors, (397), 174 states have return successors, (868), 392 states have call predecessors, (868), 391 states have call successors, (868) [2022-11-25 16:58:28,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2313 transitions. [2022-11-25 16:58:28,441 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1527 states and 2313 transitions. [2022-11-25 16:58:28,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:28,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 16:58:28,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-11-25 16:58:28,442 INFO L87 Difference]: Start difference. First operand 1527 states and 2313 transitions. Second operand has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 15 states have internal predecessors, (56), 9 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 7 states have call predecessors, (23), 9 states have call successors, (23) [2022-11-25 16:58:29,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:29,271 INFO L93 Difference]: Finished difference Result 1993 states and 3167 transitions. [2022-11-25 16:58:29,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1993 states and 3167 transitions. [2022-11-25 16:58:29,287 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 185 [2022-11-25 16:58:29,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1993 states to 1808 states and 2856 transitions. [2022-11-25 16:58:29,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 578 [2022-11-25 16:58:29,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 578 [2022-11-25 16:58:29,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1808 states and 2856 transitions. [2022-11-25 16:58:29,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:58:29,313 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1808 states and 2856 transitions. [2022-11-25 16:58:29,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states and 2856 transitions. [2022-11-25 16:58:29,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1599. [2022-11-25 16:58:29,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1003 states have (on average 1.0887337986041874) internal successors, (1092), 1014 states have internal predecessors, (1092), 422 states have call successors, (428), 162 states have call predecessors, (428), 174 states have return successors, (935), 422 states have call predecessors, (935), 422 states have call successors, (935) [2022-11-25 16:58:29,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2455 transitions. [2022-11-25 16:58:29,378 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1599 states and 2455 transitions. [2022-11-25 16:58:29,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 16:58:29,379 INFO L428 stractBuchiCegarLoop]: Abstraction has 1599 states and 2455 transitions. [2022-11-25 16:58:29,379 INFO L335 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2022-11-25 16:58:29,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1599 states and 2455 transitions. [2022-11-25 16:58:29,388 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 141 [2022-11-25 16:58:29,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:58:29,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:58:29,389 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 12, 8, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:29,389 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:29,390 INFO L748 eck$LassoCheckResult]: Stem: 54057#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 54030#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; 54031#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 54056#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; 54081#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 54248#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 55176#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 54022#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 54023#factENTRY ~n := #in~n; 55291#L25 assume ~n <= 0;#res := 1; 55289#factFINAL assume true; 55287#factEXIT >#68#return; 55280#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 55281#factENTRY ~n := #in~n; 55286#L25 assume ~n <= 0;#res := 1; 55285#factFINAL assume true; 55279#factEXIT >#70#return; 55275#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 55276#factENTRY ~n := #in~n; 55284#L25 assume ~n <= 0;#res := 1; 55278#factFINAL assume true; 55274#factEXIT >#72#return; 55272#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 55268#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 55265#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 55261#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 55254#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 55245#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 55249#factENTRY ~n := #in~n; 55264#L25 assume !(~n <= 0); 55258#L26 call #t~ret0 := fact(~n - 1);< 55260#factENTRY ~n := #in~n; 55267#L25 assume ~n <= 0;#res := 1; 55263#factFINAL assume true; 55259#factEXIT >#66#return; 55253#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55250#factFINAL assume true; 55244#factEXIT >#74#return; 55248#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 55251#factENTRY ~n := #in~n; 55257#L25 assume ~n <= 0;#res := 1; 55256#factFINAL assume true; 55252#factEXIT >#76#return; 55246#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 55249#factENTRY ~n := #in~n; 55264#L25 assume !(~n <= 0); 55258#L26 call #t~ret0 := fact(~n - 1);< 55260#factENTRY ~n := #in~n; 55267#L25 assume ~n <= 0;#res := 1; 55263#factFINAL assume true; 55259#factEXIT >#66#return; 55253#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55250#factFINAL assume true; 55244#factEXIT >#78#return; 55242#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; 55240#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 55231#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 54288#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 54287#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 54285#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 54284#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 54283#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 54091#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 54137#factENTRY ~n := #in~n; 54168#L25 assume !(~n <= 0); 54155#L26 call #t~ret0 := fact(~n - 1);< 54158#factENTRY ~n := #in~n; 54209#L25 assume !(~n <= 0); 54173#L26 call #t~ret0 := fact(~n - 1);< 54232#factENTRY ~n := #in~n; 54234#L25 assume ~n <= 0;#res := 1; 54233#factFINAL assume true; 54231#factEXIT >#66#return; 54224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54225#factFINAL assume true; 54169#factEXIT >#66#return; 54165#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54166#factFINAL assume true; 54140#factEXIT >#68#return; 54142#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 54278#factENTRY ~n := #in~n; 54280#L25 assume ~n <= 0;#res := 1; 54279#factFINAL assume true; 54277#factEXIT >#70#return; 54130#L30-2 [2022-11-25 16:58:29,390 INFO L750 eck$LassoCheckResult]: Loop: 54130#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 54139#factENTRY ~n := #in~n; 54230#L25 assume !(~n <= 0); 54170#L26 call #t~ret0 := fact(~n - 1);< 54178#factENTRY ~n := #in~n; 54209#L25 assume !(~n <= 0); 54173#L26 call #t~ret0 := fact(~n - 1);< 54232#factENTRY ~n := #in~n; 54209#L25 assume !(~n <= 0); 54173#L26 call #t~ret0 := fact(~n - 1);< 54232#factENTRY ~n := #in~n; 54234#L25 assume ~n <= 0;#res := 1; 54233#factFINAL assume true; 54231#factEXIT >#66#return; 54224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54225#factFINAL assume true; 54169#factEXIT >#66#return; 54177#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54179#factFINAL assume true; 54183#factEXIT >#66#return; 54250#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54127#factFINAL assume true; 54136#factEXIT >#72#return; 54047#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 54048#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 54051#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 54079#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 54058#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 54059#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 54126#factENTRY ~n := #in~n; 54163#L25 assume !(~n <= 0); 54155#L26 call #t~ret0 := fact(~n - 1);< 54158#factENTRY ~n := #in~n; 54209#L25 assume !(~n <= 0); 54173#L26 call #t~ret0 := fact(~n - 1);< 54232#factENTRY ~n := #in~n; 54234#L25 assume ~n <= 0;#res := 1; 54233#factFINAL assume true; 54231#factEXIT >#66#return; 54224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54225#factFINAL assume true; 54169#factEXIT >#66#return; 54165#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54166#factFINAL assume true; 54140#factEXIT >#68#return; 54098#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 54137#factENTRY ~n := #in~n; 54168#L25 assume ~n <= 0;#res := 1; 54309#factFINAL assume true; 54306#factEXIT >#70#return; 54130#L30-2 [2022-11-25 16:58:29,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:29,390 INFO L85 PathProgramCache]: Analyzing trace with hash 31041928, now seen corresponding path program 7 times [2022-11-25 16:58:29,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:29,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823855886] [2022-11-25 16:58:29,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:29,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:29,398 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:58:29,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [567270604] [2022-11-25 16:58:29,399 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 16:58:29,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:58:29,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:29,401 INFO L229 MonitoredProcess]: Starting monitored process 177 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:58:29,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (177)] Waiting until timeout for monitored process [2022-11-25 16:58:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:29,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 16:58:29,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:58:29,618 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 108 proven. 10 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-11-25 16:58:29,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:58:29,903 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 64 proven. 17 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2022-11-25 16:58:29,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:29,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823855886] [2022-11-25 16:58:29,903 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:58:29,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567270604] [2022-11-25 16:58:29,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567270604] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:58:29,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:58:29,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2022-11-25 16:58:29,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579341056] [2022-11-25 16:58:29,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:58:29,905 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 16:58:29,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:29,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1560947734, now seen corresponding path program 1 times [2022-11-25 16:58:29,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:29,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28931803] [2022-11-25 16:58:29,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:29,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:29,910 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:58:29,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [622754387] [2022-11-25 16:58:29,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:29,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:58:29,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:29,924 INFO L229 MonitoredProcess]: Starting monitored process 178 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:58:29,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (178)] Waiting until timeout for monitored process [2022-11-25 16:58:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:58:30,016 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:58:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:58:30,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:58:31,044 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:58:31,044 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:58:31,044 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:58:31,044 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:58:31,044 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-25 16:58:31,044 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:31,044 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:58:31,044 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:58:31,044 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration24_Loop [2022-11-25 16:58:31,045 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:58:31,045 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:58:31,045 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:31,048 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:31,052 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:31,054 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:31,086 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:31,088 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:31,212 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:58:31,212 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-25 16:58:31,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:31,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:31,216 INFO L229 MonitoredProcess]: Starting monitored process 179 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:31,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2022-11-25 16:58:31,220 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:58:31,220 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:58:31,233 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-25 16:58:31,233 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: [] [2022-11-25 16:58:31,236 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Ended with exit code 0 [2022-11-25 16:58:31,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:31,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:31,238 INFO L229 MonitoredProcess]: Starting monitored process 180 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:31,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2022-11-25 16:58:31,241 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:58:31,241 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:58:31,255 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-25 16:58:31,255 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: [] [2022-11-25 16:58:31,258 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Ended with exit code 0 [2022-11-25 16:58:31,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:31,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:31,260 INFO L229 MonitoredProcess]: Starting monitored process 181 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:31,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2022-11-25 16:58:31,263 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:58:31,263 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:58:31,276 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-25 16:58:31,276 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: [] [2022-11-25 16:58:31,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Forceful destruction successful, exit code 0 [2022-11-25 16:58:31,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:31,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:31,282 INFO L229 MonitoredProcess]: Starting monitored process 182 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:31,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2022-11-25 16:58:31,284 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:58:31,285 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:58:31,304 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0 [2022-11-25 16:58:31,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:31,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:31,306 INFO L229 MonitoredProcess]: Starting monitored process 183 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:31,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2022-11-25 16:58:31,309 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-25 16:58:31,309 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:58:31,336 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-25 16:58:31,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Forceful destruction successful, exit code 0 [2022-11-25 16:58:31,340 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:58:31,340 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:58:31,340 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:58:31,340 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:58:31,340 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-25 16:58:31,340 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:31,340 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:58:31,340 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:58:31,340 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration24_Loop [2022-11-25 16:58:31,340 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:58:31,340 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:58:31,342 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:31,355 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:31,357 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:31,359 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:31,389 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:31,391 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:31,512 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:58:31,513 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-25 16:58:31,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:31,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:31,514 INFO L229 MonitoredProcess]: Starting monitored process 184 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:31,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2022-11-25 16:58:31,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:58:31,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:58:31,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:58:31,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:58:31,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:58:31,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:58:31,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:58:31,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:58:31,531 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:58:31,534 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Ended with exit code 0 [2022-11-25 16:58:31,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:31,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:31,535 INFO L229 MonitoredProcess]: Starting monitored process 185 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:31,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2022-11-25 16:58:31,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:58:31,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:58:31,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:58:31,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:58:31,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:58:31,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:58:31,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:58:31,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:58:31,552 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:58:31,559 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Ended with exit code 0 [2022-11-25 16:58:31,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:31,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:31,561 INFO L229 MonitoredProcess]: Starting monitored process 186 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:31,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2022-11-25 16:58:31,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 [2022-11-25 16:58:31,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:58:31,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:58:31,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:58:31,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:58:31,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:58:31,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:58:31,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:58:31,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:58:31,582 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Ended with exit code 0 [2022-11-25 16:58:31,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:31,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:31,584 INFO L229 MonitoredProcess]: Starting monitored process 187 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:31,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2022-11-25 16:58:31,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:58:31,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:58:31,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:58:31,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:58:31,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:58:31,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:58:31,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:58:31,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:58:31,607 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-25 16:58:31,615 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-11-25 16:58:31,615 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-11-25 16:58:31,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:31,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:31,617 INFO L229 MonitoredProcess]: Starting monitored process 188 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:31,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2022-11-25 16:58:31,620 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-25 16:58:31,620 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-25 16:58:31,620 INFO L513 LassoAnalysis]: Proved termination. [2022-11-25 16:58:31,620 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 [] [2022-11-25 16:58:31,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Forceful destruction successful, exit code 0 [2022-11-25 16:58:31,624 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-25 16:58:31,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:31,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-25 16:58:31,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:58:32,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Forceful destruction successful, exit code 0 [2022-11-25 16:58:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:32,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-25 16:58:32,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:58:32,546 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-11-25 16:58:32,546 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2022-11-25 16:58:32,547 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1599 states and 2455 transitions. cyclomatic complexity: 885 Second operand has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-11-25 16:58:32,738 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1599 states and 2455 transitions. cyclomatic complexity: 885. Second operand has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Result 2283 states and 3422 transitions. Complement of second has 26 states. [2022-11-25 16:58:32,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2022-11-25 16:58:32,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-11-25 16:58:32,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-11-25 16:58:32,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 84 letters. Loop has 50 letters. [2022-11-25 16:58:32,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:58:32,742 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-25 16:58:32,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:32,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-25 16:58:32,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:58:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:33,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-25 16:58:33,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:58:33,605 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-11-25 16:58:33,606 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2022-11-25 16:58:33,606 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1599 states and 2455 transitions. cyclomatic complexity: 885 Second operand has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-11-25 16:58:33,789 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1599 states and 2455 transitions. cyclomatic complexity: 885. Second operand has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Result 2283 states and 3422 transitions. Complement of second has 26 states. [2022-11-25 16:58:33,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2022-11-25 16:58:33,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-11-25 16:58:33,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-11-25 16:58:33,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 84 letters. Loop has 50 letters. [2022-11-25 16:58:33,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:58:33,791 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-25 16:58:33,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:33,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-25 16:58:33,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:58:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:34,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-25 16:58:34,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:58:34,605 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-11-25 16:58:34,605 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2022-11-25 16:58:34,605 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1599 states and 2455 transitions. cyclomatic complexity: 885 Second operand has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-11-25 16:58:34,869 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1599 states and 2455 transitions. cyclomatic complexity: 885. Second operand has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Result 3766 states and 5447 transitions. Complement of second has 50 states. [2022-11-25 16:58:34,870 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 [2022-11-25 16:58:34,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-11-25 16:58:34,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2022-11-25 16:58:34,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 76 transitions. Stem has 84 letters. Loop has 50 letters. [2022-11-25 16:58:34,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:58:34,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 76 transitions. Stem has 134 letters. Loop has 50 letters. [2022-11-25 16:58:34,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:58:34,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 76 transitions. Stem has 84 letters. Loop has 100 letters. [2022-11-25 16:58:34,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:58:34,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3766 states and 5447 transitions. [2022-11-25 16:58:34,901 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 162 [2022-11-25 16:58:34,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3766 states to 2174 states and 3157 transitions. [2022-11-25 16:58:34,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 574 [2022-11-25 16:58:34,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 583 [2022-11-25 16:58:34,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2174 states and 3157 transitions. [2022-11-25 16:58:34,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:58:34,925 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2174 states and 3157 transitions. [2022-11-25 16:58:34,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2174 states and 3157 transitions. [2022-11-25 16:58:34,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2174 to 2053. [2022-11-25 16:58:34,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 1306 states have (on average 1.0826952526799387) internal successors, (1414), 1330 states have internal predecessors, (1414), 484 states have call successors, (506), 214 states have call predecessors, (506), 263 states have return successors, (1030), 508 states have call predecessors, (1030), 484 states have call successors, (1030) [2022-11-25 16:58:34,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 2950 transitions. [2022-11-25 16:58:34,989 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2053 states and 2950 transitions. [2022-11-25 16:58:34,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:34,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 16:58:34,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-25 16:58:34,990 INFO L87 Difference]: Start difference. First operand 2053 states and 2950 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 10 states have internal predecessors, (37), 7 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2022-11-25 16:58:35,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:35,394 INFO L93 Difference]: Finished difference Result 2361 states and 3470 transitions. [2022-11-25 16:58:35,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2361 states and 3470 transitions. [2022-11-25 16:58:35,409 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 166 [2022-11-25 16:58:35,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2361 states to 2361 states and 3470 transitions. [2022-11-25 16:58:35,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 658 [2022-11-25 16:58:35,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 658 [2022-11-25 16:58:35,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2361 states and 3470 transitions. [2022-11-25 16:58:35,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:58:35,439 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2361 states and 3470 transitions. [2022-11-25 16:58:35,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states and 3470 transitions. [2022-11-25 16:58:35,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 2069. [2022-11-25 16:58:35,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2069 states, 1318 states have (on average 1.0842185128983308) internal successors, (1429), 1346 states have internal predecessors, (1429), 488 states have call successors, (510), 214 states have call predecessors, (510), 263 states have return successors, (1036), 508 states have call predecessors, (1036), 488 states have call successors, (1036) [2022-11-25 16:58:35,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 2975 transitions. [2022-11-25 16:58:35,511 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2069 states and 2975 transitions. [2022-11-25 16:58:35,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 16:58:35,512 INFO L428 stractBuchiCegarLoop]: Abstraction has 2069 states and 2975 transitions. [2022-11-25 16:58:35,513 INFO L335 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2022-11-25 16:58:35,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2069 states and 2975 transitions. [2022-11-25 16:58:35,521 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 144 [2022-11-25 16:58:35,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:58:35,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:58:35,523 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:35,523 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 11, 8, 8, 8, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:35,523 INFO L748 eck$LassoCheckResult]: Stem: 70286#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 70254#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; 70255#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 70285#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; 70269#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 70270#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 70522#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 70245#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 70246#factENTRY ~n := #in~n; 70942#L25 assume ~n <= 0;#res := 1; 70941#factFINAL assume true; 70940#factEXIT >#68#return; 70299#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 70300#factENTRY ~n := #in~n; 70913#L25 assume ~n <= 0;#res := 1; 70912#factFINAL assume true; 70909#factEXIT >#70#return; 70222#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 70223#factENTRY ~n := #in~n; 70935#L25 assume ~n <= 0;#res := 1; 70934#factFINAL assume true; 70933#factEXIT >#72#return; 70932#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 70274#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 70275#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 70307#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 70893#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 70894#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 70309#factENTRY ~n := #in~n; 70918#L25 assume !(~n <= 0); 70915#L26 call #t~ret0 := fact(~n - 1);< 70916#factENTRY ~n := #in~n; 70924#L25 assume ~n <= 0;#res := 1; 70921#factFINAL assume true; 70914#factEXIT >#66#return; 70906#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70904#factFINAL assume true; 70901#factEXIT >#74#return; 70902#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 70905#factENTRY ~n := #in~n; 71086#L25 assume ~n <= 0;#res := 1; 71085#factFINAL assume true; 71062#factEXIT >#76#return; 70308#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 70309#factENTRY ~n := #in~n; 70918#L25 assume !(~n <= 0); 70915#L26 call #t~ret0 := fact(~n - 1);< 70916#factENTRY ~n := #in~n; 70924#L25 assume ~n <= 0;#res := 1; 70921#factFINAL assume true; 70914#factEXIT >#66#return; 70906#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70904#factFINAL assume true; 70901#factEXIT >#78#return; 70256#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; 70257#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 71149#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 71148#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 71146#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 71108#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 71113#factENTRY ~n := #in~n; 71194#L25 assume !(~n <= 0); 71145#L26 call #t~ret0 := fact(~n - 1);< 71185#factENTRY ~n := #in~n; 71198#L25 assume !(~n <= 0); 71158#L26 call #t~ret0 := fact(~n - 1);< 71200#factENTRY ~n := #in~n; 71215#L25 assume ~n <= 0;#res := 1; 71213#factFINAL assume true; 71199#factEXIT >#66#return; 71196#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71190#factFINAL assume true; 71182#factEXIT >#66#return; 71179#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71126#factFINAL assume true; 71107#factEXIT >#74#return; 70227#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 71105#factENTRY ~n := #in~n; 70292#L25 assume ~n <= 0;#res := 1; 70293#factFINAL assume true; 71103#factEXIT >#76#return; 71008#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 71082#factENTRY ~n := #in~n; 71064#L25 assume !(~n <= 0); 70988#L26 call #t~ret0 := fact(~n - 1);< 71009#factENTRY ~n := #in~n; 71017#L25 assume !(~n <= 0); 70989#L26 call #t~ret0 := fact(~n - 1);< 71014#factENTRY ~n := #in~n; 71016#L25 assume ~n <= 0;#res := 1; 71015#factFINAL assume true; 71013#factEXIT >#66#return; 71011#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71007#factFINAL assume true; 71004#factEXIT >#66#return; 70993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71115#factFINAL assume true; 71097#factEXIT >#78#return; 70899#L30-8 [2022-11-25 16:58:35,523 INFO L750 eck$LassoCheckResult]: Loop: 70899#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; 70911#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 70910#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 70908#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 70907#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 70218#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 70219#factENTRY ~n := #in~n; 71012#L25 assume !(~n <= 0); 70990#L26 call #t~ret0 := fact(~n - 1);< 71010#factENTRY ~n := #in~n; 71017#L25 assume !(~n <= 0); 70989#L26 call #t~ret0 := fact(~n - 1);< 71014#factENTRY ~n := #in~n; 71017#L25 assume !(~n <= 0); 70989#L26 call #t~ret0 := fact(~n - 1);< 71014#factENTRY ~n := #in~n; 71017#L25 assume !(~n <= 0); 70989#L26 call #t~ret0 := fact(~n - 1);< 71014#factENTRY ~n := #in~n; 71016#L25 assume ~n <= 0;#res := 1; 71015#factFINAL assume true; 71013#factEXIT >#66#return; 71011#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71007#factFINAL assume true; 71004#factEXIT >#66#return; 71003#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71002#factFINAL assume true; 71000#factEXIT >#66#return; 70995#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70998#factFINAL assume true; 70984#factEXIT >#66#return; 70983#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70981#factFINAL assume true; 70978#factEXIT >#74#return; 70303#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 70304#factENTRY ~n := #in~n; 71023#L25 assume ~n <= 0;#res := 1; 71026#factFINAL assume true; 71021#factEXIT >#76#return; 70979#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 71020#factENTRY ~n := #in~n; 71019#L25 assume !(~n <= 0); 70986#L26 call #t~ret0 := fact(~n - 1);< 70262#factENTRY ~n := #in~n; 71018#L25 assume !(~n <= 0); 70987#L26 call #t~ret0 := fact(~n - 1);< 70999#factENTRY ~n := #in~n; 71017#L25 assume !(~n <= 0); 70989#L26 call #t~ret0 := fact(~n - 1);< 71014#factENTRY ~n := #in~n; 71017#L25 assume !(~n <= 0); 70989#L26 call #t~ret0 := fact(~n - 1);< 71014#factENTRY ~n := #in~n; 71016#L25 assume ~n <= 0;#res := 1; 71015#factFINAL assume true; 71013#factEXIT >#66#return; 71011#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71007#factFINAL assume true; 71004#factEXIT >#66#return; 71003#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71002#factFINAL assume true; 71000#factEXIT >#66#return; 70995#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70998#factFINAL assume true; 70984#factEXIT >#66#return; 70983#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70981#factFINAL assume true; 70978#factEXIT >#78#return; 70899#L30-8 [2022-11-25 16:58:35,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:35,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1326926298, now seen corresponding path program 3 times [2022-11-25 16:58:35,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:35,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873632515] [2022-11-25 16:58:35,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:35,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:35,531 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:58:35,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [420118319] [2022-11-25 16:58:35,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 16:58:35,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:58:35,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:35,534 INFO L229 MonitoredProcess]: Starting monitored process 189 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:58:35,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (189)] Waiting until timeout for monitored process [2022-11-25 16:58:35,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-11-25 16:58:35,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 16:58:35,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:58:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:58:35,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:58:35,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:35,706 INFO L85 PathProgramCache]: Analyzing trace with hash 857296756, now seen corresponding path program 4 times [2022-11-25 16:58:35,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:35,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946831907] [2022-11-25 16:58:35,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:35,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:35,711 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:58:35,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1218659676] [2022-11-25 16:58:35,711 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 16:58:35,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:58:35,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:35,713 INFO L229 MonitoredProcess]: Starting monitored process 190 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:58:35,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (190)] Waiting until timeout for monitored process [2022-11-25 16:58:35,808 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 16:58:35,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 16:58:35,808 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:58:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:58:35,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:58:35,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:35,847 INFO L85 PathProgramCache]: Analyzing trace with hash -858733799, now seen corresponding path program 4 times [2022-11-25 16:58:35,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:35,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80969644] [2022-11-25 16:58:35,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:35,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:35,857 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:58:35,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [634483631] [2022-11-25 16:58:35,858 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 16:58:35,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:58:35,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:35,867 INFO L229 MonitoredProcess]: Starting monitored process 191 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:58:35,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (191)] Waiting until timeout for monitored process [2022-11-25 16:58:36,005 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 16:58:36,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:58:36,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 16:58:36,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:58:36,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1508 backedges. 818 proven. 29 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2022-11-25 16:58:36,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:58:36,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1508 backedges. 258 proven. 142 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2022-11-25 16:58:36,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:36,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80969644] [2022-11-25 16:58:36,966 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:58:36,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634483631] [2022-11-25 16:58:36,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634483631] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:58:36,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:58:36,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 16 [2022-11-25 16:58:36,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365481395] [2022-11-25 16:58:36,966 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:58:38,269 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:58:38,269 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:58:38,269 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:58:38,269 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:58:38,269 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-25 16:58:38,269 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:38,269 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:58:38,269 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:58:38,269 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration25_Loop [2022-11-25 16:58:38,269 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:58:38,269 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:58:38,271 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:38,305 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:38,307 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:38,309 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:38,311 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:38,472 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:58:38,472 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-25 16:58:38,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:38,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:38,478 INFO L229 MonitoredProcess]: Starting monitored process 192 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:38,487 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:58:38,487 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:58:38,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2022-11-25 16:58:38,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Forceful destruction successful, exit code 0 [2022-11-25 16:58:38,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:38,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:38,517 INFO L229 MonitoredProcess]: Starting monitored process 193 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:38,520 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-25 16:58:38,521 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:58:38,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2022-11-25 16:58:38,559 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-25 16:58:38,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Forceful destruction successful, exit code 0 [2022-11-25 16:58:38,562 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:58:38,563 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:58:38,563 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:58:38,563 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:58:38,563 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-25 16:58:38,563 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:38,563 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:58:38,563 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:58:38,563 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration25_Loop [2022-11-25 16:58:38,563 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:58:38,563 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:58:38,565 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:38,567 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:38,569 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:38,603 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:38,605 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:38,752 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:58:38,752 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-25 16:58:38,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:38,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:38,754 INFO L229 MonitoredProcess]: Starting monitored process 194 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:38,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:58:38,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:58:38,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:58:38,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:58:38,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:58:38,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:58:38,771 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:58:38,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:58:38,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2022-11-25 16:58:38,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:58:38,790 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Forceful destruction successful, exit code 0 [2022-11-25 16:58:38,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:38,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:38,792 INFO L229 MonitoredProcess]: Starting monitored process 195 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:38,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:58:38,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2022-11-25 16:58:38,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:58:38,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:58:38,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:58:38,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:58:38,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:58:38,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:58:38,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:58:38,809 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:58:38,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Forceful destruction successful, exit code 0 [2022-11-25 16:58:38,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:38,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:38,813 INFO L229 MonitoredProcess]: Starting monitored process 196 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:38,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2022-11-25 16:58:38,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:58:38,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:58:38,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:58:38,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:58:38,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:58:38,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:58:38,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:58:38,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:58:38,834 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-25 16:58:38,838 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-25 16:58:38,838 INFO L444 ModelExtractionUtils]: 8 out of 11 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-25 16:58:38,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:38,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:38,839 INFO L229 MonitoredProcess]: Starting monitored process 197 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:38,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2022-11-25 16:58:38,842 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-25 16:58:38,842 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-25 16:58:38,842 INFO L513 LassoAnalysis]: Proved termination. [2022-11-25 16:58:38,842 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1, ULTIMATE.start_main_~x~0#1) = -1*ULTIMATE.start_main_~k~0#1 + 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2022-11-25 16:58:38,845 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Forceful destruction successful, exit code 0 [2022-11-25 16:58:38,846 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-25 16:58:38,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:38,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-25 16:58:38,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:58:39,231 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Ended with exit code 0 [2022-11-25 16:58:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:39,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-25 16:58:39,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:58:39,755 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2022-11-25 16:58:39,756 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2022-11-25 16:58:39,757 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2069 states and 2975 transitions. cyclomatic complexity: 942 Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 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) [2022-11-25 16:58:39,879 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2069 states and 2975 transitions. cyclomatic complexity: 942. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 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 2661 states and 3837 transitions. Complement of second has 13 states. [2022-11-25 16:58:39,880 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 [2022-11-25 16:58:39,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 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) [2022-11-25 16:58:39,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-11-25 16:58:39,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 98 letters. Loop has 68 letters. [2022-11-25 16:58:39,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:58:39,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 166 letters. Loop has 68 letters. [2022-11-25 16:58:39,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:58:39,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 98 letters. Loop has 136 letters. [2022-11-25 16:58:39,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 16:58:39,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2661 states and 3837 transitions. [2022-11-25 16:58:39,900 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 135 [2022-11-25 16:58:39,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2661 states to 1853 states and 2667 transitions. [2022-11-25 16:58:39,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 422 [2022-11-25 16:58:39,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 422 [2022-11-25 16:58:39,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1853 states and 2667 transitions. [2022-11-25 16:58:39,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:58:39,929 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1853 states and 2667 transitions. [2022-11-25 16:58:39,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states and 2667 transitions. [2022-11-25 16:58:39,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1852. [2022-11-25 16:58:39,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1852 states, 1179 states have (on average 1.0865139949109415) internal successors, (1281), 1204 states have internal predecessors, (1281), 447 states have call successors, (466), 186 states have call predecessors, (466), 226 states have return successors, (918), 461 states have call predecessors, (918), 447 states have call successors, (918) [2022-11-25 16:58:39,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 2665 transitions. [2022-11-25 16:58:39,978 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1852 states and 2665 transitions. [2022-11-25 16:58:39,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:39,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 16:58:39,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-11-25 16:58:39,979 INFO L87 Difference]: Start difference. First operand 1852 states and 2665 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 11 states have call successors, (21), 2 states have call predecessors, (21), 6 states have return successors, (23), 9 states have call predecessors, (23), 11 states have call successors, (23) [2022-11-25 16:58:40,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:40,670 INFO L93 Difference]: Finished difference Result 2994 states and 5203 transitions. [2022-11-25 16:58:40,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2994 states and 5203 transitions. [2022-11-25 16:58:40,688 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 259 [2022-11-25 16:58:40,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2994 states to 2985 states and 5180 transitions. [2022-11-25 16:58:40,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 683 [2022-11-25 16:58:40,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 683 [2022-11-25 16:58:40,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2985 states and 5180 transitions. [2022-11-25 16:58:40,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 16:58:40,724 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2985 states and 5180 transitions. [2022-11-25 16:58:40,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states and 5180 transitions. [2022-11-25 16:58:40,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2103. [2022-11-25 16:58:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2103 states, 1341 states have (on average 1.0917225950782998) internal successors, (1464), 1369 states have internal predecessors, (1464), 525 states have call successors, (551), 186 states have call predecessors, (551), 237 states have return successors, (1205), 547 states have call predecessors, (1205), 525 states have call successors, (1205) [2022-11-25 16:58:40,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 2103 states and 3220 transitions. [2022-11-25 16:58:40,819 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2103 states and 3220 transitions. [2022-11-25 16:58:40,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 16:58:40,820 INFO L428 stractBuchiCegarLoop]: Abstraction has 2103 states and 3220 transitions. [2022-11-25 16:58:40,820 INFO L335 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2022-11-25 16:58:40,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2103 states and 3220 transitions. [2022-11-25 16:58:40,827 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 177 [2022-11-25 16:58:40,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:58:40,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:58:40,830 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [29, 29, 17, 12, 12, 12, 12, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-11-25 16:58:40,830 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 9, 6, 6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:40,831 INFO L748 eck$LassoCheckResult]: Stem: 81414#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 81384#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; 81385#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 81413#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; 81439#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 81728#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 81726#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 81722#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 81723#factENTRY ~n := #in~n; 81727#L25 assume ~n <= 0;#res := 1; 81725#factFINAL assume true; 81721#factEXIT >#68#return; 81716#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 81717#factENTRY ~n := #in~n; 81724#L25 assume ~n <= 0;#res := 1; 81720#factFINAL assume true; 81715#factEXIT >#70#return; 81711#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 81712#factENTRY ~n := #in~n; 81719#L25 assume ~n <= 0;#res := 1; 81714#factFINAL assume true; 81710#factEXIT >#72#return; 81707#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 81705#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 81702#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 81693#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 81687#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 81680#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 81682#factENTRY ~n := #in~n; 81698#L25 assume !(~n <= 0); 81691#L26 call #t~ret0 := fact(~n - 1);< 81692#factENTRY ~n := #in~n; 81701#L25 assume ~n <= 0;#res := 1; 81697#factFINAL assume true; 81690#factEXIT >#66#return; 81686#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81683#factFINAL assume true; 81677#factEXIT >#74#return; 81678#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 81684#factENTRY ~n := #in~n; 81696#L25 assume ~n <= 0;#res := 1; 81689#factFINAL assume true; 81685#factEXIT >#76#return; 81681#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 81682#factENTRY ~n := #in~n; 81698#L25 assume !(~n <= 0); 81691#L26 call #t~ret0 := fact(~n - 1);< 81692#factENTRY ~n := #in~n; 81701#L25 assume ~n <= 0;#res := 1; 81697#factFINAL assume true; 81690#factEXIT >#66#return; 81686#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81683#factFINAL assume true; 81677#factEXIT >#78#return; 81675#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; 81674#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 81672#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 81668#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 81665#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 81662#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 81597#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 82098#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 82026#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 82030#factENTRY ~n := #in~n; 82033#L25 assume ~n <= 0;#res := 1; 82031#factFINAL assume true; 82025#factEXIT >#68#return; 82020#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 82022#factENTRY ~n := #in~n; 82024#L25 assume ~n <= 0;#res := 1; 82023#factFINAL assume true; 82018#factEXIT >#70#return; 82012#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 82017#factENTRY ~n := #in~n; 82593#L25 assume ~n <= 0;#res := 1; 82621#factFINAL assume true; 82011#factEXIT >#72#return; 82010#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 82009#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 82008#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 82007#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 82006#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 81906#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 81949#factENTRY ~n := #in~n; 82002#L25 assume !(~n <= 0); 81965#L26 call #t~ret0 := fact(~n - 1);< 81998#factENTRY ~n := #in~n; 82003#L25 assume ~n <= 0;#res := 1; 81999#factFINAL assume true; 81989#factEXIT >#66#return; 81988#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81987#factFINAL assume true; 81983#factEXIT >#74#return; 81941#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 81981#factENTRY ~n := #in~n; 81982#L25 assume ~n <= 0;#res := 1; 82047#factFINAL assume true; 82046#factEXIT >#76#return; 81903#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 81949#factENTRY ~n := #in~n; 82002#L25 assume !(~n <= 0); 81965#L26 call #t~ret0 := fact(~n - 1);< 81998#factENTRY ~n := #in~n; 82003#L25 assume ~n <= 0;#res := 1; 81999#factFINAL assume true; 81989#factEXIT >#66#return; 81988#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81987#factFINAL assume true; 81983#factEXIT >#78#return; 81984#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; 82270#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 82269#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 82268#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 81894#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 81596#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 81595#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 81593#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 81394#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 81507#factENTRY ~n := #in~n; 81504#L25 assume !(~n <= 0); 81390#L26 call #t~ret0 := fact(~n - 1);< 81396#factENTRY ~n := #in~n; 81667#L25 assume !(~n <= 0); 81606#L26 call #t~ret0 := fact(~n - 1);< 81664#factENTRY ~n := #in~n; 81670#L25 assume ~n <= 0;#res := 1; 81673#factFINAL assume true; 81669#factEXIT >#66#return; 81666#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81663#factFINAL assume true; 81661#factEXIT >#66#return; 81659#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81658#factFINAL assume true; 81656#factEXIT >#68#return; 81587#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 81589#factENTRY ~n := #in~n; 81591#L25 assume ~n <= 0;#res := 1; 81590#factFINAL assume true; 81583#factEXIT >#70#return; 81575#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 81609#factENTRY ~n := #in~n; 81610#L25 assume !(~n <= 0); 81482#L26 call #t~ret0 := fact(~n - 1);< 81493#factENTRY ~n := #in~n; 81502#L25 assume !(~n <= 0); 81472#L26 call #t~ret0 := fact(~n - 1);< 81652#factENTRY ~n := #in~n; 81502#L25 assume !(~n <= 0); 81472#L26 call #t~ret0 := fact(~n - 1);< 81652#factENTRY ~n := #in~n; 81654#L25 assume ~n <= 0;#res := 1; 81653#factFINAL assume true; 81650#factEXIT >#66#return; 81651#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81735#factFINAL assume true; 81731#factEXIT >#66#return; 81733#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 83368#factFINAL assume true; 81466#factEXIT >#66#return; 81488#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81599#factFINAL assume true; 81603#factEXIT >#72#return; 81405#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 81406#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 81409#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 81422#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 81415#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 81416#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 81367#factENTRY ~n := #in~n; 81567#L25 assume !(~n <= 0); 81481#L26 call #t~ret0 := fact(~n - 1);< 81518#factENTRY ~n := #in~n; 81502#L25 assume !(~n <= 0); 81472#L26 call #t~ret0 := fact(~n - 1);< 81652#factENTRY ~n := #in~n; 81654#L25 assume ~n <= 0;#res := 1; 81653#factFINAL assume true; 81650#factEXIT >#66#return; 81651#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81735#factFINAL assume true; 81731#factEXIT >#66#return; 81491#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82665#factFINAL assume true; 82664#factEXIT >#68#return; 81556#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 81367#factENTRY ~n := #in~n; 81567#L25 assume !(~n <= 0); 81481#L26 call #t~ret0 := fact(~n - 1);< 81518#factENTRY ~n := #in~n; 81522#L25 assume ~n <= 0;#res := 1; 81519#factFINAL assume true; 81509#factEXIT >#66#return; 81517#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81563#factFINAL assume true; 81546#factEXIT >#70#return; 81353#L30-2 [2022-11-25 16:58:40,831 INFO L750 eck$LassoCheckResult]: Loop: 81353#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 81363#factENTRY ~n := #in~n; 81880#L25 assume !(~n <= 0); 81479#L26 call #t~ret0 := fact(~n - 1);< 81518#factENTRY ~n := #in~n; 81502#L25 assume !(~n <= 0); 81472#L26 call #t~ret0 := fact(~n - 1);< 81652#factENTRY ~n := #in~n; 81654#L25 assume ~n <= 0;#res := 1; 81653#factFINAL assume true; 81650#factEXIT >#66#return; 81651#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81735#factFINAL assume true; 81731#factEXIT >#66#return; 81420#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81370#factFINAL assume true; 81351#factEXIT >#72#return; 81357#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 82688#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 82687#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 82686#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 82685#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 81554#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 81367#factENTRY ~n := #in~n; 81567#L25 assume !(~n <= 0); 81481#L26 call #t~ret0 := fact(~n - 1);< 81518#factENTRY ~n := #in~n; 81502#L25 assume !(~n <= 0); 81472#L26 call #t~ret0 := fact(~n - 1);< 81652#factENTRY ~n := #in~n; 81654#L25 assume ~n <= 0;#res := 1; 81653#factFINAL assume true; 81650#factEXIT >#66#return; 81651#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81735#factFINAL assume true; 81731#factEXIT >#66#return; 81491#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82665#factFINAL assume true; 82664#factEXIT >#68#return; 81559#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 81367#factENTRY ~n := #in~n; 81567#L25 assume !(~n <= 0); 81481#L26 call #t~ret0 := fact(~n - 1);< 81518#factENTRY ~n := #in~n; 81502#L25 assume !(~n <= 0); 81472#L26 call #t~ret0 := fact(~n - 1);< 81652#factENTRY ~n := #in~n; 81654#L25 assume ~n <= 0;#res := 1; 81653#factFINAL assume true; 81650#factEXIT >#66#return; 81651#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81735#factFINAL assume true; 81731#factEXIT >#66#return; 81491#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82665#factFINAL assume true; 82664#factEXIT >#70#return; 81353#L30-2 [2022-11-25 16:58:40,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:40,831 INFO L85 PathProgramCache]: Analyzing trace with hash -125024212, now seen corresponding path program 8 times [2022-11-25 16:58:40,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:40,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416436876] [2022-11-25 16:58:40,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:40,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:40,850 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:58:40,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [298773957] [2022-11-25 16:58:40,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 16:58:40,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:58:40,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:40,856 INFO L229 MonitoredProcess]: Starting monitored process 198 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:58:40,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (198)] Waiting until timeout for monitored process [2022-11-25 16:58:40,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 16:58:40,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:58:40,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 16:58:40,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:58:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1839 backedges. 842 proven. 1 refuted. 0 times theorem prover too weak. 996 trivial. 0 not checked. [2022-11-25 16:58:41,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:58:41,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1839 backedges. 82 proven. 61 refuted. 0 times theorem prover too weak. 1696 trivial. 0 not checked. [2022-11-25 16:58:41,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:41,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416436876] [2022-11-25 16:58:41,245 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:58:41,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298773957] [2022-11-25 16:58:41,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298773957] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:58:41,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:58:41,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-11-25 16:58:41,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916283142] [2022-11-25 16:58:41,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:58:41,246 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 16:58:41,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:41,247 INFO L85 PathProgramCache]: Analyzing trace with hash -11172366, now seen corresponding path program 2 times [2022-11-25 16:58:41,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:41,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699843083] [2022-11-25 16:58:41,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:41,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:41,254 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:58:41,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [100145940] [2022-11-25 16:58:41,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 16:58:41,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:58:41,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:41,256 INFO L229 MonitoredProcess]: Starting monitored process 199 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:58:41,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (199)] Waiting until timeout for monitored process [2022-11-25 16:58:41,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 16:58:41,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 16:58:41,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:58:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:58:41,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:58:42,180 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:58:42,180 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:58:42,180 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:58:42,180 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:58:42,180 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-25 16:58:42,180 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:42,180 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:58:42,180 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:58:42,181 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration26_Loop [2022-11-25 16:58:42,181 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:58:42,181 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:58:42,182 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:42,183 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:42,185 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:42,187 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:42,231 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:58:42,402 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:58:42,402 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-25 16:58:42,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:42,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:42,411 INFO L229 MonitoredProcess]: Starting monitored process 200 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:42,412 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:58:42,412 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:58:42,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2022-11-25 16:58:42,439 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-25 16:58:42,439 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: [] [2022-11-25 16:58:42,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Forceful destruction successful, exit code 0 [2022-11-25 16:58:42,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:58:42,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:42,444 INFO L229 MonitoredProcess]: Starting monitored process 201 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:42,447 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:58:42,448 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:58:42,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2022-11-25 16:58:42,469 INFO L437 LassoAnalysis]: Proved nontermination for one component. WARNING: YOUR LOGFILE WAS TOO LONG, SOME LINES IN THE MIDDLE WERE REMOVED. [2022-11-25 17:06:06,103 INFO L750 eck$LassoCheckResult]: Loop: 506795#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 506855#factENTRY ~n := #in~n; 506864#L25 assume !(~n <= 0); 506802#L26 call #t~ret0 := fact(~n - 1);< 506805#factENTRY ~n := #in~n; 506845#L25 assume !(~n <= 0); 506801#L26 call #t~ret0 := fact(~n - 1);< 506816#factENTRY ~n := #in~n; 506844#L25 assume !(~n <= 0); 506800#L26 call #t~ret0 := fact(~n - 1);< 506836#factENTRY ~n := #in~n; 506844#L25 assume !(~n <= 0); 506800#L26 call #t~ret0 := fact(~n - 1);< 506836#factENTRY ~n := #in~n; 506874#L25 assume ~n <= 0;#res := 1; 506850#factFINAL assume true; 506851#factEXIT >#66#return; 506865#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 506837#factFINAL assume true; 506838#factEXIT >#66#return; 506830#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 506831#factFINAL assume true; 506824#factEXIT >#66#return; 506803#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 506812#factFINAL assume true; 506799#factEXIT >#66#return; 506804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 506794#factFINAL assume true; 506796#factEXIT >#74#return; 506853#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 506854#factENTRY ~n := #in~n; 506897#L25 assume !(~n <= 0); 506894#L26 call #t~ret0 := fact(~n - 1);< 506896#factENTRY ~n := #in~n; 506900#L25 assume !(~n <= 0); 506893#L26 call #t~ret0 := fact(~n - 1);< 506899#factENTRY ~n := #in~n; 506900#L25 assume !(~n <= 0); 506893#L26 call #t~ret0 := fact(~n - 1);< 506899#factENTRY ~n := #in~n; 506901#L25 assume ~n <= 0;#res := 1; 506914#factFINAL assume true; 506913#factEXIT >#66#return; 506912#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 506911#factFINAL assume true; 506910#factEXIT >#66#return; 506895#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 506898#factFINAL assume true; 506892#factEXIT >#66#return; 506887#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 506885#factFINAL assume true; 506852#factEXIT >#76#return; 506847#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 506849#factENTRY ~n := #in~n; 506848#L25 assume !(~n <= 0); 506698#L26 call #t~ret0 := fact(~n - 1);< 506815#factENTRY ~n := #in~n; 506769#L25 assume ~n <= 0;#res := 1; 506722#factFINAL assume true; 506697#factEXIT >#66#return; 506700#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507901#factFINAL assume true; 507898#factEXIT >#78#return; 506734#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; 506735#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 506743#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 506780#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 506753#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 506754#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 506766#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 506767#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 506718#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 506719#factENTRY ~n := #in~n; 506959#L25 assume !(~n <= 0); 506727#L26 call #t~ret0 := fact(~n - 1);< 506726#factENTRY ~n := #in~n; 506728#L25 assume !(~n <= 0); 507017#L26 call #t~ret0 := fact(~n - 1);< 507020#factENTRY ~n := #in~n; 507015#L25 assume !(~n <= 0); 507014#L26 call #t~ret0 := fact(~n - 1);< 507013#factENTRY ~n := #in~n; 507015#L25 assume !(~n <= 0); 507014#L26 call #t~ret0 := fact(~n - 1);< 507013#factENTRY ~n := #in~n; 507016#L25 assume ~n <= 0;#res := 1; 507403#factFINAL assume true; 507402#factEXIT >#66#return; 507401#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507400#factFINAL assume true; 507399#factEXIT >#66#return; 507398#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507397#factFINAL assume true; 507395#factEXIT >#66#return; 507396#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507889#factFINAL assume true; 507887#factEXIT >#66#return; 507886#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507885#factFINAL assume true; 507884#factEXIT >#68#return; 506772#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 506773#factENTRY ~n := #in~n; 507012#L25 assume ~n <= 0;#res := 1; 507353#factFINAL assume true; 507346#factEXIT >#70#return; 507180#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 507182#factENTRY ~n := #in~n; 507181#L25 assume !(~n <= 0); 507120#L26 call #t~ret0 := fact(~n - 1);< 507176#factENTRY ~n := #in~n; 507175#L25 assume !(~n <= 0); 507118#L26 call #t~ret0 := fact(~n - 1);< 507153#factENTRY ~n := #in~n; 507173#L25 assume !(~n <= 0); 507114#L26 call #t~ret0 := fact(~n - 1);< 507150#factENTRY ~n := #in~n; 507172#L25 assume !(~n <= 0); 507110#L26 call #t~ret0 := fact(~n - 1);< 507170#factENTRY ~n := #in~n; 507174#L25 assume ~n <= 0;#res := 1; 507171#factFINAL assume true; 507169#factEXIT >#66#return; 507168#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507157#factFINAL assume true; 507155#factEXIT >#66#return; 507154#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507151#factFINAL assume true; 507147#factEXIT >#66#return; 507122#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507129#factFINAL assume true; 507108#factEXIT >#66#return; 507124#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507883#factFINAL assume true; 507877#factEXIT >#72#return; 507879#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 508065#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 508064#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 508063#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 508062#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 507134#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 507464#factENTRY ~n := #in~n; 507457#L25 assume !(~n <= 0); 507115#L26 call #t~ret0 := fact(~n - 1);< 507125#factENTRY ~n := #in~n; 507364#L25 assume !(~n <= 0); 507111#L26 call #t~ret0 := fact(~n - 1);< 507150#factENTRY ~n := #in~n; 507172#L25 assume !(~n <= 0); 507110#L26 call #t~ret0 := fact(~n - 1);< 507170#factENTRY ~n := #in~n; 507172#L25 assume !(~n <= 0); 507110#L26 call #t~ret0 := fact(~n - 1);< 507170#factENTRY ~n := #in~n; 507174#L25 assume ~n <= 0;#res := 1; 507171#factFINAL assume true; 507169#factEXIT >#66#return; 507168#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507157#factFINAL assume true; 507155#factEXIT >#66#return; 507154#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507151#factFINAL assume true; 507147#factEXIT >#66#return; 507122#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507129#factFINAL assume true; 507108#factEXIT >#66#return; 507123#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507734#factFINAL assume true; 507682#factEXIT >#68#return; 507698#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 507726#factENTRY ~n := #in~n; 507738#L25 assume !(~n <= 0); 507119#L26 call #t~ret0 := fact(~n - 1);< 507736#factENTRY ~n := #in~n; 507847#L25 assume ~n <= 0;#res := 1; 507846#factFINAL assume true; 507844#factEXIT >#66#return; 507845#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507871#factFINAL assume true; 507870#factEXIT >#70#return; 507165#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 507812#factENTRY ~n := #in~n; 507813#L25 assume !(~n <= 0); 507113#L26 call #t~ret0 := fact(~n - 1);< 507150#factENTRY ~n := #in~n; 507172#L25 assume !(~n <= 0); 507110#L26 call #t~ret0 := fact(~n - 1);< 507170#factENTRY ~n := #in~n; 507174#L25 assume ~n <= 0;#res := 1; 507171#factFINAL assume true; 507169#factEXIT >#66#return; 507168#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507157#factFINAL assume true; 507155#factEXIT >#66#return; 507121#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507903#factFINAL assume true; 507853#factEXIT >#72#return; 507856#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 510822#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 510821#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 510820#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 510819#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 507136#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 507464#factENTRY ~n := #in~n; 507457#L25 assume !(~n <= 0); 507115#L26 call #t~ret0 := fact(~n - 1);< 507125#factENTRY ~n := #in~n; 507364#L25 assume !(~n <= 0); 507111#L26 call #t~ret0 := fact(~n - 1);< 507150#factENTRY ~n := #in~n; 507172#L25 assume !(~n <= 0); 507110#L26 call #t~ret0 := fact(~n - 1);< 507170#factENTRY ~n := #in~n; 507172#L25 assume !(~n <= 0); 507110#L26 call #t~ret0 := fact(~n - 1);< 507170#factENTRY ~n := #in~n; 507174#L25 assume ~n <= 0;#res := 1; 507171#factFINAL assume true; 507169#factEXIT >#66#return; 507168#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507157#factFINAL assume true; 507155#factEXIT >#66#return; 507154#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507151#factFINAL assume true; 507147#factEXIT >#66#return; 507122#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507129#factFINAL assume true; 507108#factEXIT >#66#return; 507123#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507734#factFINAL assume true; 507682#factEXIT >#68#return; 507719#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 507726#factENTRY ~n := #in~n; 507738#L25 assume !(~n <= 0); 507119#L26 call #t~ret0 := fact(~n - 1);< 507736#factENTRY ~n := #in~n; 507172#L25 assume !(~n <= 0); 507110#L26 call #t~ret0 := fact(~n - 1);< 507170#factENTRY ~n := #in~n; 507174#L25 assume ~n <= 0;#res := 1; 507171#factFINAL assume true; 507169#factEXIT >#66#return; 507168#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507157#factFINAL assume true; 507155#factEXIT >#66#return; 507156#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507865#factFINAL assume true; 507864#factEXIT >#70#return; 507159#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 507812#factENTRY ~n := #in~n; 507813#L25 assume !(~n <= 0); 507113#L26 call #t~ret0 := fact(~n - 1);< 507150#factENTRY ~n := #in~n; 507172#L25 assume !(~n <= 0); 507110#L26 call #t~ret0 := fact(~n - 1);< 507170#factENTRY ~n := #in~n; 507174#L25 assume ~n <= 0;#res := 1; 507171#factFINAL assume true; 507169#factEXIT >#66#return; 507168#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507157#factFINAL assume true; 507155#factEXIT >#66#return; 507121#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507903#factFINAL assume true; 507853#factEXIT >#72#return; 507859#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 510837#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 510835#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 510834#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 510833#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 507131#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 507464#factENTRY ~n := #in~n; 507457#L25 assume !(~n <= 0); 507115#L26 call #t~ret0 := fact(~n - 1);< 507125#factENTRY ~n := #in~n; 507364#L25 assume !(~n <= 0); 507111#L26 call #t~ret0 := fact(~n - 1);< 507150#factENTRY ~n := #in~n; 507172#L25 assume !(~n <= 0); 507110#L26 call #t~ret0 := fact(~n - 1);< 507170#factENTRY ~n := #in~n; 507172#L25 assume !(~n <= 0); 507110#L26 call #t~ret0 := fact(~n - 1);< 507170#factENTRY ~n := #in~n; 507174#L25 assume ~n <= 0;#res := 1; 507171#factFINAL assume true; 507169#factEXIT >#66#return; 507168#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507157#factFINAL assume true; 507155#factEXIT >#66#return; 507154#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507151#factFINAL assume true; 507147#factEXIT >#66#return; 507122#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507129#factFINAL assume true; 507108#factEXIT >#66#return; 507123#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507734#factFINAL assume true; 507682#factEXIT >#68#return; 507696#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 507726#factENTRY ~n := #in~n; 507738#L25 assume !(~n <= 0); 507119#L26 call #t~ret0 := fact(~n - 1);< 507736#factENTRY ~n := #in~n; 507172#L25 assume !(~n <= 0); 507110#L26 call #t~ret0 := fact(~n - 1);< 507170#factENTRY ~n := #in~n; 507172#L25 assume !(~n <= 0); 507110#L26 call #t~ret0 := fact(~n - 1);< 507170#factENTRY ~n := #in~n; 507172#L25 assume !(~n <= 0); 507110#L26 call #t~ret0 := fact(~n - 1);< 507170#factENTRY ~n := #in~n; 507174#L25 assume ~n <= 0;#res := 1; 507171#factFINAL assume true; 507169#factEXIT >#66#return; 507168#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507157#factFINAL assume true; 507155#factEXIT >#66#return; 507154#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507151#factFINAL assume true; 507147#factEXIT >#66#return; 507122#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507129#factFINAL assume true; 507108#factEXIT >#66#return; 507123#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507734#factFINAL assume true; 507682#factEXIT >#70#return; 507724#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 507839#factENTRY ~n := #in~n; 507809#L25 assume !(~n <= 0); 507109#L26 call #t~ret0 := fact(~n - 1);< 507736#factENTRY ~n := #in~n; 507847#L25 assume ~n <= 0;#res := 1; 507846#factFINAL assume true; 507844#factEXIT >#66#return; 507842#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507840#factFINAL assume true; 507836#factEXIT >#72#return; 507675#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 510840#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 510838#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 510836#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 510830#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 507135#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 507464#factENTRY ~n := #in~n; 507457#L25 assume !(~n <= 0); 507115#L26 call #t~ret0 := fact(~n - 1);< 507125#factENTRY ~n := #in~n; 507364#L25 assume !(~n <= 0); 507111#L26 call #t~ret0 := fact(~n - 1);< 507150#factENTRY ~n := #in~n; 507172#L25 assume !(~n <= 0); 507110#L26 call #t~ret0 := fact(~n - 1);< 507170#factENTRY ~n := #in~n; 507172#L25 assume !(~n <= 0); 507110#L26 call #t~ret0 := fact(~n - 1);< 507170#factENTRY ~n := #in~n; 507174#L25 assume ~n <= 0;#res := 1; 507171#factFINAL assume true; 507169#factEXIT >#66#return; 507168#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507157#factFINAL assume true; 507155#factEXIT >#66#return; 507154#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507151#factFINAL assume true; 507147#factEXIT >#66#return; 507122#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507129#factFINAL assume true; 507108#factEXIT >#66#return; 507123#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507734#factFINAL assume true; 507682#factEXIT >#68#return; 507695#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 507726#factENTRY ~n := #in~n; 507738#L25 assume !(~n <= 0); 507119#L26 call #t~ret0 := fact(~n - 1);< 507736#factENTRY ~n := #in~n; 507172#L25 assume !(~n <= 0); 507110#L26 call #t~ret0 := fact(~n - 1);< 507170#factENTRY ~n := #in~n; 507172#L25 assume !(~n <= 0); 507110#L26 call #t~ret0 := fact(~n - 1);< 507170#factENTRY ~n := #in~n; 507172#L25 assume !(~n <= 0); 507110#L26 call #t~ret0 := fact(~n - 1);< 507170#factENTRY ~n := #in~n; 507174#L25 assume ~n <= 0;#res := 1; 507171#factFINAL assume true; 507169#factEXIT >#66#return; 507168#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507157#factFINAL assume true; 507155#factEXIT >#66#return; 507154#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507151#factFINAL assume true; 507147#factEXIT >#66#return; 507122#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507129#factFINAL assume true; 507108#factEXIT >#66#return; 507123#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 507734#factFINAL assume true; 507682#factEXIT >#70#return; 507668#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 507680#factENTRY ~n := #in~n; 507742#L25 assume ~n <= 0;#res := 1; 507735#factFINAL assume true; 507664#factEXIT >#72#return; 507676#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 510832#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 510831#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 507455#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 507456#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 506795#L30-5 [2022-11-25 17:06:06,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:06,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1466559774, now seen corresponding path program 32 times [2022-11-25 17:06:06,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:06,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448779898] [2022-11-25 17:06:06,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:06,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:06,128 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:06:06,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1403918648] [2022-11-25 17:06:06,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:06:06,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:06:06,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:06,129 INFO L229 MonitoredProcess]: Starting monitored process 311 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:06:06,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (311)] Waiting until timeout for monitored process [2022-11-25 17:06:06,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:06:06,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:06:06,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 1675 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 17:06:06,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:07,232 INFO L134 CoverageAnalysis]: Checked inductivity of 31991 backedges. 321 proven. 313 refuted. 0 times theorem prover too weak. 31357 trivial. 0 not checked. [2022-11-25 17:06:07,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:06:08,081 INFO L134 CoverageAnalysis]: Checked inductivity of 31991 backedges. 320 proven. 313 refuted. 0 times theorem prover too weak. 31358 trivial. 0 not checked. [2022-11-25 17:06:08,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:08,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448779898] [2022-11-25 17:06:08,081 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:06:08,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403918648] [2022-11-25 17:06:08,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403918648] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:06:08,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:06:08,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2022-11-25 17:06:08,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651847144] [2022-11-25 17:06:08,082 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:06:08,083 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 17:06:08,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:08,083 INFO L85 PathProgramCache]: Analyzing trace with hash -2051063904, now seen corresponding path program 28 times [2022-11-25 17:06:08,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:08,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279900020] [2022-11-25 17:06:08,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:08,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:08,092 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:06:08,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1009052180] [2022-11-25 17:06:08,093 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:06:08,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:06:08,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:08,098 INFO L229 MonitoredProcess]: Starting monitored process 312 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:06:08,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (312)] Waiting until timeout for monitored process [2022-11-25 17:06:08,377 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:06:08,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:06:08,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-25 17:06:08,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:08,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10937 backedges. 6074 proven. 299 refuted. 0 times theorem prover too weak. 4564 trivial. 0 not checked. [2022-11-25 17:06:08,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:06:09,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10937 backedges. 572 proven. 1326 refuted. 0 times theorem prover too weak. 9039 trivial. 0 not checked. [2022-11-25 17:06:09,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:09,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279900020] [2022-11-25 17:06:09,834 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:06:09,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009052180] [2022-11-25 17:06:09,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009052180] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:06:09,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:06:09,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 27 [2022-11-25 17:06:09,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147453053] [2022-11-25 17:06:09,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:06:09,836 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 17:06:09,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:09,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-25 17:06:09,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2022-11-25 17:06:09,836 INFO L87 Difference]: Start difference. First operand 4160 states and 5825 transitions. cyclomatic complexity: 1740 Second operand has 27 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 27 states have internal predecessors, (68), 16 states have call successors, (31), 2 states have call predecessors, (31), 9 states have return successors, (34), 12 states have call predecessors, (34), 16 states have call successors, (34) [2022-11-25 17:06:11,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:11,551 INFO L93 Difference]: Finished difference Result 4829 states and 6757 transitions. [2022-11-25 17:06:11,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4829 states and 6757 transitions. [2022-11-25 17:06:11,569 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 257 [2022-11-25 17:06:11,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4829 states to 4827 states and 6755 transitions. [2022-11-25 17:06:11,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 258 [2022-11-25 17:06:11,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 258 [2022-11-25 17:06:11,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4827 states and 6755 transitions. [2022-11-25 17:06:11,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 17:06:11,590 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4827 states and 6755 transitions. [2022-11-25 17:06:11,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4827 states and 6755 transitions. [2022-11-25 17:06:11,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4827 to 4177. [2022-11-25 17:06:11,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4177 states, 2695 states have (on average 1.0623376623376624) internal successors, (2863), 2748 states have internal predecessors, (2863), 792 states have call successors, (884), 457 states have call predecessors, (884), 690 states have return successors, (2114), 971 states have call predecessors, (2114), 792 states have call successors, (2114) [2022-11-25 17:06:11,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4177 states to 4177 states and 5861 transitions. [2022-11-25 17:06:11,648 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4177 states and 5861 transitions. [2022-11-25 17:06:11,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-25 17:06:11,649 INFO L428 stractBuchiCegarLoop]: Abstraction has 4177 states and 5861 transitions. [2022-11-25 17:06:11,649 INFO L335 stractBuchiCegarLoop]: ======== Iteration 49 ============ [2022-11-25 17:06:11,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4177 states and 5861 transitions. [2022-11-25 17:06:11,657 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 227 [2022-11-25 17:06:11,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:06:11,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:06:11,660 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [117, 117, 69, 69, 69, 69, 48, 17, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 3, 3, 1, 1, 1, 1] [2022-11-25 17:06:11,660 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [67, 67, 49, 49, 49, 49, 18, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:11,661 INFO L748 eck$LassoCheckResult]: Stem: 522739#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 522716#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; 522717#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 522738#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; 522728#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 522729#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 525813#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 522704#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 522705#factENTRY ~n := #in~n; 525847#L25 assume ~n <= 0;#res := 1; 525846#factFINAL assume true; 524785#factEXIT >#68#return; 522754#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 522755#factENTRY ~n := #in~n; 525890#L25 assume ~n <= 0;#res := 1; 525888#factFINAL assume true; 525884#factEXIT >#70#return; 522700#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 522701#factENTRY ~n := #in~n; 526117#L25 assume ~n <= 0;#res := 1; 526116#factFINAL assume true; 526115#factEXIT >#72#return; 522734#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 522732#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 522733#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 526280#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 526279#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 526275#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 526276#factENTRY ~n := #in~n; 526289#L25 assume !(~n <= 0); 526285#L26 call #t~ret0 := fact(~n - 1);< 526287#factENTRY ~n := #in~n; 526302#L25 assume ~n <= 0;#res := 1; 526300#factFINAL assume true; 526299#factEXIT >#66#return; 526298#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 526296#factFINAL assume true; 526292#factEXIT >#74#return; 526261#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 526263#factENTRY ~n := #in~n; 526277#L25 assume ~n <= 0;#res := 1; 526278#factFINAL assume true; 526265#factEXIT >#76#return; 526255#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 526258#factENTRY ~n := #in~n; 526304#L25 assume !(~n <= 0); 526267#L26 call #t~ret0 := fact(~n - 1);< 526268#factENTRY ~n := #in~n; 526297#L25 assume ~n <= 0;#res := 1; 526295#factFINAL assume true; 526266#factEXIT >#66#return; 526264#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 526259#factFINAL assume true; 526254#factEXIT >#78#return; 526257#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; 526349#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 526348#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 526347#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 522741#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 522690#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 522691#factENTRY ~n := #in~n; 526359#L25 assume !(~n <= 0); 526355#L26 call #t~ret0 := fact(~n - 1);< 526357#factENTRY ~n := #in~n; 526364#L25 assume !(~n <= 0); 526356#L26 call #t~ret0 := fact(~n - 1);< 526362#factENTRY ~n := #in~n; 526365#L25 assume ~n <= 0;#res := 1; 526363#factFINAL assume true; 526361#factEXIT >#66#return; 526360#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 526358#factFINAL assume true; 526354#factEXIT >#66#return; 526353#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 526352#factFINAL assume true; 526341#factEXIT >#74#return; 526342#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 526375#factENTRY ~n := #in~n; 526378#L25 assume ~n <= 0;#res := 1; 526376#factFINAL assume true; 526377#factEXIT >#76#return; 526372#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 526373#factENTRY ~n := #in~n; 526449#L25 assume !(~n <= 0); 526423#L26 call #t~ret0 := fact(~n - 1);< 526437#factENTRY ~n := #in~n; 526393#L25 assume !(~n <= 0); 526420#L26 call #t~ret0 := fact(~n - 1);< 526442#factENTRY ~n := #in~n; 526445#L25 assume ~n <= 0;#res := 1; 526443#factFINAL assume true; 526441#factEXIT >#66#return; 526440#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 526439#factFINAL assume true; 526435#factEXIT >#66#return; 526427#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 526519#factFINAL assume true; 526446#factEXIT >#78#return; 526368#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; 526367#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 526366#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 526350#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 526324#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 526172#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 526814#factENTRY ~n := #in~n; 526813#L25 assume !(~n <= 0); 526811#L26 call #t~ret0 := fact(~n - 1);< 526812#factENTRY ~n := #in~n; 526810#L25 assume !(~n <= 0); 526805#L26 call #t~ret0 := fact(~n - 1);< 526809#factENTRY ~n := #in~n; 526810#L25 assume !(~n <= 0); 526805#L26 call #t~ret0 := fact(~n - 1);< 526809#factENTRY ~n := #in~n; 526804#L25 assume ~n <= 0;#res := 1; 526806#factFINAL assume true; 526824#factEXIT >#66#return; 526823#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 526822#factFINAL assume true; 526821#factEXIT >#66#return; 526820#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 526819#factFINAL assume true; 526818#factEXIT >#66#return; 526817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 526816#factFINAL assume true; 526171#factEXIT >#74#return; 526133#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 526134#factENTRY ~n := #in~n; 526146#L25 assume ~n <= 0;#res := 1; 526147#factFINAL assume true; 526213#factEXIT >#76#return; 522744#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 526211#factENTRY ~n := #in~n; 526210#L25 assume !(~n <= 0); 526184#L26 call #t~ret0 := fact(~n - 1);< 526188#factENTRY ~n := #in~n; 526212#L25 assume !(~n <= 0); 526181#L26 call #t~ret0 := fact(~n - 1);< 526190#factENTRY ~n := #in~n; 526160#L25 assume !(~n <= 0); 526180#L26 call #t~ret0 := fact(~n - 1);< 526206#factENTRY ~n := #in~n; 526208#L25 assume ~n <= 0;#res := 1; 526207#factFINAL assume true; 526205#factEXIT >#66#return; 526204#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 526203#factFINAL assume true; 526202#factEXIT >#66#return; 526201#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 526200#factFINAL assume true; 526199#factEXIT >#66#return; 522742#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 522745#factFINAL assume true; 524782#factEXIT >#78#return; 524781#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; 524348#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 524345#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 524341#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 522737#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 522730#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 522731#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 524529#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 524380#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 524382#factENTRY ~n := #in~n; 524408#L25 assume !(~n <= 0); 524406#L26 call #t~ret0 := fact(~n - 1);< 524407#factENTRY ~n := #in~n; 524410#L25 assume ~n <= 0;#res := 1; 524409#factFINAL assume true; 524405#factEXIT >#66#return; 524404#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 524399#factFINAL assume true; 524378#factEXIT >#68#return; 524374#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 524377#factENTRY ~n := #in~n; 524493#L25 assume ~n <= 0;#res := 1; 524491#factFINAL assume true; 524373#factEXIT >#70#return; 524366#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 524371#factENTRY ~n := #in~n; 524460#L25 assume !(~n <= 0); 524419#L26 call #t~ret0 := fact(~n - 1);< 524426#factENTRY ~n := #in~n; 524527#L25 assume ~n <= 0;#res := 1; 524428#factFINAL assume true; 524414#factEXIT >#66#return; 524424#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 524451#factFINAL assume true; 524365#factEXIT >#72#return; 524369#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 524522#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 524521#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 524520#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 524519#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 524355#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 524358#factENTRY ~n := #in~n; 524473#L25 assume !(~n <= 0); 524421#L26 call #t~ret0 := fact(~n - 1);< 524470#factENTRY ~n := #in~n; 524527#L25 assume ~n <= 0;#res := 1; 524428#factFINAL assume true; 524414#factEXIT >#66#return; 524425#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 524467#factFINAL assume true; 524354#factEXIT >#68#return; 524338#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 524339#factENTRY ~n := #in~n; 524530#L25 assume !(~n <= 0); 524415#L26 call #t~ret0 := fact(~n - 1);< 524426#factENTRY ~n := #in~n; 524527#L25 assume ~n <= 0;#res := 1; 524428#factFINAL assume true; 524414#factEXIT >#66#return; 524412#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 524351#factFINAL assume true; 524335#factEXIT >#70#return; 524329#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 524332#factENTRY ~n := #in~n; 524532#L25 assume ~n <= 0;#res := 1; 524531#factFINAL assume true; 524326#factEXIT >#72#return; 524331#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 524436#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 524434#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 524432#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 524430#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 524306#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 524309#factENTRY ~n := #in~n; 524545#L25 assume !(~n <= 0); 524420#L26 call #t~ret0 := fact(~n - 1);< 524426#factENTRY ~n := #in~n; 524662#L25 assume !(~n <= 0); 524540#L26 call #t~ret0 := fact(~n - 1);< 524666#factENTRY ~n := #in~n; 524651#L25 assume ~n <= 0;#res := 1; 524647#factFINAL assume true; 524594#factEXIT >#66#return; 524593#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 524546#factFINAL assume true; 524538#factEXIT >#66#return; 524536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 524533#factFINAL assume true; 524305#factEXIT >#74#return; 524299#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 524301#factENTRY ~n := #in~n; 524513#L25 assume !(~n <= 0); 524316#L26 call #t~ret0 := fact(~n - 1);< 524512#factENTRY ~n := #in~n; 524342#L25 assume ~n <= 0;#res := 1; 524343#factFINAL assume true; 524511#factEXIT >#66#return; 524509#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 524507#factFINAL assume true; 524298#factEXIT >#76#return; 524294#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 524297#factENTRY ~n := #in~n; 524646#L25 assume !(~n <= 0); 524632#L26 call #t~ret0 := fact(~n - 1);< 524645#factENTRY ~n := #in~n; 524652#L25 assume ~n <= 0;#res := 1; 524649#factFINAL assume true; 524631#factEXIT >#66#return; 524630#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 524592#factFINAL assume true; 524291#factEXIT >#78#return; 524296#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; 524672#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 524671#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 524669#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 524668#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 524205#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 524219#factENTRY ~n := #in~n; 524216#L25 assume !(~n <= 0); 524197#L26 call #t~ret0 := fact(~n - 1);< 524202#factENTRY ~n := #in~n; 524217#L25 assume !(~n <= 0); 524199#L26 call #t~ret0 := fact(~n - 1);< 524214#factENTRY ~n := #in~n; 524217#L25 assume !(~n <= 0); 524199#L26 call #t~ret0 := fact(~n - 1);< 524214#factENTRY ~n := #in~n; 524222#L25 assume ~n <= 0;#res := 1; 524221#factFINAL assume true; 524220#factEXIT >#66#return; 524218#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 524215#factFINAL assume true; 524213#factEXIT >#66#return; 524212#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 524204#factFINAL assume true; 524196#factEXIT >#66#return; 524200#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 524262#factFINAL assume true; 524256#factEXIT >#74#return; 524160#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 524165#factENTRY ~n := #in~n; 524163#L25 assume !(~n <= 0); 524123#L26 call #t~ret0 := fact(~n - 1);< 524154#factENTRY ~n := #in~n; 524148#L25 assume ~n <= 0;#res := 1; 524143#factFINAL assume true; 524120#factEXIT >#66#return; 524126#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 524244#factFINAL assume true; 524242#factEXIT >#76#return; 524115#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 524137#factENTRY ~n := #in~n; 524138#L25 assume !(~n <= 0); 524128#L26 call #t~ret0 := fact(~n - 1);< 524129#factENTRY ~n := #in~n; 524155#L25 assume !(~n <= 0); 524150#L26 call #t~ret0 := fact(~n - 1);< 524157#factENTRY ~n := #in~n; 524164#L25 assume ~n <= 0;#res := 1; 524162#factFINAL assume true; 524156#factEXIT >#66#return; 524149#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 524153#factFINAL assume true; 524166#factEXIT >#66#return; 524118#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 524113#factFINAL assume true; 524116#factEXIT >#78#return; 524108#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; 524106#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 524103#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 524100#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 524097#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 524091#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 523834#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 524083#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 524079#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 524081#factENTRY ~n := #in~n; 524096#L25 assume !(~n <= 0); 524088#L26 call #t~ret0 := fact(~n - 1);< 524090#factENTRY ~n := #in~n; 524105#L25 assume !(~n <= 0); 524089#L26 call #t~ret0 := fact(~n - 1);< 524102#factENTRY ~n := #in~n; 524107#L25 assume ~n <= 0;#res := 1; 524104#factFINAL assume true; 524101#factEXIT >#66#return; 524099#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 524095#factFINAL assume true; 524087#factEXIT >#66#return; 524085#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 524082#factFINAL assume true; 524078#factEXIT >#68#return; 523975#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 523977#factENTRY ~n := #in~n; 523979#L25 assume ~n <= 0;#res := 1; 523978#factFINAL assume true; 523974#factEXIT >#70#return; 523952#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 523968#factENTRY ~n := #in~n; 523960#L25 assume !(~n <= 0); 523942#L26 call #t~ret0 := fact(~n - 1);< 523953#factENTRY ~n := #in~n; 524031#L25 assume !(~n <= 0); 523946#L26 call #t~ret0 := fact(~n - 1);< 523967#factENTRY ~n := #in~n; 523970#L25 assume ~n <= 0;#res := 1; 523969#factFINAL assume true; 523965#factEXIT >#66#return; 523959#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523950#factFINAL assume true; 523941#factEXIT >#66#return; 523948#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 524077#factFINAL assume true; 524075#factEXIT >#72#return; 524076#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 524098#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 524094#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 524086#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 523958#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 523932#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 523939#factENTRY ~n := #in~n; 523972#L25 assume !(~n <= 0); 523944#L26 call #t~ret0 := fact(~n - 1);< 524032#factENTRY ~n := #in~n; 523996#L25 assume !(~n <= 0); 523966#L26 call #t~ret0 := fact(~n - 1);< 523971#factENTRY ~n := #in~n; 523970#L25 assume ~n <= 0;#res := 1; 523969#factFINAL assume true; 523965#factEXIT >#66#return; 523959#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523950#factFINAL assume true; 523941#factEXIT >#66#return; 523940#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523938#factFINAL assume true; 523930#factEXIT >#68#return; 523935#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 524052#factENTRY ~n := #in~n; 524050#L25 assume !(~n <= 0); 523945#L26 call #t~ret0 := fact(~n - 1);< 524036#factENTRY ~n := #in~n; 524051#L25 assume ~n <= 0;#res := 1; 524047#factFINAL assume true; 524045#factEXIT >#66#return; 524046#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 525887#factFINAL assume true; 524058#factEXIT >#70#return; 524040#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 524042#factENTRY ~n := #in~n; 524048#L25 assume !(~n <= 0); 523943#L26 call #t~ret0 := fact(~n - 1);< 524036#factENTRY ~n := #in~n; 524051#L25 assume ~n <= 0;#res := 1; 524047#factFINAL assume true; 524045#factEXIT >#66#return; 524044#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 524043#factFINAL assume true; 524038#factEXIT >#72#return; 524034#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 524035#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 524026#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 524027#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 524023#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 523931#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 523937#factENTRY ~n := #in~n; 523973#L25 assume !(~n <= 0); 523947#L26 call #t~ret0 := fact(~n - 1);< 523949#factENTRY ~n := #in~n; 523996#L25 assume !(~n <= 0); 523966#L26 call #t~ret0 := fact(~n - 1);< 523971#factENTRY ~n := #in~n; 523970#L25 assume ~n <= 0;#res := 1; 523969#factFINAL assume true; 523965#factEXIT >#66#return; 523959#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523950#factFINAL assume true; 523941#factEXIT >#66#return; 523940#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523938#factFINAL assume true; 523930#factEXIT >#68#return; 523927#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 523929#factENTRY ~n := #in~n; 524014#L25 assume !(~n <= 0); 524007#L26 call #t~ret0 := fact(~n - 1);< 524010#factENTRY ~n := #in~n; 524017#L25 assume !(~n <= 0); 524008#L26 call #t~ret0 := fact(~n - 1);< 524013#factENTRY ~n := #in~n; 524022#L25 assume ~n <= 0;#res := 1; 524021#factFINAL assume true; 524019#factEXIT >#66#return; 524016#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 524012#factFINAL assume true; 524005#factEXIT >#66#return; 524003#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 524000#factFINAL assume true; 523926#factEXIT >#70#return; 523922#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 523925#factENTRY ~n := #in~n; 524002#L25 assume ~n <= 0;#res := 1; 523999#factFINAL assume true; 523921#factEXIT >#72#return; 523918#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 523919#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 523912#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 523913#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 523853#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 523844#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 523845#factENTRY ~n := #in~n; 523866#L25 assume !(~n <= 0); 523861#L26 call #t~ret0 := fact(~n - 1);< 523862#factENTRY ~n := #in~n; 523873#L25 assume !(~n <= 0); 523860#L26 call #t~ret0 := fact(~n - 1);< 523872#factENTRY ~n := #in~n; 523873#L25 assume !(~n <= 0); 523860#L26 call #t~ret0 := fact(~n - 1);< 523872#factENTRY ~n := #in~n; 523908#L25 assume ~n <= 0;#res := 1; 523894#factFINAL assume true; 523888#factEXIT >#66#return; 523878#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523876#factFINAL assume true; 523871#factEXIT >#66#return; 523868#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523865#factFINAL assume true; 523859#factEXIT >#66#return; 523856#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523852#factFINAL assume true; 523843#factEXIT >#74#return; 523839#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 523840#factENTRY ~n := #in~n; 525526#L25 assume !(~n <= 0); 525522#L26 call #t~ret0 := fact(~n - 1);< 525524#factENTRY ~n := #in~n; 526131#L25 assume !(~n <= 0); 525521#L26 call #t~ret0 := fact(~n - 1);< 526130#factENTRY ~n := #in~n; 526141#L25 assume ~n <= 0;#res := 1; 526140#factFINAL assume true; 526139#factEXIT >#66#return; 525523#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 526129#factFINAL assume true; 525520#factEXIT >#66#return; 525519#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 525516#factFINAL assume true; 523838#factEXIT >#76#return; 523362#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 523363#factENTRY ~n := #in~n; 523855#L25 assume !(~n <= 0); 523848#L26 call #t~ret0 := fact(~n - 1);< 523851#factENTRY ~n := #in~n; 523857#L25 assume ~n <= 0;#res := 1; 523854#factFINAL assume true; 523846#factEXIT >#66#return; 523842#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523841#factFINAL assume true; 523837#factEXIT >#78#return; 523356#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; 523357#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 523352#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 523353#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 523348#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 523349#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 523343#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 523344#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 523110#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 523118#factENTRY ~n := #in~n; 523108#L25 assume !(~n <= 0); 523111#L26 call #t~ret0 := fact(~n - 1);< 523337#factENTRY ~n := #in~n; 523341#L25 assume !(~n <= 0); 523335#L26 call #t~ret0 := fact(~n - 1);< 525639#factENTRY ~n := #in~n; 523341#L25 assume !(~n <= 0); 523335#L26 call #t~ret0 := fact(~n - 1);< 525639#factENTRY ~n := #in~n; 525651#L25 assume ~n <= 0;#res := 1; 525649#factFINAL assume true; 525647#factEXIT >#66#return; 525645#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 525641#factFINAL assume true; 525638#factEXIT >#66#return; 525636#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523338#factFINAL assume true; 523333#factEXIT >#66#return; 523332#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523331#factFINAL assume true; 523330#factEXIT >#68#return; 523327#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 522753#factENTRY ~n := #in~n; 523329#L25 assume ~n <= 0;#res := 1; 523328#factFINAL assume true; 523322#factEXIT >#70#return; 523317#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 523321#factENTRY ~n := #in~n; 523316#L25 assume !(~n <= 0); 523137#L26 call #t~ret0 := fact(~n - 1);< 523261#factENTRY ~n := #in~n; 523281#L25 assume !(~n <= 0); 523134#L26 call #t~ret0 := fact(~n - 1);< 523255#factENTRY ~n := #in~n; 523279#L25 assume !(~n <= 0); 523132#L26 call #t~ret0 := fact(~n - 1);< 523277#factENTRY ~n := #in~n; 523280#L25 assume ~n <= 0;#res := 1; 523278#factFINAL assume true; 523276#factEXIT >#66#return; 523275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523266#factFINAL assume true; 523263#factEXIT >#66#return; 523262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523256#factFINAL assume true; 523252#factEXIT >#66#return; 523253#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523833#factFINAL assume true; 523832#factEXIT >#72#return; 523799#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 524648#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 524600#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 524599#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 524598#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 523186#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 523304#factENTRY ~n := #in~n; 523302#L25 assume !(~n <= 0); 523144#L26 call #t~ret0 := fact(~n - 1);< 523261#factENTRY ~n := #in~n; 523281#L25 assume !(~n <= 0); 523134#L26 call #t~ret0 := fact(~n - 1);< 523255#factENTRY ~n := #in~n; 523279#L25 assume !(~n <= 0); 523132#L26 call #t~ret0 := fact(~n - 1);< 523277#factENTRY ~n := #in~n; 523280#L25 assume ~n <= 0;#res := 1; 523278#factFINAL assume true; 523276#factEXIT >#66#return; 523275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523266#factFINAL assume true; 523263#factEXIT >#66#return; 523262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523256#factFINAL assume true; 523252#factEXIT >#66#return; 523254#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 525767#factFINAL assume true; 523173#factEXIT >#68#return; 523184#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 523217#factENTRY ~n := #in~n; 523303#L25 assume !(~n <= 0); 523145#L26 call #t~ret0 := fact(~n - 1);< 523301#factENTRY ~n := #in~n; 523732#L25 assume ~n <= 0;#res := 1; 523730#factFINAL assume true; 523718#factEXIT >#66#return; 523720#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523784#factFINAL assume true; 523782#factEXIT >#70#return; 523269#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 523497#factENTRY ~n := #in~n; 523498#L25 assume !(~n <= 0); 523135#L26 call #t~ret0 := fact(~n - 1);< 523255#factENTRY ~n := #in~n; 523279#L25 assume !(~n <= 0); 523132#L26 call #t~ret0 := fact(~n - 1);< 523277#factENTRY ~n := #in~n; 523279#L25 assume !(~n <= 0); 523132#L26 call #t~ret0 := fact(~n - 1);< 523277#factENTRY ~n := #in~n; 523280#L25 assume ~n <= 0;#res := 1; 523278#factFINAL assume true; 523276#factEXIT >#66#return; 523275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523266#factFINAL assume true; 523263#factEXIT >#66#return; 523262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523256#factFINAL assume true; 523252#factEXIT >#66#return; 523148#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523955#factFINAL assume true; 523779#factEXIT >#72#return; 523763#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 524136#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 524132#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 524053#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 523777#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 523209#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 523304#factENTRY ~n := #in~n; 523302#L25 assume !(~n <= 0); 523144#L26 call #t~ret0 := fact(~n - 1);< 523261#factENTRY ~n := #in~n; 523281#L25 assume !(~n <= 0); 523134#L26 call #t~ret0 := fact(~n - 1);< 523255#factENTRY ~n := #in~n; 523279#L25 assume !(~n <= 0); 523132#L26 call #t~ret0 := fact(~n - 1);< 523277#factENTRY ~n := #in~n; 523280#L25 assume ~n <= 0;#res := 1; 523278#factFINAL assume true; 523276#factEXIT >#66#return; 523275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523266#factFINAL assume true; 523263#factEXIT >#66#return; 523262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523256#factFINAL assume true; 523252#factEXIT >#66#return; 523254#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 525767#factFINAL assume true; 523173#factEXIT >#68#return; 523190#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 523217#factENTRY ~n := #in~n; 523303#L25 assume !(~n <= 0); 523145#L26 call #t~ret0 := fact(~n - 1);< 523301#factENTRY ~n := #in~n; 523279#L25 assume !(~n <= 0); 523132#L26 call #t~ret0 := fact(~n - 1);< 523277#factENTRY ~n := #in~n; 523280#L25 assume ~n <= 0;#res := 1; 523278#factFINAL assume true; 523276#factEXIT >#66#return; 523275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523266#factFINAL assume true; 523263#factEXIT >#66#return; 523265#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523737#factFINAL assume true; 523734#factEXIT >#70#return; 523215#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 523715#factENTRY ~n := #in~n; 523496#L25 assume !(~n <= 0); 523140#L26 call #t~ret0 := fact(~n - 1);< 523301#factENTRY ~n := #in~n; 523732#L25 assume ~n <= 0;#res := 1; 523730#factFINAL assume true; 523718#factEXIT >#66#return; 523717#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523716#factFINAL assume true; 523712#factEXIT >#72#return; 523714#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 523746#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 523745#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 523744#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 523743#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 523199#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 523304#factENTRY ~n := #in~n; 523302#L25 assume !(~n <= 0); 523144#L26 call #t~ret0 := fact(~n - 1);< 523261#factENTRY ~n := #in~n; 523281#L25 assume !(~n <= 0); 523134#L26 call #t~ret0 := fact(~n - 1);< 523255#factENTRY ~n := #in~n; 523279#L25 assume !(~n <= 0); 523132#L26 call #t~ret0 := fact(~n - 1);< 523277#factENTRY ~n := #in~n; 523280#L25 assume ~n <= 0;#res := 1; 523278#factFINAL assume true; 523276#factEXIT >#66#return; 523275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523266#factFINAL assume true; 523263#factEXIT >#66#return; 523262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523256#factFINAL assume true; 523252#factEXIT >#66#return; 523254#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 525767#factFINAL assume true; 523173#factEXIT >#68#return; 523192#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 523217#factENTRY ~n := #in~n; 523303#L25 assume !(~n <= 0); 523145#L26 call #t~ret0 := fact(~n - 1);< 523301#factENTRY ~n := #in~n; 523279#L25 assume !(~n <= 0); 523132#L26 call #t~ret0 := fact(~n - 1);< 523277#factENTRY ~n := #in~n; 523279#L25 assume !(~n <= 0); 523132#L26 call #t~ret0 := fact(~n - 1);< 523277#factENTRY ~n := #in~n; 523280#L25 assume ~n <= 0;#res := 1; 523278#factFINAL assume true; 523276#factEXIT >#66#return; 523275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523266#factFINAL assume true; 523263#factEXIT >#66#return; 523262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523256#factFINAL assume true; 523252#factEXIT >#66#return; 523254#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 525767#factFINAL assume true; 523173#factEXIT >#70#return; 523155#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 523170#factENTRY ~n := #in~n; 523172#L25 assume ~n <= 0;#res := 1; 523171#factFINAL assume true; 523154#factEXIT >#72#return; 523163#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 523489#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 523490#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 523485#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 523486#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 522778#L30-5 [2022-11-25 17:06:11,662 INFO L750 eck$LassoCheckResult]: Loop: 522778#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 522834#factENTRY ~n := #in~n; 522843#L25 assume !(~n <= 0); 522784#L26 call #t~ret0 := fact(~n - 1);< 522788#factENTRY ~n := #in~n; 522879#L25 assume !(~n <= 0); 522783#L26 call #t~ret0 := fact(~n - 1);< 522796#factENTRY ~n := #in~n; 522825#L25 assume !(~n <= 0); 522785#L26 call #t~ret0 := fact(~n - 1);< 522820#factENTRY ~n := #in~n; 522825#L25 assume !(~n <= 0); 522785#L26 call #t~ret0 := fact(~n - 1);< 522820#factENTRY ~n := #in~n; 522863#L25 assume ~n <= 0;#res := 1; 522861#factFINAL assume true; 522858#factEXIT >#66#return; 522824#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 522821#factFINAL assume true; 522822#factEXIT >#66#return; 522814#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 522815#factFINAL assume true; 522807#factEXIT >#66#return; 522786#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 522795#factFINAL assume true; 522782#factEXIT >#66#return; 522787#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 522777#factFINAL assume true; 522779#factEXIT >#74#return; 522832#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 522833#factENTRY ~n := #in~n; 522860#L25 assume !(~n <= 0); 522854#L26 call #t~ret0 := fact(~n - 1);< 522857#factENTRY ~n := #in~n; 523308#L25 assume !(~n <= 0); 522855#L26 call #t~ret0 := fact(~n - 1);< 523307#factENTRY ~n := #in~n; 523308#L25 assume !(~n <= 0); 522855#L26 call #t~ret0 := fact(~n - 1);< 523307#factENTRY ~n := #in~n; 523309#L25 assume ~n <= 0;#res := 1; 523315#factFINAL assume true; 523314#factEXIT >#66#return; 523313#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523312#factFINAL assume true; 523311#factEXIT >#66#return; 522856#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523306#factFINAL assume true; 522853#factEXIT >#66#return; 522852#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 522851#factFINAL assume true; 522831#factEXIT >#76#return; 522767#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 522830#factENTRY ~n := #in~n; 522829#L25 assume !(~n <= 0); 522810#L26 call #t~ret0 := fact(~n - 1);< 522828#factENTRY ~n := #in~n; 523059#L25 assume ~n <= 0;#res := 1; 523053#factFINAL assume true; 523049#factEXIT >#66#return; 523047#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523043#factFINAL assume true; 522766#factEXIT >#78#return; 522768#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; 523809#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 523808#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 523807#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 523806#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 523805#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 523804#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 523803#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 522702#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 522703#factENTRY ~n := #in~n; 523340#L25 assume !(~n <= 0); 522711#L26 call #t~ret0 := fact(~n - 1);< 522710#factENTRY ~n := #in~n; 522712#L25 assume !(~n <= 0); 523334#L26 call #t~ret0 := fact(~n - 1);< 523339#factENTRY ~n := #in~n; 523341#L25 assume !(~n <= 0); 523335#L26 call #t~ret0 := fact(~n - 1);< 525639#factENTRY ~n := #in~n; 523341#L25 assume !(~n <= 0); 523335#L26 call #t~ret0 := fact(~n - 1);< 525639#factENTRY ~n := #in~n; 525651#L25 assume ~n <= 0;#res := 1; 525649#factFINAL assume true; 525647#factEXIT >#66#return; 525645#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 525641#factFINAL assume true; 525638#factEXIT >#66#return; 525636#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523338#factFINAL assume true; 523333#factEXIT >#66#return; 523336#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523827#factFINAL assume true; 523813#factEXIT >#66#return; 523812#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523802#factFINAL assume true; 523801#factEXIT >#68#return; 523324#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 522753#factENTRY ~n := #in~n; 523329#L25 assume ~n <= 0;#res := 1; 523328#factFINAL assume true; 523322#factEXIT >#70#return; 523243#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 522699#factENTRY ~n := #in~n; 523580#L25 assume !(~n <= 0); 523141#L26 call #t~ret0 := fact(~n - 1);< 523244#factENTRY ~n := #in~n; 526061#L25 assume !(~n <= 0); 523139#L26 call #t~ret0 := fact(~n - 1);< 523261#factENTRY ~n := #in~n; 523281#L25 assume !(~n <= 0); 523134#L26 call #t~ret0 := fact(~n - 1);< 523255#factENTRY ~n := #in~n; 523279#L25 assume !(~n <= 0); 523132#L26 call #t~ret0 := fact(~n - 1);< 523277#factENTRY ~n := #in~n; 523280#L25 assume ~n <= 0;#res := 1; 523278#factFINAL assume true; 523276#factEXIT >#66#return; 523275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523266#factFINAL assume true; 523263#factEXIT >#66#return; 523262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523256#factFINAL assume true; 523252#factEXIT >#66#return; 523146#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523240#factFINAL assume true; 523131#factEXIT >#66#return; 523149#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523800#factFINAL assume true; 523794#factEXIT >#72#return; 523796#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 523823#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 523822#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 523821#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 523820#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 523294#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 523582#factENTRY ~n := #in~n; 523581#L25 assume !(~n <= 0); 523133#L26 call #t~ret0 := fact(~n - 1);< 523244#factENTRY ~n := #in~n; 526061#L25 assume !(~n <= 0); 523139#L26 call #t~ret0 := fact(~n - 1);< 523261#factENTRY ~n := #in~n; 523281#L25 assume !(~n <= 0); 523134#L26 call #t~ret0 := fact(~n - 1);< 523255#factENTRY ~n := #in~n; 523279#L25 assume !(~n <= 0); 523132#L26 call #t~ret0 := fact(~n - 1);< 523277#factENTRY ~n := #in~n; 523280#L25 assume ~n <= 0;#res := 1; 523278#factFINAL assume true; 523276#factEXIT >#66#return; 523275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523266#factFINAL assume true; 523263#factEXIT >#66#return; 523262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523256#factFINAL assume true; 523252#factEXIT >#66#return; 523146#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523240#factFINAL assume true; 523131#factEXIT >#66#return; 523147#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523289#factFINAL assume true; 523299#factEXIT >#68#return; 523706#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 523735#factENTRY ~n := #in~n; 523733#L25 assume !(~n <= 0); 523719#L26 call #t~ret0 := fact(~n - 1);< 523731#factENTRY ~n := #in~n; 523732#L25 assume ~n <= 0;#res := 1; 523730#factFINAL assume true; 523718#factEXIT >#66#return; 523720#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523784#factFINAL assume true; 523782#factEXIT >#70#return; 523258#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 523319#factENTRY ~n := #in~n; 523320#L25 assume !(~n <= 0); 523142#L26 call #t~ret0 := fact(~n - 1);< 523261#factENTRY ~n := #in~n; 523281#L25 assume !(~n <= 0); 523134#L26 call #t~ret0 := fact(~n - 1);< 523255#factENTRY ~n := #in~n; 523279#L25 assume !(~n <= 0); 523132#L26 call #t~ret0 := fact(~n - 1);< 523277#factENTRY ~n := #in~n; 523280#L25 assume ~n <= 0;#res := 1; 523278#factFINAL assume true; 523276#factEXIT >#66#return; 523275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523266#factFINAL assume true; 523263#factEXIT >#66#return; 523262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523256#factFINAL assume true; 523252#factEXIT >#66#return; 523148#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523955#factFINAL assume true; 523779#factEXIT >#72#return; 523780#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 523819#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 523818#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 523817#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 523816#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 523296#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 523300#factENTRY ~n := #in~n; 523305#L25 assume !(~n <= 0); 523138#L26 call #t~ret0 := fact(~n - 1);< 523150#factENTRY ~n := #in~n; 523579#L25 assume !(~n <= 0); 523136#L26 call #t~ret0 := fact(~n - 1);< 523255#factENTRY ~n := #in~n; 523279#L25 assume !(~n <= 0); 523132#L26 call #t~ret0 := fact(~n - 1);< 523277#factENTRY ~n := #in~n; 523279#L25 assume !(~n <= 0); 523132#L26 call #t~ret0 := fact(~n - 1);< 523277#factENTRY ~n := #in~n; 523280#L25 assume ~n <= 0;#res := 1; 523278#factFINAL assume true; 523276#factEXIT >#66#return; 523275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523266#factFINAL assume true; 523263#factEXIT >#66#return; 523262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523256#factFINAL assume true; 523252#factEXIT >#66#return; 523146#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523240#factFINAL assume true; 523131#factEXIT >#66#return; 523147#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523289#factFINAL assume true; 523299#factEXIT >#68#return; 523197#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 523217#factENTRY ~n := #in~n; 523303#L25 assume !(~n <= 0); 523145#L26 call #t~ret0 := fact(~n - 1);< 523301#factENTRY ~n := #in~n; 523279#L25 assume !(~n <= 0); 523132#L26 call #t~ret0 := fact(~n - 1);< 523277#factENTRY ~n := #in~n; 523280#L25 assume ~n <= 0;#res := 1; 523278#factFINAL assume true; 523276#factEXIT >#66#return; 523275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523266#factFINAL assume true; 523263#factEXIT >#66#return; 523265#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523737#factFINAL assume true; 523734#factEXIT >#70#return; 523268#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 523497#factENTRY ~n := #in~n; 523498#L25 assume !(~n <= 0); 523135#L26 call #t~ret0 := fact(~n - 1);< 523255#factENTRY ~n := #in~n; 523279#L25 assume !(~n <= 0); 523132#L26 call #t~ret0 := fact(~n - 1);< 523277#factENTRY ~n := #in~n; 523279#L25 assume !(~n <= 0); 523132#L26 call #t~ret0 := fact(~n - 1);< 523277#factENTRY ~n := #in~n; 523280#L25 assume ~n <= 0;#res := 1; 523278#factFINAL assume true; 523276#factEXIT >#66#return; 523275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523266#factFINAL assume true; 523263#factEXIT >#66#return; 523262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523256#factFINAL assume true; 523252#factEXIT >#66#return; 523148#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523955#factFINAL assume true; 523779#factEXIT >#72#return; 523764#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 524780#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 524775#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 524774#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 524597#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 523297#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 523300#factENTRY ~n := #in~n; 523305#L25 assume !(~n <= 0); 523138#L26 call #t~ret0 := fact(~n - 1);< 523150#factENTRY ~n := #in~n; 523579#L25 assume !(~n <= 0); 523136#L26 call #t~ret0 := fact(~n - 1);< 523255#factENTRY ~n := #in~n; 523279#L25 assume !(~n <= 0); 523132#L26 call #t~ret0 := fact(~n - 1);< 523277#factENTRY ~n := #in~n; 523279#L25 assume !(~n <= 0); 523132#L26 call #t~ret0 := fact(~n - 1);< 523277#factENTRY ~n := #in~n; 523280#L25 assume ~n <= 0;#res := 1; 523278#factFINAL assume true; 523276#factEXIT >#66#return; 523275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523266#factFINAL assume true; 523263#factEXIT >#66#return; 523262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523256#factFINAL assume true; 523252#factEXIT >#66#return; 523146#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523240#factFINAL assume true; 523131#factEXIT >#66#return; 523147#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523289#factFINAL assume true; 523299#factEXIT >#68#return; 523207#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 523217#factENTRY ~n := #in~n; 523303#L25 assume !(~n <= 0); 523145#L26 call #t~ret0 := fact(~n - 1);< 523301#factENTRY ~n := #in~n; 523279#L25 assume !(~n <= 0); 523132#L26 call #t~ret0 := fact(~n - 1);< 523277#factENTRY ~n := #in~n; 523279#L25 assume !(~n <= 0); 523132#L26 call #t~ret0 := fact(~n - 1);< 523277#factENTRY ~n := #in~n; 523280#L25 assume ~n <= 0;#res := 1; 523278#factFINAL assume true; 523276#factEXIT >#66#return; 523275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523266#factFINAL assume true; 523263#factEXIT >#66#return; 523262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523256#factFINAL assume true; 523252#factEXIT >#66#return; 523254#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 525767#factFINAL assume true; 523173#factEXIT >#70#return; 523216#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 523715#factENTRY ~n := #in~n; 523496#L25 assume !(~n <= 0); 523140#L26 call #t~ret0 := fact(~n - 1);< 523301#factENTRY ~n := #in~n; 523732#L25 assume ~n <= 0;#res := 1; 523730#factFINAL assume true; 523718#factEXIT >#66#return; 523717#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523716#factFINAL assume true; 523712#factEXIT >#72#return; 523165#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 523773#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 523750#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 523749#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 523747#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 522836#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 523300#factENTRY ~n := #in~n; 523305#L25 assume !(~n <= 0); 523138#L26 call #t~ret0 := fact(~n - 1);< 523150#factENTRY ~n := #in~n; 523579#L25 assume !(~n <= 0); 523136#L26 call #t~ret0 := fact(~n - 1);< 523255#factENTRY ~n := #in~n; 523279#L25 assume !(~n <= 0); 523132#L26 call #t~ret0 := fact(~n - 1);< 523277#factENTRY ~n := #in~n; 523279#L25 assume !(~n <= 0); 523132#L26 call #t~ret0 := fact(~n - 1);< 523277#factENTRY ~n := #in~n; 523280#L25 assume ~n <= 0;#res := 1; 523278#factFINAL assume true; 523276#factEXIT >#66#return; 523275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523266#factFINAL assume true; 523263#factEXIT >#66#return; 523262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523256#factFINAL assume true; 523252#factEXIT >#66#return; 523146#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523240#factFINAL assume true; 523131#factEXIT >#66#return; 523147#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523289#factFINAL assume true; 523299#factEXIT >#68#return; 523185#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 523217#factENTRY ~n := #in~n; 523303#L25 assume !(~n <= 0); 523145#L26 call #t~ret0 := fact(~n - 1);< 523301#factENTRY ~n := #in~n; 523279#L25 assume !(~n <= 0); 523132#L26 call #t~ret0 := fact(~n - 1);< 523277#factENTRY ~n := #in~n; 523279#L25 assume !(~n <= 0); 523132#L26 call #t~ret0 := fact(~n - 1);< 523277#factENTRY ~n := #in~n; 523279#L25 assume !(~n <= 0); 523132#L26 call #t~ret0 := fact(~n - 1);< 523277#factENTRY ~n := #in~n; 523280#L25 assume ~n <= 0;#res := 1; 523278#factFINAL assume true; 523276#factEXIT >#66#return; 523275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523266#factFINAL assume true; 523263#factEXIT >#66#return; 523262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523256#factFINAL assume true; 523252#factEXIT >#66#return; 523146#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523240#factFINAL assume true; 523131#factEXIT >#66#return; 523147#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 523289#factFINAL assume true; 523299#factEXIT >#70#return; 523159#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 523170#factENTRY ~n := #in~n; 523172#L25 assume ~n <= 0;#res := 1; 523171#factFINAL assume true; 523154#factEXIT >#72#return; 523166#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 523492#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 523487#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 523488#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 522835#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 522778#L30-5 [2022-11-25 17:06:11,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:11,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1186366490, now seen corresponding path program 33 times [2022-11-25 17:06:11,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:11,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879355061] [2022-11-25 17:06:11,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:11,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:11,680 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:06:11,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [511121761] [2022-11-25 17:06:11,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:06:11,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:06:11,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:11,682 INFO L229 MonitoredProcess]: Starting monitored process 313 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:06:11,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (313)] Waiting until timeout for monitored process [2022-11-25 17:06:11,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-25 17:06:11,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:06:11,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:06:11,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:12,068 INFO L134 CoverageAnalysis]: Checked inductivity of 32591 backedges. 373 proven. 48 refuted. 0 times theorem prover too weak. 32170 trivial. 0 not checked. [2022-11-25 17:06:12,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:06:12,661 INFO L134 CoverageAnalysis]: Checked inductivity of 32591 backedges. 373 proven. 48 refuted. 0 times theorem prover too weak. 32170 trivial. 0 not checked. [2022-11-25 17:06:12,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:12,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879355061] [2022-11-25 17:06:12,662 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:06:12,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511121761] [2022-11-25 17:06:12,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511121761] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:06:12,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:06:12,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-11-25 17:06:12,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195231685] [2022-11-25 17:06:12,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:06:12,664 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 17:06:12,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:12,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1979185192, now seen corresponding path program 29 times [2022-11-25 17:06:12,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:12,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026665977] [2022-11-25 17:06:12,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:12,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:12,678 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:06:12,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1838941781] [2022-11-25 17:06:12,678 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 17:06:12,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:06:12,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:12,687 INFO L229 MonitoredProcess]: Starting monitored process 314 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:06:12,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (314)] Waiting until timeout for monitored process [2022-11-25 17:06:13,018 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2022-11-25 17:06:13,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:06:13,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-25 17:06:13,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:13,310 INFO L134 CoverageAnalysis]: Checked inductivity of 11297 backedges. 5816 proven. 641 refuted. 0 times theorem prover too weak. 4840 trivial. 0 not checked. [2022-11-25 17:06:13,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:06:14,890 INFO L134 CoverageAnalysis]: Checked inductivity of 11297 backedges. 797 proven. 1416 refuted. 0 times theorem prover too weak. 9084 trivial. 0 not checked. [2022-11-25 17:06:14,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:14,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026665977] [2022-11-25 17:06:14,891 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:06:14,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838941781] [2022-11-25 17:06:14,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838941781] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:06:14,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:06:14,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 24] total 31 [2022-11-25 17:06:14,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817368591] [2022-11-25 17:06:14,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:06:14,892 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 17:06:14,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:14,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-25 17:06:14,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2022-11-25 17:06:14,893 INFO L87 Difference]: Start difference. First operand 4177 states and 5861 transitions. cyclomatic complexity: 1759 Second operand has 31 states, 27 states have (on average 3.037037037037037) internal successors, (82), 31 states have internal predecessors, (82), 19 states have call successors, (38), 2 states have call predecessors, (38), 10 states have return successors, (42), 15 states have call predecessors, (42), 19 states have call successors, (42) [2022-11-25 17:06:18,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:18,072 INFO L93 Difference]: Finished difference Result 6536 states and 10138 transitions. [2022-11-25 17:06:18,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6536 states and 10138 transitions. [2022-11-25 17:06:18,098 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 834 [2022-11-25 17:06:18,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6536 states to 6430 states and 9975 transitions. [2022-11-25 17:06:18,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 345 [2022-11-25 17:06:18,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 345 [2022-11-25 17:06:18,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6430 states and 9975 transitions. [2022-11-25 17:06:18,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 17:06:18,134 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6430 states and 9975 transitions. [2022-11-25 17:06:18,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6430 states and 9975 transitions. [2022-11-25 17:06:18,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6430 to 4901. [2022-11-25 17:06:18,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4901 states, 3117 states have (on average 1.068976580044915) internal successors, (3332), 3153 states have internal predecessors, (3332), 1089 states have call successors, (1228), 477 states have call predecessors, (1228), 695 states have return successors, (2785), 1270 states have call predecessors, (2785), 1089 states have call successors, (2785) [2022-11-25 17:06:18,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4901 states to 4901 states and 7345 transitions. [2022-11-25 17:06:18,216 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4901 states and 7345 transitions. [2022-11-25 17:06:18,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-25 17:06:18,217 INFO L428 stractBuchiCegarLoop]: Abstraction has 4901 states and 7345 transitions. [2022-11-25 17:06:18,217 INFO L335 stractBuchiCegarLoop]: ======== Iteration 50 ============ [2022-11-25 17:06:18,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4901 states and 7345 transitions. [2022-11-25 17:06:18,226 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 567 [2022-11-25 17:06:18,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:06:18,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:06:18,229 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [118, 118, 70, 70, 70, 70, 48, 17, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 3, 3, 1, 1, 1, 1] [2022-11-25 17:06:18,229 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [70, 70, 52, 52, 52, 52, 18, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:18,230 INFO L748 eck$LassoCheckResult]: Stem: 540578#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 540553#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; 540554#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 540577#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; 540566#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 540567#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 543209#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 543207#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 543208#factENTRY ~n := #in~n; 543211#L25 assume ~n <= 0;#res := 1; 543210#factFINAL assume true; 543206#factEXIT >#68#return; 543204#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 543205#factENTRY ~n := #in~n; 543213#L25 assume ~n <= 0;#res := 1; 543212#factFINAL assume true; 543203#factEXIT >#70#return; 543201#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 543202#factENTRY ~n := #in~n; 543215#L25 assume ~n <= 0;#res := 1; 543214#factFINAL assume true; 543200#factEXIT >#72#return; 543198#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 543197#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 543196#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 543194#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 543193#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 543089#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 543090#factENTRY ~n := #in~n; 543113#L25 assume !(~n <= 0); 543108#L26 call #t~ret0 := fact(~n - 1);< 543110#factENTRY ~n := #in~n; 543183#L25 assume ~n <= 0;#res := 1; 543182#factFINAL assume true; 543181#factEXIT >#66#return; 543178#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 543174#factFINAL assume true; 543170#factEXIT >#74#return; 543086#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 543087#factENTRY ~n := #in~n; 543179#L25 assume ~n <= 0;#res := 1; 543180#factFINAL assume true; 543168#factEXIT >#76#return; 543071#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 543073#factENTRY ~n := #in~n; 543236#L25 assume !(~n <= 0); 543232#L26 call #t~ret0 := fact(~n - 1);< 543233#factENTRY ~n := #in~n; 543237#L25 assume ~n <= 0;#res := 1; 543235#factFINAL assume true; 543231#factEXIT >#66#return; 543164#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 543082#factFINAL assume true; 543069#factEXIT >#78#return; 543067#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; 543062#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 543060#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 543058#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 543057#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 543029#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 543056#factENTRY ~n := #in~n; 543068#L25 assume !(~n <= 0); 543065#L26 call #t~ret0 := fact(~n - 1);< 543066#factENTRY ~n := #in~n; 543146#L25 assume !(~n <= 0); 543064#L26 call #t~ret0 := fact(~n - 1);< 543144#factENTRY ~n := #in~n; 543150#L25 assume ~n <= 0;#res := 1; 543149#factFINAL assume true; 543143#factEXIT >#66#return; 543142#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 543141#factFINAL assume true; 543063#factEXIT >#66#return; 543061#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 543059#factFINAL assume true; 543055#factEXIT >#74#return; 543053#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 543054#factENTRY ~n := #in~n; 543133#L25 assume ~n <= 0;#res := 1; 543134#factFINAL assume true; 543266#factEXIT >#76#return; 542962#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 543014#factENTRY ~n := #in~n; 543015#L25 assume !(~n <= 0); 542938#L26 call #t~ret0 := fact(~n - 1);< 542957#factENTRY ~n := #in~n; 542958#L25 assume !(~n <= 0); 542934#L26 call #t~ret0 := fact(~n - 1);< 542970#factENTRY ~n := #in~n; 543033#L25 assume ~n <= 0;#res := 1; 543032#factFINAL assume true; 542969#factEXIT >#66#return; 542964#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 542961#factFINAL assume true; 542955#factEXIT >#66#return; 542941#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 543412#factFINAL assume true; 543405#factEXIT >#78#return; 543403#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; 543402#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 543401#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 542885#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 542819#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 542816#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 542818#factENTRY ~n := #in~n; 542817#L25 assume !(~n <= 0); 542814#L26 call #t~ret0 := fact(~n - 1);< 542815#factENTRY ~n := #in~n; 542813#L25 assume !(~n <= 0); 542809#L26 call #t~ret0 := fact(~n - 1);< 542812#factENTRY ~n := #in~n; 542813#L25 assume !(~n <= 0); 542809#L26 call #t~ret0 := fact(~n - 1);< 542812#factENTRY ~n := #in~n; 542808#L25 assume ~n <= 0;#res := 1; 542810#factFINAL assume true; 542830#factEXIT >#66#return; 542829#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 542828#factFINAL assume true; 542827#factEXIT >#66#return; 542826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 542825#factFINAL assume true; 542824#factEXIT >#66#return; 542823#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 542822#factFINAL assume true; 542821#factEXIT >#74#return; 542598#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 542599#factENTRY ~n := #in~n; 542629#L25 assume ~n <= 0;#res := 1; 542630#factFINAL assume true; 542597#factEXIT >#76#return; 540646#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 542736#factENTRY ~n := #in~n; 542735#L25 assume !(~n <= 0); 542694#L26 call #t~ret0 := fact(~n - 1);< 542734#factENTRY ~n := #in~n; 542733#L25 assume !(~n <= 0); 542691#L26 call #t~ret0 := fact(~n - 1);< 542699#factENTRY ~n := #in~n; 542666#L25 assume !(~n <= 0); 542693#L26 call #t~ret0 := fact(~n - 1);< 542730#factENTRY ~n := #in~n; 542732#L25 assume ~n <= 0;#res := 1; 542731#factFINAL assume true; 542729#factEXIT >#66#return; 542728#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 542727#factFINAL assume true; 542726#factEXIT >#66#return; 542724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 542723#factFINAL assume true; 542720#factEXIT >#66#return; 542695#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 542750#factFINAL assume true; 540644#factEXIT >#78#return; 540642#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; 540643#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 540638#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 540639#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 541639#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 540568#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 540569#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 541638#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 541541#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 541544#factENTRY ~n := #in~n; 541566#L25 assume !(~n <= 0); 541564#L26 call #t~ret0 := fact(~n - 1);< 541565#factENTRY ~n := #in~n; 541570#L25 assume ~n <= 0;#res := 1; 541567#factFINAL assume true; 541563#factEXIT >#66#return; 541562#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 541550#factFINAL assume true; 541540#factEXIT >#68#return; 541535#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 541538#factENTRY ~n := #in~n; 541546#L25 assume ~n <= 0;#res := 1; 541539#factFINAL assume true; 541534#factEXIT >#70#return; 541526#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 541531#factENTRY ~n := #in~n; 541545#L25 assume !(~n <= 0); 541464#L26 call #t~ret0 := fact(~n - 1);< 541469#factENTRY ~n := #in~n; 541521#L25 assume ~n <= 0;#res := 1; 541516#factFINAL assume true; 541508#factEXIT >#66#return; 541513#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 541532#factFINAL assume true; 541525#factEXIT >#72#return; 541530#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 541713#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 541712#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 541711#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 541710#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 541502#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 541504#factENTRY ~n := #in~n; 541522#L25 assume !(~n <= 0); 541509#L26 call #t~ret0 := fact(~n - 1);< 541518#factENTRY ~n := #in~n; 541521#L25 assume ~n <= 0;#res := 1; 541516#factFINAL assume true; 541508#factEXIT >#66#return; 541511#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 541506#factFINAL assume true; 541500#factEXIT >#68#return; 541494#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 541496#factENTRY ~n := #in~n; 541519#L25 assume !(~n <= 0); 541460#L26 call #t~ret0 := fact(~n - 1);< 541469#factENTRY ~n := #in~n; 541521#L25 assume ~n <= 0;#res := 1; 541516#factFINAL assume true; 541508#factEXIT >#66#return; 541505#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 541499#factFINAL assume true; 541492#factEXIT >#70#return; 541485#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 541489#factENTRY ~n := #in~n; 541498#L25 assume ~n <= 0;#res := 1; 541491#factFINAL assume true; 541483#factEXIT >#72#return; 541488#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 541686#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 541656#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 541657#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 541604#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 541446#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 541449#factENTRY ~n := #in~n; 541475#L25 assume !(~n <= 0); 541465#L26 call #t~ret0 := fact(~n - 1);< 541469#factENTRY ~n := #in~n; 542559#L25 assume !(~n <= 0); 541461#L26 call #t~ret0 := fact(~n - 1);< 541482#factENTRY ~n := #in~n; 541497#L25 assume ~n <= 0;#res := 1; 541490#factFINAL assume true; 541480#factEXIT >#66#return; 541477#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 541471#factFINAL assume true; 541459#factEXIT >#66#return; 541456#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 541452#factFINAL assume true; 541444#factEXIT >#74#return; 541385#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 541386#factENTRY ~n := #in~n; 541589#L25 assume !(~n <= 0); 541579#L26 call #t~ret0 := fact(~n - 1);< 541662#factENTRY ~n := #in~n; 541659#L25 assume ~n <= 0;#res := 1; 541660#factFINAL assume true; 541578#factEXIT >#66#return; 541576#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 541577#factFINAL assume true; 541383#factEXIT >#76#return; 541376#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 541381#factENTRY ~n := #in~n; 541425#L25 assume !(~n <= 0); 541407#L26 call #t~ret0 := fact(~n - 1);< 541416#factENTRY ~n := #in~n; 541427#L25 assume ~n <= 0;#res := 1; 541418#factFINAL assume true; 541402#factEXIT >#66#return; 541399#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 541398#factFINAL assume true; 541375#factEXIT >#78#return; 541379#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; 541845#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 541843#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 541840#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 541076#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 541013#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 541066#factENTRY ~n := #in~n; 541064#L25 assume !(~n <= 0); 541053#L26 call #t~ret0 := fact(~n - 1);< 541056#factENTRY ~n := #in~n; 541063#L25 assume !(~n <= 0); 541051#L26 call #t~ret0 := fact(~n - 1);< 541061#factENTRY ~n := #in~n; 541063#L25 assume !(~n <= 0); 541051#L26 call #t~ret0 := fact(~n - 1);< 541061#factENTRY ~n := #in~n; 541070#L25 assume ~n <= 0;#res := 1; 541068#factFINAL assume true; 541067#factEXIT >#66#return; 541065#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 541062#factFINAL assume true; 541060#factEXIT >#66#return; 541059#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 541057#factFINAL assume true; 541050#factEXIT >#66#return; 541054#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 541304#factFINAL assume true; 541012#factEXIT >#74#return; 540999#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 541005#factENTRY ~n := #in~n; 541003#L25 assume !(~n <= 0); 540961#L26 call #t~ret0 := fact(~n - 1);< 540994#factENTRY ~n := #in~n; 540981#L25 assume ~n <= 0;#res := 1; 540982#factFINAL assume true; 540959#factEXIT >#66#return; 540965#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 541301#factFINAL assume true; 541279#factEXIT >#76#return; 540938#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 540934#factENTRY ~n := #in~n; 540968#L25 assume !(~n <= 0); 540966#L26 call #t~ret0 := fact(~n - 1);< 540967#factENTRY ~n := #in~n; 540995#L25 assume !(~n <= 0); 540975#L26 call #t~ret0 := fact(~n - 1);< 540997#factENTRY ~n := #in~n; 541004#L25 assume ~n <= 0;#res := 1; 541002#factFINAL assume true; 540996#factEXIT >#66#return; 540983#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 540971#factFINAL assume true; 540976#factEXIT >#66#return; 541006#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 540937#factFINAL assume true; 540939#factEXIT >#78#return; 540929#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; 540928#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 540927#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 540926#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 540925#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 540921#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 540920#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 540918#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 540818#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 540820#factENTRY ~n := #in~n; 540828#L25 assume !(~n <= 0); 540824#L26 call #t~ret0 := fact(~n - 1);< 540826#factENTRY ~n := #in~n; 540832#L25 assume !(~n <= 0); 540825#L26 call #t~ret0 := fact(~n - 1);< 540831#factENTRY ~n := #in~n; 540835#L25 assume ~n <= 0;#res := 1; 540834#factFINAL assume true; 540830#factEXIT >#66#return; 540829#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 540827#factFINAL assume true; 540823#factEXIT >#66#return; 540822#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 540821#factFINAL assume true; 540817#factEXIT >#68#return; 540812#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 540814#factENTRY ~n := #in~n; 540816#L25 assume ~n <= 0;#res := 1; 540815#factFINAL assume true; 540811#factEXIT >#70#return; 540800#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 540808#factENTRY ~n := #in~n; 540804#L25 assume !(~n <= 0); 540793#L26 call #t~ret0 := fact(~n - 1);< 540801#factENTRY ~n := #in~n; 542252#L25 assume !(~n <= 0); 540794#L26 call #t~ret0 := fact(~n - 1);< 542251#factENTRY ~n := #in~n; 540810#L25 assume ~n <= 0;#res := 1; 540809#factFINAL assume true; 540805#factEXIT >#66#return; 540802#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 540798#factFINAL assume true; 540791#factEXIT >#66#return; 540796#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 540911#factFINAL assume true; 540910#factEXIT >#72#return; 540908#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 540906#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 540904#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 540902#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 540899#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 540784#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 540788#factENTRY ~n := #in~n; 540803#L25 assume !(~n <= 0); 540792#L26 call #t~ret0 := fact(~n - 1);< 540797#factENTRY ~n := #in~n; 540992#L25 assume !(~n <= 0); 540806#L26 call #t~ret0 := fact(~n - 1);< 540807#factENTRY ~n := #in~n; 540810#L25 assume ~n <= 0;#res := 1; 540809#factFINAL assume true; 540805#factEXIT >#66#return; 540802#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 540798#factFINAL assume true; 540791#factEXIT >#66#return; 540790#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 540789#factFINAL assume true; 540781#factEXIT >#68#return; 540787#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 540885#factENTRY ~n := #in~n; 540901#L25 assume !(~n <= 0); 540795#L26 call #t~ret0 := fact(~n - 1);< 540893#factENTRY ~n := #in~n; 540895#L25 assume ~n <= 0;#res := 1; 540892#factFINAL assume true; 540888#factEXIT >#66#return; 540890#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 540887#factFINAL assume true; 540884#factEXIT >#70#return; 540880#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 540882#factENTRY ~n := #in~n; 540894#L25 assume !(~n <= 0); 540889#L26 call #t~ret0 := fact(~n - 1);< 540891#factENTRY ~n := #in~n; 540895#L25 assume ~n <= 0;#res := 1; 540892#factFINAL assume true; 540888#factEXIT >#66#return; 540886#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 540883#factFINAL assume true; 540879#factEXIT >#72#return; 540878#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 540876#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 540874#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 540872#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 540862#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 540785#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 540788#factENTRY ~n := #in~n; 540803#L25 assume !(~n <= 0); 540792#L26 call #t~ret0 := fact(~n - 1);< 540797#factENTRY ~n := #in~n; 540992#L25 assume !(~n <= 0); 540806#L26 call #t~ret0 := fact(~n - 1);< 540807#factENTRY ~n := #in~n; 540810#L25 assume ~n <= 0;#res := 1; 540809#factFINAL assume true; 540805#factEXIT >#66#return; 540802#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 540798#factFINAL assume true; 540791#factEXIT >#66#return; 540790#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 540789#factFINAL assume true; 540781#factEXIT >#68#return; 540762#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 540764#factENTRY ~n := #in~n; 540775#L25 assume !(~n <= 0); 540769#L26 call #t~ret0 := fact(~n - 1);< 540772#factENTRY ~n := #in~n; 540777#L25 assume !(~n <= 0); 540768#L26 call #t~ret0 := fact(~n - 1);< 540774#factENTRY ~n := #in~n; 540780#L25 assume ~n <= 0;#res := 1; 540779#factFINAL assume true; 540778#factEXIT >#66#return; 540776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 540773#factFINAL assume true; 540767#factEXIT >#66#return; 540766#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 540765#factFINAL assume true; 540761#factEXIT >#70#return; 540755#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 540758#factENTRY ~n := #in~n; 540760#L25 assume ~n <= 0;#res := 1; 540759#factFINAL assume true; 540754#factEXIT >#72#return; 540748#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 540749#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 540740#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 540741#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 540702#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 540698#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 540699#factENTRY ~n := #in~n; 540712#L25 assume !(~n <= 0); 540708#L26 call #t~ret0 := fact(~n - 1);< 540709#factENTRY ~n := #in~n; 540720#L25 assume !(~n <= 0); 540707#L26 call #t~ret0 := fact(~n - 1);< 540717#factENTRY ~n := #in~n; 540720#L25 assume !(~n <= 0); 540707#L26 call #t~ret0 := fact(~n - 1);< 540717#factENTRY ~n := #in~n; 540730#L25 assume ~n <= 0;#res := 1; 540728#factFINAL assume true; 540726#factEXIT >#66#return; 540722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 540719#factFINAL assume true; 540716#factEXIT >#66#return; 540714#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 540711#factFINAL assume true; 540706#factEXIT >#66#return; 540704#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 540701#factFINAL assume true; 540697#factEXIT >#74#return; 540694#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 540695#factENTRY ~n := #in~n; 542668#L25 assume !(~n <= 0); 542624#L26 call #t~ret0 := fact(~n - 1);< 542626#factENTRY ~n := #in~n; 543418#L25 assume !(~n <= 0); 542623#L26 call #t~ret0 := fact(~n - 1);< 543417#factENTRY ~n := #in~n; 543430#L25 assume ~n <= 0;#res := 1; 543429#factFINAL assume true; 543428#factEXIT >#66#return; 542625#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 543416#factFINAL assume true; 542622#factEXIT >#66#return; 542621#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 542617#factFINAL assume true; 540693#factEXIT >#76#return; 540624#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 540686#factENTRY ~n := #in~n; 540682#L25 assume !(~n <= 0); 540658#L26 call #t~ret0 := fact(~n - 1);< 540663#factENTRY ~n := #in~n; 540858#L25 assume ~n <= 0;#res := 1; 540833#factFINAL assume true; 540657#factEXIT >#66#return; 540662#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 540746#factFINAL assume true; 540623#factEXIT >#78#return; 540621#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; 540622#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 540617#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 540618#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 540613#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 540614#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 540922#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 540579#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 540560#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 543455#factENTRY ~n := #in~n; 543456#L25 assume !(~n <= 0); 540559#L26 call #t~ret0 := fact(~n - 1);< 540562#factENTRY ~n := #in~n; 543649#L25 assume !(~n <= 0); 540589#L26 call #t~ret0 := fact(~n - 1);< 543648#factENTRY ~n := #in~n; 543649#L25 assume !(~n <= 0); 540589#L26 call #t~ret0 := fact(~n - 1);< 543648#factENTRY ~n := #in~n; 540588#L25 assume ~n <= 0;#res := 1; 540590#factFINAL assume true; 544793#factEXIT >#66#return; 544792#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544791#factFINAL assume true; 544790#factEXIT >#66#return; 544789#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544788#factFINAL assume true; 544786#factEXIT >#66#return; 544787#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 545041#factFINAL assume true; 545028#factEXIT >#68#return; 543639#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 540594#factENTRY ~n := #in~n; 543647#L25 assume ~n <= 0;#res := 1; 544772#factFINAL assume true; 544771#factEXIT >#70#return; 540528#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 540529#factENTRY ~n := #in~n; 544781#L25 assume !(~n <= 0); 544277#L26 call #t~ret0 := fact(~n - 1);< 544316#factENTRY ~n := #in~n; 544388#L25 assume !(~n <= 0); 544278#L26 call #t~ret0 := fact(~n - 1);< 544313#factENTRY ~n := #in~n; 544380#L25 assume !(~n <= 0); 544274#L26 call #t~ret0 := fact(~n - 1);< 544355#factENTRY ~n := #in~n; 544382#L25 assume ~n <= 0;#res := 1; 544379#factFINAL assume true; 544353#factEXIT >#66#return; 544350#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544325#factFINAL assume true; 544318#factEXIT >#66#return; 544317#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544315#factFINAL assume true; 544308#factEXIT >#66#return; 544312#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 545252#factFINAL assume true; 545251#factEXIT >#72#return; 544767#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 545248#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 545249#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 545244#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 545245#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 544545#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 544609#factENTRY ~n := #in~n; 544608#L25 assume !(~n <= 0); 544271#L26 call #t~ret0 := fact(~n - 1);< 544316#factENTRY ~n := #in~n; 544388#L25 assume !(~n <= 0); 544278#L26 call #t~ret0 := fact(~n - 1);< 544313#factENTRY ~n := #in~n; 544380#L25 assume !(~n <= 0); 544274#L26 call #t~ret0 := fact(~n - 1);< 544355#factENTRY ~n := #in~n; 544382#L25 assume ~n <= 0;#res := 1; 544379#factFINAL assume true; 544353#factEXIT >#66#return; 544350#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544325#factFINAL assume true; 544318#factEXIT >#66#return; 544317#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544315#factFINAL assume true; 544308#factEXIT >#66#return; 544311#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544667#factFINAL assume true; 544659#factEXIT >#68#return; 544481#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 544599#factENTRY ~n := #in~n; 544610#L25 assume !(~n <= 0); 544268#L26 call #t~ret0 := fact(~n - 1);< 544665#factENTRY ~n := #in~n; 544691#L25 assume ~n <= 0;#res := 1; 544668#factFINAL assume true; 544662#factEXIT >#66#return; 544664#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 545014#factFINAL assume true; 544754#factEXIT >#70#return; 544343#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 544473#factENTRY ~n := #in~n; 544409#L25 assume !(~n <= 0); 544321#L26 call #t~ret0 := fact(~n - 1);< 544346#factENTRY ~n := #in~n; 544381#L25 assume !(~n <= 0); 544354#L26 call #t~ret0 := fact(~n - 1);< 544356#factENTRY ~n := #in~n; 544382#L25 assume ~n <= 0;#res := 1; 544379#factFINAL assume true; 544353#factEXIT >#66#return; 544350#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544325#factFINAL assume true; 544318#factEXIT >#66#return; 544322#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 545012#factFINAL assume true; 544711#factEXIT >#72#return; 544725#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 545395#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 545394#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 545393#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 545392#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 544372#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 544378#factENTRY ~n := #in~n; 544376#L25 assume !(~n <= 0); 544292#L26 call #t~ret0 := fact(~n - 1);< 544352#factENTRY ~n := #in~n; 544348#L25 assume !(~n <= 0); 544310#L26 call #t~ret0 := fact(~n - 1);< 544314#factENTRY ~n := #in~n; 544349#L25 assume !(~n <= 0); 544319#L26 call #t~ret0 := fact(~n - 1);< 544324#factENTRY ~n := #in~n; 544382#L25 assume ~n <= 0;#res := 1; 544379#factFINAL assume true; 544353#factEXIT >#66#return; 544350#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544325#factFINAL assume true; 544318#factEXIT >#66#return; 544317#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544315#factFINAL assume true; 544308#factEXIT >#66#return; 544311#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544667#factFINAL assume true; 544659#factEXIT >#68#return; 544487#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 544689#factENTRY ~n := #in~n; 544688#L25 assume !(~n <= 0); 544280#L26 call #t~ret0 := fact(~n - 1);< 544313#factENTRY ~n := #in~n; 544380#L25 assume !(~n <= 0); 544274#L26 call #t~ret0 := fact(~n - 1);< 544355#factENTRY ~n := #in~n; 544382#L25 assume ~n <= 0;#res := 1; 544379#factFINAL assume true; 544353#factEXIT >#66#return; 544350#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544325#factFINAL assume true; 544318#factEXIT >#66#return; 544323#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544738#factFINAL assume true; 544737#factEXIT >#70#return; 544416#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 544413#factENTRY ~n := #in~n; 544420#L25 assume !(~n <= 0); 544320#L26 call #t~ret0 := fact(~n - 1);< 544666#factENTRY ~n := #in~n; 544691#L25 assume ~n <= 0;#res := 1; 544668#factFINAL assume true; 544662#factEXIT >#66#return; 544661#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544658#factFINAL assume true; 544641#factEXIT >#72#return; 544653#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 545379#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 545371#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 545358#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 545357#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 544366#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 544378#factENTRY ~n := #in~n; 544376#L25 assume !(~n <= 0); 544292#L26 call #t~ret0 := fact(~n - 1);< 544352#factENTRY ~n := #in~n; 544348#L25 assume !(~n <= 0); 544310#L26 call #t~ret0 := fact(~n - 1);< 544314#factENTRY ~n := #in~n; 544349#L25 assume !(~n <= 0); 544319#L26 call #t~ret0 := fact(~n - 1);< 544324#factENTRY ~n := #in~n; 544381#L25 assume !(~n <= 0); 544354#L26 call #t~ret0 := fact(~n - 1);< 544356#factENTRY ~n := #in~n; 544382#L25 assume ~n <= 0;#res := 1; 544379#factFINAL assume true; 544353#factEXIT >#66#return; 544350#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544325#factFINAL assume true; 544318#factEXIT >#66#return; 544317#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544315#factFINAL assume true; 544308#factEXIT >#66#return; 544307#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544294#factFINAL assume true; 544290#factEXIT >#66#return; 544293#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544607#factFINAL assume true; 544474#factEXIT >#68#return; 544516#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 544689#factENTRY ~n := #in~n; 544688#L25 assume !(~n <= 0); 544280#L26 call #t~ret0 := fact(~n - 1);< 544313#factENTRY ~n := #in~n; 544380#L25 assume !(~n <= 0); 544274#L26 call #t~ret0 := fact(~n - 1);< 544355#factENTRY ~n := #in~n; 544380#L25 assume !(~n <= 0); 544274#L26 call #t~ret0 := fact(~n - 1);< 544355#factENTRY ~n := #in~n; 544380#L25 assume !(~n <= 0); 544274#L26 call #t~ret0 := fact(~n - 1);< 544355#factENTRY ~n := #in~n; 544382#L25 assume ~n <= 0;#res := 1; 544379#factFINAL assume true; 544353#factEXIT >#66#return; 544350#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544325#factFINAL assume true; 544318#factEXIT >#66#return; 544317#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544315#factFINAL assume true; 544308#factEXIT >#66#return; 544307#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544294#factFINAL assume true; 544290#factEXIT >#66#return; 544293#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544607#factFINAL assume true; 544474#factEXIT >#70#return; 544424#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 544470#factENTRY ~n := #in~n; 544472#L25 assume ~n <= 0;#res := 1; 544471#factFINAL assume true; 544422#factEXIT >#72#return; 544448#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 545355#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 545354#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 545353#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 545352#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 540515#L30-5 [2022-11-25 17:06:18,231 INFO L750 eck$LassoCheckResult]: Loop: 540515#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 540516#factENTRY ~n := #in~n; 543487#L25 assume !(~n <= 0); 543483#L26 call #t~ret0 := fact(~n - 1);< 543486#factENTRY ~n := #in~n; 543503#L25 assume !(~n <= 0); 543484#L26 call #t~ret0 := fact(~n - 1);< 543501#factENTRY ~n := #in~n; 543502#L25 assume !(~n <= 0); 543482#L26 call #t~ret0 := fact(~n - 1);< 543510#factENTRY ~n := #in~n; 543502#L25 assume !(~n <= 0); 543482#L26 call #t~ret0 := fact(~n - 1);< 543510#factENTRY ~n := #in~n; 543515#L25 assume ~n <= 0;#res := 1; 543514#factFINAL assume true; 543513#factEXIT >#66#return; 543512#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 543511#factFINAL assume true; 543509#factEXIT >#66#return; 543508#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 543507#factFINAL assume true; 543506#factEXIT >#66#return; 543485#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 543500#factFINAL assume true; 543481#factEXIT >#66#return; 543480#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 543479#factFINAL assume true; 543478#factEXIT >#74#return; 540597#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 540598#factENTRY ~n := #in~n; 543524#L25 assume !(~n <= 0); 543521#L26 call #t~ret0 := fact(~n - 1);< 543523#factENTRY ~n := #in~n; 543554#L25 assume !(~n <= 0); 543520#L26 call #t~ret0 := fact(~n - 1);< 543553#factENTRY ~n := #in~n; 543554#L25 assume !(~n <= 0); 543520#L26 call #t~ret0 := fact(~n - 1);< 543553#factENTRY ~n := #in~n; 543563#L25 assume ~n <= 0;#res := 1; 543666#factFINAL assume true; 543665#factEXIT >#66#return; 543664#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 543663#factFINAL assume true; 543662#factEXIT >#66#return; 543522#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 543552#factFINAL assume true; 543519#factEXIT >#66#return; 543518#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 543517#factFINAL assume true; 543516#factEXIT >#76#return; 543451#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 543450#factENTRY ~n := #in~n; 543452#L25 assume !(~n <= 0); 543444#L26 call #t~ret0 := fact(~n - 1);< 543475#factENTRY ~n := #in~n; 543472#L25 assume ~n <= 0;#res := 1; 543457#factFINAL assume true; 543443#factEXIT >#66#return; 543446#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 545229#factFINAL assume true; 545228#factEXIT >#78#return; 540555#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; 540556#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 540564#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 540601#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 540573#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 540574#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 540606#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 540607#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 540534#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 540535#factENTRY ~n := #in~n; 543453#L25 assume !(~n <= 0); 540539#L26 call #t~ret0 := fact(~n - 1);< 540538#factENTRY ~n := #in~n; 540540#L25 assume !(~n <= 0); 543650#L26 call #t~ret0 := fact(~n - 1);< 543651#factENTRY ~n := #in~n; 543649#L25 assume !(~n <= 0); 540589#L26 call #t~ret0 := fact(~n - 1);< 543648#factENTRY ~n := #in~n; 543649#L25 assume !(~n <= 0); 540589#L26 call #t~ret0 := fact(~n - 1);< 543648#factENTRY ~n := #in~n; 540588#L25 assume ~n <= 0;#res := 1; 540590#factFINAL assume true; 544793#factEXIT >#66#return; 544792#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544791#factFINAL assume true; 544790#factEXIT >#66#return; 544789#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544788#factFINAL assume true; 544786#factEXIT >#66#return; 544785#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544784#factFINAL assume true; 544782#factEXIT >#66#return; 544783#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 545163#factFINAL assume true; 545162#factEXIT >#68#return; 543641#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 540594#factENTRY ~n := #in~n; 543647#L25 assume ~n <= 0;#res := 1; 544772#factFINAL assume true; 544771#factEXIT >#70#return; 544393#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 544410#factENTRY ~n := #in~n; 544411#L25 assume !(~n <= 0); 544279#L26 call #t~ret0 := fact(~n - 1);< 544389#factENTRY ~n := #in~n; 544384#L25 assume !(~n <= 0); 544275#L26 call #t~ret0 := fact(~n - 1);< 544316#factENTRY ~n := #in~n; 544388#L25 assume !(~n <= 0); 544278#L26 call #t~ret0 := fact(~n - 1);< 544313#factENTRY ~n := #in~n; 544380#L25 assume !(~n <= 0); 544274#L26 call #t~ret0 := fact(~n - 1);< 544355#factENTRY ~n := #in~n; 544382#L25 assume ~n <= 0;#res := 1; 544379#factFINAL assume true; 544353#factEXIT >#66#return; 544350#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544325#factFINAL assume true; 544318#factEXIT >#66#return; 544317#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544315#factFINAL assume true; 544308#factEXIT >#66#return; 544307#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544294#factFINAL assume true; 544290#factEXIT >#66#return; 544284#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544778#factFINAL assume true; 544760#factEXIT >#72#return; 544766#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 545217#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 545216#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 545215#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 545214#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 544401#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 544421#factENTRY ~n := #in~n; 544399#L25 assume !(~n <= 0); 544266#L26 call #t~ret0 := fact(~n - 1);< 544389#factENTRY ~n := #in~n; 544384#L25 assume !(~n <= 0); 544275#L26 call #t~ret0 := fact(~n - 1);< 544316#factENTRY ~n := #in~n; 544388#L25 assume !(~n <= 0); 544278#L26 call #t~ret0 := fact(~n - 1);< 544313#factENTRY ~n := #in~n; 544380#L25 assume !(~n <= 0); 544274#L26 call #t~ret0 := fact(~n - 1);< 544355#factENTRY ~n := #in~n; 544380#L25 assume !(~n <= 0); 544274#L26 call #t~ret0 := fact(~n - 1);< 544355#factENTRY ~n := #in~n; 544382#L25 assume ~n <= 0;#res := 1; 544379#factFINAL assume true; 544353#factEXIT >#66#return; 544350#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544325#factFINAL assume true; 544318#factEXIT >#66#return; 544317#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544315#factFINAL assume true; 544308#factEXIT >#66#return; 544307#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544294#factFINAL assume true; 544290#factEXIT >#66#return; 544283#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544383#factFINAL assume true; 544265#factEXIT >#66#return; 544281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544600#factFINAL assume true; 544601#factEXIT >#68#return; 544588#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 544672#factENTRY ~n := #in~n; 544670#L25 assume !(~n <= 0); 544663#L26 call #t~ret0 := fact(~n - 1);< 544669#factENTRY ~n := #in~n; 544691#L25 assume ~n <= 0;#res := 1; 544668#factFINAL assume true; 544662#factEXIT >#66#return; 544664#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 545014#factFINAL assume true; 544754#factEXIT >#70#return; 540548#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 540531#factENTRY ~n := #in~n; 540552#L25 assume !(~n <= 0); 544276#L26 call #t~ret0 := fact(~n - 1);< 544316#factENTRY ~n := #in~n; 544388#L25 assume !(~n <= 0); 544278#L26 call #t~ret0 := fact(~n - 1);< 544313#factENTRY ~n := #in~n; 544380#L25 assume !(~n <= 0); 544274#L26 call #t~ret0 := fact(~n - 1);< 544355#factENTRY ~n := #in~n; 544382#L25 assume ~n <= 0;#res := 1; 544379#factFINAL assume true; 544353#factEXIT >#66#return; 544350#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544325#factFINAL assume true; 544318#factEXIT >#66#return; 544317#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544315#factFINAL assume true; 544308#factEXIT >#66#return; 544282#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 545033#factFINAL assume true; 544744#factEXIT >#72#return; 544747#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 545213#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 545212#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 545211#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 545164#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 544357#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 544377#factENTRY ~n := #in~n; 544375#L25 assume !(~n <= 0); 544291#L26 call #t~ret0 := fact(~n - 1);< 544351#factENTRY ~n := #in~n; 544347#L25 assume !(~n <= 0); 544309#L26 call #t~ret0 := fact(~n - 1);< 544314#factENTRY ~n := #in~n; 544349#L25 assume !(~n <= 0); 544319#L26 call #t~ret0 := fact(~n - 1);< 544324#factENTRY ~n := #in~n; 544381#L25 assume !(~n <= 0); 544354#L26 call #t~ret0 := fact(~n - 1);< 544356#factENTRY ~n := #in~n; 544382#L25 assume ~n <= 0;#res := 1; 544379#factFINAL assume true; 544353#factEXIT >#66#return; 544350#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544325#factFINAL assume true; 544318#factEXIT >#66#return; 544317#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544315#factFINAL assume true; 544308#factEXIT >#66#return; 544307#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544294#factFINAL assume true; 544290#factEXIT >#66#return; 544293#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544607#factFINAL assume true; 544474#factEXIT >#68#return; 544553#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 544689#factENTRY ~n := #in~n; 544688#L25 assume !(~n <= 0); 544280#L26 call #t~ret0 := fact(~n - 1);< 544313#factENTRY ~n := #in~n; 544380#L25 assume !(~n <= 0); 544274#L26 call #t~ret0 := fact(~n - 1);< 544355#factENTRY ~n := #in~n; 544382#L25 assume ~n <= 0;#res := 1; 544379#factFINAL assume true; 544353#factEXIT >#66#return; 544350#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544325#factFINAL assume true; 544318#factEXIT >#66#return; 544323#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544738#factFINAL assume true; 544737#factEXIT >#70#return; 544341#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 544473#factENTRY ~n := #in~n; 544409#L25 assume !(~n <= 0); 544321#L26 call #t~ret0 := fact(~n - 1);< 544346#factENTRY ~n := #in~n; 544381#L25 assume !(~n <= 0); 544354#L26 call #t~ret0 := fact(~n - 1);< 544356#factENTRY ~n := #in~n; 544382#L25 assume ~n <= 0;#res := 1; 544379#factFINAL assume true; 544353#factEXIT >#66#return; 544350#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544325#factFINAL assume true; 544318#factEXIT >#66#return; 544322#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 545012#factFINAL assume true; 544711#factEXIT >#72#return; 544715#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 545219#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 545218#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 545210#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 545201#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 544360#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 544377#factENTRY ~n := #in~n; 544375#L25 assume !(~n <= 0); 544291#L26 call #t~ret0 := fact(~n - 1);< 544351#factENTRY ~n := #in~n; 544347#L25 assume !(~n <= 0); 544309#L26 call #t~ret0 := fact(~n - 1);< 544314#factENTRY ~n := #in~n; 544349#L25 assume !(~n <= 0); 544319#L26 call #t~ret0 := fact(~n - 1);< 544324#factENTRY ~n := #in~n; 544381#L25 assume !(~n <= 0); 544354#L26 call #t~ret0 := fact(~n - 1);< 544356#factENTRY ~n := #in~n; 544382#L25 assume ~n <= 0;#res := 1; 544379#factFINAL assume true; 544353#factEXIT >#66#return; 544350#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544325#factFINAL assume true; 544318#factEXIT >#66#return; 544317#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544315#factFINAL assume true; 544308#factEXIT >#66#return; 544307#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544294#factFINAL assume true; 544290#factEXIT >#66#return; 544293#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544607#factFINAL assume true; 544474#factEXIT >#68#return; 544574#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 544689#factENTRY ~n := #in~n; 544688#L25 assume !(~n <= 0); 544280#L26 call #t~ret0 := fact(~n - 1);< 544313#factENTRY ~n := #in~n; 544380#L25 assume !(~n <= 0); 544274#L26 call #t~ret0 := fact(~n - 1);< 544355#factENTRY ~n := #in~n; 544380#L25 assume !(~n <= 0); 544274#L26 call #t~ret0 := fact(~n - 1);< 544355#factENTRY ~n := #in~n; 544380#L25 assume !(~n <= 0); 544274#L26 call #t~ret0 := fact(~n - 1);< 544355#factENTRY ~n := #in~n; 544380#L25 assume !(~n <= 0); 544274#L26 call #t~ret0 := fact(~n - 1);< 544355#factENTRY ~n := #in~n; 544382#L25 assume ~n <= 0;#res := 1; 544379#factFINAL assume true; 544353#factEXIT >#66#return; 544350#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544325#factFINAL assume true; 544318#factEXIT >#66#return; 544317#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544315#factFINAL assume true; 544308#factEXIT >#66#return; 544307#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544294#factFINAL assume true; 544290#factEXIT >#66#return; 544283#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544383#factFINAL assume true; 544265#factEXIT >#66#return; 544281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544600#factFINAL assume true; 544601#factEXIT >#70#return; 544419#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 544413#factENTRY ~n := #in~n; 544420#L25 assume !(~n <= 0); 544320#L26 call #t~ret0 := fact(~n - 1);< 544666#factENTRY ~n := #in~n; 544691#L25 assume ~n <= 0;#res := 1; 544668#factFINAL assume true; 544662#factEXIT >#66#return; 544661#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544658#factFINAL assume true; 544641#factEXIT >#72#return; 544458#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 545192#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 545190#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 545188#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 545172#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 544362#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 544377#factENTRY ~n := #in~n; 544375#L25 assume !(~n <= 0); 544291#L26 call #t~ret0 := fact(~n - 1);< 544351#factENTRY ~n := #in~n; 544347#L25 assume !(~n <= 0); 544309#L26 call #t~ret0 := fact(~n - 1);< 544314#factENTRY ~n := #in~n; 544349#L25 assume !(~n <= 0); 544319#L26 call #t~ret0 := fact(~n - 1);< 544324#factENTRY ~n := #in~n; 544381#L25 assume !(~n <= 0); 544354#L26 call #t~ret0 := fact(~n - 1);< 544356#factENTRY ~n := #in~n; 544382#L25 assume ~n <= 0;#res := 1; 544379#factFINAL assume true; 544353#factEXIT >#66#return; 544350#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544325#factFINAL assume true; 544318#factEXIT >#66#return; 544317#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544315#factFINAL assume true; 544308#factEXIT >#66#return; 544307#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544294#factFINAL assume true; 544290#factEXIT >#66#return; 544293#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544607#factFINAL assume true; 544474#factEXIT >#68#return; 544519#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 544689#factENTRY ~n := #in~n; 544688#L25 assume !(~n <= 0); 544280#L26 call #t~ret0 := fact(~n - 1);< 544313#factENTRY ~n := #in~n; 544380#L25 assume !(~n <= 0); 544274#L26 call #t~ret0 := fact(~n - 1);< 544355#factENTRY ~n := #in~n; 544380#L25 assume !(~n <= 0); 544274#L26 call #t~ret0 := fact(~n - 1);< 544355#factENTRY ~n := #in~n; 544380#L25 assume !(~n <= 0); 544274#L26 call #t~ret0 := fact(~n - 1);< 544355#factENTRY ~n := #in~n; 544380#L25 assume !(~n <= 0); 544274#L26 call #t~ret0 := fact(~n - 1);< 544355#factENTRY ~n := #in~n; 544382#L25 assume ~n <= 0;#res := 1; 544379#factFINAL assume true; 544353#factEXIT >#66#return; 544350#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544325#factFINAL assume true; 544318#factEXIT >#66#return; 544317#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544315#factFINAL assume true; 544308#factEXIT >#66#return; 544307#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544294#factFINAL assume true; 544290#factEXIT >#66#return; 544283#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544383#factFINAL assume true; 544265#factEXIT >#66#return; 544281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 544600#factFINAL assume true; 544601#factEXIT >#70#return; 544430#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 544470#factENTRY ~n := #in~n; 544472#L25 assume ~n <= 0;#res := 1; 544471#factFINAL assume true; 544422#factEXIT >#72#return; 544454#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 545168#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 545167#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 545166#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 545165#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 540515#L30-5 [2022-11-25 17:06:18,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:18,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1630772446, now seen corresponding path program 34 times [2022-11-25 17:06:18,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:18,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443031550] [2022-11-25 17:06:18,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:18,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:18,248 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:06:18,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1052186452] [2022-11-25 17:06:18,248 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:06:18,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:06:18,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:18,250 INFO L229 MonitoredProcess]: Starting monitored process 315 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:06:18,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (315)] Waiting until timeout for monitored process [2022-11-25 17:06:18,656 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:06:18,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:06:18,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 1699 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 17:06:18,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:18,961 INFO L134 CoverageAnalysis]: Checked inductivity of 33197 backedges. 5108 proven. 540 refuted. 0 times theorem prover too weak. 27549 trivial. 0 not checked. [2022-11-25 17:06:18,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:06:20,243 INFO L134 CoverageAnalysis]: Checked inductivity of 33197 backedges. 1892 proven. 653 refuted. 0 times theorem prover too weak. 30652 trivial. 0 not checked. [2022-11-25 17:06:20,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:20,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443031550] [2022-11-25 17:06:20,243 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:06:20,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052186452] [2022-11-25 17:06:20,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052186452] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:06:20,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:06:20,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 16 [2022-11-25 17:06:20,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759464715] [2022-11-25 17:06:20,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:06:20,245 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 17:06:20,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:20,246 INFO L85 PathProgramCache]: Analyzing trace with hash -2025122976, now seen corresponding path program 30 times [2022-11-25 17:06:20,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:20,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373820872] [2022-11-25 17:06:20,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:20,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:20,255 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:06:20,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2084319231] [2022-11-25 17:06:20,256 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-25 17:06:20,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:06:20,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:20,262 INFO L229 MonitoredProcess]: Starting monitored process 316 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:06:20,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (316)] Waiting until timeout for monitored process [2022-11-25 17:06:20,565 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2022-11-25 17:06:20,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:06:20,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-25 17:06:20,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:20,830 INFO L134 CoverageAnalysis]: Checked inductivity of 12413 backedges. 1889 proven. 1161 refuted. 0 times theorem prover too weak. 9363 trivial. 0 not checked. [2022-11-25 17:06:20,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:06:22,863 INFO L134 CoverageAnalysis]: Checked inductivity of 12413 backedges. 1616 proven. 1220 refuted. 0 times theorem prover too weak. 9577 trivial. 0 not checked. [2022-11-25 17:06:22,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:22,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373820872] [2022-11-25 17:06:22,864 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:06:22,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084319231] [2022-11-25 17:06:22,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084319231] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:06:22,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:06:22,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25] total 28 [2022-11-25 17:06:22,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144846398] [2022-11-25 17:06:22,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:06:22,866 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 17:06:22,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:22,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 17:06:22,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2022-11-25 17:06:22,866 INFO L87 Difference]: Start difference. First operand 4901 states and 7345 transitions. cyclomatic complexity: 2524 Second operand has 28 states, 25 states have (on average 2.92) internal successors, (73), 28 states have internal predecessors, (73), 17 states have call successors, (24), 2 states have call predecessors, (24), 12 states have return successors, (30), 13 states have call predecessors, (30), 17 states have call successors, (30) [2022-11-25 17:06:25,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:25,012 INFO L93 Difference]: Finished difference Result 6588 states and 10256 transitions. [2022-11-25 17:06:25,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6588 states and 10256 transitions. [2022-11-25 17:06:25,040 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 895 [2022-11-25 17:06:25,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6588 states to 6430 states and 10004 transitions. [2022-11-25 17:06:25,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 360 [2022-11-25 17:06:25,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 378 [2022-11-25 17:06:25,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6430 states and 10004 transitions. [2022-11-25 17:06:25,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 17:06:25,077 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6430 states and 10004 transitions. [2022-11-25 17:06:25,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6430 states and 10004 transitions. [2022-11-25 17:06:25,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6430 to 5533. [2022-11-25 17:06:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5533 states, 3509 states have (on average 1.079509831860929) internal successors, (3788), 3531 states have internal predecessors, (3788), 1285 states have call successors, (1451), 597 states have call predecessors, (1451), 739 states have return successors, (3088), 1404 states have call predecessors, (3088), 1285 states have call successors, (3088) [2022-11-25 17:06:25,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5533 states to 5533 states and 8327 transitions. [2022-11-25 17:06:25,162 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5533 states and 8327 transitions. [2022-11-25 17:06:25,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-25 17:06:25,162 INFO L428 stractBuchiCegarLoop]: Abstraction has 5533 states and 8327 transitions. [2022-11-25 17:06:25,162 INFO L335 stractBuchiCegarLoop]: ======== Iteration 51 ============ [2022-11-25 17:06:25,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5533 states and 8327 transitions. [2022-11-25 17:06:25,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 697 [2022-11-25 17:06:25,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:06:25,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:06:25,177 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [118, 118, 70, 70, 70, 70, 48, 17, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 3, 3, 1, 1, 1, 1] [2022-11-25 17:06:25,177 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [68, 68, 50, 50, 50, 50, 18, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:25,177 INFO L748 eck$LassoCheckResult]: Stem: 559297#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 559272#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; 559273#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 559296#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; 559286#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 559287#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 561744#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 561742#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 561743#factENTRY ~n := #in~n; 561748#L25 assume ~n <= 0;#res := 1; 561747#factFINAL assume true; 561741#factEXIT >#68#return; 561739#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 561740#factENTRY ~n := #in~n; 561750#L25 assume ~n <= 0;#res := 1; 561749#factFINAL assume true; 561738#factEXIT >#70#return; 561731#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 561732#factENTRY ~n := #in~n; 561737#L25 assume ~n <= 0;#res := 1; 561736#factFINAL assume true; 561730#factEXIT >#72#return; 561728#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 561727#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 561725#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 561723#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 561721#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 561694#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 561695#factENTRY ~n := #in~n; 561713#L25 assume !(~n <= 0); 561711#L26 call #t~ret0 := fact(~n - 1);< 561712#factENTRY ~n := #in~n; 561724#L25 assume ~n <= 0;#res := 1; 561722#factFINAL assume true; 561718#factEXIT >#66#return; 561716#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 561714#factFINAL assume true; 561693#factEXIT >#74#return; 561688#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 561689#factENTRY ~n := #in~n; 561703#L25 assume ~n <= 0;#res := 1; 561702#factFINAL assume true; 561691#factEXIT >#76#return; 561682#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 561684#factENTRY ~n := #in~n; 561701#L25 assume !(~n <= 0); 561699#L26 call #t~ret0 := fact(~n - 1);< 561700#factENTRY ~n := #in~n; 561706#L25 assume ~n <= 0;#res := 1; 561705#factFINAL assume true; 561698#factEXIT >#66#return; 561690#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 561685#factFINAL assume true; 561680#factEXIT >#78#return; 561683#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; 562325#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 562323#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 562321#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 562315#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 561675#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 562309#factENTRY ~n := #in~n; 562326#L25 assume !(~n <= 0); 562318#L26 call #t~ret0 := fact(~n - 1);< 562320#factENTRY ~n := #in~n; 562330#L25 assume !(~n <= 0); 562319#L26 call #t~ret0 := fact(~n - 1);< 562328#factENTRY ~n := #in~n; 562331#L25 assume ~n <= 0;#res := 1; 562329#factFINAL assume true; 562327#factEXIT >#66#return; 562324#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 562322#factFINAL assume true; 562317#factEXIT >#66#return; 562314#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 562313#factFINAL assume true; 562308#factEXIT >#74#return; 562289#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 562298#factENTRY ~n := #in~n; 562296#L25 assume ~n <= 0;#res := 1; 562297#factFINAL assume true; 562311#factEXIT >#76#return; 561937#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 562210#factENTRY ~n := #in~n; 562207#L25 assume !(~n <= 0); 561915#L26 call #t~ret0 := fact(~n - 1);< 561934#factENTRY ~n := #in~n; 561949#L25 assume !(~n <= 0); 561916#L26 call #t~ret0 := fact(~n - 1);< 561942#factENTRY ~n := #in~n; 561947#L25 assume ~n <= 0;#res := 1; 561945#factFINAL assume true; 561941#factEXIT >#66#return; 561939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 561936#factFINAL assume true; 561932#factEXIT >#66#return; 561922#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 562337#factFINAL assume true; 562312#factEXIT >#78#return; 561837#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; 561836#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 561834#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 561835#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 561821#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 561668#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 561820#factENTRY ~n := #in~n; 561819#L25 assume !(~n <= 0); 561812#L26 call #t~ret0 := fact(~n - 1);< 561817#factENTRY ~n := #in~n; 561809#L25 assume !(~n <= 0); 561805#L26 call #t~ret0 := fact(~n - 1);< 561808#factENTRY ~n := #in~n; 561809#L25 assume !(~n <= 0); 561805#L26 call #t~ret0 := fact(~n - 1);< 561808#factENTRY ~n := #in~n; 561804#L25 assume ~n <= 0;#res := 1; 561806#factFINAL assume true; 561831#factEXIT >#66#return; 561830#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 561829#factFINAL assume true; 561828#factEXIT >#66#return; 561827#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 561826#factFINAL assume true; 561825#factEXIT >#66#return; 561824#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 561823#factFINAL assume true; 561667#factEXIT >#74#return; 561592#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 561591#factENTRY ~n := #in~n; 561593#L25 assume ~n <= 0;#res := 1; 561671#factFINAL assume true; 561665#factEXIT >#76#return; 561661#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 561663#factENTRY ~n := #in~n; 561662#L25 assume !(~n <= 0); 561607#L26 call #t~ret0 := fact(~n - 1);< 561660#factENTRY ~n := #in~n; 561659#L25 assume !(~n <= 0); 561606#L26 call #t~ret0 := fact(~n - 1);< 561614#factENTRY ~n := #in~n; 561619#L25 assume !(~n <= 0); 561610#L26 call #t~ret0 := fact(~n - 1);< 561657#factENTRY ~n := #in~n; 561664#L25 assume ~n <= 0;#res := 1; 561658#factFINAL assume true; 561656#factEXIT >#66#return; 561653#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 561652#factFINAL assume true; 561647#factEXIT >#66#return; 561648#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 561618#factFINAL assume true; 561605#factEXIT >#66#return; 561613#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 561751#factFINAL assume true; 561666#factEXIT >#78#return; 559379#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; 559378#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 559377#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 559375#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 559376#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 560214#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 560212#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 560210#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 560196#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 560199#factENTRY ~n := #in~n; 560209#L25 assume !(~n <= 0); 560206#L26 call #t~ret0 := fact(~n - 1);< 560207#factENTRY ~n := #in~n; 560218#L25 assume ~n <= 0;#res := 1; 560270#factFINAL assume true; 560269#factEXIT >#66#return; 560266#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 560263#factFINAL assume true; 560260#factEXIT >#68#return; 560059#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 560061#factENTRY ~n := #in~n; 560112#L25 assume ~n <= 0;#res := 1; 560082#factFINAL assume true; 560057#factEXIT >#70#return; 560050#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 560055#factENTRY ~n := #in~n; 560143#L25 assume !(~n <= 0); 559901#L26 call #t~ret0 := fact(~n - 1);< 559907#factENTRY ~n := #in~n; 560254#L25 assume ~n <= 0;#res := 1; 560148#factFINAL assume true; 560032#factEXIT >#66#return; 560037#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 560121#factFINAL assume true; 560049#factEXIT >#72#return; 560048#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 560047#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 560046#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 560045#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 560044#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 560024#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 560025#factENTRY ~n := #in~n; 560056#L25 assume !(~n <= 0); 560034#L26 call #t~ret0 := fact(~n - 1);< 560041#factENTRY ~n := #in~n; 560254#L25 assume ~n <= 0;#res := 1; 560148#factFINAL assume true; 560032#factEXIT >#66#return; 560040#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 560042#factFINAL assume true; 560021#factEXIT >#68#return; 560017#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 560020#factENTRY ~n := #in~n; 560043#L25 assume !(~n <= 0); 560035#L26 call #t~ret0 := fact(~n - 1);< 560041#factENTRY ~n := #in~n; 560254#L25 assume ~n <= 0;#res := 1; 560148#factFINAL assume true; 560032#factEXIT >#66#return; 560031#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 560026#factFINAL assume true; 560016#factEXIT >#70#return; 559976#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 559978#factENTRY ~n := #in~n; 560228#L25 assume ~n <= 0;#res := 1; 560015#factFINAL assume true; 559973#factEXIT >#72#return; 559977#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 560103#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 560101#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 560100#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 560099#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 559886#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 559890#factENTRY ~n := #in~n; 559934#L25 assume !(~n <= 0); 559903#L26 call #t~ret0 := fact(~n - 1);< 559907#factENTRY ~n := #in~n; 560298#L25 assume !(~n <= 0); 559904#L26 call #t~ret0 := fact(~n - 1);< 559931#factENTRY ~n := #in~n; 559946#L25 assume ~n <= 0;#res := 1; 559945#factFINAL assume true; 559929#factEXIT >#66#return; 559927#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 559922#factFINAL assume true; 559899#factEXIT >#66#return; 559896#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 559893#factFINAL assume true; 559885#factEXIT >#74#return; 559879#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 559881#factENTRY ~n := #in~n; 560098#L25 assume !(~n <= 0); 559956#L26 call #t~ret0 := fact(~n - 1);< 560097#factENTRY ~n := #in~n; 560104#L25 assume ~n <= 0;#res := 1; 560102#factFINAL assume true; 560096#factEXIT >#66#return; 560094#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 560090#factFINAL assume true; 559878#factEXIT >#76#return; 559838#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 559843#factENTRY ~n := #in~n; 560029#L25 assume !(~n <= 0); 559982#L26 call #t~ret0 := fact(~n - 1);< 559994#factENTRY ~n := #in~n; 560030#L25 assume ~n <= 0;#res := 1; 560027#factFINAL assume true; 559980#factEXIT >#66#return; 559979#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 559933#factFINAL assume true; 559837#factEXIT >#78#return; 559841#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; 560111#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 560110#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 560109#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 560107#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 559798#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 559815#factENTRY ~n := #in~n; 559814#L25 assume !(~n <= 0); 559789#L26 call #t~ret0 := fact(~n - 1);< 559793#factENTRY ~n := #in~n; 559813#L25 assume !(~n <= 0); 559788#L26 call #t~ret0 := fact(~n - 1);< 559809#factENTRY ~n := #in~n; 559813#L25 assume !(~n <= 0); 559788#L26 call #t~ret0 := fact(~n - 1);< 559809#factENTRY ~n := #in~n; 559865#L25 assume ~n <= 0;#res := 1; 559864#factFINAL assume true; 559863#factEXIT >#66#return; 559862#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 559860#factFINAL assume true; 559808#factEXIT >#66#return; 559806#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 559797#factFINAL assume true; 559787#factEXIT >#66#return; 559791#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 559866#factFINAL assume true; 559820#factEXIT >#74#return; 559756#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 559765#factENTRY ~n := #in~n; 559763#L25 assume !(~n <= 0); 559667#L26 call #t~ret0 := fact(~n - 1);< 559750#factENTRY ~n := #in~n; 559735#L25 assume ~n <= 0;#res := 1; 559736#factFINAL assume true; 559665#factEXIT >#66#return; 559671#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 559868#factFINAL assume true; 559844#factEXIT >#76#return; 559655#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 559640#factENTRY ~n := #in~n; 559675#L25 assume !(~n <= 0); 559676#L26 call #t~ret0 := fact(~n - 1);< 559753#factENTRY ~n := #in~n; 559752#L25 assume !(~n <= 0); 559727#L26 call #t~ret0 := fact(~n - 1);< 559740#factENTRY ~n := #in~n; 559744#L25 assume ~n <= 0;#res := 1; 559742#factFINAL assume true; 559738#factEXIT >#66#return; 559737#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 559722#factFINAL assume true; 559729#factEXIT >#66#return; 559776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 559654#factFINAL assume true; 559656#factEXIT >#78#return; 559635#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; 559634#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 559632#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 559630#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 559626#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 559624#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 559347#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 559614#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 559608#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 559609#factENTRY ~n := #in~n; 559623#L25 assume !(~n <= 0); 559618#L26 call #t~ret0 := fact(~n - 1);< 559619#factENTRY ~n := #in~n; 559629#L25 assume !(~n <= 0); 559617#L26 call #t~ret0 := fact(~n - 1);< 559628#factENTRY ~n := #in~n; 559633#L25 assume ~n <= 0;#res := 1; 559631#factFINAL assume true; 559627#factEXIT >#66#return; 559625#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 559622#factFINAL assume true; 559616#factEXIT >#66#return; 559613#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 559611#factFINAL assume true; 559606#factEXIT >#68#return; 559603#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 559604#factENTRY ~n := #in~n; 559610#L25 assume ~n <= 0;#res := 1; 559605#factFINAL assume true; 559601#factEXIT >#70#return; 559562#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 559599#factENTRY ~n := #in~n; 559565#L25 assume !(~n <= 0); 559556#L26 call #t~ret0 := fact(~n - 1);< 559564#factENTRY ~n := #in~n; 559649#L25 assume !(~n <= 0); 559555#L26 call #t~ret0 := fact(~n - 1);< 559577#factENTRY ~n := #in~n; 559582#L25 assume ~n <= 0;#res := 1; 559579#factFINAL assume true; 559575#factEXIT >#66#return; 559572#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 559561#factFINAL assume true; 559553#factEXIT >#66#return; 559557#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 559600#factFINAL assume true; 559597#factEXIT >#72#return; 559596#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 559595#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 559592#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 559588#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 559581#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 559539#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 559543#factENTRY ~n := #in~n; 559566#L25 assume !(~n <= 0); 559554#L26 call #t~ret0 := fact(~n - 1);< 559558#factENTRY ~n := #in~n; 559647#L25 assume !(~n <= 0); 559576#L26 call #t~ret0 := fact(~n - 1);< 559589#factENTRY ~n := #in~n; 559582#L25 assume ~n <= 0;#res := 1; 559579#factFINAL assume true; 559575#factEXIT >#66#return; 559572#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 559561#factFINAL assume true; 559553#factEXIT >#66#return; 559550#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 559547#factFINAL assume true; 559536#factEXIT >#68#return; 559541#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 559574#factENTRY ~n := #in~n; 559591#L25 assume !(~n <= 0); 559584#L26 call #t~ret0 := fact(~n - 1);< 559587#factENTRY ~n := #in~n; 559593#L25 assume ~n <= 0;#res := 1; 559590#factFINAL assume true; 559583#factEXIT >#66#return; 559580#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 559578#factFINAL assume true; 559573#factEXIT >#70#return; 559569#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 559571#factENTRY ~n := #in~n; 559594#L25 assume !(~n <= 0); 559585#L26 call #t~ret0 := fact(~n - 1);< 559587#factENTRY ~n := #in~n; 559593#L25 assume ~n <= 0;#res := 1; 559590#factFINAL assume true; 559583#factEXIT >#66#return; 559586#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 559641#factFINAL assume true; 559568#factEXIT >#72#return; 559560#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 559552#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 559549#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 559546#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 559545#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 559538#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 559543#factENTRY ~n := #in~n; 559566#L25 assume !(~n <= 0); 559554#L26 call #t~ret0 := fact(~n - 1);< 559558#factENTRY ~n := #in~n; 559647#L25 assume !(~n <= 0); 559576#L26 call #t~ret0 := fact(~n - 1);< 559589#factENTRY ~n := #in~n; 559582#L25 assume ~n <= 0;#res := 1; 559579#factFINAL assume true; 559575#factEXIT >#66#return; 559572#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 559561#factFINAL assume true; 559553#factEXIT >#66#return; 559550#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 559547#factFINAL assume true; 559536#factEXIT >#68#return; 559511#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 559512#factENTRY ~n := #in~n; 559523#L25 assume !(~n <= 0); 559516#L26 call #t~ret0 := fact(~n - 1);< 559520#factENTRY ~n := #in~n; 559530#L25 assume !(~n <= 0); 559527#L26 call #t~ret0 := fact(~n - 1);< 559528#factENTRY ~n := #in~n; 559532#L25 assume ~n <= 0;#res := 1; 559531#factFINAL assume true; 559526#factEXIT >#66#return; 559524#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 559521#factFINAL assume true; 559515#factEXIT >#66#return; 559514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 559513#factFINAL assume true; 559509#factEXIT >#70#return; 559504#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 559506#factENTRY ~n := #in~n; 559508#L25 assume ~n <= 0;#res := 1; 559507#factFINAL assume true; 559502#factEXIT >#72#return; 559500#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 559501#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 559495#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 559496#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 559437#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 559434#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 559435#factENTRY ~n := #in~n; 559458#L25 assume !(~n <= 0); 559452#L26 call #t~ret0 := fact(~n - 1);< 559454#factENTRY ~n := #in~n; 559471#L25 assume !(~n <= 0); 559453#L26 call #t~ret0 := fact(~n - 1);< 559466#factENTRY ~n := #in~n; 559471#L25 assume !(~n <= 0); 559453#L26 call #t~ret0 := fact(~n - 1);< 559466#factENTRY ~n := #in~n; 559484#L25 assume ~n <= 0;#res := 1; 559481#factFINAL assume true; 559478#factEXIT >#66#return; 559472#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 559469#factFINAL assume true; 559465#factEXIT >#66#return; 559461#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 559457#factFINAL assume true; 559451#factEXIT >#66#return; 559443#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 559440#factFINAL assume true; 559433#factEXIT >#74#return; 559390#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 559430#factENTRY ~n := #in~n; 561462#L25 assume !(~n <= 0); 561460#L26 call #t~ret0 := fact(~n - 1);< 561461#factENTRY ~n := #in~n; 561470#L25 assume !(~n <= 0); 561466#L26 call #t~ret0 := fact(~n - 1);< 561471#factENTRY ~n := #in~n; 561473#L25 assume ~n <= 0;#res := 1; 561487#factFINAL assume true; 561481#factEXIT >#66#return; 561483#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 561488#factFINAL assume true; 561484#factEXIT >#66#return; 559395#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 559389#factFINAL assume true; 559391#factEXIT >#76#return; 559360#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 559425#factENTRY ~n := #in~n; 559422#L25 assume !(~n <= 0); 559399#L26 call #t~ret0 := fact(~n - 1);< 559404#factENTRY ~n := #in~n; 559873#L25 assume ~n <= 0;#res := 1; 559846#factFINAL assume true; 559398#factEXIT >#66#return; 559402#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 559491#factFINAL assume true; 559359#factEXIT >#78#return; 559361#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; 559355#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 559356#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 559351#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 559352#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 559346#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 559345#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 559298#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 559299#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 564069#factENTRY ~n := #in~n; 564068#L25 assume !(~n <= 0); 563934#L26 call #t~ret0 := fact(~n - 1);< 564065#factENTRY ~n := #in~n; 563955#L25 assume !(~n <= 0); 563936#L26 call #t~ret0 := fact(~n - 1);< 564121#factENTRY ~n := #in~n; 563955#L25 assume !(~n <= 0); 563936#L26 call #t~ret0 := fact(~n - 1);< 564121#factENTRY ~n := #in~n; 564135#L25 assume ~n <= 0;#res := 1; 564134#factFINAL assume true; 564133#factEXIT >#66#return; 564132#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 564131#factFINAL assume true; 564120#factEXIT >#66#return; 564119#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 564064#factFINAL assume true; 564060#factEXIT >#66#return; 564061#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 564244#factFINAL assume true; 564243#factEXIT >#68#return; 563916#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 559331#factENTRY ~n := #in~n; 563929#L25 assume ~n <= 0;#res := 1; 563925#factFINAL assume true; 563915#factEXIT >#70#return; 559239#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 559240#factENTRY ~n := #in~n; 563941#L25 assume !(~n <= 0); 562915#L26 call #t~ret0 := fact(~n - 1);< 563444#factENTRY ~n := #in~n; 563702#L25 assume !(~n <= 0); 562921#L26 call #t~ret0 := fact(~n - 1);< 563426#factENTRY ~n := #in~n; 563700#L25 assume !(~n <= 0); 562923#L26 call #t~ret0 := fact(~n - 1);< 563710#factENTRY ~n := #in~n; 563728#L25 assume ~n <= 0;#res := 1; 563726#factFINAL assume true; 563706#factEXIT >#66#return; 563705#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563666#factFINAL assume true; 563659#factEXIT >#66#return; 563657#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563432#factFINAL assume true; 563419#factEXIT >#66#return; 563424#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 564342#factFINAL assume true; 564343#factEXIT >#72#return; 563907#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 564521#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 564520#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 564519#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 564518#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 563519#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 563631#factENTRY ~n := #in~n; 563632#L25 assume !(~n <= 0); 562913#L26 call #t~ret0 := fact(~n - 1);< 563444#factENTRY ~n := #in~n; 563702#L25 assume !(~n <= 0); 562921#L26 call #t~ret0 := fact(~n - 1);< 563426#factENTRY ~n := #in~n; 563700#L25 assume !(~n <= 0); 562923#L26 call #t~ret0 := fact(~n - 1);< 563710#factENTRY ~n := #in~n; 563728#L25 assume ~n <= 0;#res := 1; 563726#factFINAL assume true; 563706#factEXIT >#66#return; 563705#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563666#factFINAL assume true; 563659#factEXIT >#66#return; 563657#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563432#factFINAL assume true; 563419#factEXIT >#66#return; 563423#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563836#factFINAL assume true; 563829#factEXIT >#68#return; 563818#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 563827#factENTRY ~n := #in~n; 563825#L25 assume !(~n <= 0); 563398#L26 call #t~ret0 := fact(~n - 1);< 563824#factENTRY ~n := #in~n; 563828#L25 assume ~n <= 0;#res := 1; 563802#factFINAL assume true; 563798#factEXIT >#66#return; 563800#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563898#factFINAL assume true; 563897#factEXIT >#70#return; 563685#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 563697#factENTRY ~n := #in~n; 563698#L25 assume !(~n <= 0); 563661#L26 call #t~ret0 := fact(~n - 1);< 563687#factENTRY ~n := #in~n; 563753#L25 assume !(~n <= 0); 563707#L26 call #t~ret0 := fact(~n - 1);< 563708#factENTRY ~n := #in~n; 563728#L25 assume ~n <= 0;#res := 1; 563726#factFINAL assume true; 563706#factEXIT >#66#return; 563705#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563666#factFINAL assume true; 563659#factEXIT >#66#return; 563663#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 564016#factFINAL assume true; 563854#factEXIT >#72#return; 563870#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 564675#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 564673#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 564672#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 564671#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 563716#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 563729#factENTRY ~n := #in~n; 563727#L25 assume !(~n <= 0); 563400#L26 call #t~ret0 := fact(~n - 1);< 563712#factENTRY ~n := #in~n; 563711#L25 assume !(~n <= 0); 563421#L26 call #t~ret0 := fact(~n - 1);< 563425#factENTRY ~n := #in~n; 563704#L25 assume !(~n <= 0); 563660#L26 call #t~ret0 := fact(~n - 1);< 563665#factENTRY ~n := #in~n; 563728#L25 assume ~n <= 0;#res := 1; 563726#factFINAL assume true; 563706#factEXIT >#66#return; 563705#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563666#factFINAL assume true; 563659#factEXIT >#66#return; 563657#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563432#factFINAL assume true; 563419#factEXIT >#66#return; 563423#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563836#factFINAL assume true; 563829#factEXIT >#68#return; 563743#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 563782#factENTRY ~n := #in~n; 563779#L25 assume !(~n <= 0); 563399#L26 call #t~ret0 := fact(~n - 1);< 563703#factENTRY ~n := #in~n; 563701#L25 assume !(~n <= 0); 563420#L26 call #t~ret0 := fact(~n - 1);< 563709#factENTRY ~n := #in~n; 563728#L25 assume ~n <= 0;#res := 1; 563726#factFINAL assume true; 563706#factEXIT >#66#return; 563705#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563666#factFINAL assume true; 563659#factEXIT >#66#return; 563664#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563881#factFINAL assume true; 563880#factEXIT >#70#return; 563693#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 563796#factENTRY ~n := #in~n; 563690#L25 assume !(~n <= 0); 563662#L26 call #t~ret0 := fact(~n - 1);< 563801#factENTRY ~n := #in~n; 563828#L25 assume ~n <= 0;#res := 1; 563802#factFINAL assume true; 563798#factEXIT >#66#return; 563797#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563795#factFINAL assume true; 563785#factEXIT >#72#return; 563791#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 564688#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 564686#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 564683#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 564678#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 563723#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 563729#factENTRY ~n := #in~n; 563727#L25 assume !(~n <= 0); 563400#L26 call #t~ret0 := fact(~n - 1);< 563712#factENTRY ~n := #in~n; 563711#L25 assume !(~n <= 0); 563421#L26 call #t~ret0 := fact(~n - 1);< 563425#factENTRY ~n := #in~n; 563704#L25 assume !(~n <= 0); 563660#L26 call #t~ret0 := fact(~n - 1);< 563665#factENTRY ~n := #in~n; 563753#L25 assume !(~n <= 0); 563707#L26 call #t~ret0 := fact(~n - 1);< 563708#factENTRY ~n := #in~n; 563728#L25 assume ~n <= 0;#res := 1; 563726#factFINAL assume true; 563706#factEXIT >#66#return; 563705#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563666#factFINAL assume true; 563659#factEXIT >#66#return; 563657#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563432#factFINAL assume true; 563419#factEXIT >#66#return; 563413#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563402#factFINAL assume true; 563396#factEXIT >#66#return; 563401#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563832#factFINAL assume true; 563833#factEXIT >#68#return; 563737#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 563782#factENTRY ~n := #in~n; 563779#L25 assume !(~n <= 0); 563399#L26 call #t~ret0 := fact(~n - 1);< 563703#factENTRY ~n := #in~n; 563701#L25 assume !(~n <= 0); 563420#L26 call #t~ret0 := fact(~n - 1);< 563709#factENTRY ~n := #in~n; 563704#L25 assume !(~n <= 0); 563660#L26 call #t~ret0 := fact(~n - 1);< 563665#factENTRY ~n := #in~n; 563753#L25 assume !(~n <= 0); 563707#L26 call #t~ret0 := fact(~n - 1);< 563708#factENTRY ~n := #in~n; 563728#L25 assume ~n <= 0;#res := 1; 563726#factFINAL assume true; 563706#factEXIT >#66#return; 563705#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563666#factFINAL assume true; 563659#factEXIT >#66#return; 563657#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563432#factFINAL assume true; 563419#factEXIT >#66#return; 563413#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563402#factFINAL assume true; 563396#factEXIT >#66#return; 563401#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563832#factFINAL assume true; 563833#factEXIT >#70#return; 563455#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 563503#factENTRY ~n := #in~n; 563689#L25 assume ~n <= 0;#res := 1; 563658#factFINAL assume true; 563448#factEXIT >#72#return; 563483#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 564681#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 564680#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 564679#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 564677#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 562375#L30-5 [2022-11-25 17:06:25,178 INFO L750 eck$LassoCheckResult]: Loop: 562375#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 559226#factENTRY ~n := #in~n; 562443#L25 assume !(~n <= 0); 562438#L26 call #t~ret0 := fact(~n - 1);< 562442#factENTRY ~n := #in~n; 562502#L25 assume !(~n <= 0); 562439#L26 call #t~ret0 := fact(~n - 1);< 562500#factENTRY ~n := #in~n; 562501#L25 assume !(~n <= 0); 562440#L26 call #t~ret0 := fact(~n - 1);< 562770#factENTRY ~n := #in~n; 562501#L25 assume !(~n <= 0); 562440#L26 call #t~ret0 := fact(~n - 1);< 562770#factENTRY ~n := #in~n; 562803#L25 assume ~n <= 0;#res := 1; 562801#factFINAL assume true; 562799#factEXIT >#66#return; 562788#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 562773#factFINAL assume true; 562769#factEXIT >#66#return; 562765#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 562761#factFINAL assume true; 562671#factEXIT >#66#return; 562441#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 562499#factFINAL assume true; 562437#factEXIT >#66#return; 562435#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 562426#factFINAL assume true; 562423#factEXIT >#74#return; 559334#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 559335#factENTRY ~n := #in~n; 564659#L25 assume !(~n <= 0); 559279#L26 call #t~ret0 := fact(~n - 1);< 564657#factENTRY ~n := #in~n; 564662#L25 assume !(~n <= 0); 559278#L26 call #t~ret0 := fact(~n - 1);< 559280#factENTRY ~n := #in~n; 564645#L25 assume !(~n <= 0); 559327#L26 call #t~ret0 := fact(~n - 1);< 564665#factENTRY ~n := #in~n; 559324#L25 assume ~n <= 0;#res := 1; 559326#factFINAL assume true; 564669#factEXIT >#66#return; 564668#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 564666#factFINAL assume true; 564664#factEXIT >#66#return; 564663#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 564661#factFINAL assume true; 564660#factEXIT >#66#return; 564655#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 564670#factFINAL assume true; 564648#factEXIT >#76#return; 562342#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 562400#factENTRY ~n := #in~n; 562398#L25 assume !(~n <= 0); 562345#L26 call #t~ret0 := fact(~n - 1);< 562348#factENTRY ~n := #in~n; 562425#L25 assume ~n <= 0;#res := 1; 562352#factFINAL assume true; 562344#factEXIT >#66#return; 562341#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 562343#factFINAL assume true; 564751#factEXIT >#78#return; 564748#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; 564747#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 564746#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 564745#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 559293#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 559294#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 559348#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 564102#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 559243#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 559244#factENTRY ~n := #in~n; 563984#L25 assume !(~n <= 0); 563935#L26 call #t~ret0 := fact(~n - 1);< 563939#factENTRY ~n := #in~n; 563954#L25 assume !(~n <= 0); 563937#L26 call #t~ret0 := fact(~n - 1);< 563953#factENTRY ~n := #in~n; 563955#L25 assume !(~n <= 0); 563936#L26 call #t~ret0 := fact(~n - 1);< 564121#factENTRY ~n := #in~n; 563955#L25 assume !(~n <= 0); 563936#L26 call #t~ret0 := fact(~n - 1);< 564121#factENTRY ~n := #in~n; 563955#L25 assume !(~n <= 0); 563936#L26 call #t~ret0 := fact(~n - 1);< 564121#factENTRY ~n := #in~n; 564135#L25 assume ~n <= 0;#res := 1; 564134#factFINAL assume true; 564133#factEXIT >#66#return; 564132#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 564131#factFINAL assume true; 564120#factEXIT >#66#return; 564119#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 564064#factFINAL assume true; 564060#factEXIT >#66#return; 564059#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 564058#factFINAL assume true; 563960#factEXIT >#66#return; 563938#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563952#factFINAL assume true; 563933#factEXIT >#66#return; 563932#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563930#factFINAL assume true; 563926#factEXIT >#68#return; 563917#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 559331#factENTRY ~n := #in~n; 563929#L25 assume ~n <= 0;#res := 1; 563925#factFINAL assume true; 563915#factEXIT >#70#return; 563770#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 563777#factENTRY ~n := #in~n; 563776#L25 assume !(~n <= 0); 562918#L26 call #t~ret0 := fact(~n - 1);< 563731#factENTRY ~n := #in~n; 563699#L25 assume !(~n <= 0); 562919#L26 call #t~ret0 := fact(~n - 1);< 563444#factENTRY ~n := #in~n; 563702#L25 assume !(~n <= 0); 562921#L26 call #t~ret0 := fact(~n - 1);< 563426#factENTRY ~n := #in~n; 563700#L25 assume !(~n <= 0); 562923#L26 call #t~ret0 := fact(~n - 1);< 563710#factENTRY ~n := #in~n; 563728#L25 assume ~n <= 0;#res := 1; 563726#factFINAL assume true; 563706#factEXIT >#66#return; 563705#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563666#factFINAL assume true; 563659#factEXIT >#66#return; 563657#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563432#factFINAL assume true; 563419#factEXIT >#66#return; 563413#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563402#factFINAL assume true; 563396#factEXIT >#66#return; 562928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563940#factFINAL assume true; 563904#factEXIT >#72#return; 563910#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 564482#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 564481#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 564480#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 564479#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 563511#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 563626#factENTRY ~n := #in~n; 563630#L25 assume !(~n <= 0); 562917#L26 call #t~ret0 := fact(~n - 1);< 563731#factENTRY ~n := #in~n; 563699#L25 assume !(~n <= 0); 562919#L26 call #t~ret0 := fact(~n - 1);< 563444#factENTRY ~n := #in~n; 563702#L25 assume !(~n <= 0); 562921#L26 call #t~ret0 := fact(~n - 1);< 563426#factENTRY ~n := #in~n; 563700#L25 assume !(~n <= 0); 562923#L26 call #t~ret0 := fact(~n - 1);< 563710#factENTRY ~n := #in~n; 563728#L25 assume ~n <= 0;#res := 1; 563726#factFINAL assume true; 563706#factEXIT >#66#return; 563705#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563666#factFINAL assume true; 563659#factEXIT >#66#return; 563657#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563432#factFINAL assume true; 563419#factEXIT >#66#return; 563413#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563402#factFINAL assume true; 563396#factEXIT >#66#return; 563401#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563832#factFINAL assume true; 563833#factEXIT >#68#return; 563804#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 563835#factENTRY ~n := #in~n; 563831#L25 assume !(~n <= 0); 563799#L26 call #t~ret0 := fact(~n - 1);< 563803#factENTRY ~n := #in~n; 563828#L25 assume ~n <= 0;#res := 1; 563802#factFINAL assume true; 563798#factEXIT >#66#return; 563800#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563898#factFINAL assume true; 563897#factEXIT >#70#return; 563434#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 559242#factENTRY ~n := #in~n; 564239#L25 assume !(~n <= 0); 562925#L26 call #t~ret0 := fact(~n - 1);< 563444#factENTRY ~n := #in~n; 563702#L25 assume !(~n <= 0); 562921#L26 call #t~ret0 := fact(~n - 1);< 563426#factENTRY ~n := #in~n; 563700#L25 assume !(~n <= 0); 562923#L26 call #t~ret0 := fact(~n - 1);< 563710#factENTRY ~n := #in~n; 563728#L25 assume ~n <= 0;#res := 1; 563726#factFINAL assume true; 563706#factEXIT >#66#return; 563705#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563666#factFINAL assume true; 563659#factEXIT >#66#return; 563657#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563432#factFINAL assume true; 563419#factEXIT >#66#return; 562926#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 564020#factFINAL assume true; 563887#factEXIT >#72#return; 563893#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 564542#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 564540#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 564538#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 564536#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 563516#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 563628#factENTRY ~n := #in~n; 563633#L25 assume !(~n <= 0); 562914#L26 call #t~ret0 := fact(~n - 1);< 562930#factENTRY ~n := #in~n; 563752#L25 assume !(~n <= 0); 562922#L26 call #t~ret0 := fact(~n - 1);< 563426#factENTRY ~n := #in~n; 563700#L25 assume !(~n <= 0); 562923#L26 call #t~ret0 := fact(~n - 1);< 563710#factENTRY ~n := #in~n; 563700#L25 assume !(~n <= 0); 562923#L26 call #t~ret0 := fact(~n - 1);< 563710#factENTRY ~n := #in~n; 563728#L25 assume ~n <= 0;#res := 1; 563726#factFINAL assume true; 563706#factEXIT >#66#return; 563705#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563666#factFINAL assume true; 563659#factEXIT >#66#return; 563657#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563432#factFINAL assume true; 563419#factEXIT >#66#return; 563413#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563402#factFINAL assume true; 563396#factEXIT >#66#return; 563401#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563832#factFINAL assume true; 563833#factEXIT >#68#return; 563593#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 563827#factENTRY ~n := #in~n; 563825#L25 assume !(~n <= 0); 563398#L26 call #t~ret0 := fact(~n - 1);< 563824#factENTRY ~n := #in~n; 563701#L25 assume !(~n <= 0); 563420#L26 call #t~ret0 := fact(~n - 1);< 563709#factENTRY ~n := #in~n; 563728#L25 assume ~n <= 0;#res := 1; 563726#factFINAL assume true; 563706#factEXIT >#66#return; 563705#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563666#factFINAL assume true; 563659#factEXIT >#66#return; 563664#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563881#factFINAL assume true; 563880#factEXIT >#70#return; 563676#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 563781#factENTRY ~n := #in~n; 563826#L25 assume !(~n <= 0); 562916#L26 call #t~ret0 := fact(~n - 1);< 563426#factENTRY ~n := #in~n; 563700#L25 assume !(~n <= 0); 562923#L26 call #t~ret0 := fact(~n - 1);< 563710#factENTRY ~n := #in~n; 563728#L25 assume ~n <= 0;#res := 1; 563726#factFINAL assume true; 563706#factEXIT >#66#return; 563705#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563666#factFINAL assume true; 563659#factEXIT >#66#return; 563663#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 564016#factFINAL assume true; 563854#factEXIT >#72#return; 563864#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 564628#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 564627#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 564626#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 564625#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 563405#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 559246#factENTRY ~n := #in~n; 564229#L25 assume !(~n <= 0); 563397#L26 call #t~ret0 := fact(~n - 1);< 563408#factENTRY ~n := #in~n; 563754#L25 assume !(~n <= 0); 563422#L26 call #t~ret0 := fact(~n - 1);< 563425#factENTRY ~n := #in~n; 563704#L25 assume !(~n <= 0); 563660#L26 call #t~ret0 := fact(~n - 1);< 563665#factENTRY ~n := #in~n; 563753#L25 assume !(~n <= 0); 563707#L26 call #t~ret0 := fact(~n - 1);< 563708#factENTRY ~n := #in~n; 563728#L25 assume ~n <= 0;#res := 1; 563726#factFINAL assume true; 563706#factEXIT >#66#return; 563705#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563666#factFINAL assume true; 563659#factEXIT >#66#return; 563657#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563432#factFINAL assume true; 563419#factEXIT >#66#return; 563413#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563402#factFINAL assume true; 563396#factEXIT >#66#return; 563401#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563832#factFINAL assume true; 563833#factEXIT >#68#return; 563745#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 563782#factENTRY ~n := #in~n; 563779#L25 assume !(~n <= 0); 563399#L26 call #t~ret0 := fact(~n - 1);< 563703#factENTRY ~n := #in~n; 563701#L25 assume !(~n <= 0); 563420#L26 call #t~ret0 := fact(~n - 1);< 563709#factENTRY ~n := #in~n; 563704#L25 assume !(~n <= 0); 563660#L26 call #t~ret0 := fact(~n - 1);< 563665#factENTRY ~n := #in~n; 563753#L25 assume !(~n <= 0); 563707#L26 call #t~ret0 := fact(~n - 1);< 563708#factENTRY ~n := #in~n; 563728#L25 assume ~n <= 0;#res := 1; 563726#factFINAL assume true; 563706#factEXIT >#66#return; 563705#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563666#factFINAL assume true; 563659#factEXIT >#66#return; 563657#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563432#factFINAL assume true; 563419#factEXIT >#66#return; 563413#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563402#factFINAL assume true; 563396#factEXIT >#66#return; 563401#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563832#factFINAL assume true; 563833#factEXIT >#70#return; 563692#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 563796#factENTRY ~n := #in~n; 563690#L25 assume !(~n <= 0); 563662#L26 call #t~ret0 := fact(~n - 1);< 563801#factENTRY ~n := #in~n; 563828#L25 assume ~n <= 0;#res := 1; 563802#factFINAL assume true; 563798#factEXIT >#66#return; 563797#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563795#factFINAL assume true; 563785#factEXIT >#72#return; 563487#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 564617#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 564614#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 564613#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 564612#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 563403#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 559246#factENTRY ~n := #in~n; 564229#L25 assume !(~n <= 0); 563397#L26 call #t~ret0 := fact(~n - 1);< 563408#factENTRY ~n := #in~n; 563754#L25 assume !(~n <= 0); 563422#L26 call #t~ret0 := fact(~n - 1);< 563425#factENTRY ~n := #in~n; 563704#L25 assume !(~n <= 0); 563660#L26 call #t~ret0 := fact(~n - 1);< 563665#factENTRY ~n := #in~n; 563753#L25 assume !(~n <= 0); 563707#L26 call #t~ret0 := fact(~n - 1);< 563708#factENTRY ~n := #in~n; 563728#L25 assume ~n <= 0;#res := 1; 563726#factFINAL assume true; 563706#factEXIT >#66#return; 563705#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563666#factFINAL assume true; 563659#factEXIT >#66#return; 563657#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563432#factFINAL assume true; 563419#factEXIT >#66#return; 563413#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563402#factFINAL assume true; 563396#factEXIT >#66#return; 563401#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563832#factFINAL assume true; 563833#factEXIT >#68#return; 563744#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 563782#factENTRY ~n := #in~n; 563779#L25 assume !(~n <= 0); 563399#L26 call #t~ret0 := fact(~n - 1);< 563703#factENTRY ~n := #in~n; 563701#L25 assume !(~n <= 0); 563420#L26 call #t~ret0 := fact(~n - 1);< 563709#factENTRY ~n := #in~n; 563704#L25 assume !(~n <= 0); 563660#L26 call #t~ret0 := fact(~n - 1);< 563665#factENTRY ~n := #in~n; 563753#L25 assume !(~n <= 0); 563707#L26 call #t~ret0 := fact(~n - 1);< 563708#factENTRY ~n := #in~n; 563728#L25 assume ~n <= 0;#res := 1; 563726#factFINAL assume true; 563706#factEXIT >#66#return; 563705#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563666#factFINAL assume true; 563659#factEXIT >#66#return; 563657#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563432#factFINAL assume true; 563419#factEXIT >#66#return; 563413#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563402#factFINAL assume true; 563396#factEXIT >#66#return; 563401#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 563832#factFINAL assume true; 563833#factEXIT >#70#return; 563453#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 563503#factENTRY ~n := #in~n; 563689#L25 assume ~n <= 0;#res := 1; 563658#factFINAL assume true; 563448#factEXIT >#72#return; 563481#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 564611#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 564610#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 564609#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 564605#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 562375#L30-5 [2022-11-25 17:06:25,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:25,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1630772446, now seen corresponding path program 35 times [2022-11-25 17:06:25,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:25,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292386799] [2022-11-25 17:06:25,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:25,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:25,194 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:06:25,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [630977879] [2022-11-25 17:06:25,194 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 17:06:25,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:06:25,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:25,199 INFO L229 MonitoredProcess]: Starting monitored process 317 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:06:25,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (317)] Waiting until timeout for monitored process [2022-11-25 17:06:26,354 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2022-11-25 17:06:26,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:06:26,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 1676 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-25 17:06:26,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:26,547 INFO L134 CoverageAnalysis]: Checked inductivity of 33197 backedges. 3247 proven. 185 refuted. 0 times theorem prover too weak. 29765 trivial. 0 not checked. [2022-11-25 17:06:26,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:06:27,731 INFO L134 CoverageAnalysis]: Checked inductivity of 33197 backedges. 2779 proven. 213 refuted. 0 times theorem prover too weak. 30205 trivial. 0 not checked. [2022-11-25 17:06:27,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:27,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292386799] [2022-11-25 17:06:27,732 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:06:27,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630977879] [2022-11-25 17:06:27,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630977879] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:06:27,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:06:27,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 22 [2022-11-25 17:06:27,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313299889] [2022-11-25 17:06:27,733 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:06:27,734 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 17:06:27,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:27,734 INFO L85 PathProgramCache]: Analyzing trace with hash -118701744, now seen corresponding path program 31 times [2022-11-25 17:06:27,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:27,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110804590] [2022-11-25 17:06:27,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:27,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:27,743 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:06:27,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2069345554] [2022-11-25 17:06:27,743 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 17:06:27,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:06:27,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:27,748 INFO L229 MonitoredProcess]: Starting monitored process 318 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:06:27,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (318)] Waiting until timeout for monitored process [2022-11-25 17:06:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:28,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-25 17:06:28,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:28,281 INFO L134 CoverageAnalysis]: Checked inductivity of 11663 backedges. 5839 proven. 165 refuted. 0 times theorem prover too weak. 5659 trivial. 0 not checked. [2022-11-25 17:06:28,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:06:30,216 INFO L134 CoverageAnalysis]: Checked inductivity of 11663 backedges. 577 proven. 2141 refuted. 0 times theorem prover too weak. 8945 trivial. 0 not checked. [2022-11-25 17:06:30,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:30,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110804590] [2022-11-25 17:06:30,217 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:06:30,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069345554] [2022-11-25 17:06:30,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069345554] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:06:30,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:06:30,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25] total 28 [2022-11-25 17:06:30,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366499106] [2022-11-25 17:06:30,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:06:30,218 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 17:06:30,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:30,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 17:06:30,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2022-11-25 17:06:30,219 INFO L87 Difference]: Start difference. First operand 5533 states and 8327 transitions. cyclomatic complexity: 2872 Second operand has 28 states, 25 states have (on average 2.76) internal successors, (69), 26 states have internal predecessors, (69), 16 states have call successors, (27), 2 states have call predecessors, (27), 12 states have return successors, (34), 13 states have call predecessors, (34), 16 states have call successors, (34) [2022-11-25 17:06:31,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:31,658 INFO L93 Difference]: Finished difference Result 6582 states and 9973 transitions. [2022-11-25 17:06:31,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6582 states and 9973 transitions. [2022-11-25 17:06:31,685 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 855 [2022-11-25 17:06:31,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6582 states to 6581 states and 9972 transitions. [2022-11-25 17:06:31,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 334 [2022-11-25 17:06:31,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 334 [2022-11-25 17:06:31,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6581 states and 9972 transitions. [2022-11-25 17:06:31,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 17:06:31,716 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6581 states and 9972 transitions. [2022-11-25 17:06:31,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6581 states and 9972 transitions. [2022-11-25 17:06:31,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6581 to 5542. [2022-11-25 17:06:31,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5542 states, 3515 states have (on average 1.0793741109530584) internal successors, (3794), 3537 states have internal predecessors, (3794), 1287 states have call successors, (1453), 599 states have call predecessors, (1453), 740 states have return successors, (3097), 1405 states have call predecessors, (3097), 1287 states have call successors, (3097) [2022-11-25 17:06:31,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5542 states to 5542 states and 8344 transitions. [2022-11-25 17:06:31,796 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5542 states and 8344 transitions. [2022-11-25 17:06:31,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-25 17:06:31,797 INFO L428 stractBuchiCegarLoop]: Abstraction has 5542 states and 8344 transitions. [2022-11-25 17:06:31,797 INFO L335 stractBuchiCegarLoop]: ======== Iteration 52 ============ [2022-11-25 17:06:31,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5542 states and 8344 transitions. [2022-11-25 17:06:31,807 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 697 [2022-11-25 17:06:31,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:06:31,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:06:31,811 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [116, 116, 68, 68, 68, 68, 48, 17, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 3, 3, 1, 1, 1, 1] [2022-11-25 17:06:31,811 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [70, 70, 52, 52, 52, 52, 18, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:31,812 INFO L748 eck$LassoCheckResult]: Stem: 578543#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 578523#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; 578524#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 578542#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; 578532#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 578533#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 582933#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 578508#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 578509#factENTRY ~n := #in~n; 582662#L25 assume ~n <= 0;#res := 1; 582659#factFINAL assume true; 582652#factEXIT >#68#return; 578563#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 578564#factENTRY ~n := #in~n; 583119#L25 assume ~n <= 0;#res := 1; 583118#factFINAL assume true; 583117#factEXIT >#70#return; 578504#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 578505#factENTRY ~n := #in~n; 583251#L25 assume ~n <= 0;#res := 1; 583250#factFINAL assume true; 583249#factEXIT >#72#return; 578541#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 578539#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 578540#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 583420#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 583417#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 583412#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 583413#factENTRY ~n := #in~n; 583440#L25 assume !(~n <= 0); 583436#L26 call #t~ret0 := fact(~n - 1);< 583437#factENTRY ~n := #in~n; 583441#L25 assume ~n <= 0;#res := 1; 583439#factFINAL assume true; 583435#factEXIT >#66#return; 583431#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 583427#factFINAL assume true; 583425#factEXIT >#74#return; 583407#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 583409#factENTRY ~n := #in~n; 583433#L25 assume ~n <= 0;#res := 1; 583434#factFINAL assume true; 583423#factEXIT >#76#return; 583402#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 583404#factENTRY ~n := #in~n; 583419#L25 assume !(~n <= 0); 583415#L26 call #t~ret0 := fact(~n - 1);< 583416#factENTRY ~n := #in~n; 583421#L25 assume ~n <= 0;#res := 1; 583418#factFINAL assume true; 583414#factEXIT >#66#return; 583410#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 583405#factFINAL assume true; 583400#factEXIT >#78#return; 583403#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; 583476#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 583475#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 583474#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 578546#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 578491#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 578492#factENTRY ~n := #in~n; 583831#L25 assume !(~n <= 0); 583828#L26 call #t~ret0 := fact(~n - 1);< 583829#factENTRY ~n := #in~n; 583855#L25 assume !(~n <= 0); 583827#L26 call #t~ret0 := fact(~n - 1);< 583852#factENTRY ~n := #in~n; 583857#L25 assume ~n <= 0;#res := 1; 583854#factFINAL assume true; 583851#factEXIT >#66#return; 583849#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 583847#factFINAL assume true; 583826#factEXIT >#66#return; 583824#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 583823#factFINAL assume true; 583819#factEXIT >#74#return; 578529#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 578567#factENTRY ~n := #in~n; 584000#L25 assume ~n <= 0;#res := 1; 584001#factFINAL assume true; 583991#factEXIT >#76#return; 583986#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 584021#factENTRY ~n := #in~n; 583985#L25 assume !(~n <= 0); 583693#L26 call #t~ret0 := fact(~n - 1);< 583716#factENTRY ~n := #in~n; 583732#L25 assume !(~n <= 0); 583697#L26 call #t~ret0 := fact(~n - 1);< 583731#factENTRY ~n := #in~n; 583724#L25 assume ~n <= 0;#res := 1; 583722#factFINAL assume true; 583720#factEXIT >#66#return; 583719#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 583717#factFINAL assume true; 583718#factEXIT >#66#return; 583698#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 584024#factFINAL assume true; 584020#factEXIT >#78#return; 584012#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; 584011#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 584010#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 584007#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 583538#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 583535#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 583537#factENTRY ~n := #in~n; 583536#L25 assume !(~n <= 0); 583533#L26 call #t~ret0 := fact(~n - 1);< 583534#factENTRY ~n := #in~n; 583532#L25 assume !(~n <= 0); 583527#L26 call #t~ret0 := fact(~n - 1);< 583531#factENTRY ~n := #in~n; 583532#L25 assume !(~n <= 0); 583527#L26 call #t~ret0 := fact(~n - 1);< 583531#factENTRY ~n := #in~n; 583526#L25 assume ~n <= 0;#res := 1; 583528#factFINAL assume true; 583549#factEXIT >#66#return; 583548#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 583547#factFINAL assume true; 583546#factEXIT >#66#return; 583545#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 583544#factFINAL assume true; 583543#factEXIT >#66#return; 583542#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 583541#factFINAL assume true; 583540#factEXIT >#74#return; 583333#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 583332#factENTRY ~n := #in~n; 583334#L25 assume ~n <= 0;#res := 1; 583394#factFINAL assume true; 583389#factEXIT >#76#return; 578548#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 583387#factENTRY ~n := #in~n; 583386#L25 assume !(~n <= 0); 583347#L26 call #t~ret0 := fact(~n - 1);< 583385#factENTRY ~n := #in~n; 583384#L25 assume !(~n <= 0); 583344#L26 call #t~ret0 := fact(~n - 1);< 583352#factENTRY ~n := #in~n; 583356#L25 assume !(~n <= 0); 583345#L26 call #t~ret0 := fact(~n - 1);< 583382#factENTRY ~n := #in~n; 583388#L25 assume ~n <= 0;#res := 1; 583383#factFINAL assume true; 583381#factEXIT >#66#return; 583380#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 583379#factFINAL assume true; 583378#factEXIT >#66#return; 583377#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 583355#factFINAL assume true; 583343#factEXIT >#66#return; 578547#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 578550#factFINAL assume true; 583499#factEXIT >#78#return; 583317#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; 583316#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 583315#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 583314#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 578538#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 578534#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 578535#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 581981#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 581966#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 581968#factENTRY ~n := #in~n; 581999#L25 assume !(~n <= 0); 581978#L26 call #t~ret0 := fact(~n - 1);< 581979#factENTRY ~n := #in~n; 581984#L25 assume ~n <= 0;#res := 1; 581983#factFINAL assume true; 581977#factEXIT >#66#return; 581976#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581971#factFINAL assume true; 581964#factEXIT >#68#return; 581949#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 581952#factENTRY ~n := #in~n; 581960#L25 assume ~n <= 0;#res := 1; 581956#factFINAL assume true; 581948#factEXIT >#70#return; 581941#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 581946#factENTRY ~n := #in~n; 581986#L25 assume !(~n <= 0); 581889#L26 call #t~ret0 := fact(~n - 1);< 581896#factENTRY ~n := #in~n; 581911#L25 assume ~n <= 0;#res := 1; 581908#factFINAL assume true; 581897#factEXIT >#66#return; 581903#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581963#factFINAL assume true; 581940#factEXIT >#72#return; 581944#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 581962#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 581961#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 581959#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 581958#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 581865#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 581866#factENTRY ~n := #in~n; 581990#L25 assume !(~n <= 0); 581899#L26 call #t~ret0 := fact(~n - 1);< 581906#factENTRY ~n := #in~n; 581911#L25 assume ~n <= 0;#res := 1; 581908#factFINAL assume true; 581897#factEXIT >#66#return; 581887#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581883#factFINAL assume true; 581862#factEXIT >#68#return; 581858#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 581861#factENTRY ~n := #in~n; 581935#L25 assume !(~n <= 0); 581900#L26 call #t~ret0 := fact(~n - 1);< 581906#factENTRY ~n := #in~n; 581911#L25 assume ~n <= 0;#res := 1; 581908#factFINAL assume true; 581897#factEXIT >#66#return; 581904#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581932#factFINAL assume true; 581857#factEXIT >#70#return; 581852#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 581856#factENTRY ~n := #in~n; 581996#L25 assume ~n <= 0;#res := 1; 581931#factFINAL assume true; 581850#factEXIT >#72#return; 581849#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 581847#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 581844#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 581843#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 581842#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 581818#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 581821#factENTRY ~n := #in~n; 581907#L25 assume !(~n <= 0); 581890#L26 call #t~ret0 := fact(~n - 1);< 581896#factENTRY ~n := #in~n; 582000#L25 assume !(~n <= 0); 581893#L26 call #t~ret0 := fact(~n - 1);< 582002#factENTRY ~n := #in~n; 581993#L25 assume ~n <= 0;#res := 1; 581930#factFINAL assume true; 581922#factEXIT >#66#return; 581919#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581915#factFINAL assume true; 581888#factEXIT >#66#return; 581886#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581885#factFINAL assume true; 581817#factEXIT >#74#return; 581812#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 581815#factENTRY ~n := #in~n; 581989#L25 assume !(~n <= 0); 581835#L26 call #t~ret0 := fact(~n - 1);< 581921#factENTRY ~n := #in~n; 581970#L25 assume ~n <= 0;#res := 1; 581969#factFINAL assume true; 581920#factEXIT >#66#return; 581918#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581831#factFINAL assume true; 581830#factEXIT >#76#return; 581805#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 581808#factENTRY ~n := #in~n; 581884#L25 assume !(~n <= 0); 581875#L26 call #t~ret0 := fact(~n - 1);< 581882#factENTRY ~n := #in~n; 581955#L25 assume ~n <= 0;#res := 1; 581954#factFINAL assume true; 581868#factEXIT >#66#return; 581867#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581816#factFINAL assume true; 581802#factEXIT >#78#return; 581806#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; 581829#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 581828#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 581826#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 581823#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 581572#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 581582#factENTRY ~n := #in~n; 581579#L25 assume !(~n <= 0); 581560#L26 call #t~ret0 := fact(~n - 1);< 581565#factENTRY ~n := #in~n; 581580#L25 assume !(~n <= 0); 581562#L26 call #t~ret0 := fact(~n - 1);< 581577#factENTRY ~n := #in~n; 581580#L25 assume !(~n <= 0); 581562#L26 call #t~ret0 := fact(~n - 1);< 581577#factENTRY ~n := #in~n; 581585#L25 assume ~n <= 0;#res := 1; 581584#factFINAL assume true; 581583#factEXIT >#66#return; 581581#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581578#factFINAL assume true; 581576#factEXIT >#66#return; 581575#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581567#factFINAL assume true; 581559#factEXIT >#66#return; 581563#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581598#factFINAL assume true; 581599#factEXIT >#74#return; 581527#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 581532#factENTRY ~n := #in~n; 581530#L25 assume !(~n <= 0); 581477#L26 call #t~ret0 := fact(~n - 1);< 581529#factENTRY ~n := #in~n; 581504#L25 assume ~n <= 0;#res := 1; 581505#factFINAL assume true; 581476#factEXIT >#66#return; 581482#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581792#factFINAL assume true; 581790#factEXIT >#76#return; 581362#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 581363#factENTRY ~n := #in~n; 581531#L25 assume !(~n <= 0); 581483#L26 call #t~ret0 := fact(~n - 1);< 581484#factENTRY ~n := #in~n; 581509#L25 assume !(~n <= 0); 581490#L26 call #t~ret0 := fact(~n - 1);< 581512#factENTRY ~n := #in~n; 581517#L25 assume ~n <= 0;#res := 1; 581515#factFINAL assume true; 581510#factEXIT >#66#return; 581506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581488#factFINAL assume true; 581495#factEXIT >#66#return; 581536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581459#factFINAL assume true; 581461#factEXIT >#78#return; 581357#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; 581354#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 581352#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 581350#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 581349#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 581348#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 580811#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 581341#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 581336#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 581338#factENTRY ~n := #in~n; 581347#L25 assume !(~n <= 0); 581344#L26 call #t~ret0 := fact(~n - 1);< 581346#factENTRY ~n := #in~n; 581358#L25 assume !(~n <= 0); 581345#L26 call #t~ret0 := fact(~n - 1);< 581356#factENTRY ~n := #in~n; 581402#L25 assume ~n <= 0;#res := 1; 581364#factFINAL assume true; 581355#factEXIT >#66#return; 581353#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581351#factFINAL assume true; 581343#factEXIT >#66#return; 581340#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581339#factFINAL assume true; 581335#factEXIT >#68#return; 581249#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 581250#factENTRY ~n := #in~n; 581256#L25 assume ~n <= 0;#res := 1; 581252#factFINAL assume true; 581247#factEXIT >#70#return; 581243#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 581246#factENTRY ~n := #in~n; 581267#L25 assume !(~n <= 0); 581263#L26 call #t~ret0 := fact(~n - 1);< 581266#factENTRY ~n := #in~n; 581443#L25 assume !(~n <= 0); 581262#L26 call #t~ret0 := fact(~n - 1);< 581587#factENTRY ~n := #in~n; 581291#L25 assume ~n <= 0;#res := 1; 581277#factFINAL assume true; 581272#factEXIT >#66#return; 581271#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581268#factFINAL assume true; 581261#factEXIT >#66#return; 581260#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581259#factFINAL assume true; 581242#factEXIT >#72#return; 581240#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 581234#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 581232#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 581231#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 581229#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 581201#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 581205#factENTRY ~n := #in~n; 581270#L25 assume !(~n <= 0); 581264#L26 call #t~ret0 := fact(~n - 1);< 581269#factENTRY ~n := #in~n; 581630#L25 assume !(~n <= 0); 581273#L26 call #t~ret0 := fact(~n - 1);< 581274#factENTRY ~n := #in~n; 581291#L25 assume ~n <= 0;#res := 1; 581277#factFINAL assume true; 581272#factEXIT >#66#return; 581271#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581268#factFINAL assume true; 581261#factEXIT >#66#return; 581265#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581209#factFINAL assume true; 581198#factEXIT >#68#return; 581204#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 581228#factENTRY ~n := #in~n; 581241#L25 assume !(~n <= 0); 581237#L26 call #t~ret0 := fact(~n - 1);< 581239#factENTRY ~n := #in~n; 581299#L25 assume ~n <= 0;#res := 1; 581297#factFINAL assume true; 581235#factEXIT >#66#return; 581233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581230#factFINAL assume true; 581227#factEXIT >#70#return; 581215#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 581218#factENTRY ~n := #in~n; 581298#L25 assume !(~n <= 0); 581236#L26 call #t~ret0 := fact(~n - 1);< 581239#factENTRY ~n := #in~n; 581299#L25 assume ~n <= 0;#res := 1; 581297#factFINAL assume true; 581235#factEXIT >#66#return; 581238#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581226#factFINAL assume true; 581214#factEXIT >#72#return; 581217#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 581225#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 581224#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 581223#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 581222#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 581199#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 581205#factENTRY ~n := #in~n; 581270#L25 assume !(~n <= 0); 581264#L26 call #t~ret0 := fact(~n - 1);< 581269#factENTRY ~n := #in~n; 581630#L25 assume !(~n <= 0); 581273#L26 call #t~ret0 := fact(~n - 1);< 581274#factENTRY ~n := #in~n; 581291#L25 assume ~n <= 0;#res := 1; 581277#factFINAL assume true; 581272#factEXIT >#66#return; 581271#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581268#factFINAL assume true; 581261#factEXIT >#66#return; 581265#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581209#factFINAL assume true; 581198#factEXIT >#68#return; 581180#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 581184#factENTRY ~n := #in~n; 581183#L25 assume !(~n <= 0); 581159#L26 call #t~ret0 := fact(~n - 1);< 581182#factENTRY ~n := #in~n; 581251#L25 assume !(~n <= 0); 581187#L26 call #t~ret0 := fact(~n - 1);< 581188#factENTRY ~n := #in~n; 581221#L25 assume ~n <= 0;#res := 1; 581220#factFINAL assume true; 581186#factEXIT >#66#return; 581185#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581179#factFINAL assume true; 581158#factEXIT >#66#return; 581160#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581293#factFINAL assume true; 581196#factEXIT >#70#return; 581190#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 581192#factENTRY ~n := #in~n; 581365#L25 assume ~n <= 0;#res := 1; 581253#factFINAL assume true; 581189#factEXIT >#72#return; 581102#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 581103#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 581134#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 581133#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 580838#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 580829#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 580830#factENTRY ~n := #in~n; 580851#L25 assume !(~n <= 0); 580846#L26 call #t~ret0 := fact(~n - 1);< 580847#factENTRY ~n := #in~n; 580874#L25 assume !(~n <= 0); 580845#L26 call #t~ret0 := fact(~n - 1);< 580871#factENTRY ~n := #in~n; 580874#L25 assume !(~n <= 0); 580845#L26 call #t~ret0 := fact(~n - 1);< 580871#factENTRY ~n := #in~n; 580891#L25 assume ~n <= 0;#res := 1; 580885#factFINAL assume true; 580884#factEXIT >#66#return; 580875#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580873#factFINAL assume true; 580870#factEXIT >#66#return; 580853#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580850#factFINAL assume true; 580844#factEXIT >#66#return; 580841#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580837#factFINAL assume true; 580828#factEXIT >#74#return; 580825#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 580826#factENTRY ~n := #in~n; 583256#L25 assume !(~n <= 0); 583254#L26 call #t~ret0 := fact(~n - 1);< 583255#factENTRY ~n := #in~n; 583266#L25 assume !(~n <= 0); 583262#L26 call #t~ret0 := fact(~n - 1);< 583267#factENTRY ~n := #in~n; 583269#L25 assume ~n <= 0;#res := 1; 583277#factFINAL assume true; 583271#factEXIT >#66#return; 583273#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 583278#factFINAL assume true; 583274#factEXIT >#66#return; 583248#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 583080#factFINAL assume true; 580824#factEXIT >#76#return; 580821#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 580822#factENTRY ~n := #in~n; 580840#L25 assume !(~n <= 0); 580832#L26 call #t~ret0 := fact(~n - 1);< 580836#factENTRY ~n := #in~n; 580842#L25 assume ~n <= 0;#res := 1; 580839#factFINAL assume true; 580831#factEXIT >#66#return; 580827#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580823#factFINAL assume true; 580820#factEXIT >#78#return; 580818#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; 580817#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 580816#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 580815#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 580813#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 580810#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 580808#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 578544#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 578545#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 580269#factENTRY ~n := #in~n; 580306#L25 assume !(~n <= 0); 580284#L26 call #t~ret0 := fact(~n - 1);< 580288#factENTRY ~n := #in~n; 580302#L25 assume !(~n <= 0); 580285#L26 call #t~ret0 := fact(~n - 1);< 580301#factENTRY ~n := #in~n; 580302#L25 assume !(~n <= 0); 580285#L26 call #t~ret0 := fact(~n - 1);< 580301#factENTRY ~n := #in~n; 580312#L25 assume ~n <= 0;#res := 1; 580310#factFINAL assume true; 580305#factEXIT >#66#return; 580304#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580303#factFINAL assume true; 580300#factEXIT >#66#return; 580299#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580295#factFINAL assume true; 580283#factEXIT >#66#return; 580282#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580276#factFINAL assume true; 580267#factEXIT >#68#return; 579852#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 578562#factENTRY ~n := #in~n; 580667#L25 assume ~n <= 0;#res := 1; 580659#factFINAL assume true; 579845#factEXIT >#70#return; 578502#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 578503#factENTRY ~n := #in~n; 580401#L25 assume !(~n <= 0); 578981#L26 call #t~ret0 := fact(~n - 1);< 579084#factENTRY ~n := #in~n; 579580#L25 assume !(~n <= 0); 578984#L26 call #t~ret0 := fact(~n - 1);< 579056#factENTRY ~n := #in~n; 579472#L25 assume !(~n <= 0); 578974#L26 call #t~ret0 := fact(~n - 1);< 579458#factENTRY ~n := #in~n; 579471#L25 assume ~n <= 0;#res := 1; 579469#factFINAL assume true; 579456#factEXIT >#66#return; 579448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579093#factFINAL assume true; 579086#factEXIT >#66#return; 579085#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579058#factFINAL assume true; 579050#factEXIT >#66#return; 579055#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581029#factFINAL assume true; 580801#factEXIT >#72#return; 580734#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 581067#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 581064#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 581060#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 581058#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 579728#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 579823#factENTRY ~n := #in~n; 579821#L25 assume !(~n <= 0); 578987#L26 call #t~ret0 := fact(~n - 1);< 579084#factENTRY ~n := #in~n; 579580#L25 assume !(~n <= 0); 578984#L26 call #t~ret0 := fact(~n - 1);< 579056#factENTRY ~n := #in~n; 579472#L25 assume !(~n <= 0); 578974#L26 call #t~ret0 := fact(~n - 1);< 579458#factENTRY ~n := #in~n; 579471#L25 assume ~n <= 0;#res := 1; 579469#factFINAL assume true; 579456#factEXIT >#66#return; 579448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579093#factFINAL assume true; 579086#factEXIT >#66#return; 579085#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579058#factFINAL assume true; 579050#factEXIT >#66#return; 579054#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580407#factFINAL assume true; 580118#factEXIT >#68#return; 580058#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 580076#factENTRY ~n := #in~n; 580075#L25 assume !(~n <= 0); 579021#L26 call #t~ret0 := fact(~n - 1);< 580074#factENTRY ~n := #in~n; 580078#L25 assume ~n <= 0;#res := 1; 580052#factFINAL assume true; 580043#factEXIT >#66#return; 580045#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580726#factFINAL assume true; 580725#factEXIT >#70#return; 579118#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 580141#factENTRY ~n := #in~n; 580140#L25 assume !(~n <= 0); 579088#L26 call #t~ret0 := fact(~n - 1);< 579123#factENTRY ~n := #in~n; 579476#L25 assume !(~n <= 0); 579457#L26 call #t~ret0 := fact(~n - 1);< 579459#factENTRY ~n := #in~n; 579471#L25 assume ~n <= 0;#res := 1; 579469#factFINAL assume true; 579456#factEXIT >#66#return; 579448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579093#factFINAL assume true; 579086#factEXIT >#66#return; 579091#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581088#factFINAL assume true; 580456#factEXIT >#72#return; 580467#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 583214#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 583212#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 583210#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 583053#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 579062#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 579141#factENTRY ~n := #in~n; 579139#L25 assume !(~n <= 0); 579022#L26 call #t~ret0 := fact(~n - 1);< 579071#factENTRY ~n := #in~n; 579554#L25 assume !(~n <= 0); 579052#L26 call #t~ret0 := fact(~n - 1);< 579057#factENTRY ~n := #in~n; 579136#L25 assume !(~n <= 0); 579089#L26 call #t~ret0 := fact(~n - 1);< 579092#factENTRY ~n := #in~n; 579471#L25 assume ~n <= 0;#res := 1; 579469#factFINAL assume true; 579456#factEXIT >#66#return; 579448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579093#factFINAL assume true; 579086#factEXIT >#66#return; 579085#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579058#factFINAL assume true; 579050#factEXIT >#66#return; 579054#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580407#factFINAL assume true; 580118#factEXIT >#68#return; 579094#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 579576#factENTRY ~n := #in~n; 579575#L25 assume !(~n <= 0); 579019#L26 call #t~ret0 := fact(~n - 1);< 579114#factENTRY ~n := #in~n; 579462#L25 assume !(~n <= 0); 579053#L26 call #t~ret0 := fact(~n - 1);< 579460#factENTRY ~n := #in~n; 579471#L25 assume ~n <= 0;#res := 1; 579469#factFINAL assume true; 579456#factEXIT >#66#return; 579448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579093#factFINAL assume true; 579086#factEXIT >#66#return; 579090#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580485#factFINAL assume true; 580482#factEXIT >#70#return; 579939#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 580049#factENTRY ~n := #in~n; 580048#L25 assume !(~n <= 0); 579087#L26 call #t~ret0 := fact(~n - 1);< 580046#factENTRY ~n := #in~n; 580078#L25 assume ~n <= 0;#res := 1; 580052#factFINAL assume true; 580043#factEXIT >#66#return; 580041#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580039#factFINAL assume true; 579938#factEXIT >#72#return; 579957#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 583190#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 583185#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 583180#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 583177#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 579059#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 579141#factENTRY ~n := #in~n; 579139#L25 assume !(~n <= 0); 579022#L26 call #t~ret0 := fact(~n - 1);< 579071#factENTRY ~n := #in~n; 579554#L25 assume !(~n <= 0); 579052#L26 call #t~ret0 := fact(~n - 1);< 579057#factENTRY ~n := #in~n; 579136#L25 assume !(~n <= 0); 579089#L26 call #t~ret0 := fact(~n - 1);< 579092#factENTRY ~n := #in~n; 579471#L25 assume ~n <= 0;#res := 1; 579469#factFINAL assume true; 579456#factEXIT >#66#return; 579448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579093#factFINAL assume true; 579086#factEXIT >#66#return; 579085#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579058#factFINAL assume true; 579050#factEXIT >#66#return; 579054#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580407#factFINAL assume true; 580118#factEXIT >#68#return; 579111#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 579576#factENTRY ~n := #in~n; 579575#L25 assume !(~n <= 0); 579019#L26 call #t~ret0 := fact(~n - 1);< 579114#factENTRY ~n := #in~n; 579462#L25 assume !(~n <= 0); 579053#L26 call #t~ret0 := fact(~n - 1);< 579460#factENTRY ~n := #in~n; 579136#L25 assume !(~n <= 0); 579089#L26 call #t~ret0 := fact(~n - 1);< 579092#factENTRY ~n := #in~n; 579471#L25 assume ~n <= 0;#res := 1; 579469#factFINAL assume true; 579456#factEXIT >#66#return; 579448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579093#factFINAL assume true; 579086#factEXIT >#66#return; 579085#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579058#factFINAL assume true; 579050#factEXIT >#66#return; 579054#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580407#factFINAL assume true; 580118#factEXIT >#70#return; 579631#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 579665#factENTRY ~n := #in~n; 580160#L25 assume ~n <= 0;#res := 1; 580156#factFINAL assume true; 579609#factEXIT >#72#return; 579658#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 583176#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 583175#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 583174#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 583172#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 578489#L30-5 [2022-11-25 17:06:31,813 INFO L750 eck$LassoCheckResult]: Loop: 578489#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 578490#factENTRY ~n := #in~n; 578608#L25 assume !(~n <= 0); 578599#L26 call #t~ret0 := fact(~n - 1);< 578601#factENTRY ~n := #in~n; 579578#L25 assume !(~n <= 0); 578597#L26 call #t~ret0 := fact(~n - 1);< 578693#factENTRY ~n := #in~n; 578964#L25 assume !(~n <= 0); 578598#L26 call #t~ret0 := fact(~n - 1);< 583105#factENTRY ~n := #in~n; 578964#L25 assume !(~n <= 0); 578598#L26 call #t~ret0 := fact(~n - 1);< 583105#factENTRY ~n := #in~n; 583114#L25 assume ~n <= 0;#res := 1; 583112#factFINAL assume true; 583111#factEXIT >#66#return; 583110#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 583109#factFINAL assume true; 583104#factEXIT >#66#return; 583100#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 583099#factFINAL assume true; 582943#factEXIT >#66#return; 578600#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 578692#factFINAL assume true; 578596#factEXIT >#66#return; 578594#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 578592#factFINAL assume true; 578582#factEXIT >#74#return; 578584#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 582387#factENTRY ~n := #in~n; 582388#L25 assume !(~n <= 0); 578511#L26 call #t~ret0 := fact(~n - 1);< 581789#factENTRY ~n := #in~n; 583155#L25 assume !(~n <= 0); 578494#L26 call #t~ret0 := fact(~n - 1);< 578516#factENTRY ~n := #in~n; 578517#L25 assume !(~n <= 0); 578496#L26 call #t~ret0 := fact(~n - 1);< 583154#factENTRY ~n := #in~n; 583143#L25 assume ~n <= 0;#res := 1; 583138#factFINAL assume true; 583139#factEXIT >#66#return; 583151#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 583152#factFINAL assume true; 578493#factEXIT >#66#return; 578498#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 578510#factFINAL assume true; 578512#factEXIT >#66#return; 580807#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580648#factFINAL assume true; 580649#factEXIT >#76#return; 578569#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 578570#factENTRY ~n := #in~n; 578729#L25 assume !(~n <= 0); 578724#L26 call #t~ret0 := fact(~n - 1);< 578727#factENTRY ~n := #in~n; 578730#L25 assume ~n <= 0;#res := 1; 578728#factFINAL assume true; 578723#factEXIT >#66#return; 578722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 578721#factFINAL assume true; 578719#factEXIT >#78#return; 578720#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; 580754#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 580753#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 580752#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 580751#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 580750#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 580749#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 580746#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 578506#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 578507#factENTRY ~n := #in~n; 580315#L25 assume !(~n <= 0); 580296#L26 call #t~ret0 := fact(~n - 1);< 580311#factENTRY ~n := #in~n; 580308#L25 assume !(~n <= 0); 580286#L26 call #t~ret0 := fact(~n - 1);< 580297#factENTRY ~n := #in~n; 580302#L25 assume !(~n <= 0); 580285#L26 call #t~ret0 := fact(~n - 1);< 580301#factENTRY ~n := #in~n; 580302#L25 assume !(~n <= 0); 580285#L26 call #t~ret0 := fact(~n - 1);< 580301#factENTRY ~n := #in~n; 580302#L25 assume !(~n <= 0); 580285#L26 call #t~ret0 := fact(~n - 1);< 580301#factENTRY ~n := #in~n; 580312#L25 assume ~n <= 0;#res := 1; 580310#factFINAL assume true; 580305#factEXIT >#66#return; 580304#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580303#factFINAL assume true; 580300#factEXIT >#66#return; 580299#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580295#factFINAL assume true; 580283#factEXIT >#66#return; 580287#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580763#factFINAL assume true; 580761#factEXIT >#66#return; 580748#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580758#factFINAL assume true; 580747#factEXIT >#66#return; 580745#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580744#factFINAL assume true; 580743#factEXIT >#68#return; 579854#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 578562#factENTRY ~n := #in~n; 580667#L25 assume ~n <= 0;#res := 1; 580659#factFINAL assume true; 579845#factEXIT >#70#return; 579009#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 579819#factENTRY ~n := #in~n; 579812#L25 assume !(~n <= 0); 578972#L26 call #t~ret0 := fact(~n - 1);< 579010#factENTRY ~n := #in~n; 579927#L25 assume !(~n <= 0); 578986#L26 call #t~ret0 := fact(~n - 1);< 579026#factENTRY ~n := #in~n; 579589#L25 assume !(~n <= 0); 578980#L26 call #t~ret0 := fact(~n - 1);< 579084#factENTRY ~n := #in~n; 579580#L25 assume !(~n <= 0); 578984#L26 call #t~ret0 := fact(~n - 1);< 579056#factENTRY ~n := #in~n; 579472#L25 assume !(~n <= 0); 578974#L26 call #t~ret0 := fact(~n - 1);< 579458#factENTRY ~n := #in~n; 579471#L25 assume ~n <= 0;#res := 1; 579469#factFINAL assume true; 579456#factEXIT >#66#return; 579448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579093#factFINAL assume true; 579086#factEXIT >#66#return; 579085#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579058#factFINAL assume true; 579050#factEXIT >#66#return; 579049#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579027#factFINAL assume true; 579018#factEXIT >#66#return; 578989#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579005#factFINAL assume true; 578971#factEXIT >#66#return; 578988#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580742#factFINAL assume true; 580732#factEXIT >#72#return; 580741#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 583121#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 583120#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 583014#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 583013#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 579758#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 579605#factENTRY ~n := #in~n; 579827#L25 assume !(~n <= 0); 578985#L26 call #t~ret0 := fact(~n - 1);< 579026#factENTRY ~n := #in~n; 579589#L25 assume !(~n <= 0); 578980#L26 call #t~ret0 := fact(~n - 1);< 579084#factENTRY ~n := #in~n; 579580#L25 assume !(~n <= 0); 578984#L26 call #t~ret0 := fact(~n - 1);< 579056#factENTRY ~n := #in~n; 579472#L25 assume !(~n <= 0); 578974#L26 call #t~ret0 := fact(~n - 1);< 579458#factENTRY ~n := #in~n; 579472#L25 assume !(~n <= 0); 578974#L26 call #t~ret0 := fact(~n - 1);< 579458#factENTRY ~n := #in~n; 579471#L25 assume ~n <= 0;#res := 1; 579469#factFINAL assume true; 579456#factEXIT >#66#return; 579448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579093#factFINAL assume true; 579086#factEXIT >#66#return; 579085#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579058#factFINAL assume true; 579050#factEXIT >#66#return; 579049#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579027#factFINAL assume true; 579018#factEXIT >#66#return; 578989#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579005#factFINAL assume true; 578971#factEXIT >#66#return; 578990#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579814#factFINAL assume true; 579698#factEXIT >#68#return; 579801#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 580079#factENTRY ~n := #in~n; 580077#L25 assume !(~n <= 0); 580044#L26 call #t~ret0 := fact(~n - 1);< 580057#factENTRY ~n := #in~n; 580078#L25 assume ~n <= 0;#res := 1; 580052#factFINAL assume true; 580043#factEXIT >#66#return; 580045#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580726#factFINAL assume true; 580725#factEXIT >#70#return; 579074#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 580423#factENTRY ~n := #in~n; 580424#L25 assume !(~n <= 0); 578978#L26 call #t~ret0 := fact(~n - 1);< 579084#factENTRY ~n := #in~n; 579580#L25 assume !(~n <= 0); 578984#L26 call #t~ret0 := fact(~n - 1);< 579056#factENTRY ~n := #in~n; 579472#L25 assume !(~n <= 0); 578974#L26 call #t~ret0 := fact(~n - 1);< 579458#factENTRY ~n := #in~n; 579471#L25 assume ~n <= 0;#res := 1; 579469#factFINAL assume true; 579456#factEXIT >#66#return; 579448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579093#factFINAL assume true; 579086#factEXIT >#66#return; 579085#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579058#factFINAL assume true; 579050#factEXIT >#66#return; 578991#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580764#factFINAL assume true; 580715#factEXIT >#72#return; 580718#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 583032#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 583031#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 583030#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 583029#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 579041#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 579815#factENTRY ~n := #in~n; 579928#L25 assume !(~n <= 0); 578975#L26 call #t~ret0 := fact(~n - 1);< 578992#factENTRY ~n := #in~n; 580013#L25 assume !(~n <= 0); 578979#L26 call #t~ret0 := fact(~n - 1);< 579056#factENTRY ~n := #in~n; 579472#L25 assume !(~n <= 0); 578974#L26 call #t~ret0 := fact(~n - 1);< 579458#factENTRY ~n := #in~n; 579472#L25 assume !(~n <= 0); 578974#L26 call #t~ret0 := fact(~n - 1);< 579458#factENTRY ~n := #in~n; 579471#L25 assume ~n <= 0;#res := 1; 579469#factFINAL assume true; 579456#factEXIT >#66#return; 579448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579093#factFINAL assume true; 579086#factEXIT >#66#return; 579085#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579058#factFINAL assume true; 579050#factEXIT >#66#return; 579049#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579027#factFINAL assume true; 579018#factEXIT >#66#return; 579023#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580323#factFINAL assume true; 580322#factEXIT >#68#return; 579710#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 579804#factENTRY ~n := #in~n; 580658#L25 assume !(~n <= 0); 578977#L26 call #t~ret0 := fact(~n - 1);< 579820#factENTRY ~n := #in~n; 579472#L25 assume !(~n <= 0); 578974#L26 call #t~ret0 := fact(~n - 1);< 579458#factENTRY ~n := #in~n; 579471#L25 assume ~n <= 0;#res := 1; 579469#factFINAL assume true; 579456#factEXIT >#66#return; 579448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579093#factFINAL assume true; 579086#factEXIT >#66#return; 579090#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580485#factFINAL assume true; 580482#factEXIT >#70#return; 579129#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 580159#factENTRY ~n := #in~n; 579926#L25 assume !(~n <= 0); 578982#L26 call #t~ret0 := fact(~n - 1);< 579056#factENTRY ~n := #in~n; 579472#L25 assume !(~n <= 0); 578974#L26 call #t~ret0 := fact(~n - 1);< 579458#factENTRY ~n := #in~n; 579471#L25 assume ~n <= 0;#res := 1; 579469#factFINAL assume true; 579456#factEXIT >#66#return; 579448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579093#factFINAL assume true; 579086#factEXIT >#66#return; 579091#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 581088#factFINAL assume true; 580456#factEXIT >#72#return; 580460#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 583004#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 583002#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 583000#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 582999#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 579035#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 579815#factENTRY ~n := #in~n; 579928#L25 assume !(~n <= 0); 578975#L26 call #t~ret0 := fact(~n - 1);< 578992#factENTRY ~n := #in~n; 580013#L25 assume !(~n <= 0); 578979#L26 call #t~ret0 := fact(~n - 1);< 579056#factENTRY ~n := #in~n; 579472#L25 assume !(~n <= 0); 578974#L26 call #t~ret0 := fact(~n - 1);< 579458#factENTRY ~n := #in~n; 579472#L25 assume !(~n <= 0); 578974#L26 call #t~ret0 := fact(~n - 1);< 579458#factENTRY ~n := #in~n; 579471#L25 assume ~n <= 0;#res := 1; 579469#factFINAL assume true; 579456#factEXIT >#66#return; 579448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579093#factFINAL assume true; 579086#factEXIT >#66#return; 579085#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579058#factFINAL assume true; 579050#factEXIT >#66#return; 579049#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579027#factFINAL assume true; 579018#factEXIT >#66#return; 579023#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580323#factFINAL assume true; 580322#factEXIT >#68#return; 579766#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 580076#factENTRY ~n := #in~n; 580075#L25 assume !(~n <= 0); 579021#L26 call #t~ret0 := fact(~n - 1);< 580074#factENTRY ~n := #in~n; 579462#L25 assume !(~n <= 0); 579053#L26 call #t~ret0 := fact(~n - 1);< 579460#factENTRY ~n := #in~n; 579136#L25 assume !(~n <= 0); 579089#L26 call #t~ret0 := fact(~n - 1);< 579092#factENTRY ~n := #in~n; 579476#L25 assume !(~n <= 0); 579457#L26 call #t~ret0 := fact(~n - 1);< 579459#factENTRY ~n := #in~n; 579471#L25 assume ~n <= 0;#res := 1; 579469#factFINAL assume true; 579456#factEXIT >#66#return; 579448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579093#factFINAL assume true; 579086#factEXIT >#66#return; 579085#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579058#factFINAL assume true; 579050#factEXIT >#66#return; 579049#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579027#factFINAL assume true; 579018#factEXIT >#66#return; 579023#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580323#factFINAL assume true; 580322#factEXIT >#70#return; 579942#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 579966#factENTRY ~n := #in~n; 580051#L25 assume !(~n <= 0); 578983#L26 call #t~ret0 := fact(~n - 1);< 579820#factENTRY ~n := #in~n; 580078#L25 assume ~n <= 0;#res := 1; 580052#factFINAL assume true; 580043#factEXIT >#66#return; 580041#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580039#factFINAL assume true; 579938#factEXIT >#72#return; 579661#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 583060#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 583059#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 583056#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 582949#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 579030#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 579140#factENTRY ~n := #in~n; 579137#L25 assume !(~n <= 0); 579020#L26 call #t~ret0 := fact(~n - 1);< 579034#factENTRY ~n := #in~n; 579138#L25 assume !(~n <= 0); 579051#L26 call #t~ret0 := fact(~n - 1);< 579057#factENTRY ~n := #in~n; 579136#L25 assume !(~n <= 0); 579089#L26 call #t~ret0 := fact(~n - 1);< 579092#factENTRY ~n := #in~n; 579476#L25 assume !(~n <= 0); 579457#L26 call #t~ret0 := fact(~n - 1);< 579459#factENTRY ~n := #in~n; 579471#L25 assume ~n <= 0;#res := 1; 579469#factFINAL assume true; 579456#factEXIT >#66#return; 579448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579093#factFINAL assume true; 579086#factEXIT >#66#return; 579085#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579058#factFINAL assume true; 579050#factEXIT >#66#return; 579049#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579027#factFINAL assume true; 579018#factEXIT >#66#return; 579023#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580323#factFINAL assume true; 580322#factEXIT >#68#return; 579113#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 579576#factENTRY ~n := #in~n; 579575#L25 assume !(~n <= 0); 579019#L26 call #t~ret0 := fact(~n - 1);< 579114#factENTRY ~n := #in~n; 579462#L25 assume !(~n <= 0); 579053#L26 call #t~ret0 := fact(~n - 1);< 579460#factENTRY ~n := #in~n; 579136#L25 assume !(~n <= 0); 579089#L26 call #t~ret0 := fact(~n - 1);< 579092#factENTRY ~n := #in~n; 579476#L25 assume !(~n <= 0); 579457#L26 call #t~ret0 := fact(~n - 1);< 579459#factENTRY ~n := #in~n; 579471#L25 assume ~n <= 0;#res := 1; 579469#factFINAL assume true; 579456#factEXIT >#66#return; 579448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579093#factFINAL assume true; 579086#factEXIT >#66#return; 579085#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579058#factFINAL assume true; 579050#factEXIT >#66#return; 579049#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579027#factFINAL assume true; 579018#factEXIT >#66#return; 579023#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 580323#factFINAL assume true; 580322#factEXIT >#70#return; 579637#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 579665#factENTRY ~n := #in~n; 580160#L25 assume ~n <= 0;#res := 1; 580156#factFINAL assume true; 579609#factEXIT >#72#return; 579664#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 582984#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 582983#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 582981#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 582950#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 578489#L30-5 [2022-11-25 17:06:31,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:31,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1466559774, now seen corresponding path program 36 times [2022-11-25 17:06:31,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:31,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388853372] [2022-11-25 17:06:31,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:31,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:31,838 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:06:31,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1570123804] [2022-11-25 17:06:31,838 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-25 17:06:31,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:06:31,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:31,846 INFO L229 MonitoredProcess]: Starting monitored process 319 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:06:31,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (319)] Waiting until timeout for monitored process [2022-11-25 17:06:32,234 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-11-25 17:06:32,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:06:32,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:06:32,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:32,359 INFO L134 CoverageAnalysis]: Checked inductivity of 31991 backedges. 373 proven. 48 refuted. 0 times theorem prover too weak. 31570 trivial. 0 not checked. [2022-11-25 17:06:32,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:06:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 31991 backedges. 373 proven. 48 refuted. 0 times theorem prover too weak. 31570 trivial. 0 not checked. [2022-11-25 17:06:32,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:32,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388853372] [2022-11-25 17:06:32,937 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:06:32,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570123804] [2022-11-25 17:06:32,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570123804] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:06:32,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:06:32,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-11-25 17:06:32,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288746229] [2022-11-25 17:06:32,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:06:32,939 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 17:06:32,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:32,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1437841664, now seen corresponding path program 32 times [2022-11-25 17:06:32,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:32,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342074290] [2022-11-25 17:06:32,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:32,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:32,952 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:06:32,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1823978453] [2022-11-25 17:06:32,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:06:32,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:06:32,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:32,961 INFO L229 MonitoredProcess]: Starting monitored process 320 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:06:32,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (320)] Waiting until timeout for monitored process [2022-11-25 17:06:33,290 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:06:33,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:06:33,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-25 17:06:33,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:33,558 INFO L134 CoverageAnalysis]: Checked inductivity of 12413 backedges. 7026 proven. 454 refuted. 0 times theorem prover too weak. 4933 trivial. 0 not checked. [2022-11-25 17:06:33,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:06:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 12413 backedges. 780 proven. 1797 refuted. 0 times theorem prover too weak. 9836 trivial. 0 not checked. [2022-11-25 17:06:35,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:35,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342074290] [2022-11-25 17:06:35,353 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:06:35,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823978453] [2022-11-25 17:06:35,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823978453] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:06:35,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:06:35,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25] total 31 [2022-11-25 17:06:35,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362473569] [2022-11-25 17:06:35,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:06:35,355 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 17:06:35,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:35,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-25 17:06:35,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=810, Unknown=0, NotChecked=0, Total=930 [2022-11-25 17:06:35,356 INFO L87 Difference]: Start difference. First operand 5542 states and 8344 transitions. cyclomatic complexity: 2880 Second operand has 31 states, 27 states have (on average 2.814814814814815) internal successors, (76), 31 states have internal predecessors, (76), 18 states have call successors, (33), 2 states have call predecessors, (33), 11 states have return successors, (38), 14 states have call predecessors, (38), 18 states have call successors, (38) [2022-11-25 17:06:37,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:37,224 INFO L93 Difference]: Finished difference Result 6791 states and 10403 transitions. [2022-11-25 17:06:37,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6791 states and 10403 transitions. [2022-11-25 17:06:37,251 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 805 [2022-11-25 17:06:37,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6791 states to 6790 states and 10401 transitions. [2022-11-25 17:06:37,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 334 [2022-11-25 17:06:37,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 334 [2022-11-25 17:06:37,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6790 states and 10401 transitions. [2022-11-25 17:06:37,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 17:06:37,287 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6790 states and 10401 transitions. [2022-11-25 17:06:37,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6790 states and 10401 transitions. [2022-11-25 17:06:37,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6790 to 5509. [2022-11-25 17:06:37,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5509 states, 3501 states have (on average 1.0796915167095116) internal successors, (3780), 3523 states have internal predecessors, (3780), 1267 states have call successors, (1433), 601 states have call predecessors, (1433), 741 states have return successors, (3097), 1384 states have call predecessors, (3097), 1267 states have call successors, (3097) [2022-11-25 17:06:37,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5509 states to 5509 states and 8310 transitions. [2022-11-25 17:06:37,374 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5509 states and 8310 transitions. [2022-11-25 17:06:37,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-25 17:06:37,374 INFO L428 stractBuchiCegarLoop]: Abstraction has 5509 states and 8310 transitions. [2022-11-25 17:06:37,374 INFO L335 stractBuchiCegarLoop]: ======== Iteration 53 ============ [2022-11-25 17:06:37,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5509 states and 8310 transitions. [2022-11-25 17:06:37,385 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 677 [2022-11-25 17:06:37,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:06:37,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:06:37,388 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [118, 118, 70, 70, 70, 70, 48, 17, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 3, 3, 1, 1, 1, 1] [2022-11-25 17:06:37,388 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [68, 68, 50, 50, 50, 50, 18, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:37,388 INFO L748 eck$LassoCheckResult]: Stem: 598026#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 598002#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; 598003#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 598025#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; 598013#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 598014#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 601400#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 597994#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 597995#factENTRY ~n := #in~n; 601546#L25 assume ~n <= 0;#res := 1; 601538#factFINAL assume true; 601532#factEXIT >#68#return; 598040#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 598041#factENTRY ~n := #in~n; 601508#L25 assume ~n <= 0;#res := 1; 601506#factFINAL assume true; 601505#factEXIT >#70#return; 597983#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 597984#factENTRY ~n := #in~n; 602607#L25 assume ~n <= 0;#res := 1; 602606#factFINAL assume true; 602605#factEXIT >#72#return; 602604#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 598019#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 598020#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 602874#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 602870#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 602866#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 602867#factENTRY ~n := #in~n; 602884#L25 assume !(~n <= 0); 602879#L26 call #t~ret0 := fact(~n - 1);< 602880#factENTRY ~n := #in~n; 602890#L25 assume ~n <= 0;#res := 1; 602913#factFINAL assume true; 602912#factEXIT >#66#return; 602911#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 602910#factFINAL assume true; 602908#factEXIT >#74#return; 602861#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 602863#factENTRY ~n := #in~n; 602904#L25 assume ~n <= 0;#res := 1; 602905#factFINAL assume true; 602894#factEXIT >#76#return; 602856#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 602859#factENTRY ~n := #in~n; 602902#L25 assume !(~n <= 0); 602897#L26 call #t~ret0 := fact(~n - 1);< 602898#factENTRY ~n := #in~n; 602909#L25 assume ~n <= 0;#res := 1; 602907#factFINAL assume true; 602896#factEXIT >#66#return; 602893#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 602891#factFINAL assume true; 602855#factEXIT >#78#return; 602858#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; 602946#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 602945#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 602944#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 598028#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 597970#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 597971#factENTRY ~n := #in~n; 603417#L25 assume !(~n <= 0); 603413#L26 call #t~ret0 := fact(~n - 1);< 603415#factENTRY ~n := #in~n; 603422#L25 assume !(~n <= 0); 603414#L26 call #t~ret0 := fact(~n - 1);< 603420#factENTRY ~n := #in~n; 603423#L25 assume ~n <= 0;#res := 1; 603421#factFINAL assume true; 603419#factEXIT >#66#return; 603418#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 603416#factFINAL assume true; 603412#factEXIT >#66#return; 603411#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 603410#factFINAL assume true; 603409#factEXIT >#74#return; 598044#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 598045#factENTRY ~n := #in~n; 603451#L25 assume ~n <= 0;#res := 1; 603449#factFINAL assume true; 603450#factEXIT >#76#return; 598000#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 597999#factENTRY ~n := #in~n; 598001#L25 assume !(~n <= 0); 598033#L26 call #t~ret0 := fact(~n - 1);< 603187#factENTRY ~n := #in~n; 603248#L25 assume !(~n <= 0); 603227#L26 call #t~ret0 := fact(~n - 1);< 603230#factENTRY ~n := #in~n; 603245#L25 assume ~n <= 0;#res := 1; 603243#factFINAL assume true; 603241#factEXIT >#66#return; 603240#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 603239#factFINAL assume true; 603234#factEXIT >#66#return; 603237#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 603466#factFINAL assume true; 603463#factEXIT >#78#return; 603445#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; 603444#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 598047#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 598036#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 598037#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 602742#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 602986#factENTRY ~n := #in~n; 602985#L25 assume !(~n <= 0); 602983#L26 call #t~ret0 := fact(~n - 1);< 602984#factENTRY ~n := #in~n; 602982#L25 assume !(~n <= 0); 602977#L26 call #t~ret0 := fact(~n - 1);< 602981#factENTRY ~n := #in~n; 602982#L25 assume !(~n <= 0); 602977#L26 call #t~ret0 := fact(~n - 1);< 602981#factENTRY ~n := #in~n; 602976#L25 assume ~n <= 0;#res := 1; 602978#factFINAL assume true; 602998#factEXIT >#66#return; 602997#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 602996#factFINAL assume true; 602995#factEXIT >#66#return; 602994#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 602993#factFINAL assume true; 602992#factEXIT >#66#return; 602991#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 602990#factFINAL assume true; 602741#factEXIT >#74#return; 602737#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 602782#factENTRY ~n := #in~n; 602783#L25 assume ~n <= 0;#res := 1; 602839#factFINAL assume true; 602838#factEXIT >#76#return; 602834#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 602836#factENTRY ~n := #in~n; 602835#L25 assume !(~n <= 0); 602792#L26 call #t~ret0 := fact(~n - 1);< 602833#factENTRY ~n := #in~n; 602832#L25 assume !(~n <= 0); 602791#L26 call #t~ret0 := fact(~n - 1);< 602797#factENTRY ~n := #in~n; 602802#L25 assume !(~n <= 0); 602790#L26 call #t~ret0 := fact(~n - 1);< 602830#factENTRY ~n := #in~n; 602837#L25 assume ~n <= 0;#res := 1; 602831#factFINAL assume true; 602829#factEXIT >#66#return; 602828#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 602827#factFINAL assume true; 602826#factEXIT >#66#return; 602825#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 602801#factFINAL assume true; 602788#factEXIT >#66#return; 602796#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 602916#factFINAL assume true; 602915#factEXIT >#78#return; 601977#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; 601970#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 601392#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 601386#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 601376#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 601368#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 601366#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 601361#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 601338#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 601341#factENTRY ~n := #in~n; 601354#L25 assume !(~n <= 0); 601350#L26 call #t~ret0 := fact(~n - 1);< 601351#factENTRY ~n := #in~n; 601363#L25 assume ~n <= 0;#res := 1; 601486#factFINAL assume true; 601485#factEXIT >#66#return; 601484#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 601482#factFINAL assume true; 601481#factEXIT >#68#return; 601396#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 601399#factENTRY ~n := #in~n; 601405#L25 assume ~n <= 0;#res := 1; 601404#factFINAL assume true; 601395#factEXIT >#70#return; 601328#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 601374#factENTRY ~n := #in~n; 601372#L25 assume !(~n <= 0); 601280#L26 call #t~ret0 := fact(~n - 1);< 601304#factENTRY ~n := #in~n; 601335#L25 assume ~n <= 0;#res := 1; 601326#factFINAL assume true; 601311#factEXIT >#66#return; 601318#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 601480#factFINAL assume true; 601477#factEXIT >#72#return; 601479#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 601501#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 601493#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 601494#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 601417#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 601378#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 601393#factENTRY ~n := #in~n; 601377#L25 assume !(~n <= 0); 601312#L26 call #t~ret0 := fact(~n - 1);< 601320#factENTRY ~n := #in~n; 601335#L25 assume ~n <= 0;#res := 1; 601326#factFINAL assume true; 601311#factEXIT >#66#return; 601316#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 601416#factFINAL assume true; 601415#factEXIT >#68#return; 601371#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 601387#factENTRY ~n := #in~n; 601388#L25 assume !(~n <= 0); 601314#L26 call #t~ret0 := fact(~n - 1);< 601320#factENTRY ~n := #in~n; 601335#L25 assume ~n <= 0;#res := 1; 601326#factFINAL assume true; 601311#factEXIT >#66#return; 601319#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 601471#factFINAL assume true; 601469#factEXIT >#70#return; 601462#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 601467#factENTRY ~n := #in~n; 601470#L25 assume ~n <= 0;#res := 1; 601468#factFINAL assume true; 601461#factEXIT >#72#return; 601466#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 601509#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 601503#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 601504#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 601490#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 601302#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 601355#factENTRY ~n := #in~n; 601352#L25 assume !(~n <= 0); 601278#L26 call #t~ret0 := fact(~n - 1);< 601304#factENTRY ~n := #in~n; 601367#L25 assume !(~n <= 0); 601277#L26 call #t~ret0 := fact(~n - 1);< 601308#factENTRY ~n := #in~n; 601323#L25 assume ~n <= 0;#res := 1; 601321#factFINAL assume true; 601306#factEXIT >#66#return; 601305#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 601300#factFINAL assume true; 601276#factEXIT >#66#return; 601282#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 601455#factFINAL assume true; 601453#factEXIT >#74#return; 601424#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 601426#factENTRY ~n := #in~n; 601445#L25 assume !(~n <= 0); 601410#L26 call #t~ret0 := fact(~n - 1);< 601436#factENTRY ~n := #in~n; 601440#L25 assume ~n <= 0;#res := 1; 601438#factFINAL assume true; 601435#factEXIT >#66#return; 601430#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 601431#factFINAL assume true; 601423#factEXIT >#76#return; 601382#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 601394#factENTRY ~n := #in~n; 601381#L25 assume !(~n <= 0); 601149#L26 call #t~ret0 := fact(~n - 1);< 601162#factENTRY ~n := #in~n; 601561#L25 assume ~n <= 0;#res := 1; 601557#factFINAL assume true; 601547#factEXIT >#66#return; 601545#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 601544#factFINAL assume true; 601534#factEXIT >#78#return; 601536#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; 601816#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 601815#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 601814#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 601813#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 600909#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 600924#factENTRY ~n := #in~n; 600919#L25 assume !(~n <= 0); 600898#L26 call #t~ret0 := fact(~n - 1);< 600903#factENTRY ~n := #in~n; 600923#L25 assume !(~n <= 0); 600899#L26 call #t~ret0 := fact(~n - 1);< 600915#factENTRY ~n := #in~n; 600923#L25 assume !(~n <= 0); 600899#L26 call #t~ret0 := fact(~n - 1);< 600915#factENTRY ~n := #in~n; 600928#L25 assume ~n <= 0;#res := 1; 600927#factFINAL assume true; 600926#factEXIT >#66#return; 600922#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 600918#factFINAL assume true; 600914#factEXIT >#66#return; 600913#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 600905#factFINAL assume true; 600897#factEXIT >#66#return; 600901#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 600972#factFINAL assume true; 600973#factEXIT >#74#return; 600865#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 600870#factENTRY ~n := #in~n; 600868#L25 assume !(~n <= 0); 600828#L26 call #t~ret0 := fact(~n - 1);< 600848#factENTRY ~n := #in~n; 600845#L25 assume ~n <= 0;#res := 1; 600846#factFINAL assume true; 600824#factEXIT >#66#return; 600830#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 601533#factFINAL assume true; 601514#factEXIT >#76#return; 600819#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 600816#factENTRY ~n := #in~n; 600869#L25 assume !(~n <= 0); 600831#L26 call #t~ret0 := fact(~n - 1);< 600832#factENTRY ~n := #in~n; 600867#L25 assume !(~n <= 0); 600836#L26 call #t~ret0 := fact(~n - 1);< 600852#factENTRY ~n := #in~n; 600856#L25 assume ~n <= 0;#res := 1; 600854#factFINAL assume true; 600850#factEXIT >#66#return; 600847#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 600833#factFINAL assume true; 600840#factEXIT >#66#return; 600892#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 600818#factFINAL assume true; 600820#factEXIT >#78#return; 600811#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; 600809#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 600805#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 600802#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 600800#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 600797#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 600419#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 600791#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 600786#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 600787#factENTRY ~n := #in~n; 600799#L25 assume !(~n <= 0); 600794#L26 call #t~ret0 := fact(~n - 1);< 600796#factENTRY ~n := #in~n; 600807#L25 assume !(~n <= 0); 600795#L26 call #t~ret0 := fact(~n - 1);< 600804#factENTRY ~n := #in~n; 600808#L25 assume ~n <= 0;#res := 1; 600806#factFINAL assume true; 600803#factEXIT >#66#return; 600801#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 600798#factFINAL assume true; 600793#factEXIT >#66#return; 600792#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 600790#factFINAL assume true; 600784#factEXIT >#68#return; 600780#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 600782#factENTRY ~n := #in~n; 600789#L25 assume ~n <= 0;#res := 1; 600783#factFINAL assume true; 600779#factEXIT >#70#return; 600708#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 600715#factENTRY ~n := #in~n; 600711#L25 assume !(~n <= 0); 600697#L26 call #t~ret0 := fact(~n - 1);< 600709#factENTRY ~n := #in~n; 600733#L25 assume !(~n <= 0); 600698#L26 call #t~ret0 := fact(~n - 1);< 600714#factENTRY ~n := #in~n; 600717#L25 assume ~n <= 0;#res := 1; 600716#factFINAL assume true; 600712#factEXIT >#66#return; 600710#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 600706#factFINAL assume true; 600696#factEXIT >#66#return; 600700#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 600778#factFINAL assume true; 600777#factEXIT >#72#return; 600776#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 600774#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 600772#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 600770#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 600738#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 600675#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 600680#factENTRY ~n := #in~n; 600702#L25 assume !(~n <= 0); 600699#L26 call #t~ret0 := fact(~n - 1);< 600701#factENTRY ~n := #in~n; 600737#L25 assume !(~n <= 0); 600713#L26 call #t~ret0 := fact(~n - 1);< 600718#factENTRY ~n := #in~n; 600717#L25 assume ~n <= 0;#res := 1; 600716#factFINAL assume true; 600712#factEXIT >#66#return; 600710#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 600706#factFINAL assume true; 600696#factEXIT >#66#return; 600695#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 600691#factFINAL assume true; 600673#factEXIT >#68#return; 600678#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 600755#factENTRY ~n := #in~n; 600763#L25 assume !(~n <= 0); 600759#L26 call #t~ret0 := fact(~n - 1);< 600762#factENTRY ~n := #in~n; 600766#L25 assume ~n <= 0;#res := 1; 600765#factFINAL assume true; 600758#factEXIT >#66#return; 600761#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 600757#factFINAL assume true; 600754#factEXIT >#70#return; 600751#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 600752#factENTRY ~n := #in~n; 600768#L25 assume !(~n <= 0); 600760#L26 call #t~ret0 := fact(~n - 1);< 600762#factENTRY ~n := #in~n; 600766#L25 assume ~n <= 0;#res := 1; 600765#factFINAL assume true; 600758#factEXIT >#66#return; 600756#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 600753#factFINAL assume true; 600749#factEXIT >#72#return; 600747#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 600745#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 600743#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 600741#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 600739#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 600674#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 600680#factENTRY ~n := #in~n; 600702#L25 assume !(~n <= 0); 600699#L26 call #t~ret0 := fact(~n - 1);< 600701#factENTRY ~n := #in~n; 600737#L25 assume !(~n <= 0); 600713#L26 call #t~ret0 := fact(~n - 1);< 600718#factENTRY ~n := #in~n; 600717#L25 assume ~n <= 0;#res := 1; 600716#factFINAL assume true; 600712#factEXIT >#66#return; 600710#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 600706#factFINAL assume true; 600696#factEXIT >#66#return; 600695#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 600691#factFINAL assume true; 600673#factEXIT >#68#return; 600671#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 600672#factENTRY ~n := #in~n; 600690#L25 assume !(~n <= 0); 600685#L26 call #t~ret0 := fact(~n - 1);< 600689#factENTRY ~n := #in~n; 600730#L25 assume !(~n <= 0); 600728#L26 call #t~ret0 := fact(~n - 1);< 600729#factENTRY ~n := #in~n; 600732#L25 assume ~n <= 0;#res := 1; 600731#factFINAL assume true; 600727#factEXIT >#66#return; 600724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 600719#factFINAL assume true; 600684#factEXIT >#66#return; 600683#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 600682#factFINAL assume true; 600669#factEXIT >#70#return; 600654#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 600656#factENTRY ~n := #in~n; 600658#L25 assume ~n <= 0;#res := 1; 600657#factFINAL assume true; 600652#factEXIT >#72#return; 600649#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 600650#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 600642#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 600643#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 600611#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 600608#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 600609#factENTRY ~n := #in~n; 600618#L25 assume !(~n <= 0); 600614#L26 call #t~ret0 := fact(~n - 1);< 600616#factENTRY ~n := #in~n; 600623#L25 assume !(~n <= 0); 600615#L26 call #t~ret0 := fact(~n - 1);< 600621#factENTRY ~n := #in~n; 600623#L25 assume !(~n <= 0); 600615#L26 call #t~ret0 := fact(~n - 1);< 600621#factENTRY ~n := #in~n; 600627#L25 assume ~n <= 0;#res := 1; 600626#factFINAL assume true; 600625#factEXIT >#66#return; 600624#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 600622#factFINAL assume true; 600620#factEXIT >#66#return; 600619#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 600617#factFINAL assume true; 600613#factEXIT >#66#return; 600612#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 600610#factFINAL assume true; 600607#factEXIT >#74#return; 600605#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 600606#factENTRY ~n := #in~n; 601073#L25 assume !(~n <= 0); 601071#L26 call #t~ret0 := fact(~n - 1);< 601072#factENTRY ~n := #in~n; 601080#L25 assume !(~n <= 0); 601076#L26 call #t~ret0 := fact(~n - 1);< 601083#factENTRY ~n := #in~n; 601085#L25 assume ~n <= 0;#res := 1; 601094#factFINAL assume true; 601088#factEXIT >#66#return; 601090#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 601095#factFINAL assume true; 601091#factEXIT >#66#return; 600939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 600932#factFINAL assume true; 600604#factEXIT >#76#return; 600427#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 600428#factENTRY ~n := #in~n; 600521#L25 assume !(~n <= 0); 600477#L26 call #t~ret0 := fact(~n - 1);< 600496#factENTRY ~n := #in~n; 600493#L25 assume ~n <= 0;#res := 1; 600494#factFINAL assume true; 600476#factEXIT >#66#return; 600480#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 600586#factFINAL assume true; 600583#factEXIT >#78#return; 600424#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; 600423#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 600422#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 600421#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 600420#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 600418#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 600417#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 599665#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 599661#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 599663#factENTRY ~n := #in~n; 599677#L25 assume !(~n <= 0); 599671#L26 call #t~ret0 := fact(~n - 1);< 599675#factENTRY ~n := #in~n; 599686#L25 assume !(~n <= 0); 599672#L26 call #t~ret0 := fact(~n - 1);< 599689#factENTRY ~n := #in~n; 599686#L25 assume !(~n <= 0); 599672#L26 call #t~ret0 := fact(~n - 1);< 599689#factENTRY ~n := #in~n; 599700#L25 assume ~n <= 0;#res := 1; 599699#factFINAL assume true; 599695#factEXIT >#66#return; 599693#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599692#factFINAL assume true; 599688#factEXIT >#66#return; 599687#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599678#factFINAL assume true; 599670#factEXIT >#66#return; 599668#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599667#factFINAL assume true; 599660#factEXIT >#68#return; 599650#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 598039#factENTRY ~n := #in~n; 599676#L25 assume ~n <= 0;#res := 1; 599669#factFINAL assume true; 599641#factEXIT >#70#return; 599658#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 599639#factENTRY ~n := #in~n; 599839#L25 assume !(~n <= 0); 598900#L26 call #t~ret0 := fact(~n - 1);< 599451#factENTRY ~n := #in~n; 599929#L25 assume !(~n <= 0); 598901#L26 call #t~ret0 := fact(~n - 1);< 599430#factENTRY ~n := #in~n; 599515#L25 assume !(~n <= 0); 598902#L26 call #t~ret0 := fact(~n - 1);< 599506#factENTRY ~n := #in~n; 599509#L25 assume ~n <= 0;#res := 1; 599508#factFINAL assume true; 599502#factEXIT >#66#return; 599500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599460#factFINAL assume true; 599453#factEXIT >#66#return; 599452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599431#factFINAL assume true; 599422#factEXIT >#66#return; 599427#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 600471#factFINAL assume true; 600470#factEXIT >#72#return; 599777#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 600467#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 600466#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 600465#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 600449#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 598785#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 598833#factENTRY ~n := #in~n; 599591#L25 assume !(~n <= 0); 598905#L26 call #t~ret0 := fact(~n - 1);< 599451#factENTRY ~n := #in~n; 599929#L25 assume !(~n <= 0); 598901#L26 call #t~ret0 := fact(~n - 1);< 599430#factENTRY ~n := #in~n; 599515#L25 assume !(~n <= 0); 598902#L26 call #t~ret0 := fact(~n - 1);< 599506#factENTRY ~n := #in~n; 599515#L25 assume !(~n <= 0); 598902#L26 call #t~ret0 := fact(~n - 1);< 599506#factENTRY ~n := #in~n; 599509#L25 assume ~n <= 0;#res := 1; 599508#factFINAL assume true; 599502#factEXIT >#66#return; 599500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599460#factFINAL assume true; 599453#factEXIT >#66#return; 599452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599431#factFINAL assume true; 599422#factEXIT >#66#return; 599421#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599408#factFINAL assume true; 599401#factEXIT >#66#return; 599406#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599555#factFINAL assume true; 599545#factEXIT >#68#return; 598825#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 599554#factENTRY ~n := #in~n; 599621#L25 assume !(~n <= 0); 599402#L26 call #t~ret0 := fact(~n - 1);< 599446#factENTRY ~n := #in~n; 599612#L25 assume ~n <= 0;#res := 1; 599608#factFINAL assume true; 599603#factEXIT >#66#return; 599605#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599769#factFINAL assume true; 599767#factEXIT >#70#return; 599465#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 599794#factENTRY ~n := #in~n; 599793#L25 assume !(~n <= 0); 599455#L26 call #t~ret0 := fact(~n - 1);< 599469#factENTRY ~n := #in~n; 599510#L25 assume !(~n <= 0); 599503#L26 call #t~ret0 := fact(~n - 1);< 599504#factENTRY ~n := #in~n; 599509#L25 assume ~n <= 0;#res := 1; 599508#factFINAL assume true; 599502#factEXIT >#66#return; 599500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599460#factFINAL assume true; 599453#factEXIT >#66#return; 599457#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599841#factFINAL assume true; 599842#factEXIT >#72#return; 599734#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 601780#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 601779#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 601778#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 601777#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 599532#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 599536#factENTRY ~n := #in~n; 599535#L25 assume !(~n <= 0); 599404#L26 call #t~ret0 := fact(~n - 1);< 599521#factENTRY ~n := #in~n; 599513#L25 assume !(~n <= 0); 599423#L26 call #t~ret0 := fact(~n - 1);< 599429#factENTRY ~n := #in~n; 599499#L25 assume !(~n <= 0); 599456#L26 call #t~ret0 := fact(~n - 1);< 599459#factENTRY ~n := #in~n; 599509#L25 assume ~n <= 0;#res := 1; 599508#factFINAL assume true; 599502#factEXIT >#66#return; 599500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599460#factFINAL assume true; 599453#factEXIT >#66#return; 599452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599431#factFINAL assume true; 599422#factEXIT >#66#return; 599426#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599600#factFINAL assume true; 599599#factEXIT >#68#return; 599494#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 599507#factENTRY ~n := #in~n; 599501#L25 assume !(~n <= 0); 599405#L26 call #t~ret0 := fact(~n - 1);< 599498#factENTRY ~n := #in~n; 599514#L25 assume !(~n <= 0); 599424#L26 call #t~ret0 := fact(~n - 1);< 599505#factENTRY ~n := #in~n; 599509#L25 assume ~n <= 0;#res := 1; 599508#factFINAL assume true; 599502#factEXIT >#66#return; 599500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599460#factFINAL assume true; 599453#factEXIT >#66#return; 599458#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599756#factFINAL assume true; 599754#factEXIT >#70#return; 599573#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 599613#factENTRY ~n := #in~n; 599610#L25 assume !(~n <= 0); 599454#L26 call #t~ret0 := fact(~n - 1);< 599606#factENTRY ~n := #in~n; 599612#L25 assume ~n <= 0;#res := 1; 599608#factFINAL assume true; 599603#factEXIT >#66#return; 599602#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599601#factFINAL assume true; 599570#factEXIT >#72#return; 598684#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 601931#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 601930#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 601929#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 601928#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 599530#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 599536#factENTRY ~n := #in~n; 599535#L25 assume !(~n <= 0); 599404#L26 call #t~ret0 := fact(~n - 1);< 599521#factENTRY ~n := #in~n; 599513#L25 assume !(~n <= 0); 599423#L26 call #t~ret0 := fact(~n - 1);< 599429#factENTRY ~n := #in~n; 599499#L25 assume !(~n <= 0); 599456#L26 call #t~ret0 := fact(~n - 1);< 599459#factENTRY ~n := #in~n; 599509#L25 assume ~n <= 0;#res := 1; 599508#factFINAL assume true; 599502#factEXIT >#66#return; 599500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599460#factFINAL assume true; 599453#factEXIT >#66#return; 599452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599431#factFINAL assume true; 599422#factEXIT >#66#return; 599426#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599600#factFINAL assume true; 599599#factEXIT >#68#return; 599487#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 599507#factENTRY ~n := #in~n; 599501#L25 assume !(~n <= 0); 599405#L26 call #t~ret0 := fact(~n - 1);< 599498#factENTRY ~n := #in~n; 599514#L25 assume !(~n <= 0); 599424#L26 call #t~ret0 := fact(~n - 1);< 599505#factENTRY ~n := #in~n; 599499#L25 assume !(~n <= 0); 599456#L26 call #t~ret0 := fact(~n - 1);< 599459#factENTRY ~n := #in~n; 599510#L25 assume !(~n <= 0); 599503#L26 call #t~ret0 := fact(~n - 1);< 599504#factENTRY ~n := #in~n; 599509#L25 assume ~n <= 0;#res := 1; 599508#factFINAL assume true; 599502#factEXIT >#66#return; 599500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599460#factFINAL assume true; 599453#factEXIT >#66#return; 599452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599431#factFINAL assume true; 599422#factEXIT >#66#return; 599421#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599408#factFINAL assume true; 599401#factEXIT >#66#return; 599406#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599555#factFINAL assume true; 599545#factEXIT >#70#return; 598655#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 598710#factENTRY ~n := #in~n; 600340#L25 assume ~n <= 0;#res := 1; 600331#factFINAL assume true; 598654#factEXIT >#72#return; 598683#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 601914#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 601905#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 601904#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 601903#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 598055#L30-5 [2022-11-25 17:06:37,389 INFO L750 eck$LassoCheckResult]: Loop: 598055#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 597969#factENTRY ~n := #in~n; 598093#L25 assume !(~n <= 0); 598174#L26 call #t~ret0 := fact(~n - 1);< 598196#factENTRY ~n := #in~n; 598393#L25 assume !(~n <= 0); 598175#L26 call #t~ret0 := fact(~n - 1);< 598180#factENTRY ~n := #in~n; 598390#L25 assume !(~n <= 0); 598176#L26 call #t~ret0 := fact(~n - 1);< 599016#factENTRY ~n := #in~n; 598390#L25 assume !(~n <= 0); 598176#L26 call #t~ret0 := fact(~n - 1);< 599016#factENTRY ~n := #in~n; 599024#L25 assume ~n <= 0;#res := 1; 599023#factFINAL assume true; 599021#factEXIT >#66#return; 599019#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599017#factFINAL assume true; 599015#factEXIT >#66#return; 599012#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599010#factFINAL assume true; 599009#factEXIT >#66#return; 598195#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 598173#factFINAL assume true; 598177#factEXIT >#66#return; 598068#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 598066#factFINAL assume true; 598054#factEXIT >#74#return; 598056#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 598198#factENTRY ~n := #in~n; 599011#L25 assume !(~n <= 0); 597997#L26 call #t~ret0 := fact(~n - 1);< 597996#factENTRY ~n := #in~n; 597998#L25 assume !(~n <= 0); 597974#L26 call #t~ret0 := fact(~n - 1);< 598007#factENTRY ~n := #in~n; 600103#L25 assume !(~n <= 0); 597975#L26 call #t~ret0 := fact(~n - 1);< 600101#factENTRY ~n := #in~n; 600097#L25 assume ~n <= 0;#res := 1; 600090#factFINAL assume true; 600092#factEXIT >#66#return; 600098#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 600099#factFINAL assume true; 597972#factEXIT >#66#return; 597977#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 600223#factFINAL assume true; 599002#factEXIT >#66#return; 599001#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 598431#factFINAL assume true; 598432#factEXIT >#76#return; 598048#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 598049#factENTRY ~n := #in~n; 598243#L25 assume !(~n <= 0); 598078#L26 call #t~ret0 := fact(~n - 1);< 598242#factENTRY ~n := #in~n; 598268#L25 assume ~n <= 0;#res := 1; 598266#factFINAL assume true; 598264#factEXIT >#66#return; 598263#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 598261#factFINAL assume true; 598260#factEXIT >#78#return; 598004#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; 598005#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 598011#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 598046#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 598021#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 598022#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 600147#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 598027#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 597992#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 597993#factENTRY ~n := #in~n; 599691#L25 assume !(~n <= 0); 599679#L26 call #t~ret0 := fact(~n - 1);< 599685#factENTRY ~n := #in~n; 599684#L25 assume !(~n <= 0); 599673#L26 call #t~ret0 := fact(~n - 1);< 599680#factENTRY ~n := #in~n; 599686#L25 assume !(~n <= 0); 599672#L26 call #t~ret0 := fact(~n - 1);< 599689#factENTRY ~n := #in~n; 599686#L25 assume !(~n <= 0); 599672#L26 call #t~ret0 := fact(~n - 1);< 599689#factENTRY ~n := #in~n; 599700#L25 assume ~n <= 0;#res := 1; 599699#factFINAL assume true; 599695#factEXIT >#66#return; 599693#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599692#factFINAL assume true; 599688#factEXIT >#66#return; 599687#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599678#factFINAL assume true; 599670#factEXIT >#66#return; 599674#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599830#factFINAL assume true; 599820#factEXIT >#66#return; 599821#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599958#factFINAL assume true; 599957#factEXIT >#68#return; 599646#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 598039#factENTRY ~n := #in~n; 599676#L25 assume ~n <= 0;#res := 1; 599669#factFINAL assume true; 599641#factEXIT >#70#return; 599654#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 599840#factENTRY ~n := #in~n; 599838#L25 assume !(~n <= 0); 598910#L26 call #t~ret0 := fact(~n - 1);< 599413#factENTRY ~n := #in~n; 599931#L25 assume !(~n <= 0); 598899#L26 call #t~ret0 := fact(~n - 1);< 599451#factENTRY ~n := #in~n; 599929#L25 assume !(~n <= 0); 598901#L26 call #t~ret0 := fact(~n - 1);< 599430#factENTRY ~n := #in~n; 599515#L25 assume !(~n <= 0); 598902#L26 call #t~ret0 := fact(~n - 1);< 599506#factENTRY ~n := #in~n; 599515#L25 assume !(~n <= 0); 598902#L26 call #t~ret0 := fact(~n - 1);< 599506#factENTRY ~n := #in~n; 599509#L25 assume ~n <= 0;#res := 1; 599508#factFINAL assume true; 599502#factEXIT >#66#return; 599500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599460#factFINAL assume true; 599453#factEXIT >#66#return; 599452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599431#factFINAL assume true; 599422#factEXIT >#66#return; 599421#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599408#factFINAL assume true; 599401#factEXIT >#66#return; 598914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 598921#factFINAL assume true; 598895#factEXIT >#66#return; 598916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599836#factFINAL assume true; 599775#factEXIT >#72#return; 599784#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 600326#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 600325#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 600324#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 600323#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 598792#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 599912#factENTRY ~n := #in~n; 599913#L25 assume !(~n <= 0); 598897#L26 call #t~ret0 := fact(~n - 1);< 599413#factENTRY ~n := #in~n; 599931#L25 assume !(~n <= 0); 598899#L26 call #t~ret0 := fact(~n - 1);< 599451#factENTRY ~n := #in~n; 599929#L25 assume !(~n <= 0); 598901#L26 call #t~ret0 := fact(~n - 1);< 599430#factENTRY ~n := #in~n; 599515#L25 assume !(~n <= 0); 598902#L26 call #t~ret0 := fact(~n - 1);< 599506#factENTRY ~n := #in~n; 599509#L25 assume ~n <= 0;#res := 1; 599508#factFINAL assume true; 599502#factEXIT >#66#return; 599500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599460#factFINAL assume true; 599453#factEXIT >#66#return; 599452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599431#factFINAL assume true; 599422#factEXIT >#66#return; 599421#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599408#factFINAL assume true; 599401#factEXIT >#66#return; 599406#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599555#factFINAL assume true; 599545#factEXIT >#68#return; 598829#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 599615#factENTRY ~n := #in~n; 599614#L25 assume !(~n <= 0); 599604#L26 call #t~ret0 := fact(~n - 1);< 599609#factENTRY ~n := #in~n; 599612#L25 assume ~n <= 0;#res := 1; 599608#factFINAL assume true; 599603#factEXIT >#66#return; 599605#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599769#factFINAL assume true; 599767#factEXIT >#70#return; 599449#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 599636#factENTRY ~n := #in~n; 599635#L25 assume !(~n <= 0); 598908#L26 call #t~ret0 := fact(~n - 1);< 599451#factENTRY ~n := #in~n; 599929#L25 assume !(~n <= 0); 598901#L26 call #t~ret0 := fact(~n - 1);< 599430#factENTRY ~n := #in~n; 599515#L25 assume !(~n <= 0); 598902#L26 call #t~ret0 := fact(~n - 1);< 599506#factENTRY ~n := #in~n; 599509#L25 assume ~n <= 0;#res := 1; 599508#factFINAL assume true; 599502#factEXIT >#66#return; 599500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599460#factFINAL assume true; 599453#factEXIT >#66#return; 599452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599431#factFINAL assume true; 599422#factEXIT >#66#return; 599428#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599843#factFINAL assume true; 599728#factEXIT >#72#return; 599738#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 600322#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 600320#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 600309#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 600273#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 599416#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 599557#factENTRY ~n := #in~n; 600122#L25 assume !(~n <= 0); 599403#L26 call #t~ret0 := fact(~n - 1);< 599420#factENTRY ~n := #in~n; 599681#L25 assume !(~n <= 0); 599425#L26 call #t~ret0 := fact(~n - 1);< 599429#factENTRY ~n := #in~n; 599499#L25 assume !(~n <= 0); 599456#L26 call #t~ret0 := fact(~n - 1);< 599459#factENTRY ~n := #in~n; 599510#L25 assume !(~n <= 0); 599503#L26 call #t~ret0 := fact(~n - 1);< 599504#factENTRY ~n := #in~n; 599509#L25 assume ~n <= 0;#res := 1; 599508#factFINAL assume true; 599502#factEXIT >#66#return; 599500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599460#factFINAL assume true; 599453#factEXIT >#66#return; 599452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599431#factFINAL assume true; 599422#factEXIT >#66#return; 599421#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599408#factFINAL assume true; 599401#factEXIT >#66#return; 599406#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599555#factFINAL assume true; 599545#factEXIT >#68#return; 599486#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 599507#factENTRY ~n := #in~n; 599501#L25 assume !(~n <= 0); 599405#L26 call #t~ret0 := fact(~n - 1);< 599498#factENTRY ~n := #in~n; 599514#L25 assume !(~n <= 0); 599424#L26 call #t~ret0 := fact(~n - 1);< 599505#factENTRY ~n := #in~n; 599509#L25 assume ~n <= 0;#res := 1; 599508#factFINAL assume true; 599502#factEXIT >#66#return; 599500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599460#factFINAL assume true; 599453#factEXIT >#66#return; 599458#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599756#factFINAL assume true; 599754#factEXIT >#70#return; 599466#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 599794#factENTRY ~n := #in~n; 599793#L25 assume !(~n <= 0); 599455#L26 call #t~ret0 := fact(~n - 1);< 599469#factENTRY ~n := #in~n; 599510#L25 assume !(~n <= 0); 599503#L26 call #t~ret0 := fact(~n - 1);< 599504#factENTRY ~n := #in~n; 599509#L25 assume ~n <= 0;#res := 1; 599508#factFINAL assume true; 599502#factEXIT >#66#return; 599500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599460#factFINAL assume true; 599453#factEXIT >#66#return; 599457#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599841#factFINAL assume true; 599842#factEXIT >#72#return; 599752#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 600321#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 600312#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 600300#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 600298#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 599414#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 599557#factENTRY ~n := #in~n; 600122#L25 assume !(~n <= 0); 599403#L26 call #t~ret0 := fact(~n - 1);< 599420#factENTRY ~n := #in~n; 599681#L25 assume !(~n <= 0); 599425#L26 call #t~ret0 := fact(~n - 1);< 599429#factENTRY ~n := #in~n; 599499#L25 assume !(~n <= 0); 599456#L26 call #t~ret0 := fact(~n - 1);< 599459#factENTRY ~n := #in~n; 599510#L25 assume !(~n <= 0); 599503#L26 call #t~ret0 := fact(~n - 1);< 599504#factENTRY ~n := #in~n; 599509#L25 assume ~n <= 0;#res := 1; 599508#factFINAL assume true; 599502#factEXIT >#66#return; 599500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599460#factFINAL assume true; 599453#factEXIT >#66#return; 599452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599431#factFINAL assume true; 599422#factEXIT >#66#return; 599421#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599408#factFINAL assume true; 599401#factEXIT >#66#return; 599406#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599555#factFINAL assume true; 599545#factEXIT >#68#return; 599493#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 599507#factENTRY ~n := #in~n; 599501#L25 assume !(~n <= 0); 599405#L26 call #t~ret0 := fact(~n - 1);< 599498#factENTRY ~n := #in~n; 599514#L25 assume !(~n <= 0); 599424#L26 call #t~ret0 := fact(~n - 1);< 599505#factENTRY ~n := #in~n; 599499#L25 assume !(~n <= 0); 599456#L26 call #t~ret0 := fact(~n - 1);< 599459#factENTRY ~n := #in~n; 599510#L25 assume !(~n <= 0); 599503#L26 call #t~ret0 := fact(~n - 1);< 599504#factENTRY ~n := #in~n; 599509#L25 assume ~n <= 0;#res := 1; 599508#factFINAL assume true; 599502#factEXIT >#66#return; 599500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599460#factFINAL assume true; 599453#factEXIT >#66#return; 599452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599431#factFINAL assume true; 599422#factEXIT >#66#return; 599421#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599408#factFINAL assume true; 599401#factEXIT >#66#return; 599406#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599555#factFINAL assume true; 599545#factEXIT >#70#return; 599550#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 599613#factENTRY ~n := #in~n; 599610#L25 assume !(~n <= 0); 599454#L26 call #t~ret0 := fact(~n - 1);< 599606#factENTRY ~n := #in~n; 599612#L25 assume ~n <= 0;#res := 1; 599608#factFINAL assume true; 599603#factEXIT >#66#return; 599602#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599601#factFINAL assume true; 599570#factEXIT >#72#return; 598695#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 600289#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 600286#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 600283#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 600280#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 599415#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 599557#factENTRY ~n := #in~n; 600122#L25 assume !(~n <= 0); 599403#L26 call #t~ret0 := fact(~n - 1);< 599420#factENTRY ~n := #in~n; 599681#L25 assume !(~n <= 0); 599425#L26 call #t~ret0 := fact(~n - 1);< 599429#factENTRY ~n := #in~n; 599499#L25 assume !(~n <= 0); 599456#L26 call #t~ret0 := fact(~n - 1);< 599459#factENTRY ~n := #in~n; 599510#L25 assume !(~n <= 0); 599503#L26 call #t~ret0 := fact(~n - 1);< 599504#factENTRY ~n := #in~n; 599509#L25 assume ~n <= 0;#res := 1; 599508#factFINAL assume true; 599502#factEXIT >#66#return; 599500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599460#factFINAL assume true; 599453#factEXIT >#66#return; 599452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599431#factFINAL assume true; 599422#factEXIT >#66#return; 599421#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599408#factFINAL assume true; 599401#factEXIT >#66#return; 599406#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599555#factFINAL assume true; 599545#factEXIT >#68#return; 599492#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 599507#factENTRY ~n := #in~n; 599501#L25 assume !(~n <= 0); 599405#L26 call #t~ret0 := fact(~n - 1);< 599498#factENTRY ~n := #in~n; 599514#L25 assume !(~n <= 0); 599424#L26 call #t~ret0 := fact(~n - 1);< 599505#factENTRY ~n := #in~n; 599499#L25 assume !(~n <= 0); 599456#L26 call #t~ret0 := fact(~n - 1);< 599459#factENTRY ~n := #in~n; 599510#L25 assume !(~n <= 0); 599503#L26 call #t~ret0 := fact(~n - 1);< 599504#factENTRY ~n := #in~n; 599509#L25 assume ~n <= 0;#res := 1; 599508#factFINAL assume true; 599502#factEXIT >#66#return; 599500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599460#factFINAL assume true; 599453#factEXIT >#66#return; 599452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599431#factFINAL assume true; 599422#factEXIT >#66#return; 599421#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599408#factFINAL assume true; 599401#factEXIT >#66#return; 599406#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 599555#factFINAL assume true; 599545#factEXIT >#70#return; 598676#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 598710#factENTRY ~n := #in~n; 600340#L25 assume ~n <= 0;#res := 1; 600331#factFINAL assume true; 598654#factEXIT >#72#return; 598703#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 600277#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 600276#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 600275#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 600274#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 598055#L30-5 [2022-11-25 17:06:37,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:37,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1454278818, now seen corresponding path program 37 times [2022-11-25 17:06:37,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:37,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195498689] [2022-11-25 17:06:37,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:37,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:37,405 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:06:37,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1413429863] [2022-11-25 17:06:37,405 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 17:06:37,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:06:37,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:37,409 INFO L229 MonitoredProcess]: Starting monitored process 321 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:06:37,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (321)] Waiting until timeout for monitored process [2022-11-25 17:06:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:37,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 1699 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 17:06:37,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:38,186 INFO L134 CoverageAnalysis]: Checked inductivity of 33197 backedges. 12478 proven. 400 refuted. 0 times theorem prover too weak. 20319 trivial. 0 not checked. [2022-11-25 17:06:38,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:06:39,335 INFO L134 CoverageAnalysis]: Checked inductivity of 33197 backedges. 1726 proven. 825 refuted. 0 times theorem prover too weak. 30646 trivial. 0 not checked. [2022-11-25 17:06:39,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:39,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195498689] [2022-11-25 17:06:39,336 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:06:39,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413429863] [2022-11-25 17:06:39,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413429863] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:06:39,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:06:39,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 16 [2022-11-25 17:06:39,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032226224] [2022-11-25 17:06:39,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:06:39,337 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 17:06:39,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:39,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1997076304, now seen corresponding path program 33 times [2022-11-25 17:06:39,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:39,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418340644] [2022-11-25 17:06:39,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:39,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:39,346 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:06:39,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1919694821] [2022-11-25 17:06:39,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:06:39,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:06:39,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:39,348 INFO L229 MonitoredProcess]: Starting monitored process 322 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:06:39,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (322)] Waiting until timeout for monitored process [2022-11-25 17:06:39,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2022-11-25 17:06:39,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:06:39,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-25 17:06:39,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:40,086 INFO L134 CoverageAnalysis]: Checked inductivity of 11663 backedges. 2395 proven. 321 refuted. 0 times theorem prover too weak. 8947 trivial. 0 not checked. [2022-11-25 17:06:40,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:06:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 11663 backedges. 2390 proven. 354 refuted. 0 times theorem prover too weak. 8919 trivial. 0 not checked. [2022-11-25 17:06:41,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:41,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418340644] [2022-11-25 17:06:41,920 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:06:41,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919694821] [2022-11-25 17:06:41,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919694821] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:06:41,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:06:41,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25] total 32 [2022-11-25 17:06:41,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329405568] [2022-11-25 17:06:41,921 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:06:41,921 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 17:06:41,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:41,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-25 17:06:41,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=920, Unknown=0, NotChecked=0, Total=1056 [2022-11-25 17:06:41,922 INFO L87 Difference]: Start difference. First operand 5509 states and 8310 transitions. cyclomatic complexity: 2879 Second operand has 33 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 31 states have internal predecessors, (74), 19 states have call successors, (29), 1 states have call predecessors, (29), 10 states have return successors, (34), 18 states have call predecessors, (34), 19 states have call successors, (34) [2022-11-25 17:06:44,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:44,991 INFO L93 Difference]: Finished difference Result 9328 states and 16160 transitions. [2022-11-25 17:06:44,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9328 states and 16160 transitions. [2022-11-25 17:06:45,037 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1178 [2022-11-25 17:06:45,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9328 states to 7240 states and 11630 transitions. [2022-11-25 17:06:45,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 494 [2022-11-25 17:06:45,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 594 [2022-11-25 17:06:45,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7240 states and 11630 transitions. [2022-11-25 17:06:45,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 17:06:45,080 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7240 states and 11630 transitions. [2022-11-25 17:06:45,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7240 states and 11630 transitions. [2022-11-25 17:06:45,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7240 to 5973. [2022-11-25 17:06:45,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5973 states, 3755 states have (on average 1.0806924101198403) internal successors, (4058), 3788 states have internal predecessors, (4058), 1459 states have call successors, (1656), 599 states have call predecessors, (1656), 759 states have return successors, (3489), 1585 states have call predecessors, (3489), 1459 states have call successors, (3489) [2022-11-25 17:06:45,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5973 states to 5973 states and 9203 transitions. [2022-11-25 17:06:45,177 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5973 states and 9203 transitions. [2022-11-25 17:06:45,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-25 17:06:45,177 INFO L428 stractBuchiCegarLoop]: Abstraction has 5973 states and 9203 transitions. [2022-11-25 17:06:45,177 INFO L335 stractBuchiCegarLoop]: ======== Iteration 54 ============ [2022-11-25 17:06:45,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5973 states and 9203 transitions. [2022-11-25 17:06:45,189 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 957 [2022-11-25 17:06:45,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:06:45,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:06:45,191 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [118, 118, 70, 70, 70, 70, 48, 17, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 3, 3, 1, 1, 1, 1] [2022-11-25 17:06:45,192 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [72, 72, 54, 54, 54, 54, 18, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:45,192 INFO L748 eck$LassoCheckResult]: Stem: 620053#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 620029#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; 620030#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 620052#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; 620078#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 624652#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 624650#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 620013#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 620014#factENTRY ~n := #in~n; 624636#L25 assume ~n <= 0;#res := 1; 624635#factFINAL assume true; 624571#factEXIT >#68#return; 624295#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 624296#factENTRY ~n := #in~n; 624298#L25 assume ~n <= 0;#res := 1; 624297#factFINAL assume true; 624294#factEXIT >#70#return; 620009#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 620010#factENTRY ~n := #in~n; 625351#L25 assume ~n <= 0;#res := 1; 625350#factFINAL assume true; 625348#factEXIT >#72#return; 625344#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 625342#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 625341#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 625340#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 625339#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 625337#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 625338#factENTRY ~n := #in~n; 625360#L25 assume !(~n <= 0); 625357#L26 call #t~ret0 := fact(~n - 1);< 625359#factENTRY ~n := #in~n; 625378#L25 assume ~n <= 0;#res := 1; 625374#factFINAL assume true; 625372#factEXIT >#66#return; 625370#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 625368#factFINAL assume true; 625366#factEXIT >#74#return; 625331#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 625333#factENTRY ~n := #in~n; 625380#L25 assume ~n <= 0;#res := 1; 625381#factFINAL assume true; 625363#factEXIT >#76#return; 625323#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 625326#factENTRY ~n := #in~n; 625349#L25 assume !(~n <= 0); 625346#L26 call #t~ret0 := fact(~n - 1);< 625347#factENTRY ~n := #in~n; 625354#L25 assume ~n <= 0;#res := 1; 625352#factFINAL assume true; 625345#factEXIT >#66#return; 625343#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 625329#factFINAL assume true; 625322#factEXIT >#78#return; 625325#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; 625423#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 625422#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 625421#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 620055#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 619991#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 619992#factENTRY ~n := #in~n; 620028#L25 assume !(~n <= 0); 620035#L26 call #t~ret0 := fact(~n - 1);< 620036#factENTRY ~n := #in~n; 625944#L25 assume !(~n <= 0); 625942#L26 call #t~ret0 := fact(~n - 1);< 625941#factENTRY ~n := #in~n; 625943#L25 assume ~n <= 0;#res := 1; 625956#factFINAL assume true; 625954#factEXIT >#66#return; 625955#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 625957#factFINAL assume true; 625950#factEXIT >#66#return; 625951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 625960#factFINAL assume true; 625959#factEXIT >#74#return; 620074#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 620075#factENTRY ~n := #in~n; 625888#L25 assume ~n <= 0;#res := 1; 625889#factFINAL assume true; 625895#factEXIT >#76#return; 625757#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 625871#factENTRY ~n := #in~n; 625892#L25 assume !(~n <= 0); 625749#L26 call #t~ret0 := fact(~n - 1);< 625754#factENTRY ~n := #in~n; 625769#L25 assume !(~n <= 0); 625747#L26 call #t~ret0 := fact(~n - 1);< 625768#factENTRY ~n := #in~n; 625765#L25 assume ~n <= 0;#res := 1; 625766#factFINAL assume true; 625760#factEXIT >#66#return; 625758#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 625759#factFINAL assume true; 625745#factEXIT >#66#return; 625751#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 625949#factFINAL assume true; 625891#factEXIT >#78#return; 625868#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; 625867#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 625866#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 625865#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 625864#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 625448#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 625450#factENTRY ~n := #in~n; 625449#L25 assume !(~n <= 0); 625446#L26 call #t~ret0 := fact(~n - 1);< 625447#factENTRY ~n := #in~n; 625445#L25 assume !(~n <= 0); 625441#L26 call #t~ret0 := fact(~n - 1);< 625444#factENTRY ~n := #in~n; 625445#L25 assume !(~n <= 0); 625441#L26 call #t~ret0 := fact(~n - 1);< 625444#factENTRY ~n := #in~n; 625440#L25 assume ~n <= 0;#res := 1; 625442#factFINAL assume true; 625462#factEXIT >#66#return; 625461#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 625460#factFINAL assume true; 625459#factEXIT >#66#return; 625458#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 625457#factFINAL assume true; 625456#factEXIT >#66#return; 625455#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 625454#factFINAL assume true; 625453#factEXIT >#74#return; 625198#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 625210#factENTRY ~n := #in~n; 625211#L25 assume ~n <= 0;#res := 1; 625304#factFINAL assume true; 625303#factEXIT >#76#return; 620058#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 625302#factENTRY ~n := #in~n; 625301#L25 assume !(~n <= 0); 625247#L26 call #t~ret0 := fact(~n - 1);< 625265#factENTRY ~n := #in~n; 625266#L25 assume !(~n <= 0); 625246#L26 call #t~ret0 := fact(~n - 1);< 625254#factENTRY ~n := #in~n; 625264#L25 assume !(~n <= 0); 625251#L26 call #t~ret0 := fact(~n - 1);< 625298#factENTRY ~n := #in~n; 625300#L25 assume ~n <= 0;#res := 1; 625299#factFINAL assume true; 625297#factEXIT >#66#return; 625296#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 625295#factFINAL assume true; 625294#factEXIT >#66#return; 625293#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 625292#factFINAL assume true; 625245#factEXIT >#66#return; 620056#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620059#factFINAL assume true; 625305#factEXIT >#78#return; 622772#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; 622770#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 622768#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 622764#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 622763#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 622748#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 622719#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 622718#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 622672#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 622675#factENTRY ~n := #in~n; 622703#L25 assume !(~n <= 0); 622688#L26 call #t~ret0 := fact(~n - 1);< 622689#factENTRY ~n := #in~n; 622712#L25 assume ~n <= 0;#res := 1; 622845#factFINAL assume true; 622844#factEXIT >#66#return; 622843#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 622842#factFINAL assume true; 622841#factEXIT >#68#return; 622831#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 622834#factENTRY ~n := #in~n; 622836#L25 assume ~n <= 0;#res := 1; 622835#factFINAL assume true; 622830#factEXIT >#70#return; 622765#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 622771#factENTRY ~n := #in~n; 622769#L25 assume !(~n <= 0); 622631#L26 call #t~ret0 := fact(~n - 1);< 622655#factENTRY ~n := #in~n; 622714#L25 assume ~n <= 0;#res := 1; 622704#factFINAL assume true; 622690#factEXIT >#66#return; 622695#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 622866#factFINAL assume true; 622863#factEXIT >#72#return; 622864#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 623161#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 623160#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 623158#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 623157#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 622808#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 622826#factENTRY ~n := #in~n; 622806#L25 assume !(~n <= 0); 622692#L26 call #t~ret0 := fact(~n - 1);< 622699#factENTRY ~n := #in~n; 622714#L25 assume ~n <= 0;#res := 1; 622704#factFINAL assume true; 622690#factEXIT >#66#return; 622697#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 622839#factFINAL assume true; 622838#factEXIT >#68#return; 622705#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 622814#factENTRY ~n := #in~n; 622815#L25 assume !(~n <= 0); 622693#L26 call #t~ret0 := fact(~n - 1);< 622699#factENTRY ~n := #in~n; 622714#L25 assume ~n <= 0;#res := 1; 622704#factFINAL assume true; 622690#factEXIT >#66#return; 622698#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 622868#factFINAL assume true; 622867#factEXIT >#70#return; 622855#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 622860#factENTRY ~n := #in~n; 622862#L25 assume ~n <= 0;#res := 1; 622861#factFINAL assume true; 622854#factEXIT >#72#return; 622858#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 623153#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 623151#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 623149#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 623121#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 622653#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 622662#factENTRY ~n := #in~n; 622658#L25 assume !(~n <= 0); 622632#L26 call #t~ret0 := fact(~n - 1);< 622655#factENTRY ~n := #in~n; 622761#L25 assume !(~n <= 0); 622628#L26 call #t~ret0 := fact(~n - 1);< 622661#factENTRY ~n := #in~n; 622665#L25 assume ~n <= 0;#res := 1; 622664#factFINAL assume true; 622659#factEXIT >#66#return; 622657#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 622651#factFINAL assume true; 622627#factEXIT >#66#return; 622634#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 623104#factFINAL assume true; 623100#factEXIT >#74#return; 623097#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 623106#factENTRY ~n := #in~n; 623137#L25 assume !(~n <= 0); 623109#L26 call #t~ret0 := fact(~n - 1);< 623135#factENTRY ~n := #in~n; 623155#L25 assume ~n <= 0;#res := 1; 623154#factFINAL assume true; 623134#factEXIT >#66#return; 623133#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 623131#factFINAL assume true; 623124#factEXIT >#76#return; 623088#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 623093#factENTRY ~n := #in~n; 623168#L25 assume !(~n <= 0); 623023#L26 call #t~ret0 := fact(~n - 1);< 623034#factENTRY ~n := #in~n; 623159#L25 assume ~n <= 0;#res := 1; 623146#factFINAL assume true; 623138#factEXIT >#66#return; 623136#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 623120#factFINAL assume true; 623087#factEXIT >#78#return; 623085#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; 623083#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 623081#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 623080#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 623079#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 622325#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 622336#factENTRY ~n := #in~n; 622334#L25 assume !(~n <= 0); 622315#L26 call #t~ret0 := fact(~n - 1);< 622320#factENTRY ~n := #in~n; 622332#L25 assume !(~n <= 0); 622316#L26 call #t~ret0 := fact(~n - 1);< 622331#factENTRY ~n := #in~n; 622332#L25 assume !(~n <= 0); 622316#L26 call #t~ret0 := fact(~n - 1);< 622331#factENTRY ~n := #in~n; 622339#L25 assume ~n <= 0;#res := 1; 622338#factFINAL assume true; 622337#factEXIT >#66#return; 622335#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 622333#factFINAL assume true; 622330#factEXIT >#66#return; 622329#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 622321#factFINAL assume true; 622314#factEXIT >#66#return; 622318#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 622363#factFINAL assume true; 622355#factEXIT >#74#return; 622270#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 622275#factENTRY ~n := #in~n; 622274#L25 assume !(~n <= 0); 622160#L26 call #t~ret0 := fact(~n - 1);< 622267#factENTRY ~n := #in~n; 622226#L25 assume ~n <= 0;#res := 1; 622227#factFINAL assume true; 622158#factEXIT >#66#return; 622164#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 623614#factFINAL assume true; 623613#factEXIT >#76#return; 621703#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 621704#factENTRY ~n := #in~n; 622173#L25 assume !(~n <= 0); 622165#L26 call #t~ret0 := fact(~n - 1);< 622167#factENTRY ~n := #in~n; 622248#L25 assume !(~n <= 0); 622211#L26 call #t~ret0 := fact(~n - 1);< 622253#factENTRY ~n := #in~n; 622259#L25 assume ~n <= 0;#res := 1; 622255#factFINAL assume true; 622250#factEXIT >#66#return; 622228#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 622208#factFINAL assume true; 622215#factEXIT >#66#return; 622282#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 622298#factFINAL assume true; 622297#factEXIT >#78#return; 621698#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; 621696#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 621694#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 621693#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 621691#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 621689#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 621241#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 621663#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 621660#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 621661#factENTRY ~n := #in~n; 621671#L25 assume !(~n <= 0); 621668#L26 call #t~ret0 := fact(~n - 1);< 621669#factENTRY ~n := #in~n; 621676#L25 assume !(~n <= 0); 621667#L26 call #t~ret0 := fact(~n - 1);< 621674#factENTRY ~n := #in~n; 621677#L25 assume ~n <= 0;#res := 1; 621675#factFINAL assume true; 621673#factEXIT >#66#return; 621672#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621670#factFINAL assume true; 621666#factEXIT >#66#return; 621665#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621662#factFINAL assume true; 621658#factEXIT >#68#return; 621650#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 621652#factENTRY ~n := #in~n; 621657#L25 assume ~n <= 0;#res := 1; 621655#factFINAL assume true; 621649#factEXIT >#70#return; 621556#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 621561#factENTRY ~n := #in~n; 621559#L25 assume !(~n <= 0); 621545#L26 call #t~ret0 := fact(~n - 1);< 621558#factENTRY ~n := #in~n; 621930#L25 assume !(~n <= 0); 621546#L26 call #t~ret0 := fact(~n - 1);< 621564#factENTRY ~n := #in~n; 621566#L25 assume ~n <= 0;#res := 1; 621565#factFINAL assume true; 621562#factEXIT >#66#return; 621560#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621555#factFINAL assume true; 621543#factEXIT >#66#return; 621547#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621653#factFINAL assume true; 621647#factEXIT >#72#return; 621638#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 621636#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 621634#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 621629#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 621626#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 621487#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 621491#factENTRY ~n := #in~n; 621550#L25 assume !(~n <= 0); 621544#L26 call #t~ret0 := fact(~n - 1);< 621548#factENTRY ~n := #in~n; 621907#L25 assume !(~n <= 0); 621563#L26 call #t~ret0 := fact(~n - 1);< 621569#factENTRY ~n := #in~n; 621566#L25 assume ~n <= 0;#res := 1; 621565#factFINAL assume true; 621562#factEXIT >#66#return; 621560#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621555#factFINAL assume true; 621543#factEXIT >#66#return; 621542#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621532#factFINAL assume true; 621484#factEXIT >#68#return; 621490#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 621617#factENTRY ~n := #in~n; 621632#L25 assume !(~n <= 0); 621621#L26 call #t~ret0 := fact(~n - 1);< 621624#factENTRY ~n := #in~n; 621631#L25 assume ~n <= 0;#res := 1; 621627#factFINAL assume true; 621620#factEXIT >#66#return; 621623#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621619#factFINAL assume true; 621616#factEXIT >#70#return; 621612#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 621614#factENTRY ~n := #in~n; 621630#L25 assume !(~n <= 0); 621622#L26 call #t~ret0 := fact(~n - 1);< 621624#factENTRY ~n := #in~n; 621631#L25 assume ~n <= 0;#res := 1; 621627#factFINAL assume true; 621620#factEXIT >#66#return; 621618#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621615#factFINAL assume true; 621610#factEXIT >#72#return; 621609#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 621608#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 621607#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 621606#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 621605#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 621488#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 621491#factENTRY ~n := #in~n; 621550#L25 assume !(~n <= 0); 621544#L26 call #t~ret0 := fact(~n - 1);< 621548#factENTRY ~n := #in~n; 621907#L25 assume !(~n <= 0); 621563#L26 call #t~ret0 := fact(~n - 1);< 621569#factENTRY ~n := #in~n; 621566#L25 assume ~n <= 0;#res := 1; 621565#factFINAL assume true; 621562#factEXIT >#66#return; 621560#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621555#factFINAL assume true; 621543#factEXIT >#66#return; 621542#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621532#factFINAL assume true; 621484#factEXIT >#68#return; 621479#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 621481#factENTRY ~n := #in~n; 621577#L25 assume !(~n <= 0); 621507#L26 call #t~ret0 := fact(~n - 1);< 621510#factENTRY ~n := #in~n; 621595#L25 assume !(~n <= 0); 621581#L26 call #t~ret0 := fact(~n - 1);< 621582#factENTRY ~n := #in~n; 621588#L25 assume ~n <= 0;#res := 1; 621586#factFINAL assume true; 621580#factEXIT >#66#return; 621576#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621567#factFINAL assume true; 621505#factEXIT >#66#return; 621504#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621503#factFINAL assume true; 621478#factEXIT >#70#return; 621464#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 621466#factENTRY ~n := #in~n; 621468#L25 assume ~n <= 0;#res := 1; 621467#factFINAL assume true; 621462#factEXIT >#72#return; 621458#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 621459#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 621434#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 621435#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 621338#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 621336#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 621337#factENTRY ~n := #in~n; 621372#L25 assume !(~n <= 0); 621369#L26 call #t~ret0 := fact(~n - 1);< 621371#factENTRY ~n := #in~n; 621390#L25 assume !(~n <= 0); 621370#L26 call #t~ret0 := fact(~n - 1);< 621389#factENTRY ~n := #in~n; 621390#L25 assume !(~n <= 0); 621370#L26 call #t~ret0 := fact(~n - 1);< 621389#factENTRY ~n := #in~n; 621424#L25 assume ~n <= 0;#res := 1; 621421#factFINAL assume true; 621413#factEXIT >#66#return; 621412#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621409#factFINAL assume true; 621388#factEXIT >#66#return; 621383#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621376#factFINAL assume true; 621368#factEXIT >#66#return; 621359#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621355#factFINAL assume true; 621335#factEXIT >#74#return; 621332#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 621333#factENTRY ~n := #in~n; 621407#L25 assume !(~n <= 0); 621365#L26 call #t~ret0 := fact(~n - 1);< 621366#factENTRY ~n := #in~n; 621393#L25 assume !(~n <= 0); 621380#L26 call #t~ret0 := fact(~n - 1);< 621382#factENTRY ~n := #in~n; 621400#L25 assume ~n <= 0;#res := 1; 621404#factFINAL assume true; 621401#factEXIT >#66#return; 621399#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621397#factFINAL assume true; 621394#factEXIT >#66#return; 621381#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621429#factFINAL assume true; 621331#factEXIT >#76#return; 621252#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 621254#factENTRY ~n := #in~n; 621362#L25 assume !(~n <= 0); 621319#L26 call #t~ret0 := fact(~n - 1);< 621360#factENTRY ~n := #in~n; 621419#L25 assume ~n <= 0;#res := 1; 621345#factFINAL assume true; 621346#factEXIT >#66#return; 621357#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621353#factFINAL assume true; 621250#factEXIT >#78#return; 621248#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; 621246#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 621244#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 621243#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 621242#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 621240#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 621220#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 621172#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 620628#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 620630#factENTRY ~n := #in~n; 620642#L25 assume !(~n <= 0); 620634#L26 call #t~ret0 := fact(~n - 1);< 620638#factENTRY ~n := #in~n; 620647#L25 assume !(~n <= 0); 620635#L26 call #t~ret0 := fact(~n - 1);< 620645#factENTRY ~n := #in~n; 620647#L25 assume !(~n <= 0); 620635#L26 call #t~ret0 := fact(~n - 1);< 620645#factENTRY ~n := #in~n; 620657#L25 assume ~n <= 0;#res := 1; 620654#factFINAL assume true; 620652#factEXIT >#66#return; 620648#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620646#factFINAL assume true; 620644#factEXIT >#66#return; 620643#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620639#factFINAL assume true; 620633#factEXIT >#66#return; 620632#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620631#factFINAL assume true; 620625#factEXIT >#68#return; 620617#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 620069#factENTRY ~n := #in~n; 620622#L25 assume ~n <= 0;#res := 1; 620621#factFINAL assume true; 620607#factEXIT >#70#return; 620575#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 620600#factENTRY ~n := #in~n; 620573#L25 assume !(~n <= 0); 620332#L26 call #t~ret0 := fact(~n - 1);< 620406#factENTRY ~n := #in~n; 620527#L25 assume !(~n <= 0); 620323#L26 call #t~ret0 := fact(~n - 1);< 620395#factENTRY ~n := #in~n; 620558#L25 assume !(~n <= 0); 620326#L26 call #t~ret0 := fact(~n - 1);< 620521#factENTRY ~n := #in~n; 620524#L25 assume ~n <= 0;#res := 1; 620523#factFINAL assume true; 620517#factEXIT >#66#return; 620514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620465#factFINAL assume true; 620451#factEXIT >#66#return; 620443#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620413#factFINAL assume true; 620374#factEXIT >#66#return; 620381#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 625052#factFINAL assume true; 625051#factEXIT >#72#return; 621168#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 625050#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 625046#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 625047#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 625043#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 620171#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 620513#factENTRY ~n := #in~n; 620511#L25 assume !(~n <= 0); 620330#L26 call #t~ret0 := fact(~n - 1);< 620406#factENTRY ~n := #in~n; 620527#L25 assume !(~n <= 0); 620323#L26 call #t~ret0 := fact(~n - 1);< 620395#factENTRY ~n := #in~n; 620558#L25 assume !(~n <= 0); 620326#L26 call #t~ret0 := fact(~n - 1);< 620521#factENTRY ~n := #in~n; 620524#L25 assume ~n <= 0;#res := 1; 620523#factFINAL assume true; 620517#factEXIT >#66#return; 620514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620465#factFINAL assume true; 620451#factEXIT >#66#return; 620443#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620413#factFINAL assume true; 620374#factEXIT >#66#return; 620378#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621095#factFINAL assume true; 621093#factEXIT >#68#return; 620420#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 620565#factENTRY ~n := #in~n; 620563#L25 assume !(~n <= 0); 620319#L26 call #t~ret0 := fact(~n - 1);< 620440#factENTRY ~n := #in~n; 621105#L25 assume ~n <= 0;#res := 1; 621101#factFINAL assume true; 621096#factEXIT >#66#return; 621098#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621149#factFINAL assume true; 621148#factEXIT >#70#return; 620472#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 620599#factENTRY ~n := #in~n; 621104#L25 assume !(~n <= 0); 620453#L26 call #t~ret0 := fact(~n - 1);< 620474#factENTRY ~n := #in~n; 620556#L25 assume !(~n <= 0); 620518#L26 call #t~ret0 := fact(~n - 1);< 620519#factENTRY ~n := #in~n; 620524#L25 assume ~n <= 0;#res := 1; 620523#factFINAL assume true; 620517#factEXIT >#66#return; 620514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620465#factFINAL assume true; 620451#factEXIT >#66#return; 620455#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621178#factFINAL assume true; 621179#factEXIT >#72#return; 624670#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 625081#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 625079#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 625077#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 625075#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 620533#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 620541#factENTRY ~n := #in~n; 620540#L25 assume !(~n <= 0); 620334#L26 call #t~ret0 := fact(~n - 1);< 620526#factENTRY ~n := #in~n; 620525#L25 assume !(~n <= 0); 620377#L26 call #t~ret0 := fact(~n - 1);< 620383#factENTRY ~n := #in~n; 620509#L25 assume !(~n <= 0); 620454#L26 call #t~ret0 := fact(~n - 1);< 620457#factENTRY ~n := #in~n; 620524#L25 assume ~n <= 0;#res := 1; 620523#factFINAL assume true; 620517#factEXIT >#66#return; 620514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620465#factFINAL assume true; 620451#factEXIT >#66#return; 620443#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620413#factFINAL assume true; 620374#factEXIT >#66#return; 620378#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621095#factFINAL assume true; 621093#factEXIT >#68#return; 620495#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 620522#factENTRY ~n := #in~n; 620516#L25 assume !(~n <= 0); 620329#L26 call #t~ret0 := fact(~n - 1);< 620508#factENTRY ~n := #in~n; 620557#L25 assume !(~n <= 0); 620375#L26 call #t~ret0 := fact(~n - 1);< 620520#factENTRY ~n := #in~n; 620524#L25 assume ~n <= 0;#res := 1; 620523#factFINAL assume true; 620517#factEXIT >#66#return; 620514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620465#factFINAL assume true; 620451#factEXIT >#66#return; 620456#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621134#factFINAL assume true; 621133#factEXIT >#70#return; 620567#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 620595#factENTRY ~n := #in~n; 620566#L25 assume !(~n <= 0); 620452#L26 call #t~ret0 := fact(~n - 1);< 621099#factENTRY ~n := #in~n; 621105#L25 assume ~n <= 0;#res := 1; 621101#factFINAL assume true; 621096#factEXIT >#66#return; 621094#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621092#factFINAL assume true; 621082#factEXIT >#72#return; 621084#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 625073#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 625072#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 625068#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 625067#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 620530#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 620541#factENTRY ~n := #in~n; 620540#L25 assume !(~n <= 0); 620334#L26 call #t~ret0 := fact(~n - 1);< 620526#factENTRY ~n := #in~n; 620525#L25 assume !(~n <= 0); 620377#L26 call #t~ret0 := fact(~n - 1);< 620383#factENTRY ~n := #in~n; 620509#L25 assume !(~n <= 0); 620454#L26 call #t~ret0 := fact(~n - 1);< 620457#factENTRY ~n := #in~n; 620556#L25 assume !(~n <= 0); 620518#L26 call #t~ret0 := fact(~n - 1);< 620519#factENTRY ~n := #in~n; 620524#L25 assume ~n <= 0;#res := 1; 620523#factFINAL assume true; 620517#factEXIT >#66#return; 620514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620465#factFINAL assume true; 620451#factEXIT >#66#return; 620443#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620413#factFINAL assume true; 620374#factEXIT >#66#return; 620379#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620318#factFINAL assume true; 620338#factEXIT >#66#return; 620673#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 623905#factFINAL assume true; 623904#factEXIT >#68#return; 620489#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 620522#factENTRY ~n := #in~n; 620516#L25 assume !(~n <= 0); 620329#L26 call #t~ret0 := fact(~n - 1);< 620508#factENTRY ~n := #in~n; 620557#L25 assume !(~n <= 0); 620375#L26 call #t~ret0 := fact(~n - 1);< 620520#factENTRY ~n := #in~n; 620509#L25 assume !(~n <= 0); 620454#L26 call #t~ret0 := fact(~n - 1);< 620457#factENTRY ~n := #in~n; 620556#L25 assume !(~n <= 0); 620518#L26 call #t~ret0 := fact(~n - 1);< 620519#factENTRY ~n := #in~n; 620524#L25 assume ~n <= 0;#res := 1; 620523#factFINAL assume true; 620517#factEXIT >#66#return; 620514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620465#factFINAL assume true; 620451#factEXIT >#66#return; 620443#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620413#factFINAL assume true; 620374#factEXIT >#66#return; 620379#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620318#factFINAL assume true; 620338#factEXIT >#66#return; 620673#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 623905#factFINAL assume true; 623904#factEXIT >#70#return; 620107#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 620103#factENTRY ~n := #in~n; 620140#L25 assume ~n <= 0;#res := 1; 620104#factFINAL assume true; 620137#factEXIT >#72#return; 621033#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 625065#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 625063#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 625061#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 625059#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 623896#L30-5 [2022-11-25 17:06:45,192 INFO L750 eck$LassoCheckResult]: Loop: 623896#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 619990#factENTRY ~n := #in~n; 624954#L25 assume !(~n <= 0); 624949#L26 call #t~ret0 := fact(~n - 1);< 624953#factENTRY ~n := #in~n; 624964#L25 assume !(~n <= 0); 624950#L26 call #t~ret0 := fact(~n - 1);< 624962#factENTRY ~n := #in~n; 624963#L25 assume !(~n <= 0); 624951#L26 call #t~ret0 := fact(~n - 1);< 624972#factENTRY ~n := #in~n; 624963#L25 assume !(~n <= 0); 624951#L26 call #t~ret0 := fact(~n - 1);< 624972#factENTRY ~n := #in~n; 624977#L25 assume ~n <= 0;#res := 1; 624976#factFINAL assume true; 624975#factEXIT >#66#return; 624974#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 624973#factFINAL assume true; 624971#factEXIT >#66#return; 624970#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 624969#factFINAL assume true; 624967#factEXIT >#66#return; 624968#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 625191#factFINAL assume true; 624948#factEXIT >#66#return; 624939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 624885#factFINAL assume true; 624886#factEXIT >#74#return; 623688#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 620073#factENTRY ~n := #in~n; 624861#L25 assume !(~n <= 0); 624857#L26 call #t~ret0 := fact(~n - 1);< 624978#factENTRY ~n := #in~n; 624979#L25 assume !(~n <= 0); 624966#L26 call #t~ret0 := fact(~n - 1);< 624980#factENTRY ~n := #in~n; 624965#L25 assume !(~n <= 0); 619995#L26 call #t~ret0 := fact(~n - 1);< 624982#factENTRY ~n := #in~n; 620027#L25 assume ~n <= 0;#res := 1; 620015#factFINAL assume true; 619993#factEXIT >#66#return; 619997#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 624998#factFINAL assume true; 624997#factEXIT >#66#return; 624996#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 624995#factFINAL assume true; 624993#factEXIT >#66#return; 624992#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 624991#factFINAL assume true; 624989#factEXIT >#76#return; 623640#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 620080#factENTRY ~n := #in~n; 623673#L25 assume !(~n <= 0); 622238#L26 call #t~ret0 := fact(~n - 1);< 623648#factENTRY ~n := #in~n; 623675#L25 assume ~n <= 0;#res := 1; 623674#factFINAL assume true; 623647#factEXIT >#66#return; 623646#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 623643#factFINAL assume true; 623639#factEXIT >#78#return; 623635#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; 623634#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 623633#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 623632#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 623631#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 623630#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 623629#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 623628#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 620656#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 620012#factENTRY ~n := #in~n; 620658#L25 assume !(~n <= 0); 620640#L26 call #t~ret0 := fact(~n - 1);< 620653#factENTRY ~n := #in~n; 620651#L25 assume !(~n <= 0); 620636#L26 call #t~ret0 := fact(~n - 1);< 620641#factENTRY ~n := #in~n; 620647#L25 assume !(~n <= 0); 620635#L26 call #t~ret0 := fact(~n - 1);< 620645#factENTRY ~n := #in~n; 620647#L25 assume !(~n <= 0); 620635#L26 call #t~ret0 := fact(~n - 1);< 620645#factENTRY ~n := #in~n; 620647#L25 assume !(~n <= 0); 620635#L26 call #t~ret0 := fact(~n - 1);< 620645#factENTRY ~n := #in~n; 620657#L25 assume ~n <= 0;#res := 1; 620654#factFINAL assume true; 620652#factEXIT >#66#return; 620648#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620646#factFINAL assume true; 620644#factEXIT >#66#return; 620643#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620639#factFINAL assume true; 620633#factEXIT >#66#return; 620637#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621218#factFINAL assume true; 621216#factEXIT >#66#return; 621175#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621181#factFINAL assume true; 621174#factEXIT >#66#return; 621173#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621171#factFINAL assume true; 621170#factEXIT >#68#return; 620608#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 620069#factENTRY ~n := #in~n; 620622#L25 assume ~n <= 0;#res := 1; 620621#factFINAL assume true; 620607#factEXIT >#70#return; 620287#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 620008#factENTRY ~n := #in~n; 621003#L25 assume !(~n <= 0); 620282#L26 call #t~ret0 := fact(~n - 1);< 620277#factENTRY ~n := #in~n; 620676#L25 assume !(~n <= 0); 620309#L26 call #t~ret0 := fact(~n - 1);< 620310#factENTRY ~n := #in~n; 620542#L25 assume !(~n <= 0); 620331#L26 call #t~ret0 := fact(~n - 1);< 620406#factENTRY ~n := #in~n; 620527#L25 assume !(~n <= 0); 620323#L26 call #t~ret0 := fact(~n - 1);< 620395#factENTRY ~n := #in~n; 620558#L25 assume !(~n <= 0); 620326#L26 call #t~ret0 := fact(~n - 1);< 620521#factENTRY ~n := #in~n; 620524#L25 assume ~n <= 0;#res := 1; 620523#factFINAL assume true; 620517#factEXIT >#66#return; 620514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620465#factFINAL assume true; 620451#factEXIT >#66#return; 620443#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620413#factFINAL assume true; 620374#factEXIT >#66#return; 620379#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620318#factFINAL assume true; 620338#factEXIT >#66#return; 620364#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620386#factFINAL assume true; 620361#factEXIT >#66#return; 620366#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621169#factFINAL assume true; 621155#factEXIT >#72#return; 621164#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 624925#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 624924#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 624923#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 624922#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 620242#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 620369#factENTRY ~n := #in~n; 620367#L25 assume !(~n <= 0); 620276#L26 call #t~ret0 := fact(~n - 1);< 620277#factENTRY ~n := #in~n; 620676#L25 assume !(~n <= 0); 620309#L26 call #t~ret0 := fact(~n - 1);< 620310#factENTRY ~n := #in~n; 620542#L25 assume !(~n <= 0); 620331#L26 call #t~ret0 := fact(~n - 1);< 620406#factENTRY ~n := #in~n; 620527#L25 assume !(~n <= 0); 620323#L26 call #t~ret0 := fact(~n - 1);< 620395#factENTRY ~n := #in~n; 620558#L25 assume !(~n <= 0); 620326#L26 call #t~ret0 := fact(~n - 1);< 620521#factENTRY ~n := #in~n; 620524#L25 assume ~n <= 0;#res := 1; 620523#factFINAL assume true; 620517#factEXIT >#66#return; 620514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620465#factFINAL assume true; 620451#factEXIT >#66#return; 620443#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620413#factFINAL assume true; 620374#factEXIT >#66#return; 620379#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620318#factFINAL assume true; 620338#factEXIT >#66#return; 620364#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620386#factFINAL assume true; 620361#factEXIT >#66#return; 620363#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620148#factFINAL assume true; 620249#factEXIT >#68#return; 621073#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 621109#factENTRY ~n := #in~n; 621107#L25 assume !(~n <= 0); 621097#L26 call #t~ret0 := fact(~n - 1);< 621102#factENTRY ~n := #in~n; 621105#L25 assume ~n <= 0;#res := 1; 621101#factFINAL assume true; 621096#factEXIT >#66#return; 621098#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621149#factFINAL assume true; 621148#factEXIT >#70#return; 620544#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 620623#factENTRY ~n := #in~n; 620624#L25 assume !(~n <= 0); 620335#L26 call #t~ret0 := fact(~n - 1);< 620310#factENTRY ~n := #in~n; 620542#L25 assume !(~n <= 0); 620331#L26 call #t~ret0 := fact(~n - 1);< 620406#factENTRY ~n := #in~n; 620527#L25 assume !(~n <= 0); 620323#L26 call #t~ret0 := fact(~n - 1);< 620395#factENTRY ~n := #in~n; 620558#L25 assume !(~n <= 0); 620326#L26 call #t~ret0 := fact(~n - 1);< 620521#factENTRY ~n := #in~n; 620524#L25 assume ~n <= 0;#res := 1; 620523#factFINAL assume true; 620517#factEXIT >#66#return; 620514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620465#factFINAL assume true; 620451#factEXIT >#66#return; 620443#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620413#factFINAL assume true; 620374#factEXIT >#66#return; 620379#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620318#factFINAL assume true; 620338#factEXIT >#66#return; 620365#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621180#factFINAL assume true; 621140#factEXIT >#72#return; 621145#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 624921#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 624920#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 624919#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 624918#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 620245#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 620250#factENTRY ~n := #in~n; 620680#L25 assume !(~n <= 0); 620322#L26 call #t~ret0 := fact(~n - 1);< 620349#factENTRY ~n := #in~n; 620561#L25 assume !(~n <= 0); 620328#L26 call #t~ret0 := fact(~n - 1);< 620395#factENTRY ~n := #in~n; 620558#L25 assume !(~n <= 0); 620326#L26 call #t~ret0 := fact(~n - 1);< 620521#factENTRY ~n := #in~n; 620558#L25 assume !(~n <= 0); 620326#L26 call #t~ret0 := fact(~n - 1);< 620521#factENTRY ~n := #in~n; 620524#L25 assume ~n <= 0;#res := 1; 620523#factFINAL assume true; 620517#factEXIT >#66#return; 620514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620465#factFINAL assume true; 620451#factEXIT >#66#return; 620443#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620413#factFINAL assume true; 620374#factEXIT >#66#return; 620379#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620318#factFINAL assume true; 620338#factEXIT >#66#return; 620673#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 623905#factFINAL assume true; 623904#factEXIT >#68#return; 620233#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 620147#factENTRY ~n := #in~n; 620515#L25 assume !(~n <= 0); 620324#L26 call #t~ret0 := fact(~n - 1);< 620487#factENTRY ~n := #in~n; 620558#L25 assume !(~n <= 0); 620326#L26 call #t~ret0 := fact(~n - 1);< 620521#factENTRY ~n := #in~n; 620524#L25 assume ~n <= 0;#res := 1; 620523#factFINAL assume true; 620517#factEXIT >#66#return; 620514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620465#factFINAL assume true; 620451#factEXIT >#66#return; 620456#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621134#factFINAL assume true; 621133#factEXIT >#70#return; 620478#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 620601#factENTRY ~n := #in~n; 621103#L25 assume !(~n <= 0); 620325#L26 call #t~ret0 := fact(~n - 1);< 620395#factENTRY ~n := #in~n; 620558#L25 assume !(~n <= 0); 620326#L26 call #t~ret0 := fact(~n - 1);< 620521#factENTRY ~n := #in~n; 620558#L25 assume !(~n <= 0); 620326#L26 call #t~ret0 := fact(~n - 1);< 620521#factENTRY ~n := #in~n; 620524#L25 assume ~n <= 0;#res := 1; 620523#factFINAL assume true; 620517#factEXIT >#66#return; 620514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620465#factFINAL assume true; 620451#factEXIT >#66#return; 620443#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620413#factFINAL assume true; 620374#factEXIT >#66#return; 620380#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621184#factFINAL assume true; 621112#factEXIT >#72#return; 621116#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 624945#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 624943#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 624941#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 624940#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 620225#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 620250#factENTRY ~n := #in~n; 620680#L25 assume !(~n <= 0); 620322#L26 call #t~ret0 := fact(~n - 1);< 620349#factENTRY ~n := #in~n; 620561#L25 assume !(~n <= 0); 620328#L26 call #t~ret0 := fact(~n - 1);< 620395#factENTRY ~n := #in~n; 620558#L25 assume !(~n <= 0); 620326#L26 call #t~ret0 := fact(~n - 1);< 620521#factENTRY ~n := #in~n; 620558#L25 assume !(~n <= 0); 620326#L26 call #t~ret0 := fact(~n - 1);< 620521#factENTRY ~n := #in~n; 620558#L25 assume !(~n <= 0); 620326#L26 call #t~ret0 := fact(~n - 1);< 620521#factENTRY ~n := #in~n; 620524#L25 assume ~n <= 0;#res := 1; 620523#factFINAL assume true; 620517#factEXIT >#66#return; 620514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620465#factFINAL assume true; 620451#factEXIT >#66#return; 620443#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620413#factFINAL assume true; 620374#factEXIT >#66#return; 620379#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620318#factFINAL assume true; 620338#factEXIT >#66#return; 620364#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620386#factFINAL assume true; 620361#factEXIT >#66#return; 620363#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620148#factFINAL assume true; 620249#factEXIT >#68#return; 620439#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 620565#factENTRY ~n := #in~n; 620563#L25 assume !(~n <= 0); 620319#L26 call #t~ret0 := fact(~n - 1);< 620440#factENTRY ~n := #in~n; 620557#L25 assume !(~n <= 0); 620375#L26 call #t~ret0 := fact(~n - 1);< 620520#factENTRY ~n := #in~n; 620509#L25 assume !(~n <= 0); 620454#L26 call #t~ret0 := fact(~n - 1);< 620457#factENTRY ~n := #in~n; 620524#L25 assume ~n <= 0;#res := 1; 620523#factFINAL assume true; 620517#factEXIT >#66#return; 620514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620465#factFINAL assume true; 620451#factEXIT >#66#return; 620443#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620413#factFINAL assume true; 620374#factEXIT >#66#return; 620378#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621095#factFINAL assume true; 621093#factEXIT >#70#return; 620580#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 620598#factENTRY ~n := #in~n; 620576#L25 assume !(~n <= 0); 620333#L26 call #t~ret0 := fact(~n - 1);< 620487#factENTRY ~n := #in~n; 621105#L25 assume ~n <= 0;#res := 1; 621101#factFINAL assume true; 621096#factEXIT >#66#return; 621094#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 621092#factFINAL assume true; 621082#factEXIT >#72#return; 621042#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 624934#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 624930#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 624926#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 624892#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 620344#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 620678#factENTRY ~n := #in~n; 620677#L25 assume !(~n <= 0); 620321#L26 call #t~ret0 := fact(~n - 1);< 620345#factENTRY ~n := #in~n; 620710#L25 assume !(~n <= 0); 620376#L26 call #t~ret0 := fact(~n - 1);< 620383#factENTRY ~n := #in~n; 620509#L25 assume !(~n <= 0); 620454#L26 call #t~ret0 := fact(~n - 1);< 620457#factENTRY ~n := #in~n; 620556#L25 assume !(~n <= 0); 620518#L26 call #t~ret0 := fact(~n - 1);< 620519#factENTRY ~n := #in~n; 620524#L25 assume ~n <= 0;#res := 1; 620523#factFINAL assume true; 620517#factEXIT >#66#return; 620514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620465#factFINAL assume true; 620451#factEXIT >#66#return; 620443#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620413#factFINAL assume true; 620374#factEXIT >#66#return; 620379#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620318#factFINAL assume true; 620338#factEXIT >#66#return; 620673#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 623905#factFINAL assume true; 623904#factEXIT >#68#return; 620492#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 620522#factENTRY ~n := #in~n; 620516#L25 assume !(~n <= 0); 620329#L26 call #t~ret0 := fact(~n - 1);< 620508#factENTRY ~n := #in~n; 620557#L25 assume !(~n <= 0); 620375#L26 call #t~ret0 := fact(~n - 1);< 620520#factENTRY ~n := #in~n; 620509#L25 assume !(~n <= 0); 620454#L26 call #t~ret0 := fact(~n - 1);< 620457#factENTRY ~n := #in~n; 620556#L25 assume !(~n <= 0); 620518#L26 call #t~ret0 := fact(~n - 1);< 620519#factENTRY ~n := #in~n; 620524#L25 assume ~n <= 0;#res := 1; 620523#factFINAL assume true; 620517#factEXIT >#66#return; 620514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620465#factFINAL assume true; 620451#factEXIT >#66#return; 620443#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620413#factFINAL assume true; 620374#factEXIT >#66#return; 620379#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 620318#factFINAL assume true; 620338#factEXIT >#66#return; 620673#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 623905#factFINAL assume true; 623904#factEXIT >#70#return; 620108#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 620103#factENTRY ~n := #in~n; 620140#L25 assume ~n <= 0;#res := 1; 620104#factFINAL assume true; 620137#factEXIT >#72#return; 621034#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 624891#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 624890#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 624889#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 624888#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 623896#L30-5 [2022-11-25 17:06:45,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:45,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1630772446, now seen corresponding path program 38 times [2022-11-25 17:06:45,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:45,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580658763] [2022-11-25 17:06:45,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:45,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:45,207 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:06:45,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2058960335] [2022-11-25 17:06:45,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:06:45,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:06:45,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:45,211 INFO L229 MonitoredProcess]: Starting monitored process 323 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:06:45,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (323)] Waiting until timeout for monitored process [2022-11-25 17:06:45,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:06:45,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:06:45,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 1699 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 17:06:45,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 33197 backedges. 321 proven. 313 refuted. 0 times theorem prover too weak. 32563 trivial. 0 not checked. [2022-11-25 17:06:46,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:06:47,140 INFO L134 CoverageAnalysis]: Checked inductivity of 33197 backedges. 320 proven. 313 refuted. 0 times theorem prover too weak. 32564 trivial. 0 not checked. [2022-11-25 17:06:47,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:47,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580658763] [2022-11-25 17:06:47,141 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:06:47,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058960335] [2022-11-25 17:06:47,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058960335] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:06:47,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:06:47,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2022-11-25 17:06:47,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980517474] [2022-11-25 17:06:47,142 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:06:47,143 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 17:06:47,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:47,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1892831744, now seen corresponding path program 34 times [2022-11-25 17:06:47,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:47,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770291576] [2022-11-25 17:06:47,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:47,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:47,155 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:06:47,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [344005285] [2022-11-25 17:06:47,155 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:06:47,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:06:47,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:47,159 INFO L229 MonitoredProcess]: Starting monitored process 324 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:06:47,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (324)] Waiting until timeout for monitored process [2022-11-25 17:06:47,518 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:06:47,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:06:47,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-25 17:06:47,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 13187 backedges. 7465 proven. 603 refuted. 0 times theorem prover too weak. 5119 trivial. 0 not checked. [2022-11-25 17:06:47,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:06:49,977 INFO L134 CoverageAnalysis]: Checked inductivity of 13187 backedges. 1018 proven. 1930 refuted. 0 times theorem prover too weak. 10239 trivial. 0 not checked. [2022-11-25 17:06:49,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:49,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770291576] [2022-11-25 17:06:49,978 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:06:49,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344005285] [2022-11-25 17:06:49,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344005285] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:06:49,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:06:49,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25] total 28 [2022-11-25 17:06:49,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361376846] [2022-11-25 17:06:49,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:06:49,979 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 17:06:49,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:49,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 17:06:49,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2022-11-25 17:06:49,980 INFO L87 Difference]: Start difference. First operand 5973 states and 9203 transitions. cyclomatic complexity: 3317 Second operand has 28 states, 25 states have (on average 3.04) internal successors, (76), 28 states have internal predecessors, (76), 17 states have call successors, (28), 2 states have call predecessors, (28), 12 states have return successors, (34), 12 states have call predecessors, (34), 17 states have call successors, (34) [2022-11-25 17:06:51,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:51,710 INFO L93 Difference]: Finished difference Result 6630 states and 10212 transitions. [2022-11-25 17:06:51,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6630 states and 10212 transitions. [2022-11-25 17:06:51,740 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 748 [2022-11-25 17:06:51,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6630 states to 6300 states and 9560 transitions. [2022-11-25 17:06:51,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 509 [2022-11-25 17:06:51,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 509 [2022-11-25 17:06:51,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6300 states and 9560 transitions. [2022-11-25 17:06:51,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 17:06:51,776 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6300 states and 9560 transitions. [2022-11-25 17:06:51,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6300 states and 9560 transitions. [2022-11-25 17:06:51,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6300 to 5333. [2022-11-25 17:06:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5333 states, 3408 states have (on average 1.0713028169014085) internal successors, (3651), 3452 states have internal predecessors, (3651), 1184 states have call successors, (1314), 612 states have call predecessors, (1314), 741 states have return successors, (2730), 1268 states have call predecessors, (2730), 1184 states have call successors, (2730) [2022-11-25 17:06:51,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5333 states to 5333 states and 7695 transitions. [2022-11-25 17:06:51,858 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5333 states and 7695 transitions. [2022-11-25 17:06:51,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 17:06:51,858 INFO L428 stractBuchiCegarLoop]: Abstraction has 5333 states and 7695 transitions. [2022-11-25 17:06:51,859 INFO L335 stractBuchiCegarLoop]: ======== Iteration 55 ============ [2022-11-25 17:06:51,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5333 states and 7695 transitions. [2022-11-25 17:06:51,870 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 695 [2022-11-25 17:06:51,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:06:51,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:06:51,872 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [86, 86, 49, 49, 49, 49, 37, 13, 12, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 3, 3, 1, 1, 1, 1] [2022-11-25 17:06:51,872 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [78, 78, 60, 60, 60, 60, 18, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:51,873 INFO L748 eck$LassoCheckResult]: Stem: 639938#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 639911#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; 639912#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 639937#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; 639925#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 639926#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 643617#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 639903#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 639904#factENTRY ~n := #in~n; 643627#L25 assume ~n <= 0;#res := 1; 643626#factFINAL assume true; 643624#factEXIT >#68#return; 643622#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 643623#factENTRY ~n := #in~n; 643746#L25 assume ~n <= 0;#res := 1; 643745#factFINAL assume true; 643621#factEXIT >#70#return; 639892#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 639893#factENTRY ~n := #in~n; 643764#L25 assume ~n <= 0;#res := 1; 643763#factFINAL assume true; 643762#factEXIT >#72#return; 643761#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 639931#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 639932#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 644572#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 644573#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 644594#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 644595#factENTRY ~n := #in~n; 644628#L25 assume !(~n <= 0); 644624#L26 call #t~ret0 := fact(~n - 1);< 644625#factENTRY ~n := #in~n; 644630#L25 assume ~n <= 0;#res := 1; 644627#factFINAL assume true; 644623#factEXIT >#66#return; 644621#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 644619#factFINAL assume true; 644593#factEXIT >#74#return; 644586#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 644587#factENTRY ~n := #in~n; 644591#L25 assume ~n <= 0;#res := 1; 644590#factFINAL assume true; 644584#factEXIT >#76#return; 644580#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 644582#factENTRY ~n := #in~n; 644599#L25 assume !(~n <= 0); 644597#L26 call #t~ret0 := fact(~n - 1);< 644598#factENTRY ~n := #in~n; 644604#L25 assume ~n <= 0;#res := 1; 644603#factFINAL assume true; 644596#factEXIT >#66#return; 644588#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 644583#factFINAL assume true; 644578#factEXIT >#78#return; 644577#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; 644576#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 644574#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 644575#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 639941#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 639942#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 645101#factENTRY ~n := #in~n; 645112#L25 assume !(~n <= 0); 645109#L26 call #t~ret0 := fact(~n - 1);< 645111#factENTRY ~n := #in~n; 645123#L25 assume !(~n <= 0); 645110#L26 call #t~ret0 := fact(~n - 1);< 645122#factENTRY ~n := #in~n; 645129#L25 assume ~n <= 0;#res := 1; 645127#factFINAL assume true; 645121#factEXIT >#66#return; 645118#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 645114#factFINAL assume true; 645108#factEXIT >#66#return; 645105#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 645104#factFINAL assume true; 645100#factEXIT >#74#return; 645097#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 645098#factENTRY ~n := #in~n; 645102#L25 assume ~n <= 0;#res := 1; 645103#factFINAL assume true; 645208#factEXIT >#76#return; 639899#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 639962#factENTRY ~n := #in~n; 645106#L25 assume !(~n <= 0); 644967#L26 call #t~ret0 := fact(~n - 1);< 644977#factENTRY ~n := #in~n; 644999#L25 assume !(~n <= 0); 644968#L26 call #t~ret0 := fact(~n - 1);< 644984#factENTRY ~n := #in~n; 644997#L25 assume ~n <= 0;#res := 1; 644996#factFINAL assume true; 644983#factEXIT >#66#return; 644981#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 644982#factFINAL assume true; 644989#factEXIT >#66#return; 639946#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 639897#factFINAL assume true; 639900#factEXIT >#78#return; 639915#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; 639916#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 639924#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 639948#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 639949#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 644557#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 644715#factENTRY ~n := #in~n; 644714#L25 assume !(~n <= 0); 644712#L26 call #t~ret0 := fact(~n - 1);< 644713#factENTRY ~n := #in~n; 644711#L25 assume !(~n <= 0); 644706#L26 call #t~ret0 := fact(~n - 1);< 644710#factENTRY ~n := #in~n; 644711#L25 assume !(~n <= 0); 644706#L26 call #t~ret0 := fact(~n - 1);< 644710#factENTRY ~n := #in~n; 644705#L25 assume ~n <= 0;#res := 1; 644707#factFINAL assume true; 644727#factEXIT >#66#return; 644726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 644725#factFINAL assume true; 644724#factEXIT >#66#return; 644723#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 644722#factFINAL assume true; 644721#factEXIT >#66#return; 644720#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 644719#factFINAL assume true; 644556#factEXIT >#74#return; 644505#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 644518#factENTRY ~n := #in~n; 644519#L25 assume ~n <= 0;#res := 1; 644641#factFINAL assume true; 644640#factEXIT >#76#return; 644616#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 644620#factENTRY ~n := #in~n; 644617#L25 assume !(~n <= 0); 644535#L26 call #t~ret0 := fact(~n - 1);< 644545#factENTRY ~n := #in~n; 644544#L25 assume !(~n <= 0); 644533#L26 call #t~ret0 := fact(~n - 1);< 644540#factENTRY ~n := #in~n; 644608#L25 assume !(~n <= 0); 644532#L26 call #t~ret0 := fact(~n - 1);< 644607#factENTRY ~n := #in~n; 644614#L25 assume ~n <= 0;#res := 1; 644611#factFINAL assume true; 644606#factEXIT >#66#return; 644605#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 644602#factFINAL assume true; 644601#factEXIT >#66#return; 644600#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 644543#factFINAL assume true; 644531#factEXIT >#66#return; 644539#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 644666#factFINAL assume true; 644663#factEXIT >#78#return; 641523#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; 641522#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 641484#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 641479#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 641471#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 641462#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 641457#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 641445#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 641413#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 641415#factENTRY ~n := #in~n; 641442#L25 assume !(~n <= 0); 641437#L26 call #t~ret0 := fact(~n - 1);< 641439#factENTRY ~n := #in~n; 641455#L25 assume ~n <= 0;#res := 1; 641699#factFINAL assume true; 641697#factEXIT >#66#return; 641695#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 641693#factFINAL assume true; 641688#factEXIT >#68#return; 641683#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 641684#factENTRY ~n := #in~n; 641692#L25 assume ~n <= 0;#res := 1; 641685#factFINAL assume true; 641680#factEXIT >#70#return; 641433#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 641497#factENTRY ~n := #in~n; 641492#L25 assume !(~n <= 0); 641366#L26 call #t~ret0 := fact(~n - 1);< 641380#factENTRY ~n := #in~n; 641440#L25 assume ~n <= 0;#res := 1; 641432#factFINAL assume true; 641416#factEXIT >#66#return; 641423#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 643731#factFINAL assume true; 643708#factEXIT >#72#return; 643710#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 644388#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 644387#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 644386#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 644384#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 641469#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 641483#factENTRY ~n := #in~n; 641467#L25 assume !(~n <= 0); 641417#L26 call #t~ret0 := fact(~n - 1);< 641425#factENTRY ~n := #in~n; 641440#L25 assume ~n <= 0;#res := 1; 641432#factFINAL assume true; 641416#factEXIT >#66#return; 641421#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 641747#factFINAL assume true; 641746#factEXIT >#68#return; 641459#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 641477#factENTRY ~n := #in~n; 641478#L25 assume !(~n <= 0); 641419#L26 call #t~ret0 := fact(~n - 1);< 641425#factENTRY ~n := #in~n; 641440#L25 assume ~n <= 0;#res := 1; 641432#factFINAL assume true; 641416#factEXIT >#66#return; 641424#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 643122#factFINAL assume true; 643095#factEXIT >#70#return; 643086#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 643090#factENTRY ~n := #in~n; 643160#L25 assume ~n <= 0;#res := 1; 643158#factFINAL assume true; 643084#factEXIT >#72#return; 643088#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 644375#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 644372#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 644369#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 644366#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 641377#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 641451#factENTRY ~n := #in~n; 641448#L25 assume !(~n <= 0); 641370#L26 call #t~ret0 := fact(~n - 1);< 641380#factENTRY ~n := #in~n; 641458#L25 assume !(~n <= 0); 641368#L26 call #t~ret0 := fact(~n - 1);< 641389#factENTRY ~n := #in~n; 641405#L25 assume ~n <= 0;#res := 1; 641394#factFINAL assume true; 641387#factEXIT >#66#return; 641384#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 641376#factFINAL assume true; 641365#factEXIT >#66#return; 641372#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 644343#factFINAL assume true; 644338#factEXIT >#74#return; 644335#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 644337#factENTRY ~n := #in~n; 644379#L25 assume !(~n <= 0); 644276#L26 call #t~ret0 := fact(~n - 1);< 644374#factENTRY ~n := #in~n; 644381#L25 assume ~n <= 0;#res := 1; 644376#factFINAL assume true; 644373#factEXIT >#66#return; 644371#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 644368#factFINAL assume true; 644365#factEXIT >#76#return; 641671#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 641676#factENTRY ~n := #in~n; 644265#L25 assume !(~n <= 0); 644071#L26 call #t~ret0 := fact(~n - 1);< 644083#factENTRY ~n := #in~n; 644363#L25 assume ~n <= 0;#res := 1; 644287#factFINAL assume true; 644279#factEXIT >#66#return; 644283#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 644426#factFINAL assume true; 641670#factEXIT >#78#return; 641675#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; 644422#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 644418#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 644395#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 644091#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 641007#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 641018#factENTRY ~n := #in~n; 641016#L25 assume !(~n <= 0); 640999#L26 call #t~ret0 := fact(~n - 1);< 641002#factENTRY ~n := #in~n; 641015#L25 assume !(~n <= 0); 640997#L26 call #t~ret0 := fact(~n - 1);< 641013#factENTRY ~n := #in~n; 641015#L25 assume !(~n <= 0); 640997#L26 call #t~ret0 := fact(~n - 1);< 641013#factENTRY ~n := #in~n; 641021#L25 assume ~n <= 0;#res := 1; 641020#factFINAL assume true; 641019#factEXIT >#66#return; 641017#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 641014#factFINAL assume true; 641012#factEXIT >#66#return; 641011#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 641003#factFINAL assume true; 640996#factEXIT >#66#return; 641000#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 641118#factFINAL assume true; 641119#factEXIT >#74#return; 640953#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 640969#factENTRY ~n := #in~n; 640968#L25 assume !(~n <= 0); 640756#L26 call #t~ret0 := fact(~n - 1);< 640920#factENTRY ~n := #in~n; 640917#L25 assume ~n <= 0;#res := 1; 640918#factFINAL assume true; 640753#factEXIT >#66#return; 640759#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 644485#factFINAL assume true; 644484#factEXIT >#76#return; 640744#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 640773#factENTRY ~n := #in~n; 640774#L25 assume !(~n <= 0); 640760#L26 call #t~ret0 := fact(~n - 1);< 640761#factENTRY ~n := #in~n; 640946#L25 assume !(~n <= 0); 640898#L26 call #t~ret0 := fact(~n - 1);< 640925#factENTRY ~n := #in~n; 640928#L25 assume ~n <= 0;#res := 1; 640926#factFINAL assume true; 640922#factEXIT >#66#return; 640919#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640893#factFINAL assume true; 640900#factEXIT >#66#return; 640979#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640742#factFINAL assume true; 640745#factEXIT >#78#return; 640698#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; 640697#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 640695#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 640693#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 640691#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 640684#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 640051#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 640401#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 640399#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 640400#factENTRY ~n := #in~n; 640424#L25 assume !(~n <= 0); 640422#L26 call #t~ret0 := fact(~n - 1);< 640423#factENTRY ~n := #in~n; 640430#L25 assume !(~n <= 0); 640421#L26 call #t~ret0 := fact(~n - 1);< 640428#factENTRY ~n := #in~n; 640434#L25 assume ~n <= 0;#res := 1; 640433#factFINAL assume true; 640427#factEXIT >#66#return; 640426#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640425#factFINAL assume true; 640420#factEXIT >#66#return; 640419#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640416#factFINAL assume true; 640397#factEXIT >#68#return; 640393#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 640395#factENTRY ~n := #in~n; 640435#L25 assume ~n <= 0;#res := 1; 640432#factFINAL assume true; 640392#factEXIT >#70#return; 640383#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 640386#factENTRY ~n := #in~n; 640404#L25 assume !(~n <= 0); 640355#L26 call #t~ret0 := fact(~n - 1);< 640403#factENTRY ~n := #in~n; 640672#L25 assume !(~n <= 0); 640356#L26 call #t~ret0 := fact(~n - 1);< 640408#factENTRY ~n := #in~n; 640411#L25 assume ~n <= 0;#res := 1; 640409#factFINAL assume true; 640406#factEXIT >#66#return; 640405#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640402#factFINAL assume true; 640354#factEXIT >#66#return; 640358#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640390#factFINAL assume true; 640382#factEXIT >#72#return; 640385#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 640415#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 640414#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 640412#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 640410#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 640333#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 640339#factENTRY ~n := #in~n; 640360#L25 assume !(~n <= 0); 640357#L26 call #t~ret0 := fact(~n - 1);< 640359#factENTRY ~n := #in~n; 640670#L25 assume !(~n <= 0); 640407#L26 call #t~ret0 := fact(~n - 1);< 640413#factENTRY ~n := #in~n; 640411#L25 assume ~n <= 0;#res := 1; 640409#factFINAL assume true; 640406#factEXIT >#66#return; 640405#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640402#factFINAL assume true; 640354#factEXIT >#66#return; 640352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640342#factFINAL assume true; 640332#factEXIT >#68#return; 640337#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 640367#factENTRY ~n := #in~n; 640376#L25 assume !(~n <= 0); 640372#L26 call #t~ret0 := fact(~n - 1);< 640374#factENTRY ~n := #in~n; 640429#L25 assume ~n <= 0;#res := 1; 640381#factFINAL assume true; 640370#factEXIT >#66#return; 640369#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640368#factFINAL assume true; 640366#factEXIT >#70#return; 640363#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 640365#factENTRY ~n := #in~n; 640387#L25 assume !(~n <= 0); 640371#L26 call #t~ret0 := fact(~n - 1);< 640374#factENTRY ~n := #in~n; 640429#L25 assume ~n <= 0;#res := 1; 640381#factFINAL assume true; 640370#factEXIT >#66#return; 640373#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640418#factFINAL assume true; 640361#factEXIT >#72#return; 640353#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 640344#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 640343#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 640341#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 640340#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 640334#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 640339#factENTRY ~n := #in~n; 640360#L25 assume !(~n <= 0); 640357#L26 call #t~ret0 := fact(~n - 1);< 640359#factENTRY ~n := #in~n; 640670#L25 assume !(~n <= 0); 640407#L26 call #t~ret0 := fact(~n - 1);< 640413#factENTRY ~n := #in~n; 640411#L25 assume ~n <= 0;#res := 1; 640409#factFINAL assume true; 640406#factEXIT >#66#return; 640405#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640402#factFINAL assume true; 640354#factEXIT >#66#return; 640352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640342#factFINAL assume true; 640332#factEXIT >#68#return; 640308#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 640314#factENTRY ~n := #in~n; 640312#L25 assume !(~n <= 0); 640302#L26 call #t~ret0 := fact(~n - 1);< 640310#factENTRY ~n := #in~n; 640431#L25 assume !(~n <= 0); 640347#L26 call #t~ret0 := fact(~n - 1);< 640348#factENTRY ~n := #in~n; 640351#L25 assume ~n <= 0;#res := 1; 640350#factFINAL assume true; 640346#factEXIT >#66#return; 640330#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640307#factFINAL assume true; 640301#factEXIT >#66#return; 640303#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640345#factFINAL assume true; 640321#factEXIT >#70#return; 640318#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 640320#factENTRY ~n := #in~n; 640349#L25 assume ~n <= 0;#res := 1; 640331#factFINAL assume true; 640316#factEXIT >#72#return; 640319#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 640449#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 640446#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 640441#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 640439#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 640300#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 640437#factENTRY ~n := #in~n; 640448#L25 assume !(~n <= 0); 640443#L26 call #t~ret0 := fact(~n - 1);< 640445#factENTRY ~n := #in~n; 640454#L25 assume !(~n <= 0); 640444#L26 call #t~ret0 := fact(~n - 1);< 640452#factENTRY ~n := #in~n; 640454#L25 assume !(~n <= 0); 640444#L26 call #t~ret0 := fact(~n - 1);< 640452#factENTRY ~n := #in~n; 640458#L25 assume ~n <= 0;#res := 1; 640457#factFINAL assume true; 640456#factEXIT >#66#return; 640455#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640453#factFINAL assume true; 640451#factEXIT >#66#return; 640450#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640447#factFINAL assume true; 640442#factEXIT >#66#return; 640440#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640438#factFINAL assume true; 640436#factEXIT >#74#return; 640081#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 640082#factENTRY ~n := #in~n; 640577#L25 assume !(~n <= 0); 640574#L26 call #t~ret0 := fact(~n - 1);< 640575#factENTRY ~n := #in~n; 640584#L25 assume !(~n <= 0); 640580#L26 call #t~ret0 := fact(~n - 1);< 640582#factENTRY ~n := #in~n; 640592#L25 assume ~n <= 0;#res := 1; 640596#factFINAL assume true; 640593#factEXIT >#66#return; 640591#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640589#factFINAL assume true; 640586#factEXIT >#66#return; 640581#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640741#factFINAL assume true; 640739#factEXIT >#76#return; 640073#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 640074#factENTRY ~n := #in~n; 640507#L25 assume !(~n <= 0); 640122#L26 call #t~ret0 := fact(~n - 1);< 640132#factENTRY ~n := #in~n; 640511#L25 assume ~n <= 0;#res := 1; 640508#factFINAL assume true; 640505#factEXIT >#66#return; 640503#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640502#factFINAL assume true; 640500#factEXIT >#78#return; 640066#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; 640063#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 640064#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 640057#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 640058#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 640050#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 640052#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 642370#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 639997#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 640036#factENTRY ~n := #in~n; 640035#L25 assume !(~n <= 0); 640005#L26 call #t~ret0 := fact(~n - 1);< 640031#factENTRY ~n := #in~n; 640026#L25 assume !(~n <= 0); 640004#L26 call #t~ret0 := fact(~n - 1);< 640023#factENTRY ~n := #in~n; 640026#L25 assume !(~n <= 0); 640004#L26 call #t~ret0 := fact(~n - 1);< 640023#factENTRY ~n := #in~n; 640026#L25 assume !(~n <= 0); 640004#L26 call #t~ret0 := fact(~n - 1);< 640023#factENTRY ~n := #in~n; 640026#L25 assume !(~n <= 0); 640004#L26 call #t~ret0 := fact(~n - 1);< 640023#factENTRY ~n := #in~n; 640027#L25 assume ~n <= 0;#res := 1; 640024#factFINAL assume true; 640022#factEXIT >#66#return; 640021#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640020#factFINAL assume true; 640018#factEXIT >#66#return; 640019#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640041#factFINAL assume true; 640001#factEXIT >#66#return; 640007#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640042#factFINAL assume true; 640039#factEXIT >#66#return; 640017#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640012#factFINAL assume true; 640015#factEXIT >#66#return; 640000#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 639999#factFINAL assume true; 639988#factEXIT >#68#return; 639969#L30-1 [2022-11-25 17:06:51,873 INFO L750 eck$LassoCheckResult]: Loop: 639969#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 639954#factENTRY ~n := #in~n; 639987#L25 assume ~n <= 0;#res := 1; 639986#factFINAL assume true; 639967#factEXIT >#70#return; 639978#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 639891#factENTRY ~n := #in~n; 642602#L25 assume !(~n <= 0); 641805#L26 call #t~ret0 := fact(~n - 1);< 641819#factENTRY ~n := #in~n; 643774#L25 assume !(~n <= 0); 641798#L26 call #t~ret0 := fact(~n - 1);< 642139#factENTRY ~n := #in~n; 643703#L25 assume !(~n <= 0); 641806#L26 call #t~ret0 := fact(~n - 1);< 642229#factENTRY ~n := #in~n; 643100#L25 assume !(~n <= 0); 641802#L26 call #t~ret0 := fact(~n - 1);< 642290#factENTRY ~n := #in~n; 642307#L25 assume !(~n <= 0); 641813#L26 call #t~ret0 := fact(~n - 1);< 642305#factENTRY ~n := #in~n; 642332#L25 assume ~n <= 0;#res := 1; 642330#factFINAL assume true; 642302#factEXIT >#66#return; 642301#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642300#factFINAL assume true; 642284#factEXIT >#66#return; 642282#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642239#factFINAL assume true; 642222#factEXIT >#66#return; 642228#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642134#factFINAL assume true; 642121#factEXIT >#66#return; 641815#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 641972#factFINAL assume true; 641796#factEXIT >#66#return; 641818#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642401#factFINAL assume true; 642402#factEXIT >#72#return; 642695#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 642693#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 642691#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 642688#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 642686#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 642036#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 642052#factENTRY ~n := #in~n; 643712#L25 assume !(~n <= 0); 641799#L26 call #t~ret0 := fact(~n - 1);< 641819#factENTRY ~n := #in~n; 643774#L25 assume !(~n <= 0); 641798#L26 call #t~ret0 := fact(~n - 1);< 642139#factENTRY ~n := #in~n; 643703#L25 assume !(~n <= 0); 641806#L26 call #t~ret0 := fact(~n - 1);< 642229#factENTRY ~n := #in~n; 643100#L25 assume !(~n <= 0); 641802#L26 call #t~ret0 := fact(~n - 1);< 642290#factENTRY ~n := #in~n; 642307#L25 assume !(~n <= 0); 641813#L26 call #t~ret0 := fact(~n - 1);< 642305#factENTRY ~n := #in~n; 642332#L25 assume ~n <= 0;#res := 1; 642330#factFINAL assume true; 642302#factEXIT >#66#return; 642301#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642300#factFINAL assume true; 642284#factEXIT >#66#return; 642282#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642239#factFINAL assume true; 642222#factEXIT >#66#return; 642228#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642134#factFINAL assume true; 642121#factEXIT >#66#return; 641815#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 641972#factFINAL assume true; 641796#factEXIT >#66#return; 641816#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642051#factFINAL assume true; 642013#factEXIT >#68#return; 642049#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 642341#factENTRY ~n := #in~n; 642340#L25 assume !(~n <= 0); 642324#L26 call #t~ret0 := fact(~n - 1);< 642335#factENTRY ~n := #in~n; 642372#L25 assume ~n <= 0;#res := 1; 642334#factFINAL assume true; 642323#factEXIT >#66#return; 642325#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642362#factFINAL assume true; 642319#factEXIT >#70#return; 642140#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 642682#factENTRY ~n := #in~n; 643359#L25 assume !(~n <= 0); 641804#L26 call #t~ret0 := fact(~n - 1);< 642139#factENTRY ~n := #in~n; 643703#L25 assume !(~n <= 0); 641806#L26 call #t~ret0 := fact(~n - 1);< 642229#factENTRY ~n := #in~n; 643100#L25 assume !(~n <= 0); 641802#L26 call #t~ret0 := fact(~n - 1);< 642290#factENTRY ~n := #in~n; 642307#L25 assume !(~n <= 0); 641813#L26 call #t~ret0 := fact(~n - 1);< 642305#factENTRY ~n := #in~n; 642332#L25 assume ~n <= 0;#res := 1; 642330#factFINAL assume true; 642302#factEXIT >#66#return; 642301#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642300#factFINAL assume true; 642284#factEXIT >#66#return; 642282#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642239#factFINAL assume true; 642222#factEXIT >#66#return; 642228#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642134#factFINAL assume true; 642121#factEXIT >#66#return; 641817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642689#factFINAL assume true; 642678#factEXIT >#72#return; 642681#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 642683#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 642676#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 642673#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 642670#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 642026#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 642052#factENTRY ~n := #in~n; 643712#L25 assume !(~n <= 0); 641799#L26 call #t~ret0 := fact(~n - 1);< 641819#factENTRY ~n := #in~n; 643774#L25 assume !(~n <= 0); 641798#L26 call #t~ret0 := fact(~n - 1);< 642139#factENTRY ~n := #in~n; 643703#L25 assume !(~n <= 0); 641806#L26 call #t~ret0 := fact(~n - 1);< 642229#factENTRY ~n := #in~n; 643100#L25 assume !(~n <= 0); 641802#L26 call #t~ret0 := fact(~n - 1);< 642290#factENTRY ~n := #in~n; 642307#L25 assume !(~n <= 0); 641813#L26 call #t~ret0 := fact(~n - 1);< 642305#factENTRY ~n := #in~n; 642332#L25 assume ~n <= 0;#res := 1; 642330#factFINAL assume true; 642302#factEXIT >#66#return; 642301#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642300#factFINAL assume true; 642284#factEXIT >#66#return; 642282#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642239#factFINAL assume true; 642222#factEXIT >#66#return; 642228#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642134#factFINAL assume true; 642121#factEXIT >#66#return; 641815#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 641972#factFINAL assume true; 641796#factEXIT >#66#return; 641816#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642051#factFINAL assume true; 642013#factEXIT >#68#return; 642018#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 642050#factENTRY ~n := #in~n; 642145#L25 assume !(~n <= 0); 641814#L26 call #t~ret0 := fact(~n - 1);< 642144#factENTRY ~n := #in~n; 642307#L25 assume !(~n <= 0); 641813#L26 call #t~ret0 := fact(~n - 1);< 642305#factENTRY ~n := #in~n; 642332#L25 assume ~n <= 0;#res := 1; 642330#factFINAL assume true; 642302#factEXIT >#66#return; 642301#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642300#factFINAL assume true; 642284#factEXIT >#66#return; 642289#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642283#factFINAL assume true; 642245#factEXIT >#70#return; 642252#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 642387#factENTRY ~n := #in~n; 642386#L25 assume !(~n <= 0); 641811#L26 call #t~ret0 := fact(~n - 1);< 642290#factENTRY ~n := #in~n; 642307#L25 assume !(~n <= 0); 641813#L26 call #t~ret0 := fact(~n - 1);< 642305#factENTRY ~n := #in~n; 642307#L25 assume !(~n <= 0); 641813#L26 call #t~ret0 := fact(~n - 1);< 642305#factENTRY ~n := #in~n; 642332#L25 assume ~n <= 0;#res := 1; 642330#factFINAL assume true; 642302#factEXIT >#66#return; 642301#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642300#factFINAL assume true; 642284#factEXIT >#66#return; 642282#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642239#factFINAL assume true; 642222#factEXIT >#66#return; 642226#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642684#factFINAL assume true; 642316#factEXIT >#72#return; 642273#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 642665#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 642663#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 642661#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 642658#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 642014#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 642052#factENTRY ~n := #in~n; 643712#L25 assume !(~n <= 0); 641799#L26 call #t~ret0 := fact(~n - 1);< 641819#factENTRY ~n := #in~n; 643774#L25 assume !(~n <= 0); 641798#L26 call #t~ret0 := fact(~n - 1);< 642139#factENTRY ~n := #in~n; 643703#L25 assume !(~n <= 0); 641806#L26 call #t~ret0 := fact(~n - 1);< 642229#factENTRY ~n := #in~n; 643100#L25 assume !(~n <= 0); 641802#L26 call #t~ret0 := fact(~n - 1);< 642290#factENTRY ~n := #in~n; 642307#L25 assume !(~n <= 0); 641813#L26 call #t~ret0 := fact(~n - 1);< 642305#factENTRY ~n := #in~n; 642332#L25 assume ~n <= 0;#res := 1; 642330#factFINAL assume true; 642302#factEXIT >#66#return; 642301#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642300#factFINAL assume true; 642284#factEXIT >#66#return; 642282#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642239#factFINAL assume true; 642222#factEXIT >#66#return; 642228#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642134#factFINAL assume true; 642121#factEXIT >#66#return; 641815#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 641972#factFINAL assume true; 641796#factEXIT >#66#return; 641816#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642051#factFINAL assume true; 642013#factEXIT >#68#return; 642021#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 642050#factENTRY ~n := #in~n; 642145#L25 assume !(~n <= 0); 641814#L26 call #t~ret0 := fact(~n - 1);< 642144#factENTRY ~n := #in~n; 642307#L25 assume !(~n <= 0); 641813#L26 call #t~ret0 := fact(~n - 1);< 642305#factENTRY ~n := #in~n; 642307#L25 assume !(~n <= 0); 641813#L26 call #t~ret0 := fact(~n - 1);< 642305#factENTRY ~n := #in~n; 642332#L25 assume ~n <= 0;#res := 1; 642330#factFINAL assume true; 642302#factEXIT >#66#return; 642301#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642300#factFINAL assume true; 642284#factEXIT >#66#return; 642282#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642239#factFINAL assume true; 642222#factEXIT >#66#return; 642221#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642210#factFINAL assume true; 642201#factEXIT >#70#return; 642203#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 642329#factENTRY ~n := #in~n; 642328#L25 assume !(~n <= 0); 641807#L26 call #t~ret0 := fact(~n - 1);< 642144#factENTRY ~n := #in~n; 642372#L25 assume ~n <= 0;#res := 1; 642334#factFINAL assume true; 642323#factEXIT >#66#return; 642293#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642238#factFINAL assume true; 642213#factEXIT >#72#return; 642216#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 643752#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 643751#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 643742#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 643700#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 639966#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 642052#factENTRY ~n := #in~n; 643712#L25 assume !(~n <= 0); 641799#L26 call #t~ret0 := fact(~n - 1);< 641819#factENTRY ~n := #in~n; 643774#L25 assume !(~n <= 0); 641798#L26 call #t~ret0 := fact(~n - 1);< 642139#factENTRY ~n := #in~n; 643703#L25 assume !(~n <= 0); 641806#L26 call #t~ret0 := fact(~n - 1);< 642229#factENTRY ~n := #in~n; 643100#L25 assume !(~n <= 0); 641802#L26 call #t~ret0 := fact(~n - 1);< 642290#factENTRY ~n := #in~n; 642307#L25 assume !(~n <= 0); 641813#L26 call #t~ret0 := fact(~n - 1);< 642305#factENTRY ~n := #in~n; 642332#L25 assume ~n <= 0;#res := 1; 642330#factFINAL assume true; 642302#factEXIT >#66#return; 642301#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642300#factFINAL assume true; 642284#factEXIT >#66#return; 642282#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642239#factFINAL assume true; 642222#factEXIT >#66#return; 642228#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642134#factFINAL assume true; 642121#factEXIT >#66#return; 641815#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 641972#factFINAL assume true; 641796#factEXIT >#66#return; 641816#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642051#factFINAL assume true; 642013#factEXIT >#68#return; 642015#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 642050#factENTRY ~n := #in~n; 642145#L25 assume !(~n <= 0); 641814#L26 call #t~ret0 := fact(~n - 1);< 642144#factENTRY ~n := #in~n; 642307#L25 assume !(~n <= 0); 641813#L26 call #t~ret0 := fact(~n - 1);< 642305#factENTRY ~n := #in~n; 642307#L25 assume !(~n <= 0); 641813#L26 call #t~ret0 := fact(~n - 1);< 642305#factENTRY ~n := #in~n; 642307#L25 assume !(~n <= 0); 641813#L26 call #t~ret0 := fact(~n - 1);< 642305#factENTRY ~n := #in~n; 642307#L25 assume !(~n <= 0); 641813#L26 call #t~ret0 := fact(~n - 1);< 642305#factENTRY ~n := #in~n; 642332#L25 assume ~n <= 0;#res := 1; 642330#factFINAL assume true; 642302#factEXIT >#66#return; 642301#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642300#factFINAL assume true; 642284#factEXIT >#66#return; 642282#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642239#factFINAL assume true; 642222#factEXIT >#66#return; 642228#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642134#factFINAL assume true; 642121#factEXIT >#66#return; 641815#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 641972#factFINAL assume true; 641796#factEXIT >#66#return; 641816#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642051#factFINAL assume true; 642013#factEXIT >#70#return; 641981#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 642008#factENTRY ~n := #in~n; 642010#L25 assume ~n <= 0;#res := 1; 642009#factFINAL assume true; 641977#factEXIT >#72#return; 641995#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 643689#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 643688#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 643686#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 639965#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 639880#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 639881#factENTRY ~n := #in~n; 643228#L25 assume !(~n <= 0); 643217#L26 call #t~ret0 := fact(~n - 1);< 643227#factENTRY ~n := #in~n; 643226#L25 assume !(~n <= 0); 643206#L26 call #t~ret0 := fact(~n - 1);< 643218#factENTRY ~n := #in~n; 643546#L25 assume !(~n <= 0); 643207#L26 call #t~ret0 := fact(~n - 1);< 643256#factENTRY ~n := #in~n; 643255#L25 assume !(~n <= 0); 643204#L26 call #t~ret0 := fact(~n - 1);< 643225#factENTRY ~n := #in~n; 643267#L25 assume !(~n <= 0); 643203#L26 call #t~ret0 := fact(~n - 1);< 643250#factENTRY ~n := #in~n; 643266#L25 assume ~n <= 0;#res := 1; 643257#factFINAL assume true; 643249#factEXIT >#66#return; 643246#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 643243#factFINAL assume true; 643240#factEXIT >#66#return; 643237#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 643234#factFINAL assume true; 643224#factEXIT >#66#return; 643219#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 643216#factFINAL assume true; 643202#factEXIT >#66#return; 643208#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 643271#factFINAL assume true; 643268#factEXIT >#66#return; 643252#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 643251#factFINAL assume true; 643247#factEXIT >#74#return; 643098#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 643099#factENTRY ~n := #in~n; 643175#L25 assume !(~n <= 0); 643105#L26 call #t~ret0 := fact(~n - 1);< 643214#factENTRY ~n := #in~n; 643201#L25 assume !(~n <= 0); 643104#L26 call #t~ret0 := fact(~n - 1);< 643197#factENTRY ~n := #in~n; 643201#L25 assume !(~n <= 0); 643104#L26 call #t~ret0 := fact(~n - 1);< 643197#factENTRY ~n := #in~n; 643201#L25 assume !(~n <= 0); 643104#L26 call #t~ret0 := fact(~n - 1);< 643197#factENTRY ~n := #in~n; 643201#L25 assume !(~n <= 0); 643104#L26 call #t~ret0 := fact(~n - 1);< 643197#factENTRY ~n := #in~n; 643215#L25 assume ~n <= 0;#res := 1; 643245#factFINAL assume true; 643242#factEXIT >#66#return; 643239#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 643236#factFINAL assume true; 643230#factEXIT >#66#return; 643229#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 643222#factFINAL assume true; 643210#factEXIT >#66#return; 643200#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 643196#factFINAL assume true; 643193#factEXIT >#66#return; 643106#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 643647#factFINAL assume true; 643103#factEXIT >#66#return; 643102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 643101#factFINAL assume true; 643096#factEXIT >#76#return; 642418#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 639961#factENTRY ~n := #in~n; 642514#L25 assume !(~n <= 0); 642482#L26 call #t~ret0 := fact(~n - 1);< 642497#factENTRY ~n := #in~n; 642512#L25 assume ~n <= 0;#res := 1; 642508#factFINAL assume true; 642495#factEXIT >#66#return; 642496#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 642597#factFINAL assume true; 642417#factEXIT >#78#return; 642422#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; 643130#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 643126#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 643124#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 643120#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 643119#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 643118#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 643117#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 639995#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 639902#factENTRY ~n := #in~n; 640011#L25 assume !(~n <= 0); 640009#L26 call #t~ret0 := fact(~n - 1);< 640010#factENTRY ~n := #in~n; 640033#L25 assume !(~n <= 0); 640013#L26 call #t~ret0 := fact(~n - 1);< 640030#factENTRY ~n := #in~n; 640029#L25 assume !(~n <= 0); 640003#L26 call #t~ret0 := fact(~n - 1);< 640028#factENTRY ~n := #in~n; 640025#L25 assume !(~n <= 0); 640006#L26 call #t~ret0 := fact(~n - 1);< 640016#factENTRY ~n := #in~n; 640026#L25 assume !(~n <= 0); 640004#L26 call #t~ret0 := fact(~n - 1);< 640023#factENTRY ~n := #in~n; 640027#L25 assume ~n <= 0;#res := 1; 640024#factFINAL assume true; 640022#factEXIT >#66#return; 640021#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640020#factFINAL assume true; 640018#factEXIT >#66#return; 640019#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640041#factFINAL assume true; 640001#factEXIT >#66#return; 640007#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640042#factFINAL assume true; 640039#factEXIT >#66#return; 640017#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 640012#factFINAL assume true; 640015#factEXIT >#66#return; 640000#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 639999#factFINAL assume true; 639988#factEXIT >#68#return; 639969#L30-1 [2022-11-25 17:06:51,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:51,873 INFO L85 PathProgramCache]: Analyzing trace with hash -251968843, now seen corresponding path program 39 times [2022-11-25 17:06:51,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:51,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013347844] [2022-11-25 17:06:51,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:51,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:51,887 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:06:51,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1571126753] [2022-11-25 17:06:51,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:06:51,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:06:51,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:51,892 INFO L229 MonitoredProcess]: Starting monitored process 325 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:06:51,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (325)] Waiting until timeout for monitored process [2022-11-25 17:06:52,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-11-25 17:06:52,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:06:52,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-25 17:06:52,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:52,423 INFO L134 CoverageAnalysis]: Checked inductivity of 17401 backedges. 2224 proven. 119 refuted. 0 times theorem prover too weak. 15058 trivial. 0 not checked. [2022-11-25 17:06:52,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:06:53,581 INFO L134 CoverageAnalysis]: Checked inductivity of 17401 backedges. 2224 proven. 132 refuted. 0 times theorem prover too weak. 15045 trivial. 0 not checked. [2022-11-25 17:06:53,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:53,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013347844] [2022-11-25 17:06:53,581 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:06:53,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571126753] [2022-11-25 17:06:53,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571126753] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:06:53,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:06:53,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 22 [2022-11-25 17:06:53,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793115862] [2022-11-25 17:06:53,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:06:53,583 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 17:06:53,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:53,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1658481890, now seen corresponding path program 35 times [2022-11-25 17:06:53,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:53,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76169298] [2022-11-25 17:06:53,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:53,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:53,598 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:06:53,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1378535807] [2022-11-25 17:06:53,598 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 17:06:53,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:06:53,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:53,600 INFO L229 MonitoredProcess]: Starting monitored process 326 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:06:53,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (326)] Waiting until timeout for monitored process [2022-11-25 17:06:53,964 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2022-11-25 17:06:53,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:06:53,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-25 17:06:53,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 15653 backedges. 6402 proven. 1063 refuted. 0 times theorem prover too weak. 8188 trivial. 0 not checked. [2022-11-25 17:06:54,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:06:56,734 INFO L134 CoverageAnalysis]: Checked inductivity of 15653 backedges. 1749 proven. 1773 refuted. 0 times theorem prover too weak. 12131 trivial. 0 not checked. [2022-11-25 17:06:56,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:56,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76169298] [2022-11-25 17:06:56,734 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:06:56,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378535807] [2022-11-25 17:06:56,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378535807] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:06:56,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:06:56,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 26] total 30 [2022-11-25 17:06:56,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662136317] [2022-11-25 17:06:56,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:06:56,736 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 17:06:56,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:56,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-25 17:06:56,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2022-11-25 17:06:56,737 INFO L87 Difference]: Start difference. First operand 5333 states and 7695 transitions. cyclomatic complexity: 2437 Second operand has 30 states, 25 states have (on average 3.0) internal successors, (75), 28 states have internal predecessors, (75), 19 states have call successors, (31), 2 states have call predecessors, (31), 12 states have return successors, (37), 16 states have call predecessors, (37), 19 states have call successors, (37) [2022-11-25 17:06:58,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:58,926 INFO L93 Difference]: Finished difference Result 8260 states and 13034 transitions. [2022-11-25 17:06:58,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8260 states and 13034 transitions. [2022-11-25 17:06:58,967 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 941 [2022-11-25 17:06:59,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8260 states to 7204 states and 10951 transitions. [2022-11-25 17:06:59,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 686 [2022-11-25 17:06:59,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 704 [2022-11-25 17:06:59,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7204 states and 10951 transitions. [2022-11-25 17:06:59,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 17:06:59,011 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7204 states and 10951 transitions. [2022-11-25 17:06:59,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7204 states and 10951 transitions. [2022-11-25 17:06:59,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7204 to 6001. [2022-11-25 17:06:59,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6001 states, 3786 states have (on average 1.066825145272055) internal successors, (4039), 3830 states have internal predecessors, (4039), 1440 states have call successors, (1570), 642 states have call predecessors, (1570), 775 states have return successors, (3279), 1528 states have call predecessors, (3279), 1440 states have call successors, (3279) [2022-11-25 17:06:59,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6001 states to 6001 states and 8888 transitions. [2022-11-25 17:06:59,127 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6001 states and 8888 transitions. [2022-11-25 17:06:59,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-25 17:06:59,127 INFO L428 stractBuchiCegarLoop]: Abstraction has 6001 states and 8888 transitions. [2022-11-25 17:06:59,127 INFO L335 stractBuchiCegarLoop]: ======== Iteration 56 ============ [2022-11-25 17:06:59,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6001 states and 8888 transitions. [2022-11-25 17:06:59,141 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 870 [2022-11-25 17:06:59,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:06:59,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:06:59,143 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [86, 86, 49, 49, 49, 49, 37, 13, 12, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 3, 3, 1, 1, 1, 1] [2022-11-25 17:06:59,143 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [78, 78, 60, 60, 60, 60, 18, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:59,144 INFO L748 eck$LassoCheckResult]: Stem: 659853#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 659831#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; 659832#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 659852#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; 659879#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 664485#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 664484#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 659824#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 659825#factENTRY ~n := #in~n; 664763#L25 assume ~n <= 0;#res := 1; 664759#factFINAL assume true; 664757#factEXIT >#68#return; 659871#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 659872#factENTRY ~n := #in~n; 664515#L25 assume ~n <= 0;#res := 1; 664514#factFINAL assume true; 664512#factEXIT >#70#return; 659796#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 659797#factENTRY ~n := #in~n; 664363#L25 assume ~n <= 0;#res := 1; 664362#factFINAL assume true; 664360#factEXIT >#72#return; 659847#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 659848#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 659849#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 665046#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 665047#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 665064#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 665065#factENTRY ~n := #in~n; 665091#L25 assume !(~n <= 0); 665081#L26 call #t~ret0 := fact(~n - 1);< 665082#factENTRY ~n := #in~n; 665084#L25 assume ~n <= 0;#res := 1; 665083#factFINAL assume true; 665080#factEXIT >#66#return; 665077#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 665075#factFINAL assume true; 665063#factEXIT >#74#return; 665059#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 665061#factENTRY ~n := #in~n; 665072#L25 assume ~n <= 0;#res := 1; 665071#factFINAL assume true; 665058#factEXIT >#76#return; 665053#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 665056#factENTRY ~n := #in~n; 665070#L25 assume !(~n <= 0); 665067#L26 call #t~ret0 := fact(~n - 1);< 665068#factENTRY ~n := #in~n; 665089#L25 assume ~n <= 0;#res := 1; 665088#factFINAL assume true; 665066#factEXIT >#66#return; 665062#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 665057#factFINAL assume true; 665052#factEXIT >#78#return; 665051#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; 665050#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 665048#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 665049#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 659856#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 659783#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 659784#factENTRY ~n := #in~n; 665622#L25 assume !(~n <= 0); 665617#L26 call #t~ret0 := fact(~n - 1);< 665619#factENTRY ~n := #in~n; 665627#L25 assume !(~n <= 0); 665618#L26 call #t~ret0 := fact(~n - 1);< 665625#factENTRY ~n := #in~n; 665628#L25 assume ~n <= 0;#res := 1; 665626#factFINAL assume true; 665624#factEXIT >#66#return; 665623#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 665621#factFINAL assume true; 665616#factEXIT >#66#return; 665607#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 665605#factFINAL assume true; 665583#factEXIT >#74#return; 665584#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 665603#factENTRY ~n := #in~n; 665690#L25 assume ~n <= 0;#res := 1; 665659#factFINAL assume true; 665660#factEXIT >#76#return; 665600#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 665601#factENTRY ~n := #in~n; 665707#L25 assume !(~n <= 0); 665498#L26 call #t~ret0 := fact(~n - 1);< 665520#factENTRY ~n := #in~n; 665533#L25 assume !(~n <= 0); 665500#L26 call #t~ret0 := fact(~n - 1);< 665530#factENTRY ~n := #in~n; 665536#L25 assume ~n <= 0;#res := 1; 665534#factFINAL assume true; 665529#factEXIT >#66#return; 665527#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 665523#factFINAL assume true; 665518#factEXIT >#66#return; 665504#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 665705#factFINAL assume true; 665704#factEXIT >#78#return; 665595#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; 665593#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 665592#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 665591#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 665590#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 665209#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 665211#factENTRY ~n := #in~n; 665210#L25 assume !(~n <= 0); 665207#L26 call #t~ret0 := fact(~n - 1);< 665208#factENTRY ~n := #in~n; 665206#L25 assume !(~n <= 0); 665201#L26 call #t~ret0 := fact(~n - 1);< 665205#factENTRY ~n := #in~n; 665206#L25 assume !(~n <= 0); 665201#L26 call #t~ret0 := fact(~n - 1);< 665205#factENTRY ~n := #in~n; 665200#L25 assume ~n <= 0;#res := 1; 665202#factFINAL assume true; 665222#factEXIT >#66#return; 665221#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 665220#factFINAL assume true; 665219#factEXIT >#66#return; 665218#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 665217#factFINAL assume true; 665216#factEXIT >#66#return; 665215#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 665214#factFINAL assume true; 665213#factEXIT >#74#return; 665032#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 665031#factENTRY ~n := #in~n; 665033#L25 assume ~n <= 0;#res := 1; 665163#factFINAL assume true; 665162#factEXIT >#76#return; 659858#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 665161#factENTRY ~n := #in~n; 665116#L25 assume !(~n <= 0); 665113#L26 call #t~ret0 := fact(~n - 1);< 665114#factENTRY ~n := #in~n; 665159#L25 assume !(~n <= 0); 665132#L26 call #t~ret0 := fact(~n - 1);< 665120#factENTRY ~n := #in~n; 665158#L25 assume !(~n <= 0); 665131#L26 call #t~ret0 := fact(~n - 1);< 665155#factENTRY ~n := #in~n; 665157#L25 assume ~n <= 0;#res := 1; 665156#factFINAL assume true; 665154#factEXIT >#66#return; 665153#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 665152#factFINAL assume true; 665151#factEXIT >#66#return; 665150#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 665149#factFINAL assume true; 665146#factEXIT >#66#return; 665147#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 665761#factFINAL assume true; 665757#factEXIT >#78#return; 665001#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; 665000#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 664999#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 664998#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 659851#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 659845#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 659846#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 664056#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 664029#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 664030#factENTRY ~n := #in~n; 664045#L25 assume !(~n <= 0); 664039#L26 call #t~ret0 := fact(~n - 1);< 664041#factENTRY ~n := #in~n; 664057#L25 assume ~n <= 0;#res := 1; 664133#factFINAL assume true; 664132#factEXIT >#66#return; 664131#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 664130#factFINAL assume true; 664129#factEXIT >#68#return; 664120#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 664122#factENTRY ~n := #in~n; 664124#L25 assume ~n <= 0;#res := 1; 664123#factFINAL assume true; 664118#factEXIT >#70#return; 664075#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 664088#factENTRY ~n := #in~n; 664087#L25 assume !(~n <= 0); 663989#L26 call #t~ret0 := fact(~n - 1);< 664016#factENTRY ~n := #in~n; 664077#L25 assume ~n <= 0;#res := 1; 664072#factFINAL assume true; 664061#factEXIT >#66#return; 664069#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 664146#factFINAL assume true; 664143#factEXIT >#72#return; 664145#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 664522#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 664521#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 664520#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 664518#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 664092#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 664098#factENTRY ~n := #in~n; 664091#L25 assume !(~n <= 0); 664063#L26 call #t~ret0 := fact(~n - 1);< 664070#factENTRY ~n := #in~n; 664077#L25 assume ~n <= 0;#res := 1; 664072#factFINAL assume true; 664061#factEXIT >#66#return; 664067#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 664128#factFINAL assume true; 664127#factEXIT >#68#return; 664084#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 664095#factENTRY ~n := #in~n; 664096#L25 assume !(~n <= 0); 664064#L26 call #t~ret0 := fact(~n - 1);< 664070#factENTRY ~n := #in~n; 664077#L25 assume ~n <= 0;#res := 1; 664072#factFINAL assume true; 664061#factEXIT >#66#return; 664068#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 664157#factFINAL assume true; 664156#factEXIT >#70#return; 664150#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 664153#factENTRY ~n := #in~n; 664155#L25 assume ~n <= 0;#res := 1; 664154#factFINAL assume true; 664147#factEXIT >#72#return; 664152#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 664513#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 664137#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 664135#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 664126#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 664013#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 664034#factENTRY ~n := #in~n; 664031#L25 assume !(~n <= 0); 663990#L26 call #t~ret0 := fact(~n - 1);< 664016#factENTRY ~n := #in~n; 664083#L25 assume !(~n <= 0); 663988#L26 call #t~ret0 := fact(~n - 1);< 664023#factENTRY ~n := #in~n; 664035#L25 assume ~n <= 0;#res := 1; 664032#factFINAL assume true; 664021#factEXIT >#66#return; 664018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 664012#factFINAL assume true; 663987#factEXIT >#66#return; 663993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 664447#factFINAL assume true; 664442#factEXIT >#74#return; 664440#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 664441#factENTRY ~n := #in~n; 664469#L25 assume !(~n <= 0); 664461#L26 call #t~ret0 := fact(~n - 1);< 664468#factENTRY ~n := #in~n; 664477#L25 assume ~n <= 0;#res := 1; 664476#factFINAL assume true; 664467#factEXIT >#66#return; 664458#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 664451#factFINAL assume true; 664438#factEXIT >#76#return; 664433#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 664437#factENTRY ~n := #in~n; 664497#L25 assume !(~n <= 0); 664379#L26 call #t~ret0 := fact(~n - 1);< 664393#factENTRY ~n := #in~n; 664508#L25 assume ~n <= 0;#res := 1; 664498#factFINAL assume true; 664491#factEXIT >#66#return; 664490#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 664483#factFINAL assume true; 664431#factEXIT >#78#return; 664429#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; 664428#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 664427#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 664426#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 664424#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 663617#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 663625#factENTRY ~n := #in~n; 663654#L25 assume !(~n <= 0); 663634#L26 call #t~ret0 := fact(~n - 1);< 663638#factENTRY ~n := #in~n; 663651#L25 assume !(~n <= 0); 663635#L26 call #t~ret0 := fact(~n - 1);< 663650#factENTRY ~n := #in~n; 663651#L25 assume !(~n <= 0); 663635#L26 call #t~ret0 := fact(~n - 1);< 663650#factENTRY ~n := #in~n; 663666#L25 assume ~n <= 0;#res := 1; 663665#factFINAL assume true; 663663#factEXIT >#66#return; 663661#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 663659#factFINAL assume true; 663657#factEXIT >#66#return; 663655#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 663653#factFINAL assume true; 663647#factEXIT >#66#return; 663648#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 663669#factFINAL assume true; 663670#factEXIT >#74#return; 663331#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 663340#factENTRY ~n := #in~n; 663339#L25 assume !(~n <= 0); 663261#L26 call #t~ret0 := fact(~n - 1);< 663336#factENTRY ~n := #in~n; 663313#L25 assume ~n <= 0;#res := 1; 663307#factFINAL assume true; 663257#factEXIT >#66#return; 663263#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 664984#factFINAL assume true; 664982#factEXIT >#76#return; 663266#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 663253#factENTRY ~n := #in~n; 663269#L25 assume !(~n <= 0); 663264#L26 call #t~ret0 := fact(~n - 1);< 663268#factENTRY ~n := #in~n; 663326#L25 assume !(~n <= 0); 663319#L26 call #t~ret0 := fact(~n - 1);< 663323#factENTRY ~n := #in~n; 663338#L25 assume ~n <= 0;#res := 1; 663438#factFINAL assume true; 663321#factEXIT >#66#return; 663314#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 663320#factFINAL assume true; 663343#factEXIT >#66#return; 663345#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 663352#factFINAL assume true; 663351#factEXIT >#78#return; 663246#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; 663244#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 663242#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 663241#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 663240#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 662864#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 662846#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 662691#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 662688#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 662690#factENTRY ~n := #in~n; 662700#L25 assume !(~n <= 0); 662697#L26 call #t~ret0 := fact(~n - 1);< 662699#factENTRY ~n := #in~n; 662709#L25 assume !(~n <= 0); 662698#L26 call #t~ret0 := fact(~n - 1);< 662707#factENTRY ~n := #in~n; 662718#L25 assume ~n <= 0;#res := 1; 662717#factFINAL assume true; 662706#factEXIT >#66#return; 662704#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 662702#factFINAL assume true; 662696#factEXIT >#66#return; 662694#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 662692#factFINAL assume true; 662687#factEXIT >#68#return; 662682#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 662683#factENTRY ~n := #in~n; 662741#L25 assume ~n <= 0;#res := 1; 662686#factFINAL assume true; 662680#factEXIT >#70#return; 662676#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 662679#factENTRY ~n := #in~n; 662730#L25 assume !(~n <= 0); 662724#L26 call #t~ret0 := fact(~n - 1);< 662729#factENTRY ~n := #in~n; 662842#L25 assume !(~n <= 0); 662722#L26 call #t~ret0 := fact(~n - 1);< 662844#factENTRY ~n := #in~n; 662736#L25 assume ~n <= 0;#res := 1; 662735#factFINAL assume true; 662732#factEXIT >#66#return; 662731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 662728#factFINAL assume true; 662721#factEXIT >#66#return; 662725#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 662738#factFINAL assume true; 662675#factEXIT >#72#return; 662673#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 662667#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 662665#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 662664#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 662663#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 662634#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 662637#factENTRY ~n := #in~n; 662727#L25 assume !(~n <= 0); 662723#L26 call #t~ret0 := fact(~n - 1);< 662726#factENTRY ~n := #in~n; 662845#L25 assume !(~n <= 0); 662733#L26 call #t~ret0 := fact(~n - 1);< 662734#factENTRY ~n := #in~n; 662736#L25 assume ~n <= 0;#res := 1; 662735#factFINAL assume true; 662732#factEXIT >#66#return; 662731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 662728#factFINAL assume true; 662721#factEXIT >#66#return; 662720#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 662685#factFINAL assume true; 662630#factEXIT >#68#return; 662636#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 662655#factENTRY ~n := #in~n; 662674#L25 assume !(~n <= 0); 662670#L26 call #t~ret0 := fact(~n - 1);< 662672#factENTRY ~n := #in~n; 662739#L25 assume ~n <= 0;#res := 1; 662737#factFINAL assume true; 662668#factEXIT >#66#return; 662666#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 662661#factFINAL assume true; 662654#factEXIT >#70#return; 662650#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 662652#factENTRY ~n := #in~n; 662719#L25 assume !(~n <= 0); 662669#L26 call #t~ret0 := fact(~n - 1);< 662672#factENTRY ~n := #in~n; 662739#L25 assume ~n <= 0;#res := 1; 662737#factFINAL assume true; 662668#factEXIT >#66#return; 662671#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 662716#factFINAL assume true; 662648#factEXIT >#72#return; 662651#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 662662#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 662660#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 662659#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 662658#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 662632#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 662637#factENTRY ~n := #in~n; 662727#L25 assume !(~n <= 0); 662723#L26 call #t~ret0 := fact(~n - 1);< 662726#factENTRY ~n := #in~n; 662845#L25 assume !(~n <= 0); 662733#L26 call #t~ret0 := fact(~n - 1);< 662734#factENTRY ~n := #in~n; 662736#L25 assume ~n <= 0;#res := 1; 662735#factFINAL assume true; 662732#factEXIT >#66#return; 662731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 662728#factFINAL assume true; 662721#factEXIT >#66#return; 662720#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 662685#factFINAL assume true; 662630#factEXIT >#68#return; 662622#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 662628#factENTRY ~n := #in~n; 662656#L25 assume !(~n <= 0); 662613#L26 call #t~ret0 := fact(~n - 1);< 662624#factENTRY ~n := #in~n; 662642#L25 assume !(~n <= 0); 662639#L26 call #t~ret0 := fact(~n - 1);< 662640#factENTRY ~n := #in~n; 662653#L25 assume ~n <= 0;#res := 1; 662647#factFINAL assume true; 662638#factEXIT >#66#return; 662629#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 662621#factFINAL assume true; 662612#factEXIT >#66#return; 662614#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 662684#factFINAL assume true; 662627#factEXIT >#70#return; 662617#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 662620#factENTRY ~n := #in~n; 662657#L25 assume ~n <= 0;#res := 1; 662626#factFINAL assume true; 662616#factEXIT >#72#return; 662619#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 662814#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 662803#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 662798#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 662783#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 662599#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 662777#factENTRY ~n := #in~n; 662797#L25 assume !(~n <= 0); 662794#L26 call #t~ret0 := fact(~n - 1);< 662795#factENTRY ~n := #in~n; 662820#L25 assume !(~n <= 0); 662793#L26 call #t~ret0 := fact(~n - 1);< 662816#factENTRY ~n := #in~n; 662820#L25 assume !(~n <= 0); 662793#L26 call #t~ret0 := fact(~n - 1);< 662816#factENTRY ~n := #in~n; 662831#L25 assume ~n <= 0;#res := 1; 662830#factFINAL assume true; 662827#factEXIT >#66#return; 662823#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 662819#factFINAL assume true; 662815#factEXIT >#66#return; 662804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 662801#factFINAL assume true; 662792#factEXIT >#66#return; 662785#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 662782#factFINAL assume true; 662776#factEXIT >#74#return; 662756#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 662757#factENTRY ~n := #in~n; 662904#L25 assume !(~n <= 0); 662901#L26 call #t~ret0 := fact(~n - 1);< 662902#factENTRY ~n := #in~n; 662911#L25 assume !(~n <= 0); 662907#L26 call #t~ret0 := fact(~n - 1);< 662909#factENTRY ~n := #in~n; 662919#L25 assume ~n <= 0;#res := 1; 662923#factFINAL assume true; 662920#factEXIT >#66#return; 662918#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 662916#factFINAL assume true; 662913#factEXIT >#66#return; 662908#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 663158#factFINAL assume true; 662755#factEXIT >#76#return; 662317#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 662328#factENTRY ~n := #in~n; 662323#L25 assume !(~n <= 0); 662291#L26 call #t~ret0 := fact(~n - 1);< 662311#factENTRY ~n := #in~n; 662308#L25 assume ~n <= 0;#res := 1; 662303#factFINAL assume true; 662304#factEXIT >#66#return; 662333#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 663193#factFINAL assume true; 662896#factEXIT >#78#return; 662239#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; 662894#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 662893#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 662892#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 662890#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 662888#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 662885#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 660797#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 660592#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 660632#factENTRY ~n := #in~n; 660630#L25 assume !(~n <= 0); 660610#L26 call #t~ret0 := fact(~n - 1);< 660627#factENTRY ~n := #in~n; 660661#L25 assume !(~n <= 0); 660612#L26 call #t~ret0 := fact(~n - 1);< 660659#factENTRY ~n := #in~n; 660661#L25 assume !(~n <= 0); 660612#L26 call #t~ret0 := fact(~n - 1);< 660659#factENTRY ~n := #in~n; 660661#L25 assume !(~n <= 0); 660612#L26 call #t~ret0 := fact(~n - 1);< 660659#factENTRY ~n := #in~n; 660661#L25 assume !(~n <= 0); 660612#L26 call #t~ret0 := fact(~n - 1);< 660659#factENTRY ~n := #in~n; 660662#L25 assume ~n <= 0;#res := 1; 660660#factFINAL assume true; 660658#factEXIT >#66#return; 660656#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660651#factFINAL assume true; 660645#factEXIT >#66#return; 660641#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660626#factFINAL assume true; 660623#factEXIT >#66#return; 660622#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660619#factFINAL assume true; 660608#factEXIT >#66#return; 660616#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 663825#factFINAL assume true; 660806#factEXIT >#66#return; 660803#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660800#factFINAL assume true; 660761#factEXIT >#68#return; 660575#L30-1 [2022-11-25 17:06:59,144 INFO L750 eck$LassoCheckResult]: Loop: 660575#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 659870#factENTRY ~n := #in~n; 660618#L25 assume ~n <= 0;#res := 1; 660607#factFINAL assume true; 660571#factEXIT >#70#return; 660589#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 660696#factENTRY ~n := #in~n; 660687#L25 assume !(~n <= 0); 660419#L26 call #t~ret0 := fact(~n - 1);< 660424#factENTRY ~n := #in~n; 660683#L25 assume !(~n <= 0); 660075#L26 call #t~ret0 := fact(~n - 1);< 660395#factENTRY ~n := #in~n; 660360#L25 assume !(~n <= 0); 660070#L26 call #t~ret0 := fact(~n - 1);< 660283#factENTRY ~n := #in~n; 660333#L25 assume !(~n <= 0); 660068#L26 call #t~ret0 := fact(~n - 1);< 660261#factENTRY ~n := #in~n; 660338#L25 assume !(~n <= 0); 660074#L26 call #t~ret0 := fact(~n - 1);< 660326#factENTRY ~n := #in~n; 660329#L25 assume ~n <= 0;#res := 1; 660328#factFINAL assume true; 660322#factEXIT >#66#return; 660321#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660297#factFINAL assume true; 660288#factEXIT >#66#return; 660284#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660278#factFINAL assume true; 660270#factEXIT >#66#return; 660265#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660259#factFINAL assume true; 660057#factEXIT >#66#return; 660082#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660679#factFINAL assume true; 660418#factEXIT >#66#return; 660421#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660795#factFINAL assume true; 660757#factEXIT >#72#return; 660758#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 660778#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 660777#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 660775#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 660774#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 660375#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 660390#factENTRY ~n := #in~n; 660426#L25 assume !(~n <= 0); 660420#L26 call #t~ret0 := fact(~n - 1);< 660424#factENTRY ~n := #in~n; 660683#L25 assume !(~n <= 0); 660075#L26 call #t~ret0 := fact(~n - 1);< 660395#factENTRY ~n := #in~n; 660360#L25 assume !(~n <= 0); 660070#L26 call #t~ret0 := fact(~n - 1);< 660283#factENTRY ~n := #in~n; 660333#L25 assume !(~n <= 0); 660068#L26 call #t~ret0 := fact(~n - 1);< 660261#factENTRY ~n := #in~n; 660338#L25 assume !(~n <= 0); 660074#L26 call #t~ret0 := fact(~n - 1);< 660326#factENTRY ~n := #in~n; 660329#L25 assume ~n <= 0;#res := 1; 660328#factFINAL assume true; 660322#factEXIT >#66#return; 660321#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660297#factFINAL assume true; 660288#factEXIT >#66#return; 660284#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660278#factFINAL assume true; 660270#factEXIT >#66#return; 660265#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660259#factFINAL assume true; 660057#factEXIT >#66#return; 660082#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660679#factFINAL assume true; 660418#factEXIT >#66#return; 660414#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660410#factFINAL assume true; 660367#factEXIT >#68#return; 660388#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 660485#factENTRY ~n := #in~n; 660483#L25 assume !(~n <= 0); 660477#L26 call #t~ret0 := fact(~n - 1);< 660482#factENTRY ~n := #in~n; 660484#L25 assume ~n <= 0;#res := 1; 660481#factFINAL assume true; 660476#factEXIT >#66#return; 660478#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660528#factFINAL assume true; 660518#factEXIT >#70#return; 660394#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 660733#factENTRY ~n := #in~n; 661092#L25 assume !(~n <= 0); 660058#L26 call #t~ret0 := fact(~n - 1);< 660395#factENTRY ~n := #in~n; 660360#L25 assume !(~n <= 0); 660070#L26 call #t~ret0 := fact(~n - 1);< 660283#factENTRY ~n := #in~n; 660333#L25 assume !(~n <= 0); 660068#L26 call #t~ret0 := fact(~n - 1);< 660261#factENTRY ~n := #in~n; 660338#L25 assume !(~n <= 0); 660074#L26 call #t~ret0 := fact(~n - 1);< 660326#factENTRY ~n := #in~n; 660329#L25 assume ~n <= 0;#res := 1; 660328#factFINAL assume true; 660322#factEXIT >#66#return; 660321#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660297#factFINAL assume true; 660288#factEXIT >#66#return; 660284#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660278#factFINAL assume true; 660270#factEXIT >#66#return; 660265#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660259#factFINAL assume true; 660057#factEXIT >#66#return; 660079#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 663849#factFINAL assume true; 660704#factEXIT >#72#return; 660707#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 660747#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 660745#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 660743#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 660741#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 660370#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 660390#factENTRY ~n := #in~n; 660426#L25 assume !(~n <= 0); 660420#L26 call #t~ret0 := fact(~n - 1);< 660424#factENTRY ~n := #in~n; 660683#L25 assume !(~n <= 0); 660075#L26 call #t~ret0 := fact(~n - 1);< 660395#factENTRY ~n := #in~n; 660360#L25 assume !(~n <= 0); 660070#L26 call #t~ret0 := fact(~n - 1);< 660283#factENTRY ~n := #in~n; 660333#L25 assume !(~n <= 0); 660068#L26 call #t~ret0 := fact(~n - 1);< 660261#factENTRY ~n := #in~n; 660338#L25 assume !(~n <= 0); 660074#L26 call #t~ret0 := fact(~n - 1);< 660326#factENTRY ~n := #in~n; 660329#L25 assume ~n <= 0;#res := 1; 660328#factFINAL assume true; 660322#factEXIT >#66#return; 660321#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660297#factFINAL assume true; 660288#factEXIT >#66#return; 660284#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660278#factFINAL assume true; 660270#factEXIT >#66#return; 660265#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660259#factFINAL assume true; 660057#factEXIT >#66#return; 660082#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660679#factFINAL assume true; 660418#factEXIT >#66#return; 660414#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660410#factFINAL assume true; 660367#factEXIT >#68#return; 660224#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 660269#factENTRY ~n := #in~n; 660427#L25 assume !(~n <= 0); 660076#L26 call #t~ret0 := fact(~n - 1);< 660425#factENTRY ~n := #in~n; 660338#L25 assume !(~n <= 0); 660074#L26 call #t~ret0 := fact(~n - 1);< 660326#factENTRY ~n := #in~n; 660329#L25 assume ~n <= 0;#res := 1; 660328#factFINAL assume true; 660322#factEXIT >#66#return; 660321#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660297#factFINAL assume true; 660288#factEXIT >#66#return; 660293#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660475#factFINAL assume true; 660473#factEXIT >#70#return; 660315#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 660527#factENTRY ~n := #in~n; 660529#L25 assume !(~n <= 0); 660073#L26 call #t~ret0 := fact(~n - 1);< 660261#factENTRY ~n := #in~n; 660338#L25 assume !(~n <= 0); 660074#L26 call #t~ret0 := fact(~n - 1);< 660326#factENTRY ~n := #in~n; 660338#L25 assume !(~n <= 0); 660074#L26 call #t~ret0 := fact(~n - 1);< 660326#factENTRY ~n := #in~n; 660329#L25 assume ~n <= 0;#res := 1; 660328#factFINAL assume true; 660322#factEXIT >#66#return; 660321#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660297#factFINAL assume true; 660288#factEXIT >#66#return; 660284#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660278#factFINAL assume true; 660270#factEXIT >#66#return; 660276#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660544#factFINAL assume true; 660539#factEXIT >#72#return; 660499#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 661069#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 661067#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 661065#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 661063#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 660373#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 660390#factENTRY ~n := #in~n; 660426#L25 assume !(~n <= 0); 660420#L26 call #t~ret0 := fact(~n - 1);< 660424#factENTRY ~n := #in~n; 660683#L25 assume !(~n <= 0); 660075#L26 call #t~ret0 := fact(~n - 1);< 660395#factENTRY ~n := #in~n; 660360#L25 assume !(~n <= 0); 660070#L26 call #t~ret0 := fact(~n - 1);< 660283#factENTRY ~n := #in~n; 660333#L25 assume !(~n <= 0); 660068#L26 call #t~ret0 := fact(~n - 1);< 660261#factENTRY ~n := #in~n; 660338#L25 assume !(~n <= 0); 660074#L26 call #t~ret0 := fact(~n - 1);< 660326#factENTRY ~n := #in~n; 660329#L25 assume ~n <= 0;#res := 1; 660328#factFINAL assume true; 660322#factEXIT >#66#return; 660321#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660297#factFINAL assume true; 660288#factEXIT >#66#return; 660284#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660278#factFINAL assume true; 660270#factEXIT >#66#return; 660265#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660259#factFINAL assume true; 660057#factEXIT >#66#return; 660082#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660679#factFINAL assume true; 660418#factEXIT >#66#return; 660414#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660410#factFINAL assume true; 660367#factEXIT >#68#return; 660225#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 660269#factENTRY ~n := #in~n; 660427#L25 assume !(~n <= 0); 660076#L26 call #t~ret0 := fact(~n - 1);< 660425#factENTRY ~n := #in~n; 660338#L25 assume !(~n <= 0); 660074#L26 call #t~ret0 := fact(~n - 1);< 660326#factENTRY ~n := #in~n; 660338#L25 assume !(~n <= 0); 660074#L26 call #t~ret0 := fact(~n - 1);< 660326#factENTRY ~n := #in~n; 660329#L25 assume ~n <= 0;#res := 1; 660328#factFINAL assume true; 660322#factEXIT >#66#return; 660321#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660297#factFINAL assume true; 660288#factEXIT >#66#return; 660284#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660278#factFINAL assume true; 660270#factEXIT >#66#return; 660274#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660266#factFINAL assume true; 660267#factEXIT >#70#return; 660443#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 660472#factENTRY ~n := #in~n; 660523#L25 assume !(~n <= 0); 660072#L26 call #t~ret0 := fact(~n - 1);< 660425#factENTRY ~n := #in~n; 660484#L25 assume ~n <= 0;#res := 1; 660481#factFINAL assume true; 660476#factEXIT >#66#return; 660474#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660471#factFINAL assume true; 660463#factEXIT >#72#return; 660468#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 660724#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 660719#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 660715#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 660636#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 660384#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 660390#factENTRY ~n := #in~n; 660426#L25 assume !(~n <= 0); 660420#L26 call #t~ret0 := fact(~n - 1);< 660424#factENTRY ~n := #in~n; 660683#L25 assume !(~n <= 0); 660075#L26 call #t~ret0 := fact(~n - 1);< 660395#factENTRY ~n := #in~n; 660360#L25 assume !(~n <= 0); 660070#L26 call #t~ret0 := fact(~n - 1);< 660283#factENTRY ~n := #in~n; 660333#L25 assume !(~n <= 0); 660068#L26 call #t~ret0 := fact(~n - 1);< 660261#factENTRY ~n := #in~n; 660338#L25 assume !(~n <= 0); 660074#L26 call #t~ret0 := fact(~n - 1);< 660326#factENTRY ~n := #in~n; 660329#L25 assume ~n <= 0;#res := 1; 660328#factFINAL assume true; 660322#factEXIT >#66#return; 660321#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660297#factFINAL assume true; 660288#factEXIT >#66#return; 660284#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660278#factFINAL assume true; 660270#factEXIT >#66#return; 660265#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660259#factFINAL assume true; 660057#factEXIT >#66#return; 660082#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660679#factFINAL assume true; 660418#factEXIT >#66#return; 660414#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660410#factFINAL assume true; 660367#factEXIT >#68#return; 660168#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 660269#factENTRY ~n := #in~n; 660427#L25 assume !(~n <= 0); 660076#L26 call #t~ret0 := fact(~n - 1);< 660425#factENTRY ~n := #in~n; 660338#L25 assume !(~n <= 0); 660074#L26 call #t~ret0 := fact(~n - 1);< 660326#factENTRY ~n := #in~n; 660338#L25 assume !(~n <= 0); 660074#L26 call #t~ret0 := fact(~n - 1);< 660326#factENTRY ~n := #in~n; 660338#L25 assume !(~n <= 0); 660074#L26 call #t~ret0 := fact(~n - 1);< 660326#factENTRY ~n := #in~n; 660338#L25 assume !(~n <= 0); 660074#L26 call #t~ret0 := fact(~n - 1);< 660326#factENTRY ~n := #in~n; 660329#L25 assume ~n <= 0;#res := 1; 660328#factFINAL assume true; 660322#factEXIT >#66#return; 660321#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660297#factFINAL assume true; 660288#factEXIT >#66#return; 660284#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660278#factFINAL assume true; 660270#factEXIT >#66#return; 660265#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660259#factFINAL assume true; 660057#factEXIT >#66#return; 660082#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660679#factFINAL assume true; 660418#factEXIT >#66#return; 660414#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660410#factFINAL assume true; 660367#factEXIT >#70#return; 660088#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 660135#factENTRY ~n := #in~n; 660257#L25 assume ~n <= 0;#res := 1; 660256#factFINAL assume true; 660087#factEXIT >#72#return; 660112#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 660722#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 660718#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 660714#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 660637#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 660638#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 662011#factENTRY ~n := #in~n; 662175#L25 assume !(~n <= 0); 662018#L26 call #t~ret0 := fact(~n - 1);< 662174#factENTRY ~n := #in~n; 662173#L25 assume !(~n <= 0); 662017#L26 call #t~ret0 := fact(~n - 1);< 662172#factENTRY ~n := #in~n; 662171#L25 assume !(~n <= 0); 662019#L26 call #t~ret0 := fact(~n - 1);< 662170#factENTRY ~n := #in~n; 662163#L25 assume !(~n <= 0); 662020#L26 call #t~ret0 := fact(~n - 1);< 662140#factENTRY ~n := #in~n; 662165#L25 assume !(~n <= 0); 662022#L26 call #t~ret0 := fact(~n - 1);< 662158#factENTRY ~n := #in~n; 662165#L25 assume !(~n <= 0); 662022#L26 call #t~ret0 := fact(~n - 1);< 662158#factENTRY ~n := #in~n; 662168#L25 assume ~n <= 0;#res := 1; 662167#factFINAL assume true; 662166#factEXIT >#66#return; 662160#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 662159#factFINAL assume true; 662157#factEXIT >#66#return; 662155#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 662152#factFINAL assume true; 662148#factEXIT >#66#return; 662145#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 662143#factFINAL assume true; 662138#factEXIT >#66#return; 662136#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 662133#factFINAL assume true; 662104#factEXIT >#66#return; 662024#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 662071#factFINAL assume true; 662014#factEXIT >#66#return; 662013#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 662012#factFINAL assume true; 662009#factEXIT >#74#return; 660837#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 662008#factENTRY ~n := #in~n; 662833#L25 assume !(~n <= 0); 662751#L26 call #t~ret0 := fact(~n - 1);< 662854#factENTRY ~n := #in~n; 662852#L25 assume !(~n <= 0); 659786#L26 call #t~ret0 := fact(~n - 1);< 662850#factENTRY ~n := #in~n; 662852#L25 assume !(~n <= 0); 659786#L26 call #t~ret0 := fact(~n - 1);< 662850#factENTRY ~n := #in~n; 662852#L25 assume !(~n <= 0); 659786#L26 call #t~ret0 := fact(~n - 1);< 662850#factENTRY ~n := #in~n; 659863#L25 assume ~n <= 0;#res := 1; 659864#factFINAL assume true; 659785#factEXIT >#66#return; 659789#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 662873#factFINAL assume true; 662868#factEXIT >#66#return; 662869#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 662847#factFINAL assume true; 662849#factEXIT >#66#return; 662865#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 662866#factFINAL assume true; 662749#factEXIT >#66#return; 662752#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 662582#factFINAL assume true; 662583#factEXIT >#76#return; 660832#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 660834#factENTRY ~n := #in~n; 661128#L25 assume !(~n <= 0); 660892#L26 call #t~ret0 := fact(~n - 1);< 661122#factENTRY ~n := #in~n; 661127#L25 assume ~n <= 0;#res := 1; 661126#factFINAL assume true; 661121#factEXIT >#66#return; 661097#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 661041#factFINAL assume true; 660827#factEXIT >#78#return; 660818#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; 660819#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 660812#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 660813#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 660807#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 660808#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 660801#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 660802#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 660648#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 659823#factENTRY ~n := #in~n; 660655#L25 assume !(~n <= 0); 660620#L26 call #t~ret0 := fact(~n - 1);< 660644#factENTRY ~n := #in~n; 660640#L25 assume !(~n <= 0); 660609#L26 call #t~ret0 := fact(~n - 1);< 660621#factENTRY ~n := #in~n; 660668#L25 assume !(~n <= 0); 660613#L26 call #t~ret0 := fact(~n - 1);< 660625#factENTRY ~n := #in~n; 660716#L25 assume !(~n <= 0); 660611#L26 call #t~ret0 := fact(~n - 1);< 660646#factENTRY ~n := #in~n; 660661#L25 assume !(~n <= 0); 660612#L26 call #t~ret0 := fact(~n - 1);< 660659#factENTRY ~n := #in~n; 660662#L25 assume ~n <= 0;#res := 1; 660660#factFINAL assume true; 660658#factEXIT >#66#return; 660656#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660651#factFINAL assume true; 660645#factEXIT >#66#return; 660641#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660626#factFINAL assume true; 660623#factEXIT >#66#return; 660622#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660619#factFINAL assume true; 660608#factEXIT >#66#return; 660616#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 663825#factFINAL assume true; 660806#factEXIT >#66#return; 660803#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 660800#factFINAL assume true; 660761#factEXIT >#68#return; 660575#L30-1 [2022-11-25 17:06:59,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:59,144 INFO L85 PathProgramCache]: Analyzing trace with hash -251968843, now seen corresponding path program 40 times [2022-11-25 17:06:59,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:59,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462092292] [2022-11-25 17:06:59,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:59,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:59,164 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:06:59,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1417135812] [2022-11-25 17:06:59,165 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:06:59,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:06:59,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:59,168 INFO L229 MonitoredProcess]: Starting monitored process 327 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:06:59,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (327)] Waiting until timeout for monitored process [2022-11-25 17:06:59,614 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:06:59,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:06:59,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 1255 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 17:06:59,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 17401 backedges. 1350 proven. 338 refuted. 0 times theorem prover too weak. 15713 trivial. 0 not checked. [2022-11-25 17:06:59,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:07:00,909 INFO L134 CoverageAnalysis]: Checked inductivity of 17401 backedges. 1350 proven. 347 refuted. 0 times theorem prover too weak. 15704 trivial. 0 not checked. [2022-11-25 17:07:00,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:00,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462092292] [2022-11-25 17:07:00,909 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:07:00,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417135812] [2022-11-25 17:07:00,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417135812] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:07:00,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:07:00,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 15 [2022-11-25 17:07:00,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159254867] [2022-11-25 17:07:00,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:07:00,911 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 17:07:00,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:00,911 INFO L85 PathProgramCache]: Analyzing trace with hash -608933090, now seen corresponding path program 36 times [2022-11-25 17:07:00,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:00,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073706922] [2022-11-25 17:07:00,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:00,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:00,924 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:07:00,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1746053220] [2022-11-25 17:07:00,925 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-25 17:07:00,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:07:00,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:07:00,929 INFO L229 MonitoredProcess]: Starting monitored process 328 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:07:00,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (328)] Waiting until timeout for monitored process [2022-11-25 17:07:01,308 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2022-11-25 17:07:01,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:07:01,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-25 17:07:01,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:01,587 INFO L134 CoverageAnalysis]: Checked inductivity of 15653 backedges. 2814 proven. 665 refuted. 0 times theorem prover too weak. 12174 trivial. 0 not checked. [2022-11-25 17:07:01,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:07:04,197 INFO L134 CoverageAnalysis]: Checked inductivity of 15653 backedges. 2814 proven. 706 refuted. 0 times theorem prover too weak. 12133 trivial. 0 not checked. [2022-11-25 17:07:04,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:04,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073706922] [2022-11-25 17:07:04,198 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:07:04,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746053220] [2022-11-25 17:07:04,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746053220] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:07:04,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:07:04,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 27] total 30 [2022-11-25 17:07:04,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237607350] [2022-11-25 17:07:04,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:07:04,199 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 17:07:04,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:04,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-25 17:07:04,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2022-11-25 17:07:04,201 INFO L87 Difference]: Start difference. First operand 6001 states and 8888 transitions. cyclomatic complexity: 2973 Second operand has 31 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 30 states have internal predecessors, (73), 17 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (31), 13 states have call predecessors, (31), 17 states have call successors, (31) [2022-11-25 17:07:06,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:06,782 INFO L93 Difference]: Finished difference Result 7343 states and 11659 transitions. [2022-11-25 17:07:06,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7343 states and 11659 transitions. [2022-11-25 17:07:06,818 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 834 [2022-11-25 17:07:06,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7343 states to 7258 states and 11439 transitions. [2022-11-25 17:07:06,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 669 [2022-11-25 17:07:06,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 669 [2022-11-25 17:07:06,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7258 states and 11439 transitions. [2022-11-25 17:07:06,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 17:07:06,871 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7258 states and 11439 transitions. [2022-11-25 17:07:06,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7258 states and 11439 transitions. [2022-11-25 17:07:06,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7258 to 6208. [2022-11-25 17:07:06,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6208 states, 3915 states have (on average 1.0669220945083013) internal successors, (4177), 3955 states have internal predecessors, (4177), 1515 states have call successors, (1649), 644 states have call predecessors, (1649), 778 states have return successors, (3448), 1608 states have call predecessors, (3448), 1515 states have call successors, (3448) [2022-11-25 17:07:07,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6208 states to 6208 states and 9274 transitions. [2022-11-25 17:07:07,003 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6208 states and 9274 transitions. [2022-11-25 17:07:07,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-25 17:07:07,004 INFO L428 stractBuchiCegarLoop]: Abstraction has 6208 states and 9274 transitions. [2022-11-25 17:07:07,004 INFO L335 stractBuchiCegarLoop]: ======== Iteration 57 ============ [2022-11-25 17:07:07,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6208 states and 9274 transitions. [2022-11-25 17:07:07,019 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 791 [2022-11-25 17:07:07,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:07:07,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:07:07,022 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [118, 118, 70, 70, 70, 70, 48, 17, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 3, 3, 1, 1, 1, 1] [2022-11-25 17:07:07,023 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [67, 67, 49, 49, 49, 49, 18, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:07,023 INFO L748 eck$LassoCheckResult]: Stem: 679491#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 679467#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; 679468#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 679490#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; 679479#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 679480#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 683992#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 679450#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 679451#factENTRY ~n := #in~n; 684063#L25 assume ~n <= 0;#res := 1; 684062#factFINAL assume true; 684057#factEXIT >#68#return; 679510#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 679511#factENTRY ~n := #in~n; 684103#L25 assume ~n <= 0;#res := 1; 684102#factFINAL assume true; 684101#factEXIT >#70#return; 679446#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 679447#factENTRY ~n := #in~n; 684049#L25 assume ~n <= 0;#res := 1; 684048#factFINAL assume true; 684046#factEXIT >#72#return; 679483#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 679484#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 679485#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 684916#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 684941#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 684936#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 684937#factENTRY ~n := #in~n; 684953#L25 assume !(~n <= 0); 684951#L26 call #t~ret0 := fact(~n - 1);< 684952#factENTRY ~n := #in~n; 684955#L25 assume ~n <= 0;#res := 1; 684954#factFINAL assume true; 684950#factEXIT >#66#return; 684949#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 684947#factFINAL assume true; 684935#factEXIT >#74#return; 684927#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 684929#factENTRY ~n := #in~n; 684933#L25 assume ~n <= 0;#res := 1; 684932#factFINAL assume true; 684926#factEXIT >#76#return; 684922#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 684924#factENTRY ~n := #in~n; 684962#L25 assume !(~n <= 0); 684939#L26 call #t~ret0 := fact(~n - 1);< 684940#factENTRY ~n := #in~n; 684960#L25 assume ~n <= 0;#res := 1; 684958#factFINAL assume true; 684938#factEXIT >#66#return; 684930#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 684925#factFINAL assume true; 684920#factEXIT >#78#return; 684919#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; 684917#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 684918#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 684915#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 679494#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 679495#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 685290#factENTRY ~n := #in~n; 685300#L25 assume !(~n <= 0); 685297#L26 call #t~ret0 := fact(~n - 1);< 685299#factENTRY ~n := #in~n; 685306#L25 assume !(~n <= 0); 685298#L26 call #t~ret0 := fact(~n - 1);< 685304#factENTRY ~n := #in~n; 685307#L25 assume ~n <= 0;#res := 1; 685305#factFINAL assume true; 685303#factEXIT >#66#return; 685302#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 685301#factFINAL assume true; 685296#factEXIT >#66#return; 685295#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 685293#factFINAL assume true; 685289#factEXIT >#74#return; 685287#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 685288#factENTRY ~n := #in~n; 685317#L25 assume ~n <= 0;#res := 1; 685318#factFINAL assume true; 685286#factEXIT >#76#return; 685231#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 685285#factENTRY ~n := #in~n; 685334#L25 assume !(~n <= 0); 679455#L26 call #t~ret0 := fact(~n - 1);< 685226#factENTRY ~n := #in~n; 685245#L25 assume !(~n <= 0); 679456#L26 call #t~ret0 := fact(~n - 1);< 685237#factENTRY ~n := #in~n; 685244#L25 assume ~n <= 0;#res := 1; 685243#factFINAL assume true; 685236#factEXIT >#66#return; 685235#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 685230#factFINAL assume true; 685224#factEXIT >#66#return; 685195#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 685335#factFINAL assume true; 685331#factEXIT >#78#return; 685282#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; 685281#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 685280#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 685279#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 685076#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 684882#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 685075#factENTRY ~n := #in~n; 685074#L25 assume !(~n <= 0); 685072#L26 call #t~ret0 := fact(~n - 1);< 685073#factENTRY ~n := #in~n; 685071#L25 assume !(~n <= 0); 685067#L26 call #t~ret0 := fact(~n - 1);< 685070#factENTRY ~n := #in~n; 685071#L25 assume !(~n <= 0); 685067#L26 call #t~ret0 := fact(~n - 1);< 685070#factENTRY ~n := #in~n; 685066#L25 assume ~n <= 0;#res := 1; 685068#factFINAL assume true; 685088#factEXIT >#66#return; 685087#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 685086#factFINAL assume true; 685085#factEXIT >#66#return; 685084#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 685083#factFINAL assume true; 685082#factEXIT >#66#return; 685081#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 685080#factFINAL assume true; 684881#factEXIT >#74#return; 684878#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 684880#factENTRY ~n := #in~n; 684892#L25 assume ~n <= 0;#res := 1; 684885#factFINAL assume true; 684877#factEXIT >#76#return; 679497#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 685013#factENTRY ~n := #in~n; 685012#L25 assume !(~n <= 0); 684906#L26 call #t~ret0 := fact(~n - 1);< 685011#factENTRY ~n := #in~n; 685010#L25 assume !(~n <= 0); 684908#L26 call #t~ret0 := fact(~n - 1);< 684913#factENTRY ~n := #in~n; 684974#L25 assume !(~n <= 0); 684907#L26 call #t~ret0 := fact(~n - 1);< 685007#factENTRY ~n := #in~n; 685009#L25 assume ~n <= 0;#res := 1; 685008#factFINAL assume true; 685006#factEXIT >#66#return; 685005#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 685004#factFINAL assume true; 685003#factEXIT >#66#return; 685002#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 684973#factFINAL assume true; 684903#factEXIT >#66#return; 684910#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 685614#factFINAL assume true; 685595#factEXIT >#78#return; 683775#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; 683773#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 683772#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 683771#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 683770#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 683768#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 683750#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 683748#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 683728#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 683729#factENTRY ~n := #in~n; 683741#L25 assume !(~n <= 0); 683738#L26 call #t~ret0 := fact(~n - 1);< 683739#factENTRY ~n := #in~n; 683815#L25 assume ~n <= 0;#res := 1; 684021#factFINAL assume true; 684020#factEXIT >#66#return; 684019#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 684018#factFINAL assume true; 684017#factEXIT >#68#return; 684010#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 684011#factENTRY ~n := #in~n; 684013#L25 assume ~n <= 0;#res := 1; 684012#factFINAL assume true; 684007#factEXIT >#70#return; 683849#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 683854#factENTRY ~n := #in~n; 683852#L25 assume !(~n <= 0); 683824#L26 call #t~ret0 := fact(~n - 1);< 683848#factENTRY ~n := #in~n; 683878#L25 assume ~n <= 0;#res := 1; 683870#factFINAL assume true; 683858#factEXIT >#66#return; 683863#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 684026#factFINAL assume true; 684023#factEXIT >#72#return; 684016#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 684006#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 684004#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 684002#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 683998#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 683875#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 683881#factENTRY ~n := #in~n; 683874#L25 assume !(~n <= 0); 683861#L26 call #t~ret0 := fact(~n - 1);< 683867#factENTRY ~n := #in~n; 683878#L25 assume ~n <= 0;#res := 1; 683870#factFINAL assume true; 683858#factEXIT >#66#return; 683865#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 684000#factFINAL assume true; 683999#factEXIT >#68#return; 683871#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 683879#factENTRY ~n := #in~n; 683880#L25 assume !(~n <= 0); 683859#L26 call #t~ret0 := fact(~n - 1);< 683867#factENTRY ~n := #in~n; 683878#L25 assume ~n <= 0;#res := 1; 683870#factFINAL assume true; 683858#factEXIT >#66#return; 683864#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 684061#factFINAL assume true; 684056#factEXIT >#70#return; 684030#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 684034#factENTRY ~n := #in~n; 684036#L25 assume ~n <= 0;#res := 1; 684035#factFINAL assume true; 684028#factEXIT >#72#return; 684033#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 684241#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 684239#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 684005#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 684003#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 683846#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 683838#factENTRY ~n := #in~n; 683853#L25 assume !(~n <= 0); 683823#L26 call #t~ret0 := fact(~n - 1);< 683848#factENTRY ~n := #in~n; 683845#L25 assume !(~n <= 0); 683821#L26 call #t~ret0 := fact(~n - 1);< 683844#factENTRY ~n := #in~n; 683843#L25 assume ~n <= 0;#res := 1; 683841#factFINAL assume true; 683834#factEXIT >#66#return; 683833#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 683830#factFINAL assume true; 683820#factEXIT >#66#return; 683826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 684225#factFINAL assume true; 684197#factEXIT >#74#return; 684167#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 684169#factENTRY ~n := #in~n; 684243#L25 assume !(~n <= 0); 684200#L26 call #t~ret0 := fact(~n - 1);< 684201#factENTRY ~n := #in~n; 684234#L25 assume ~n <= 0;#res := 1; 684233#factFINAL assume true; 684199#factEXIT >#66#return; 684198#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 684196#factFINAL assume true; 684166#factEXIT >#76#return; 684161#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 684164#factENTRY ~n := #in~n; 684224#L25 assume !(~n <= 0); 684188#L26 call #t~ret0 := fact(~n - 1);< 684195#factENTRY ~n := #in~n; 684220#L25 assume ~n <= 0;#res := 1; 684213#factFINAL assume true; 684181#factEXIT >#66#return; 684180#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 684165#factFINAL assume true; 684158#factEXIT >#78#return; 684163#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; 684253#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 684252#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 684251#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 684143#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 683470#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 683481#factENTRY ~n := #in~n; 683479#L25 assume !(~n <= 0); 683456#L26 call #t~ret0 := fact(~n - 1);< 683459#factENTRY ~n := #in~n; 683491#L25 assume !(~n <= 0); 683457#L26 call #t~ret0 := fact(~n - 1);< 683489#factENTRY ~n := #in~n; 683491#L25 assume !(~n <= 0); 683457#L26 call #t~ret0 := fact(~n - 1);< 683489#factENTRY ~n := #in~n; 683501#L25 assume ~n <= 0;#res := 1; 683499#factFINAL assume true; 683498#factEXIT >#66#return; 683497#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 683496#factFINAL assume true; 683495#factEXIT >#66#return; 683493#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 683492#factFINAL assume true; 683486#factEXIT >#66#return; 683488#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 684052#factFINAL assume true; 684053#factEXIT >#74#return; 683406#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 683411#factENTRY ~n := #in~n; 683407#L25 assume !(~n <= 0); 683359#L26 call #t~ret0 := fact(~n - 1);< 683401#factENTRY ~n := #in~n; 683374#L25 assume ~n <= 0;#res := 1; 683368#factFINAL assume true; 683358#factEXIT >#66#return; 683364#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 684148#factFINAL assume true; 684146#factEXIT >#76#return; 679526#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 683337#factENTRY ~n := #in~n; 683367#L25 assume !(~n <= 0); 683365#L26 call #t~ret0 := fact(~n - 1);< 683366#factENTRY ~n := #in~n; 683396#L25 assume !(~n <= 0); 683376#L26 call #t~ret0 := fact(~n - 1);< 683385#factENTRY ~n := #in~n; 683391#L25 assume ~n <= 0;#res := 1; 683397#factFINAL assume true; 683383#factEXIT >#66#return; 683375#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 683381#factFINAL assume true; 683412#factEXIT >#66#return; 683415#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 683482#factFINAL assume true; 683480#factEXIT >#78#return; 683335#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; 683334#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 683333#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 683331#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 683328#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 683087#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 683086#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 682715#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 682713#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 682714#factENTRY ~n := #in~n; 682725#L25 assume !(~n <= 0); 682722#L26 call #t~ret0 := fact(~n - 1);< 682723#factENTRY ~n := #in~n; 682738#L25 assume !(~n <= 0); 682721#L26 call #t~ret0 := fact(~n - 1);< 682731#factENTRY ~n := #in~n; 682842#L25 assume ~n <= 0;#res := 1; 682840#factFINAL assume true; 682730#factEXIT >#66#return; 682728#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 682726#factFINAL assume true; 682720#factEXIT >#66#return; 682718#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 682717#factFINAL assume true; 682711#factEXIT >#68#return; 682708#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 682710#factENTRY ~n := #in~n; 682724#L25 assume ~n <= 0;#res := 1; 682719#factFINAL assume true; 682707#factEXIT >#70#return; 682704#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 682706#factENTRY ~n := #in~n; 682739#L25 assume !(~n <= 0); 682733#L26 call #t~ret0 := fact(~n - 1);< 682737#factENTRY ~n := #in~n; 682838#L25 assume !(~n <= 0); 682735#L26 call #t~ret0 := fact(~n - 1);< 682837#factENTRY ~n := #in~n; 682836#L25 assume ~n <= 0;#res := 1; 682834#factFINAL assume true; 682767#factEXIT >#66#return; 682765#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 682753#factFINAL assume true; 682732#factEXIT >#66#return; 682729#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 682727#factFINAL assume true; 682702#factEXIT >#72#return; 682701#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 682698#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 682692#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 682690#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 682688#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 682679#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 682683#factENTRY ~n := #in~n; 682761#L25 assume !(~n <= 0); 682734#L26 call #t~ret0 := fact(~n - 1);< 682754#factENTRY ~n := #in~n; 682827#L25 assume !(~n <= 0); 682768#L26 call #t~ret0 := fact(~n - 1);< 682769#factENTRY ~n := #in~n; 682836#L25 assume ~n <= 0;#res := 1; 682834#factFINAL assume true; 682767#factEXIT >#66#return; 682765#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 682753#factFINAL assume true; 682732#factEXIT >#66#return; 682736#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 682686#factFINAL assume true; 682676#factEXIT >#68#return; 682682#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 682700#factENTRY ~n := #in~n; 682849#L25 assume !(~n <= 0); 682846#L26 call #t~ret0 := fact(~n - 1);< 682848#factENTRY ~n := #in~n; 682852#L25 assume ~n <= 0;#res := 1; 682850#factFINAL assume true; 682844#factEXIT >#66#return; 682843#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 682841#factFINAL assume true; 682699#factEXIT >#70#return; 682695#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 682697#factENTRY ~n := #in~n; 682851#L25 assume !(~n <= 0); 682845#L26 call #t~ret0 := fact(~n - 1);< 682848#factENTRY ~n := #in~n; 682852#L25 assume ~n <= 0;#res := 1; 682850#factFINAL assume true; 682844#factEXIT >#66#return; 682847#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 682853#factFINAL assume true; 682693#factEXIT >#72#return; 682691#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 682689#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 682687#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 682685#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 682684#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 682678#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 682683#factENTRY ~n := #in~n; 682761#L25 assume !(~n <= 0); 682734#L26 call #t~ret0 := fact(~n - 1);< 682754#factENTRY ~n := #in~n; 682827#L25 assume !(~n <= 0); 682768#L26 call #t~ret0 := fact(~n - 1);< 682769#factENTRY ~n := #in~n; 682836#L25 assume ~n <= 0;#res := 1; 682834#factFINAL assume true; 682767#factEXIT >#66#return; 682765#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 682753#factFINAL assume true; 682732#factEXIT >#66#return; 682736#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 682686#factFINAL assume true; 682676#factEXIT >#68#return; 682673#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 682675#factENTRY ~n := #in~n; 682864#L25 assume !(~n <= 0); 682860#L26 call #t~ret0 := fact(~n - 1);< 682862#factENTRY ~n := #in~n; 682874#L25 assume !(~n <= 0); 682871#L26 call #t~ret0 := fact(~n - 1);< 682872#factENTRY ~n := #in~n; 682880#L25 assume ~n <= 0;#res := 1; 682878#factFINAL assume true; 682870#factEXIT >#66#return; 682868#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 682865#factFINAL assume true; 682857#factEXIT >#66#return; 682855#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 682854#factFINAL assume true; 682672#factEXIT >#70#return; 682667#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 682670#factENTRY ~n := #in~n; 682863#L25 assume ~n <= 0;#res := 1; 682856#factFINAL assume true; 682666#factEXIT >#72#return; 682659#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 682657#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 682655#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 682654#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 682243#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 682241#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 682242#factENTRY ~n := #in~n; 682255#L25 assume !(~n <= 0); 682253#L26 call #t~ret0 := fact(~n - 1);< 682254#factENTRY ~n := #in~n; 682261#L25 assume !(~n <= 0); 682252#L26 call #t~ret0 := fact(~n - 1);< 682259#factENTRY ~n := #in~n; 682261#L25 assume !(~n <= 0); 682252#L26 call #t~ret0 := fact(~n - 1);< 682259#factENTRY ~n := #in~n; 682310#L25 assume ~n <= 0;#res := 1; 682308#factFINAL assume true; 682306#factEXIT >#66#return; 682304#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 682301#factFINAL assume true; 682258#factEXIT >#66#return; 682257#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 682256#factFINAL assume true; 682251#factEXIT >#66#return; 682250#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 682248#factFINAL assume true; 682240#factEXIT >#74#return; 682237#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 682238#factENTRY ~n := #in~n; 682276#L25 assume !(~n <= 0); 682273#L26 call #t~ret0 := fact(~n - 1);< 682275#factENTRY ~n := #in~n; 682280#L25 assume !(~n <= 0); 682272#L26 call #t~ret0 := fact(~n - 1);< 682287#factENTRY ~n := #in~n; 682298#L25 assume ~n <= 0;#res := 1; 682297#factFINAL assume true; 682282#factEXIT >#66#return; 682284#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 682296#factFINAL assume true; 682285#factEXIT >#66#return; 682270#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 682269#factFINAL assume true; 682263#factEXIT >#76#return; 682232#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 682234#factENTRY ~n := #in~n; 682249#L25 assume !(~n <= 0); 681344#L26 call #t~ret0 := fact(~n - 1);< 682247#factENTRY ~n := #in~n; 682300#L25 assume ~n <= 0;#res := 1; 682260#factFINAL assume true; 682245#factEXIT >#66#return; 682244#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 682235#factFINAL assume true; 682231#factEXIT >#78#return; 682229#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; 683135#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 683133#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 683131#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 683129#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 683128#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 683127#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 679610#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 679541#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 679590#factENTRY ~n := #in~n; 679589#L25 assume !(~n <= 0); 679562#L26 call #t~ret0 := fact(~n - 1);< 679588#factENTRY ~n := #in~n; 679582#L25 assume !(~n <= 0); 679561#L26 call #t~ret0 := fact(~n - 1);< 679580#factENTRY ~n := #in~n; 679582#L25 assume !(~n <= 0); 679561#L26 call #t~ret0 := fact(~n - 1);< 679580#factENTRY ~n := #in~n; 679586#L25 assume ~n <= 0;#res := 1; 679585#factFINAL assume true; 679584#factEXIT >#66#return; 679583#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 679581#factFINAL assume true; 679578#factEXIT >#66#return; 679579#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 679595#factFINAL assume true; 679559#factEXIT >#66#return; 679564#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680684#factFINAL assume true; 680680#factEXIT >#68#return; 680662#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 679509#factENTRY ~n := #in~n; 680682#L25 assume ~n <= 0;#res := 1; 680679#factFINAL assume true; 680652#factEXIT >#70#return; 680305#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 680423#factENTRY ~n := #in~n; 680339#L25 assume !(~n <= 0); 679973#L26 call #t~ret0 := fact(~n - 1);< 680084#factENTRY ~n := #in~n; 680082#L25 assume !(~n <= 0); 679972#L26 call #t~ret0 := fact(~n - 1);< 679993#factENTRY ~n := #in~n; 680076#L25 assume !(~n <= 0); 679975#L26 call #t~ret0 := fact(~n - 1);< 680058#factENTRY ~n := #in~n; 680077#L25 assume ~n <= 0;#res := 1; 680059#factFINAL assume true; 680054#factEXIT >#66#return; 680053#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680026#factFINAL assume true; 680019#factEXIT >#66#return; 680018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680004#factFINAL assume true; 679996#factEXIT >#66#return; 680002#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680711#factFINAL assume true; 680647#factEXIT >#72#return; 680650#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 681477#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 681476#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 681475#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 681473#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 680111#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 680491#factENTRY ~n := #in~n; 681205#L25 assume !(~n <= 0); 679981#L26 call #t~ret0 := fact(~n - 1);< 680084#factENTRY ~n := #in~n; 680082#L25 assume !(~n <= 0); 679972#L26 call #t~ret0 := fact(~n - 1);< 679993#factENTRY ~n := #in~n; 680076#L25 assume !(~n <= 0); 679975#L26 call #t~ret0 := fact(~n - 1);< 680058#factENTRY ~n := #in~n; 680076#L25 assume !(~n <= 0); 679975#L26 call #t~ret0 := fact(~n - 1);< 680058#factENTRY ~n := #in~n; 680077#L25 assume ~n <= 0;#res := 1; 680059#factFINAL assume true; 680054#factEXIT >#66#return; 680053#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680026#factFINAL assume true; 680019#factEXIT >#66#return; 680018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680004#factFINAL assume true; 679996#factEXIT >#66#return; 679995#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 679991#factFINAL assume true; 679964#factEXIT >#66#return; 679987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680470#factFINAL assume true; 680471#factEXIT >#68#return; 680009#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 680473#factENTRY ~n := #in~n; 680907#L25 assume !(~n <= 0); 679967#L26 call #t~ret0 := fact(~n - 1);< 680017#factENTRY ~n := #in~n; 680576#L25 assume ~n <= 0;#res := 1; 680572#factFINAL assume true; 680565#factEXIT >#66#return; 680567#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680632#factFINAL assume true; 680619#factEXIT >#70#return; 680049#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 680182#factENTRY ~n := #in~n; 680183#L25 assume !(~n <= 0); 680021#L26 call #t~ret0 := fact(~n - 1);< 680051#factENTRY ~n := #in~n; 680061#L25 assume !(~n <= 0); 680055#L26 call #t~ret0 := fact(~n - 1);< 680056#factENTRY ~n := #in~n; 680077#L25 assume ~n <= 0;#res := 1; 680059#factFINAL assume true; 680054#factEXIT >#66#return; 680053#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680026#factFINAL assume true; 680019#factEXIT >#66#return; 680023#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680638#factFINAL assume true; 680591#factEXIT >#72#return; 680612#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 683236#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 683235#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 683234#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 683233#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 680093#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 680115#factENTRY ~n := #in~n; 680113#L25 assume !(~n <= 0); 679971#L26 call #t~ret0 := fact(~n - 1);< 680083#factENTRY ~n := #in~n; 680081#L25 assume !(~n <= 0); 679998#L26 call #t~ret0 := fact(~n - 1);< 680003#factENTRY ~n := #in~n; 680052#L25 assume !(~n <= 0); 680022#L26 call #t~ret0 := fact(~n - 1);< 680025#factENTRY ~n := #in~n; 680077#L25 assume ~n <= 0;#res := 1; 680059#factFINAL assume true; 680054#factEXIT >#66#return; 680053#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680026#factFINAL assume true; 680019#factEXIT >#66#return; 680018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680004#factFINAL assume true; 679996#factEXIT >#66#return; 680001#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680476#factFINAL assume true; 680426#factEXIT >#68#return; 680139#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 680179#factENTRY ~n := #in~n; 680178#L25 assume !(~n <= 0); 679966#L26 call #t~ret0 := fact(~n - 1);< 680079#factENTRY ~n := #in~n; 680075#L25 assume !(~n <= 0); 679997#L26 call #t~ret0 := fact(~n - 1);< 680057#factENTRY ~n := #in~n; 680077#L25 assume ~n <= 0;#res := 1; 680059#factFINAL assume true; 680054#factEXIT >#66#return; 680053#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680026#factFINAL assume true; 680019#factEXIT >#66#return; 680024#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680564#factFINAL assume true; 680562#factEXIT >#70#return; 680127#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 680559#factENTRY ~n := #in~n; 680125#L25 assume !(~n <= 0); 680020#L26 call #t~ret0 := fact(~n - 1);< 680568#factENTRY ~n := #in~n; 680576#L25 assume ~n <= 0;#res := 1; 680572#factFINAL assume true; 680565#factEXIT >#66#return; 680563#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680560#factFINAL assume true; 680547#factEXIT >#72#return; 680373#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 683230#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 683228#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 683224#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 683220#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 680086#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 680115#factENTRY ~n := #in~n; 680113#L25 assume !(~n <= 0); 679971#L26 call #t~ret0 := fact(~n - 1);< 680083#factENTRY ~n := #in~n; 680081#L25 assume !(~n <= 0); 679998#L26 call #t~ret0 := fact(~n - 1);< 680003#factENTRY ~n := #in~n; 680052#L25 assume !(~n <= 0); 680022#L26 call #t~ret0 := fact(~n - 1);< 680025#factENTRY ~n := #in~n; 680077#L25 assume ~n <= 0;#res := 1; 680059#factFINAL assume true; 680054#factEXIT >#66#return; 680053#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680026#factFINAL assume true; 680019#factEXIT >#66#return; 680018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680004#factFINAL assume true; 679996#factEXIT >#66#return; 680001#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680476#factFINAL assume true; 680426#factEXIT >#68#return; 680142#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 680179#factENTRY ~n := #in~n; 680178#L25 assume !(~n <= 0); 679966#L26 call #t~ret0 := fact(~n - 1);< 680079#factENTRY ~n := #in~n; 680075#L25 assume !(~n <= 0); 679997#L26 call #t~ret0 := fact(~n - 1);< 680057#factENTRY ~n := #in~n; 680052#L25 assume !(~n <= 0); 680022#L26 call #t~ret0 := fact(~n - 1);< 680025#factENTRY ~n := #in~n; 680061#L25 assume !(~n <= 0); 680055#L26 call #t~ret0 := fact(~n - 1);< 680056#factENTRY ~n := #in~n; 680077#L25 assume ~n <= 0;#res := 1; 680059#factFINAL assume true; 680054#factEXIT >#66#return; 680053#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680026#factFINAL assume true; 680019#factEXIT >#66#return; 680018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680004#factFINAL assume true; 679996#factEXIT >#66#return; 679995#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 679991#factFINAL assume true; 679964#factEXIT >#66#return; 679987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680470#factFINAL assume true; 680471#factEXIT >#70#return; 680344#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 680404#factENTRY ~n := #in~n; 680406#L25 assume ~n <= 0;#res := 1; 680405#factFINAL assume true; 680340#factEXIT >#72#return; 680376#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 683200#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 683196#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 683194#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 683114#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 680181#L30-5 [2022-11-25 17:07:07,023 INFO L750 eck$LassoCheckResult]: Loop: 680181#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 682653#factENTRY ~n := #in~n; 682671#L25 assume !(~n <= 0); 679463#L26 call #t~ret0 := fact(~n - 1);< 679462#factENTRY ~n := #in~n; 679464#L25 assume !(~n <= 0); 682661#L26 call #t~ret0 := fact(~n - 1);< 682905#factENTRY ~n := #in~n; 682914#L25 assume !(~n <= 0); 682664#L26 call #t~ret0 := fact(~n - 1);< 682913#factENTRY ~n := #in~n; 682914#L25 assume !(~n <= 0); 682664#L26 call #t~ret0 := fact(~n - 1);< 682913#factENTRY ~n := #in~n; 682919#L25 assume ~n <= 0;#res := 1; 682918#factFINAL assume true; 682917#factEXIT >#66#return; 682916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 682915#factFINAL assume true; 682912#factEXIT >#66#return; 682911#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 682908#factFINAL assume true; 682904#factEXIT >#66#return; 682902#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 682896#factFINAL assume true; 682660#factEXIT >#66#return; 682658#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 682656#factFINAL assume true; 682652#factEXIT >#74#return; 682650#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 682651#factENTRY ~n := #in~n; 682943#L25 assume !(~n <= 0); 682925#L26 call #t~ret0 := fact(~n - 1);< 682938#factENTRY ~n := #in~n; 682937#L25 assume !(~n <= 0); 682934#L26 call #t~ret0 := fact(~n - 1);< 682936#factENTRY ~n := #in~n; 682944#L25 assume !(~n <= 0); 679474#L26 call #t~ret0 := fact(~n - 1);< 682942#factENTRY ~n := #in~n; 682932#L25 assume ~n <= 0;#res := 1; 683039#factFINAL assume true; 683038#factEXIT >#66#return; 683037#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 683035#factFINAL assume true; 682941#factEXIT >#66#return; 682940#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 682939#factFINAL assume true; 682933#factEXIT >#66#return; 682935#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 682956#factFINAL assume true; 682945#factEXIT >#76#return; 679647#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 679644#factENTRY ~n := #in~n; 679650#L25 assume !(~n <= 0); 679632#L26 call #t~ret0 := fact(~n - 1);< 679667#factENTRY ~n := #in~n; 679658#L25 assume ~n <= 0;#res := 1; 679651#factFINAL assume true; 679631#factEXIT >#66#return; 679634#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 682186#factFINAL assume true; 682184#factEXIT >#78#return; 679469#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; 679470#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 679477#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 679516#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 679486#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 679487#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 679504#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 679505#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 679536#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 679449#factENTRY ~n := #in~n; 679567#L25 assume !(~n <= 0); 679568#L26 call #t~ret0 := fact(~n - 1);< 679596#factENTRY ~n := #in~n; 679591#L25 assume !(~n <= 0); 679560#L26 call #t~ret0 := fact(~n - 1);< 679587#factENTRY ~n := #in~n; 679582#L25 assume !(~n <= 0); 679561#L26 call #t~ret0 := fact(~n - 1);< 679580#factENTRY ~n := #in~n; 679582#L25 assume !(~n <= 0); 679561#L26 call #t~ret0 := fact(~n - 1);< 679580#factENTRY ~n := #in~n; 679586#L25 assume ~n <= 0;#res := 1; 679585#factFINAL assume true; 679584#factEXIT >#66#return; 679583#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 679581#factFINAL assume true; 679578#factEXIT >#66#return; 679579#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 679595#factFINAL assume true; 679559#factEXIT >#66#return; 679563#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 679600#factFINAL assume true; 679592#factEXIT >#66#return; 679593#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680702#factFINAL assume true; 680699#factEXIT >#68#return; 680663#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 679509#factENTRY ~n := #in~n; 680682#L25 assume ~n <= 0;#res := 1; 680679#factFINAL assume true; 680652#factEXIT >#70#return; 680672#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 679445#factENTRY ~n := #in~n; 681218#L25 assume !(~n <= 0); 679983#L26 call #t~ret0 := fact(~n - 1);< 680116#factENTRY ~n := #in~n; 680114#L25 assume !(~n <= 0); 679980#L26 call #t~ret0 := fact(~n - 1);< 680084#factENTRY ~n := #in~n; 680082#L25 assume !(~n <= 0); 679972#L26 call #t~ret0 := fact(~n - 1);< 679993#factENTRY ~n := #in~n; 680076#L25 assume !(~n <= 0); 679975#L26 call #t~ret0 := fact(~n - 1);< 680058#factENTRY ~n := #in~n; 680076#L25 assume !(~n <= 0); 679975#L26 call #t~ret0 := fact(~n - 1);< 680058#factENTRY ~n := #in~n; 680077#L25 assume ~n <= 0;#res := 1; 680059#factFINAL assume true; 680054#factEXIT >#66#return; 680053#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680026#factFINAL assume true; 680019#factEXIT >#66#return; 680018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680004#factFINAL assume true; 679996#factEXIT >#66#return; 679995#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 679991#factFINAL assume true; 679964#factEXIT >#66#return; 679988#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680412#factFINAL assume true; 680408#factEXIT >#66#return; 680209#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 681150#factFINAL assume true; 680872#factEXIT >#72#return; 680693#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 683021#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 683020#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 683018#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 683016#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 680120#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 680472#factENTRY ~n := #in~n; 681206#L25 assume !(~n <= 0); 679985#L26 call #t~ret0 := fact(~n - 1);< 680116#factENTRY ~n := #in~n; 680114#L25 assume !(~n <= 0); 679980#L26 call #t~ret0 := fact(~n - 1);< 680084#factENTRY ~n := #in~n; 680082#L25 assume !(~n <= 0); 679972#L26 call #t~ret0 := fact(~n - 1);< 679993#factENTRY ~n := #in~n; 680076#L25 assume !(~n <= 0); 679975#L26 call #t~ret0 := fact(~n - 1);< 680058#factENTRY ~n := #in~n; 680077#L25 assume ~n <= 0;#res := 1; 680059#factFINAL assume true; 680054#factEXIT >#66#return; 680053#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680026#factFINAL assume true; 680019#factEXIT >#66#return; 680018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680004#factFINAL assume true; 679996#factEXIT >#66#return; 679995#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 679991#factFINAL assume true; 679964#factEXIT >#66#return; 679987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680470#factFINAL assume true; 680471#factEXIT >#68#return; 680488#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 680580#factENTRY ~n := #in~n; 680577#L25 assume !(~n <= 0); 680566#L26 call #t~ret0 := fact(~n - 1);< 680573#factENTRY ~n := #in~n; 680576#L25 assume ~n <= 0;#res := 1; 680572#factFINAL assume true; 680565#factEXIT >#66#return; 680567#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680632#factFINAL assume true; 680619#factEXIT >#70#return; 680622#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 680425#factENTRY ~n := #in~n; 680677#L25 assume !(~n <= 0); 679976#L26 call #t~ret0 := fact(~n - 1);< 680084#factENTRY ~n := #in~n; 680082#L25 assume !(~n <= 0); 679972#L26 call #t~ret0 := fact(~n - 1);< 679993#factENTRY ~n := #in~n; 680076#L25 assume !(~n <= 0); 679975#L26 call #t~ret0 := fact(~n - 1);< 680058#factENTRY ~n := #in~n; 680077#L25 assume ~n <= 0;#res := 1; 680059#factFINAL assume true; 680054#factEXIT >#66#return; 680053#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680026#factFINAL assume true; 680019#factEXIT >#66#return; 680018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680004#factFINAL assume true; 679996#factEXIT >#66#return; 680000#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680640#factFINAL assume true; 680627#factEXIT >#72#return; 680628#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 683174#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 683172#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 683171#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 683170#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 680070#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 680080#factENTRY ~n := #in~n; 680078#L25 assume !(~n <= 0); 679968#L26 call #t~ret0 := fact(~n - 1);< 680062#factENTRY ~n := #in~n; 680060#L25 assume !(~n <= 0); 679999#L26 call #t~ret0 := fact(~n - 1);< 680003#factENTRY ~n := #in~n; 680052#L25 assume !(~n <= 0); 680022#L26 call #t~ret0 := fact(~n - 1);< 680025#factENTRY ~n := #in~n; 680061#L25 assume !(~n <= 0); 680055#L26 call #t~ret0 := fact(~n - 1);< 680056#factENTRY ~n := #in~n; 680077#L25 assume ~n <= 0;#res := 1; 680059#factFINAL assume true; 680054#factEXIT >#66#return; 680053#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680026#factFINAL assume true; 680019#factEXIT >#66#return; 680018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680004#factFINAL assume true; 679996#factEXIT >#66#return; 679995#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 679991#factFINAL assume true; 679964#factEXIT >#66#return; 679987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680470#factFINAL assume true; 680471#factEXIT >#68#return; 680145#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 680179#factENTRY ~n := #in~n; 680178#L25 assume !(~n <= 0); 679966#L26 call #t~ret0 := fact(~n - 1);< 680079#factENTRY ~n := #in~n; 680075#L25 assume !(~n <= 0); 679997#L26 call #t~ret0 := fact(~n - 1);< 680057#factENTRY ~n := #in~n; 680077#L25 assume ~n <= 0;#res := 1; 680059#factFINAL assume true; 680054#factEXIT >#66#return; 680053#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680026#factFINAL assume true; 680019#factEXIT >#66#return; 680024#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680564#factFINAL assume true; 680562#factEXIT >#70#return; 680040#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 680182#factENTRY ~n := #in~n; 680183#L25 assume !(~n <= 0); 680021#L26 call #t~ret0 := fact(~n - 1);< 680051#factENTRY ~n := #in~n; 680061#L25 assume !(~n <= 0); 680055#L26 call #t~ret0 := fact(~n - 1);< 680056#factENTRY ~n := #in~n; 680077#L25 assume ~n <= 0;#res := 1; 680059#factFINAL assume true; 680054#factEXIT >#66#return; 680053#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680026#factFINAL assume true; 680019#factEXIT >#66#return; 680023#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680638#factFINAL assume true; 680591#factEXIT >#72#return; 680595#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 683204#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 683203#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 683202#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 683201#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 680067#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 680080#factENTRY ~n := #in~n; 680078#L25 assume !(~n <= 0); 679968#L26 call #t~ret0 := fact(~n - 1);< 680062#factENTRY ~n := #in~n; 680060#L25 assume !(~n <= 0); 679999#L26 call #t~ret0 := fact(~n - 1);< 680003#factENTRY ~n := #in~n; 680052#L25 assume !(~n <= 0); 680022#L26 call #t~ret0 := fact(~n - 1);< 680025#factENTRY ~n := #in~n; 680061#L25 assume !(~n <= 0); 680055#L26 call #t~ret0 := fact(~n - 1);< 680056#factENTRY ~n := #in~n; 680077#L25 assume ~n <= 0;#res := 1; 680059#factFINAL assume true; 680054#factEXIT >#66#return; 680053#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680026#factFINAL assume true; 680019#factEXIT >#66#return; 680018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680004#factFINAL assume true; 679996#factEXIT >#66#return; 679995#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 679991#factFINAL assume true; 679964#factEXIT >#66#return; 679987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680470#factFINAL assume true; 680471#factEXIT >#68#return; 680167#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 680179#factENTRY ~n := #in~n; 680178#L25 assume !(~n <= 0); 679966#L26 call #t~ret0 := fact(~n - 1);< 680079#factENTRY ~n := #in~n; 680075#L25 assume !(~n <= 0); 679997#L26 call #t~ret0 := fact(~n - 1);< 680057#factENTRY ~n := #in~n; 680052#L25 assume !(~n <= 0); 680022#L26 call #t~ret0 := fact(~n - 1);< 680025#factENTRY ~n := #in~n; 680077#L25 assume ~n <= 0;#res := 1; 680059#factFINAL assume true; 680054#factEXIT >#66#return; 680053#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680026#factFINAL assume true; 680019#factEXIT >#66#return; 680018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680004#factFINAL assume true; 679996#factEXIT >#66#return; 680001#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680476#factFINAL assume true; 680426#factEXIT >#70#return; 680128#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 680559#factENTRY ~n := #in~n; 680125#L25 assume !(~n <= 0); 680020#L26 call #t~ret0 := fact(~n - 1);< 680568#factENTRY ~n := #in~n; 680576#L25 assume ~n <= 0;#res := 1; 680572#factFINAL assume true; 680565#factEXIT >#66#return; 680563#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680560#factFINAL assume true; 680547#factEXIT >#72#return; 680401#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 683199#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 683195#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 683193#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 683187#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 680068#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 680080#factENTRY ~n := #in~n; 680078#L25 assume !(~n <= 0); 679968#L26 call #t~ret0 := fact(~n - 1);< 680062#factENTRY ~n := #in~n; 680060#L25 assume !(~n <= 0); 679999#L26 call #t~ret0 := fact(~n - 1);< 680003#factENTRY ~n := #in~n; 680052#L25 assume !(~n <= 0); 680022#L26 call #t~ret0 := fact(~n - 1);< 680025#factENTRY ~n := #in~n; 680061#L25 assume !(~n <= 0); 680055#L26 call #t~ret0 := fact(~n - 1);< 680056#factENTRY ~n := #in~n; 680077#L25 assume ~n <= 0;#res := 1; 680059#factFINAL assume true; 680054#factEXIT >#66#return; 680053#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680026#factFINAL assume true; 680019#factEXIT >#66#return; 680018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680004#factFINAL assume true; 679996#factEXIT >#66#return; 679995#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 679991#factFINAL assume true; 679964#factEXIT >#66#return; 679987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680470#factFINAL assume true; 680471#factEXIT >#68#return; 680163#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 680179#factENTRY ~n := #in~n; 680178#L25 assume !(~n <= 0); 679966#L26 call #t~ret0 := fact(~n - 1);< 680079#factENTRY ~n := #in~n; 680075#L25 assume !(~n <= 0); 679997#L26 call #t~ret0 := fact(~n - 1);< 680057#factENTRY ~n := #in~n; 680052#L25 assume !(~n <= 0); 680022#L26 call #t~ret0 := fact(~n - 1);< 680025#factENTRY ~n := #in~n; 680061#L25 assume !(~n <= 0); 680055#L26 call #t~ret0 := fact(~n - 1);< 680056#factENTRY ~n := #in~n; 680077#L25 assume ~n <= 0;#res := 1; 680059#factFINAL assume true; 680054#factEXIT >#66#return; 680053#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680026#factFINAL assume true; 680019#factEXIT >#66#return; 680018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680004#factFINAL assume true; 679996#factEXIT >#66#return; 679995#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 679991#factFINAL assume true; 679964#factEXIT >#66#return; 679987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 680470#factFINAL assume true; 680471#factEXIT >#70#return; 680366#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 680404#factENTRY ~n := #in~n; 680406#L25 assume ~n <= 0;#res := 1; 680405#factFINAL assume true; 680340#factEXIT >#72#return; 680397#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 683313#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 683311#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 683118#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 683119#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 680181#L30-5 [2022-11-25 17:07:07,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:07,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1454278818, now seen corresponding path program 41 times [2022-11-25 17:07:07,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:07,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199860105] [2022-11-25 17:07:07,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:07,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:07,039 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:07:07,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2087236949] [2022-11-25 17:07:07,040 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 17:07:07,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:07:07,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:07:07,043 INFO L229 MonitoredProcess]: Starting monitored process 329 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:07:07,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (329)] Waiting until timeout for monitored process [2022-11-25 17:07:08,077 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2022-11-25 17:07:08,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:07:08,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 1577 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-25 17:07:08,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:08,249 INFO L134 CoverageAnalysis]: Checked inductivity of 33197 backedges. 12388 proven. 107 refuted. 0 times theorem prover too weak. 20702 trivial. 0 not checked. [2022-11-25 17:07:08,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:07:09,636 INFO L134 CoverageAnalysis]: Checked inductivity of 33197 backedges. 3382 proven. 821 refuted. 0 times theorem prover too weak. 28994 trivial. 0 not checked. [2022-11-25 17:07:09,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:09,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199860105] [2022-11-25 17:07:09,637 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:07:09,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087236949] [2022-11-25 17:07:09,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087236949] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:07:09,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:07:09,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 21 [2022-11-25 17:07:09,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608929127] [2022-11-25 17:07:09,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:07:09,638 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 17:07:09,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:09,639 INFO L85 PathProgramCache]: Analyzing trace with hash 982314840, now seen corresponding path program 37 times [2022-11-25 17:07:09,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:09,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939114086] [2022-11-25 17:07:09,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:09,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:09,655 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:07:09,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [3240733] [2022-11-25 17:07:09,655 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 17:07:09,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:07:09,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:07:09,667 INFO L229 MonitoredProcess]: Starting monitored process 330 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:07:09,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (330)] Waiting until timeout for monitored process [2022-11-25 17:07:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:10,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-25 17:07:10,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 11297 backedges. 5698 proven. 180 refuted. 0 times theorem prover too weak. 5419 trivial. 0 not checked. [2022-11-25 17:07:10,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:07:12,394 INFO L134 CoverageAnalysis]: Checked inductivity of 11297 backedges. 562 proven. 2108 refuted. 0 times theorem prover too weak. 8627 trivial. 0 not checked. [2022-11-25 17:07:12,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:12,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939114086] [2022-11-25 17:07:12,394 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:07:12,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3240733] [2022-11-25 17:07:12,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3240733] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:07:12,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:07:12,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25] total 28 [2022-11-25 17:07:12,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631998105] [2022-11-25 17:07:12,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:07:12,396 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 17:07:12,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:12,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 17:07:12,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2022-11-25 17:07:12,396 INFO L87 Difference]: Start difference. First operand 6208 states and 9274 transitions. cyclomatic complexity: 3165 Second operand has 28 states, 25 states have (on average 2.76) internal successors, (69), 26 states have internal predecessors, (69), 16 states have call successors, (27), 2 states have call predecessors, (27), 12 states have return successors, (34), 13 states have call predecessors, (34), 16 states have call successors, (34) [2022-11-25 17:07:13,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:13,915 INFO L93 Difference]: Finished difference Result 7060 states and 10528 transitions. [2022-11-25 17:07:13,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7060 states and 10528 transitions. [2022-11-25 17:07:14,067 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 938 [2022-11-25 17:07:14,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7060 states to 7041 states and 10501 transitions. [2022-11-25 17:07:14,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 593 [2022-11-25 17:07:14,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 593 [2022-11-25 17:07:14,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7041 states and 10501 transitions. [2022-11-25 17:07:14,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 17:07:14,099 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7041 states and 10501 transitions. [2022-11-25 17:07:14,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7041 states and 10501 transitions. [2022-11-25 17:07:14,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7041 to 6213. [2022-11-25 17:07:14,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6213 states, 3918 states have (on average 1.0668708524757529) internal successors, (4180), 3959 states have internal predecessors, (4180), 1516 states have call successors, (1650), 644 states have call predecessors, (1650), 779 states have return successors, (3455), 1609 states have call predecessors, (3455), 1516 states have call successors, (3455) [2022-11-25 17:07:14,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 9285 transitions. [2022-11-25 17:07:14,244 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6213 states and 9285 transitions. [2022-11-25 17:07:14,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-25 17:07:14,244 INFO L428 stractBuchiCegarLoop]: Abstraction has 6213 states and 9285 transitions. [2022-11-25 17:07:14,244 INFO L335 stractBuchiCegarLoop]: ======== Iteration 58 ============ [2022-11-25 17:07:14,244 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6213 states and 9285 transitions. [2022-11-25 17:07:14,257 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 791 [2022-11-25 17:07:14,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:07:14,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:07:14,260 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [118, 118, 70, 70, 70, 70, 48, 17, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 3, 3, 1, 1, 1, 1] [2022-11-25 17:07:14,260 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [68, 68, 50, 50, 50, 50, 18, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:14,260 INFO L748 eck$LassoCheckResult]: Stem: 699870#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 699846#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; 699847#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 699869#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; 699859#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 699860#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 704419#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 699840#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 699841#factENTRY ~n := #in~n; 704549#L25 assume ~n <= 0;#res := 1; 704548#factFINAL assume true; 704546#factEXIT >#68#return; 699888#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 699889#factENTRY ~n := #in~n; 704449#L25 assume ~n <= 0;#res := 1; 704447#factFINAL assume true; 704444#factEXIT >#70#return; 699834#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 699835#factENTRY ~n := #in~n; 705029#L25 assume ~n <= 0;#res := 1; 705028#factFINAL assume true; 705027#factEXIT >#72#return; 699865#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 699863#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 699864#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 705333#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 705334#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 705371#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 705372#factENTRY ~n := #in~n; 705381#L25 assume !(~n <= 0); 705379#L26 call #t~ret0 := fact(~n - 1);< 705380#factENTRY ~n := #in~n; 705396#L25 assume ~n <= 0;#res := 1; 705393#factFINAL assume true; 705378#factEXIT >#66#return; 705376#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 705375#factFINAL assume true; 705370#factEXIT >#74#return; 705366#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 705367#factENTRY ~n := #in~n; 705373#L25 assume ~n <= 0;#res := 1; 705369#factFINAL assume true; 705364#factEXIT >#76#return; 705359#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 705362#factENTRY ~n := #in~n; 705414#L25 assume !(~n <= 0); 705411#L26 call #t~ret0 := fact(~n - 1);< 705412#factENTRY ~n := #in~n; 705415#L25 assume ~n <= 0;#res := 1; 705413#factFINAL assume true; 705410#factEXIT >#66#return; 705409#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 705407#factFINAL assume true; 705358#factEXIT >#78#return; 705355#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; 705348#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 705349#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 705377#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 699873#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 699817#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 699818#factENTRY ~n := #in~n; 705737#L25 assume !(~n <= 0); 705734#L26 call #t~ret0 := fact(~n - 1);< 705735#factENTRY ~n := #in~n; 705756#L25 assume !(~n <= 0); 705733#L26 call #t~ret0 := fact(~n - 1);< 705754#factENTRY ~n := #in~n; 705757#L25 assume ~n <= 0;#res := 1; 705755#factFINAL assume true; 705753#factEXIT >#66#return; 705751#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 705749#factFINAL assume true; 705732#factEXIT >#66#return; 705731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 705730#factFINAL assume true; 705727#factEXIT >#74#return; 705722#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 705725#factENTRY ~n := #in~n; 705728#L25 assume ~n <= 0;#res := 1; 705726#factFINAL assume true; 705721#factEXIT >#76#return; 705718#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 705719#factENTRY ~n := #in~n; 705717#L25 assume !(~n <= 0); 705594#L26 call #t~ret0 := fact(~n - 1);< 705617#factENTRY ~n := #in~n; 705648#L25 assume !(~n <= 0); 705598#L26 call #t~ret0 := fact(~n - 1);< 705628#factENTRY ~n := #in~n; 705647#L25 assume ~n <= 0;#res := 1; 705646#factFINAL assume true; 705627#factEXIT >#66#return; 705623#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 705619#factFINAL assume true; 705615#factEXIT >#66#return; 705601#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 705978#factFINAL assume true; 705975#factEXIT >#78#return; 705973#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; 705972#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 705971#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 705692#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 705683#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 705351#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 705481#factENTRY ~n := #in~n; 705480#L25 assume !(~n <= 0); 705478#L26 call #t~ret0 := fact(~n - 1);< 705479#factENTRY ~n := #in~n; 705477#L25 assume !(~n <= 0); 705473#L26 call #t~ret0 := fact(~n - 1);< 705476#factENTRY ~n := #in~n; 705477#L25 assume !(~n <= 0); 705473#L26 call #t~ret0 := fact(~n - 1);< 705476#factENTRY ~n := #in~n; 705472#L25 assume ~n <= 0;#res := 1; 705474#factFINAL assume true; 705492#factEXIT >#66#return; 705491#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 705490#factFINAL assume true; 705489#factEXIT >#66#return; 705488#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 705487#factFINAL assume true; 705486#factEXIT >#66#return; 705485#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 705484#factFINAL assume true; 705350#factEXIT >#74#return; 705281#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 705280#factENTRY ~n := #in~n; 705282#L25 assume ~n <= 0;#res := 1; 705347#factFINAL assume true; 705346#factEXIT >#76#return; 705305#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 705345#factENTRY ~n := #in~n; 705344#L25 assume !(~n <= 0); 705301#L26 call #t~ret0 := fact(~n - 1);< 705306#factENTRY ~n := #in~n; 705343#L25 assume !(~n <= 0); 705298#L26 call #t~ret0 := fact(~n - 1);< 705312#factENTRY ~n := #in~n; 705313#L25 assume !(~n <= 0); 705297#L26 call #t~ret0 := fact(~n - 1);< 705340#factENTRY ~n := #in~n; 705342#L25 assume ~n <= 0;#res := 1; 705341#factFINAL assume true; 705339#factEXIT >#66#return; 705338#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 705337#factFINAL assume true; 705336#factEXIT >#66#return; 705335#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 705311#factFINAL assume true; 705295#factEXIT >#66#return; 705303#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 706017#factFINAL assume true; 706005#factEXIT >#78#return; 699903#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; 699902#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 699901#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 699900#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 699868#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 699861#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 699862#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 704271#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 704240#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 704242#factENTRY ~n := #in~n; 704254#L25 assume !(~n <= 0); 704250#L26 call #t~ret0 := fact(~n - 1);< 704251#factENTRY ~n := #in~n; 704261#L25 assume ~n <= 0;#res := 1; 704375#factFINAL assume true; 704374#factEXIT >#66#return; 704373#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 704372#factFINAL assume true; 704371#factEXIT >#68#return; 704365#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 704368#factENTRY ~n := #in~n; 704370#L25 assume ~n <= 0;#res := 1; 704369#factFINAL assume true; 704364#factEXIT >#70#return; 704361#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 704363#factENTRY ~n := #in~n; 704362#L25 assume !(~n <= 0); 704189#L26 call #t~ret0 := fact(~n - 1);< 704356#factENTRY ~n := #in~n; 704211#L25 assume ~n <= 0;#res := 1; 704207#factFINAL assume true; 704196#factEXIT >#66#return; 704202#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 704416#factFINAL assume true; 704413#factEXIT >#72#return; 704415#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 704734#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 704730#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 704731#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 704727#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 704294#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 704378#factENTRY ~n := #in~n; 704293#L25 assume !(~n <= 0); 704198#L26 call #t~ret0 := fact(~n - 1);< 704205#factENTRY ~n := #in~n; 704211#L25 assume ~n <= 0;#res := 1; 704207#factFINAL assume true; 704196#factEXIT >#66#return; 704201#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 704384#factFINAL assume true; 704383#factEXIT >#68#return; 704208#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 704379#factENTRY ~n := #in~n; 704385#L25 assume !(~n <= 0); 704199#L26 call #t~ret0 := fact(~n - 1);< 704205#factENTRY ~n := #in~n; 704211#L25 assume ~n <= 0;#res := 1; 704207#factFINAL assume true; 704196#factEXIT >#66#return; 704203#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 704420#factFINAL assume true; 704412#factEXIT >#70#return; 704405#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 704410#factENTRY ~n := #in~n; 704418#L25 assume ~n <= 0;#res := 1; 704417#factFINAL assume true; 704404#factEXIT >#72#return; 704408#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 704726#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 704396#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 704397#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 704711#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 704215#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 704252#factENTRY ~n := #in~n; 704247#L25 assume !(~n <= 0); 704185#L26 call #t~ret0 := fact(~n - 1);< 704217#factENTRY ~n := #in~n; 704358#L25 assume !(~n <= 0); 704186#L26 call #t~ret0 := fact(~n - 1);< 704357#factENTRY ~n := #in~n; 704227#L25 assume ~n <= 0;#res := 1; 704225#factFINAL assume true; 704220#factEXIT >#66#return; 704218#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 704213#factFINAL assume true; 704184#factEXIT >#66#return; 704190#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 704701#factFINAL assume true; 704699#factEXIT >#74#return; 704693#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 704698#factENTRY ~n := #in~n; 704715#L25 assume !(~n <= 0); 704704#L26 call #t~ret0 := fact(~n - 1);< 704796#factENTRY ~n := #in~n; 704807#L25 assume ~n <= 0;#res := 1; 704805#factFINAL assume true; 704795#factEXIT >#66#return; 704792#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 704786#factFINAL assume true; 704756#factEXIT >#76#return; 704673#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 704690#factENTRY ~n := #in~n; 704671#L25 assume !(~n <= 0); 704587#L26 call #t~ret0 := fact(~n - 1);< 704607#factENTRY ~n := #in~n; 705054#L25 assume ~n <= 0;#res := 1; 705050#factFINAL assume true; 705044#factEXIT >#66#return; 705043#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 705042#factFINAL assume true; 705039#factEXIT >#78#return; 705040#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; 705088#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 705087#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 705086#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 704585#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 703922#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 703935#factENTRY ~n := #in~n; 703933#L25 assume !(~n <= 0); 703916#L26 call #t~ret0 := fact(~n - 1);< 703920#factENTRY ~n := #in~n; 703934#L25 assume !(~n <= 0); 703917#L26 call #t~ret0 := fact(~n - 1);< 703931#factENTRY ~n := #in~n; 703934#L25 assume !(~n <= 0); 703917#L26 call #t~ret0 := fact(~n - 1);< 703931#factENTRY ~n := #in~n; 703939#L25 assume ~n <= 0;#res := 1; 703938#factFINAL assume true; 703937#factEXIT >#66#return; 703936#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 703932#factFINAL assume true; 703930#factEXIT >#66#return; 703929#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 703921#factFINAL assume true; 703914#factEXIT >#66#return; 703918#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 704313#factFINAL assume true; 704314#factEXIT >#74#return; 703880#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 703886#factENTRY ~n := #in~n; 703883#L25 assume !(~n <= 0); 703833#L26 call #t~ret0 := fact(~n - 1);< 703861#factENTRY ~n := #in~n; 703853#L25 assume ~n <= 0;#res := 1; 703846#factFINAL assume true; 703832#factEXIT >#66#return; 703838#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 704965#factFINAL assume true; 704935#factEXIT >#76#return; 703840#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 703542#factENTRY ~n := #in~n; 703845#L25 assume !(~n <= 0); 703839#L26 call #t~ret0 := fact(~n - 1);< 703843#factENTRY ~n := #in~n; 703882#L25 assume !(~n <= 0); 703858#L26 call #t~ret0 := fact(~n - 1);< 703866#factENTRY ~n := #in~n; 703869#L25 assume ~n <= 0;#res := 1; 703867#factFINAL assume true; 703863#factEXIT >#66#return; 703854#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 703860#factFINAL assume true; 703893#factEXIT >#66#return; 703892#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 703891#factFINAL assume true; 703885#factEXIT >#78#return; 703534#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; 703533#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 703531#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 703530#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 703520#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 703517#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 702180#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 703070#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 703068#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 703069#factENTRY ~n := #in~n; 703081#L25 assume !(~n <= 0); 703078#L26 call #t~ret0 := fact(~n - 1);< 703079#factENTRY ~n := #in~n; 703088#L25 assume !(~n <= 0); 703077#L26 call #t~ret0 := fact(~n - 1);< 703086#factENTRY ~n := #in~n; 703093#L25 assume ~n <= 0;#res := 1; 703092#factFINAL assume true; 703085#factEXIT >#66#return; 703084#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 703083#factFINAL assume true; 703076#factEXIT >#66#return; 703074#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 703071#factFINAL assume true; 703066#factEXIT >#68#return; 703063#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 703065#factENTRY ~n := #in~n; 703142#L25 assume ~n <= 0;#res := 1; 703141#factFINAL assume true; 703062#factEXIT >#70#return; 703058#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 703061#factENTRY ~n := #in~n; 703188#L25 assume !(~n <= 0); 703184#L26 call #t~ret0 := fact(~n - 1);< 703186#factENTRY ~n := #in~n; 703207#L25 assume !(~n <= 0); 703204#L26 call #t~ret0 := fact(~n - 1);< 703205#factENTRY ~n := #in~n; 703209#L25 assume ~n <= 0;#res := 1; 703208#factFINAL assume true; 703203#factEXIT >#66#return; 703202#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 703189#factFINAL assume true; 703182#factEXIT >#66#return; 703180#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 703178#factFINAL assume true; 703057#factEXIT >#72#return; 703056#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 703053#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 703047#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 703045#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 703043#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 703034#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 703038#factENTRY ~n := #in~n; 703191#L25 assume !(~n <= 0); 703183#L26 call #t~ret0 := fact(~n - 1);< 703186#factENTRY ~n := #in~n; 703207#L25 assume !(~n <= 0); 703204#L26 call #t~ret0 := fact(~n - 1);< 703205#factENTRY ~n := #in~n; 703209#L25 assume ~n <= 0;#res := 1; 703208#factFINAL assume true; 703203#factEXIT >#66#return; 703202#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 703189#factFINAL assume true; 703182#factEXIT >#66#return; 703185#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 703041#factFINAL assume true; 703031#factEXIT >#68#return; 703037#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 703055#factENTRY ~n := #in~n; 703198#L25 assume !(~n <= 0); 703195#L26 call #t~ret0 := fact(~n - 1);< 703197#factENTRY ~n := #in~n; 703201#L25 assume ~n <= 0;#res := 1; 703199#factFINAL assume true; 703193#factEXIT >#66#return; 703192#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 703190#factFINAL assume true; 703054#factEXIT >#70#return; 703050#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 703052#factENTRY ~n := #in~n; 703200#L25 assume !(~n <= 0); 703194#L26 call #t~ret0 := fact(~n - 1);< 703197#factENTRY ~n := #in~n; 703201#L25 assume ~n <= 0;#res := 1; 703199#factFINAL assume true; 703193#factEXIT >#66#return; 703196#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 703206#factFINAL assume true; 703048#factEXIT >#72#return; 703046#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 703044#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 703042#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 703040#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 703039#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 703032#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 703038#factENTRY ~n := #in~n; 703191#L25 assume !(~n <= 0); 703183#L26 call #t~ret0 := fact(~n - 1);< 703186#factENTRY ~n := #in~n; 703207#L25 assume !(~n <= 0); 703204#L26 call #t~ret0 := fact(~n - 1);< 703205#factENTRY ~n := #in~n; 703209#L25 assume ~n <= 0;#res := 1; 703208#factFINAL assume true; 703203#factEXIT >#66#return; 703202#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 703189#factFINAL assume true; 703182#factEXIT >#66#return; 703185#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 703041#factFINAL assume true; 703031#factEXIT >#68#return; 703029#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 703030#factENTRY ~n := #in~n; 703220#L25 assume !(~n <= 0); 703214#L26 call #t~ret0 := fact(~n - 1);< 703218#factENTRY ~n := #in~n; 703230#L25 assume !(~n <= 0); 703227#L26 call #t~ret0 := fact(~n - 1);< 703228#factENTRY ~n := #in~n; 703236#L25 assume ~n <= 0;#res := 1; 703234#factFINAL assume true; 703226#factEXIT >#66#return; 703224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 703221#factFINAL assume true; 703213#factEXIT >#66#return; 703211#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 703210#factFINAL assume true; 703027#factEXIT >#70#return; 703023#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 703025#factENTRY ~n := #in~n; 703219#L25 assume ~n <= 0;#res := 1; 703212#factFINAL assume true; 703021#factEXIT >#72#return; 703020#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 703019#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 703017#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 703016#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 702197#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 702195#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 702196#factENTRY ~n := #in~n; 702269#L25 assume !(~n <= 0); 702204#L26 call #t~ret0 := fact(~n - 1);< 702206#factENTRY ~n := #in~n; 702266#L25 assume !(~n <= 0); 702205#L26 call #t~ret0 := fact(~n - 1);< 702259#factENTRY ~n := #in~n; 702266#L25 assume !(~n <= 0); 702205#L26 call #t~ret0 := fact(~n - 1);< 702259#factENTRY ~n := #in~n; 702309#L25 assume ~n <= 0;#res := 1; 702308#factFINAL assume true; 702287#factEXIT >#66#return; 702283#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 702278#factFINAL assume true; 702258#factEXIT >#66#return; 702256#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 702255#factFINAL assume true; 702203#factEXIT >#66#return; 702199#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 702198#factFINAL assume true; 702194#factEXIT >#74#return; 702192#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 702193#factENTRY ~n := #in~n; 702229#L25 assume !(~n <= 0); 702227#L26 call #t~ret0 := fact(~n - 1);< 702228#factENTRY ~n := #in~n; 702237#L25 assume !(~n <= 0); 702233#L26 call #t~ret0 := fact(~n - 1);< 702235#factENTRY ~n := #in~n; 702274#L25 assume ~n <= 0;#res := 1; 702284#factFINAL assume true; 702279#factEXIT >#66#return; 702276#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 702275#factFINAL assume true; 702270#factEXIT >#66#return; 702234#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 703018#factFINAL assume true; 702191#factEXIT >#76#return; 702188#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 702190#factENTRY ~n := #in~n; 702224#L25 assume !(~n <= 0); 702219#L26 call #t~ret0 := fact(~n - 1);< 702222#factENTRY ~n := #in~n; 702240#L25 assume ~n <= 0;#res := 1; 702236#factFINAL assume true; 702217#factEXIT >#66#return; 702216#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 702214#factFINAL assume true; 702187#factEXIT >#78#return; 701815#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; 702186#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 702185#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 702184#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 702182#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 702179#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 702177#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 700978#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 700787#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 700788#factENTRY ~n := #in~n; 700818#L25 assume !(~n <= 0); 700808#L26 call #t~ret0 := fact(~n - 1);< 700810#factENTRY ~n := #in~n; 700827#L25 assume !(~n <= 0); 700806#L26 call #t~ret0 := fact(~n - 1);< 700826#factENTRY ~n := #in~n; 700827#L25 assume !(~n <= 0); 700806#L26 call #t~ret0 := fact(~n - 1);< 700826#factENTRY ~n := #in~n; 700840#L25 assume ~n <= 0;#res := 1; 700836#factFINAL assume true; 700834#factEXIT >#66#return; 700832#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700829#factFINAL assume true; 700825#factEXIT >#66#return; 700823#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700816#factFINAL assume true; 700805#factEXIT >#66#return; 700803#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700799#factFINAL assume true; 700781#factEXIT >#68#return; 700756#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 699887#factENTRY ~n := #in~n; 700780#L25 assume ~n <= 0;#res := 1; 700779#factFINAL assume true; 700744#factEXIT >#70#return; 700278#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 700742#factENTRY ~n := #in~n; 702593#L25 assume !(~n <= 0); 700250#L26 call #t~ret0 := fact(~n - 1);< 700280#factENTRY ~n := #in~n; 702964#L25 assume !(~n <= 0); 700268#L26 call #t~ret0 := fact(~n - 1);< 700273#factENTRY ~n := #in~n; 700416#L25 assume !(~n <= 0); 700283#L26 call #t~ret0 := fact(~n - 1);< 700320#factENTRY ~n := #in~n; 700325#L25 assume ~n <= 0;#res := 1; 700322#factFINAL assume true; 700316#factEXIT >#66#return; 700315#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700290#factFINAL assume true; 700282#factEXIT >#66#return; 700281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700275#factFINAL assume true; 700265#factEXIT >#66#return; 700272#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700789#factFINAL assume true; 700738#factEXIT >#72#return; 700740#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 701736#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 701735#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 701734#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 701733#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 700329#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 700337#factENTRY ~n := #in~n; 700335#L25 assume !(~n <= 0); 700248#L26 call #t~ret0 := fact(~n - 1);< 700326#factENTRY ~n := #in~n; 700323#L25 assume !(~n <= 0); 700240#L26 call #t~ret0 := fact(~n - 1);< 700274#factENTRY ~n := #in~n; 700324#L25 assume !(~n <= 0); 700242#L26 call #t~ret0 := fact(~n - 1);< 700321#factENTRY ~n := #in~n; 700325#L25 assume ~n <= 0;#res := 1; 700322#factFINAL assume true; 700316#factEXIT >#66#return; 700315#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700290#factFINAL assume true; 700282#factEXIT >#66#return; 700281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700275#factFINAL assume true; 700265#factEXIT >#66#return; 700271#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700595#factFINAL assume true; 700516#factEXIT >#68#return; 700407#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 700415#factENTRY ~n := #in~n; 700413#L25 assume !(~n <= 0); 700251#L26 call #t~ret0 := fact(~n - 1);< 700411#factENTRY ~n := #in~n; 700660#L25 assume ~n <= 0;#res := 1; 700643#factFINAL assume true; 700637#factEXIT >#66#return; 700639#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700725#factFINAL assume true; 700711#factEXIT >#70#return; 700291#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 700430#factENTRY ~n := #in~n; 700431#L25 assume !(~n <= 0); 700285#L26 call #t~ret0 := fact(~n - 1);< 700289#factENTRY ~n := #in~n; 700604#L25 assume !(~n <= 0); 700317#L26 call #t~ret0 := fact(~n - 1);< 700319#factENTRY ~n := #in~n; 700325#L25 assume ~n <= 0;#res := 1; 700322#factFINAL assume true; 700316#factEXIT >#66#return; 700315#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700290#factFINAL assume true; 700282#factEXIT >#66#return; 700287#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700851#factFINAL assume true; 700670#factEXIT >#72#return; 700691#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 701732#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 701731#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 701730#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 701728#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 700524#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 700602#factENTRY ~n := #in~n; 700598#L25 assume !(~n <= 0); 700249#L26 call #t~ret0 := fact(~n - 1);< 700280#factENTRY ~n := #in~n; 702964#L25 assume !(~n <= 0); 700268#L26 call #t~ret0 := fact(~n - 1);< 700273#factENTRY ~n := #in~n; 700416#L25 assume !(~n <= 0); 700283#L26 call #t~ret0 := fact(~n - 1);< 700320#factENTRY ~n := #in~n; 700325#L25 assume ~n <= 0;#res := 1; 700322#factFINAL assume true; 700316#factEXIT >#66#return; 700315#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700290#factFINAL assume true; 700282#factEXIT >#66#return; 700281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700275#factFINAL assume true; 700265#factEXIT >#66#return; 700271#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700595#factFINAL assume true; 700516#factEXIT >#68#return; 700393#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 700414#factENTRY ~n := #in~n; 700412#L25 assume !(~n <= 0); 700246#L26 call #t~ret0 := fact(~n - 1);< 700334#factENTRY ~n := #in~n; 700328#L25 assume !(~n <= 0); 700269#L26 call #t~ret0 := fact(~n - 1);< 700318#factENTRY ~n := #in~n; 700325#L25 assume ~n <= 0;#res := 1; 700322#factFINAL assume true; 700316#factEXIT >#66#return; 700315#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700290#factFINAL assume true; 700282#factEXIT >#66#return; 700288#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700662#factFINAL assume true; 700661#factEXIT >#70#return; 700424#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 700633#factENTRY ~n := #in~n; 700417#L25 assume !(~n <= 0); 700284#L26 call #t~ret0 := fact(~n - 1);< 700640#factENTRY ~n := #in~n; 700660#L25 assume ~n <= 0;#res := 1; 700643#factFINAL assume true; 700637#factEXIT >#66#return; 700636#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700634#factFINAL assume true; 700620#factEXIT >#72#return; 700628#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 701690#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 701688#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 701686#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 701685#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 700560#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 700602#factENTRY ~n := #in~n; 700598#L25 assume !(~n <= 0); 700249#L26 call #t~ret0 := fact(~n - 1);< 700280#factENTRY ~n := #in~n; 702964#L25 assume !(~n <= 0); 700268#L26 call #t~ret0 := fact(~n - 1);< 700273#factENTRY ~n := #in~n; 700416#L25 assume !(~n <= 0); 700283#L26 call #t~ret0 := fact(~n - 1);< 700320#factENTRY ~n := #in~n; 700604#L25 assume !(~n <= 0); 700317#L26 call #t~ret0 := fact(~n - 1);< 700319#factENTRY ~n := #in~n; 700325#L25 assume ~n <= 0;#res := 1; 700322#factFINAL assume true; 700316#factEXIT >#66#return; 700315#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700290#factFINAL assume true; 700282#factEXIT >#66#return; 700281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700275#factFINAL assume true; 700265#factEXIT >#66#return; 700264#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700261#factFINAL assume true; 700234#factEXIT >#66#return; 700259#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700572#factFINAL assume true; 700592#factEXIT >#68#return; 700361#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 700414#factENTRY ~n := #in~n; 700412#L25 assume !(~n <= 0); 700246#L26 call #t~ret0 := fact(~n - 1);< 700334#factENTRY ~n := #in~n; 700328#L25 assume !(~n <= 0); 700269#L26 call #t~ret0 := fact(~n - 1);< 700318#factENTRY ~n := #in~n; 700416#L25 assume !(~n <= 0); 700283#L26 call #t~ret0 := fact(~n - 1);< 700320#factENTRY ~n := #in~n; 700604#L25 assume !(~n <= 0); 700317#L26 call #t~ret0 := fact(~n - 1);< 700319#factENTRY ~n := #in~n; 700325#L25 assume ~n <= 0;#res := 1; 700322#factFINAL assume true; 700316#factEXIT >#66#return; 700315#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700290#factFINAL assume true; 700282#factEXIT >#66#return; 700281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700275#factFINAL assume true; 700265#factEXIT >#66#return; 700264#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700261#factFINAL assume true; 700234#factEXIT >#66#return; 700259#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700572#factFINAL assume true; 700592#factEXIT >#70#return; 700481#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 700513#factENTRY ~n := #in~n; 700515#L25 assume ~n <= 0;#res := 1; 700514#factFINAL assume true; 700449#factEXIT >#72#return; 700512#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 701679#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 701689#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 701687#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 701684#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 699910#L30-5 [2022-11-25 17:07:14,261 INFO L750 eck$LassoCheckResult]: Loop: 699910#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 701034#factENTRY ~n := #in~n; 701158#L25 assume !(~n <= 0); 701113#L26 call #t~ret0 := fact(~n - 1);< 701119#factENTRY ~n := #in~n; 701161#L25 assume !(~n <= 0); 701117#L26 call #t~ret0 := fact(~n - 1);< 701123#factENTRY ~n := #in~n; 701159#L25 assume !(~n <= 0); 701115#L26 call #t~ret0 := fact(~n - 1);< 701156#factENTRY ~n := #in~n; 701159#L25 assume !(~n <= 0); 701115#L26 call #t~ret0 := fact(~n - 1);< 701156#factENTRY ~n := #in~n; 701159#L25 assume !(~n <= 0); 701115#L26 call #t~ret0 := fact(~n - 1);< 701156#factENTRY ~n := #in~n; 701159#L25 assume !(~n <= 0); 701115#L26 call #t~ret0 := fact(~n - 1);< 701156#factENTRY ~n := #in~n; 701191#L25 assume ~n <= 0;#res := 1; 701190#factFINAL assume true; 701189#factEXIT >#66#return; 701186#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 701184#factFINAL assume true; 701155#factEXIT >#66#return; 701154#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 701153#factFINAL assume true; 701125#factEXIT >#66#return; 701124#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 701121#factFINAL assume true; 701112#factEXIT >#66#return; 701118#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 701490#factFINAL assume true; 701478#factEXIT >#66#return; 701479#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 701544#factFINAL assume true; 701480#factEXIT >#66#return; 701481#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 701397#factFINAL assume true; 701398#factEXIT >#74#return; 699911#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 701031#factENTRY ~n := #in~n; 701192#L25 assume !(~n <= 0); 701149#L26 call #t~ret0 := fact(~n - 1);< 701152#factENTRY ~n := #in~n; 701281#L25 assume !(~n <= 0); 701247#L26 call #t~ret0 := fact(~n - 1);< 701249#factENTRY ~n := #in~n; 701310#L25 assume !(~n <= 0); 701291#L26 call #t~ret0 := fact(~n - 1);< 701292#factENTRY ~n := #in~n; 701188#L25 assume ~n <= 0;#res := 1; 701311#factFINAL assume true; 701306#factEXIT >#66#return; 701305#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 701303#factFINAL assume true; 701290#factEXIT >#66#return; 701286#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 701279#factFINAL assume true; 701246#factEXIT >#66#return; 701248#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 701850#factFINAL assume true; 701848#factEXIT >#76#return; 700996#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 699897#factENTRY ~n := #in~n; 701111#L25 assume !(~n <= 0); 701037#L26 call #t~ret0 := fact(~n - 1);< 701039#factENTRY ~n := #in~n; 701126#L25 assume ~n <= 0;#res := 1; 701109#factFINAL assume true; 701035#factEXIT >#66#return; 701038#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 701002#factFINAL assume true; 700995#factEXIT >#78#return; 700993#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; 701847#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 701846#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 701845#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 701844#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 701843#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 701842#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 701841#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 700797#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 700798#factENTRY ~n := #in~n; 700822#L25 assume !(~n <= 0); 700813#L26 call #t~ret0 := fact(~n - 1);< 700815#factENTRY ~n := #in~n; 700830#L25 assume !(~n <= 0); 700807#L26 call #t~ret0 := fact(~n - 1);< 700817#factENTRY ~n := #in~n; 700827#L25 assume !(~n <= 0); 700806#L26 call #t~ret0 := fact(~n - 1);< 700826#factENTRY ~n := #in~n; 700827#L25 assume !(~n <= 0); 700806#L26 call #t~ret0 := fact(~n - 1);< 700826#factENTRY ~n := #in~n; 700840#L25 assume ~n <= 0;#res := 1; 700836#factFINAL assume true; 700834#factEXIT >#66#return; 700832#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700829#factFINAL assume true; 700825#factEXIT >#66#return; 700823#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700816#factFINAL assume true; 700805#factEXIT >#66#return; 700809#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700819#factFINAL assume true; 700811#factEXIT >#66#return; 700804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700801#factFINAL assume true; 700791#factEXIT >#68#return; 700751#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 699887#factENTRY ~n := #in~n; 700780#L25 assume ~n <= 0;#res := 1; 700779#factFINAL assume true; 700744#factEXIT >#70#return; 700355#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 700358#factENTRY ~n := #in~n; 700357#L25 assume !(~n <= 0); 700243#L26 call #t~ret0 := fact(~n - 1);< 700348#factENTRY ~n := #in~n; 700339#L25 assume !(~n <= 0); 700266#L26 call #t~ret0 := fact(~n - 1);< 700333#factENTRY ~n := #in~n; 700327#L25 assume !(~n <= 0); 700286#L26 call #t~ret0 := fact(~n - 1);< 700289#factENTRY ~n := #in~n; 700604#L25 assume !(~n <= 0); 700317#L26 call #t~ret0 := fact(~n - 1);< 700319#factENTRY ~n := #in~n; 700325#L25 assume ~n <= 0;#res := 1; 700322#factFINAL assume true; 700316#factEXIT >#66#return; 700315#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700290#factFINAL assume true; 700282#factEXIT >#66#return; 700281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700275#factFINAL assume true; 700265#factEXIT >#66#return; 700264#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700261#factFINAL assume true; 700234#factEXIT >#66#return; 700258#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700790#factFINAL assume true; 700771#factEXIT >#72#return; 700777#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 701840#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 701839#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 701838#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 701837#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 700586#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 700603#factENTRY ~n := #in~n; 700600#L25 assume !(~n <= 0); 700252#L26 call #t~ret0 := fact(~n - 1);< 700338#factENTRY ~n := #in~n; 700336#L25 assume !(~n <= 0); 700237#L26 call #t~ret0 := fact(~n - 1);< 700326#factENTRY ~n := #in~n; 700323#L25 assume !(~n <= 0); 700240#L26 call #t~ret0 := fact(~n - 1);< 700274#factENTRY ~n := #in~n; 700324#L25 assume !(~n <= 0); 700242#L26 call #t~ret0 := fact(~n - 1);< 700321#factENTRY ~n := #in~n; 700325#L25 assume ~n <= 0;#res := 1; 700322#factFINAL assume true; 700316#factEXIT >#66#return; 700315#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700290#factFINAL assume true; 700282#factEXIT >#66#return; 700281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700275#factFINAL assume true; 700265#factEXIT >#66#return; 700264#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700261#factFINAL assume true; 700234#factEXIT >#66#return; 700259#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700572#factFINAL assume true; 700592#factEXIT >#68#return; 700612#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 700668#factENTRY ~n := #in~n; 700664#L25 assume !(~n <= 0); 700638#L26 call #t~ret0 := fact(~n - 1);< 700652#factENTRY ~n := #in~n; 700660#L25 assume ~n <= 0;#res := 1; 700643#factFINAL assume true; 700637#factEXIT >#66#return; 700639#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700725#factFINAL assume true; 700711#factEXIT >#70#return; 700719#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 700724#factENTRY ~n := #in~n; 700732#L25 assume !(~n <= 0); 700241#L26 call #t~ret0 := fact(~n - 1);< 700280#factENTRY ~n := #in~n; 702964#L25 assume !(~n <= 0); 700268#L26 call #t~ret0 := fact(~n - 1);< 700273#factENTRY ~n := #in~n; 700416#L25 assume !(~n <= 0); 700283#L26 call #t~ret0 := fact(~n - 1);< 700320#factENTRY ~n := #in~n; 700325#L25 assume ~n <= 0;#res := 1; 700322#factFINAL assume true; 700316#factEXIT >#66#return; 700315#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700290#factFINAL assume true; 700282#factEXIT >#66#return; 700281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700275#factFINAL assume true; 700265#factEXIT >#66#return; 700270#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700726#factFINAL assume true; 700720#factEXIT >#72#return; 700721#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 701834#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 701832#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 701830#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 701828#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 700573#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 700593#factENTRY ~n := #in~n; 700601#L25 assume !(~n <= 0); 700245#L26 call #t~ret0 := fact(~n - 1);< 700597#factENTRY ~n := #in~n; 702567#L25 assume !(~n <= 0); 700267#L26 call #t~ret0 := fact(~n - 1);< 700273#factENTRY ~n := #in~n; 700416#L25 assume !(~n <= 0); 700283#L26 call #t~ret0 := fact(~n - 1);< 700320#factENTRY ~n := #in~n; 700604#L25 assume !(~n <= 0); 700317#L26 call #t~ret0 := fact(~n - 1);< 700319#factENTRY ~n := #in~n; 700325#L25 assume ~n <= 0;#res := 1; 700322#factFINAL assume true; 700316#factEXIT >#66#return; 700315#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700290#factFINAL assume true; 700282#factEXIT >#66#return; 700281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700275#factFINAL assume true; 700265#factEXIT >#66#return; 700264#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700261#factFINAL assume true; 700234#factEXIT >#66#return; 700259#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700572#factFINAL assume true; 700592#factEXIT >#68#return; 700370#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 700414#factENTRY ~n := #in~n; 700412#L25 assume !(~n <= 0); 700246#L26 call #t~ret0 := fact(~n - 1);< 700334#factENTRY ~n := #in~n; 700328#L25 assume !(~n <= 0); 700269#L26 call #t~ret0 := fact(~n - 1);< 700318#factENTRY ~n := #in~n; 700325#L25 assume ~n <= 0;#res := 1; 700322#factFINAL assume true; 700316#factEXIT >#66#return; 700315#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700290#factFINAL assume true; 700282#factEXIT >#66#return; 700288#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700662#factFINAL assume true; 700661#factEXIT >#70#return; 700292#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 700430#factENTRY ~n := #in~n; 700431#L25 assume !(~n <= 0); 700285#L26 call #t~ret0 := fact(~n - 1);< 700289#factENTRY ~n := #in~n; 700604#L25 assume !(~n <= 0); 700317#L26 call #t~ret0 := fact(~n - 1);< 700319#factENTRY ~n := #in~n; 700325#L25 assume ~n <= 0;#res := 1; 700322#factFINAL assume true; 700316#factEXIT >#66#return; 700315#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700290#factFINAL assume true; 700282#factEXIT >#66#return; 700287#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700851#factFINAL assume true; 700670#factEXIT >#72#return; 700683#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 701812#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 701791#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 701790#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 701788#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 700575#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 700593#factENTRY ~n := #in~n; 700601#L25 assume !(~n <= 0); 700245#L26 call #t~ret0 := fact(~n - 1);< 700597#factENTRY ~n := #in~n; 702567#L25 assume !(~n <= 0); 700267#L26 call #t~ret0 := fact(~n - 1);< 700273#factENTRY ~n := #in~n; 700416#L25 assume !(~n <= 0); 700283#L26 call #t~ret0 := fact(~n - 1);< 700320#factENTRY ~n := #in~n; 700604#L25 assume !(~n <= 0); 700317#L26 call #t~ret0 := fact(~n - 1);< 700319#factENTRY ~n := #in~n; 700325#L25 assume ~n <= 0;#res := 1; 700322#factFINAL assume true; 700316#factEXIT >#66#return; 700315#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700290#factFINAL assume true; 700282#factEXIT >#66#return; 700281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700275#factFINAL assume true; 700265#factEXIT >#66#return; 700264#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700261#factFINAL assume true; 700234#factEXIT >#66#return; 700259#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700572#factFINAL assume true; 700592#factEXIT >#68#return; 700396#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 700414#factENTRY ~n := #in~n; 700412#L25 assume !(~n <= 0); 700246#L26 call #t~ret0 := fact(~n - 1);< 700334#factENTRY ~n := #in~n; 700328#L25 assume !(~n <= 0); 700269#L26 call #t~ret0 := fact(~n - 1);< 700318#factENTRY ~n := #in~n; 700416#L25 assume !(~n <= 0); 700283#L26 call #t~ret0 := fact(~n - 1);< 700320#factENTRY ~n := #in~n; 700325#L25 assume ~n <= 0;#res := 1; 700322#factFINAL assume true; 700316#factEXIT >#66#return; 700315#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700290#factFINAL assume true; 700282#factEXIT >#66#return; 700281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700275#factFINAL assume true; 700265#factEXIT >#66#return; 700271#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700595#factFINAL assume true; 700516#factEXIT >#70#return; 700428#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 700633#factENTRY ~n := #in~n; 700417#L25 assume !(~n <= 0); 700284#L26 call #t~ret0 := fact(~n - 1);< 700640#factENTRY ~n := #in~n; 700660#L25 assume ~n <= 0;#res := 1; 700643#factFINAL assume true; 700637#factEXIT >#66#return; 700636#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700634#factFINAL assume true; 700620#factEXIT >#72#return; 700491#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 701721#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 701719#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 701718#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 701717#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 700591#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 700593#factENTRY ~n := #in~n; 700601#L25 assume !(~n <= 0); 700245#L26 call #t~ret0 := fact(~n - 1);< 700597#factENTRY ~n := #in~n; 702567#L25 assume !(~n <= 0); 700267#L26 call #t~ret0 := fact(~n - 1);< 700273#factENTRY ~n := #in~n; 700416#L25 assume !(~n <= 0); 700283#L26 call #t~ret0 := fact(~n - 1);< 700320#factENTRY ~n := #in~n; 700604#L25 assume !(~n <= 0); 700317#L26 call #t~ret0 := fact(~n - 1);< 700319#factENTRY ~n := #in~n; 700325#L25 assume ~n <= 0;#res := 1; 700322#factFINAL assume true; 700316#factEXIT >#66#return; 700315#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700290#factFINAL assume true; 700282#factEXIT >#66#return; 700281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700275#factFINAL assume true; 700265#factEXIT >#66#return; 700264#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700261#factFINAL assume true; 700234#factEXIT >#66#return; 700259#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700572#factFINAL assume true; 700592#factEXIT >#68#return; 700391#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 700414#factENTRY ~n := #in~n; 700412#L25 assume !(~n <= 0); 700246#L26 call #t~ret0 := fact(~n - 1);< 700334#factENTRY ~n := #in~n; 700328#L25 assume !(~n <= 0); 700269#L26 call #t~ret0 := fact(~n - 1);< 700318#factENTRY ~n := #in~n; 700416#L25 assume !(~n <= 0); 700283#L26 call #t~ret0 := fact(~n - 1);< 700320#factENTRY ~n := #in~n; 700604#L25 assume !(~n <= 0); 700317#L26 call #t~ret0 := fact(~n - 1);< 700319#factENTRY ~n := #in~n; 700325#L25 assume ~n <= 0;#res := 1; 700322#factFINAL assume true; 700316#factEXIT >#66#return; 700315#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700290#factFINAL assume true; 700282#factEXIT >#66#return; 700281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700275#factFINAL assume true; 700265#factEXIT >#66#return; 700264#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700261#factFINAL assume true; 700234#factEXIT >#66#return; 700259#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 700572#factFINAL assume true; 700592#factEXIT >#70#return; 700458#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 700513#factENTRY ~n := #in~n; 700515#L25 assume ~n <= 0;#res := 1; 700514#factFINAL assume true; 700449#factEXIT >#72#return; 700489#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 701678#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 701676#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 701240#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 701040#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 699910#L30-5 [2022-11-25 17:07:14,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:14,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1630772446, now seen corresponding path program 42 times [2022-11-25 17:07:14,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:14,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997839078] [2022-11-25 17:07:14,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:14,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:14,283 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:07:14,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [284370115] [2022-11-25 17:07:14,284 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-25 17:07:14,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:07:14,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:07:14,286 INFO L229 MonitoredProcess]: Starting monitored process 331 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:07:14,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (331)] Waiting until timeout for monitored process [2022-11-25 17:07:14,704 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-11-25 17:07:14,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:07:14,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:07:14,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:14,834 INFO L134 CoverageAnalysis]: Checked inductivity of 33197 backedges. 373 proven. 48 refuted. 0 times theorem prover too weak. 32776 trivial. 0 not checked. [2022-11-25 17:07:14,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:07:15,446 INFO L134 CoverageAnalysis]: Checked inductivity of 33197 backedges. 373 proven. 48 refuted. 0 times theorem prover too weak. 32776 trivial. 0 not checked. [2022-11-25 17:07:15,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:15,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997839078] [2022-11-25 17:07:15,446 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:07:15,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284370115] [2022-11-25 17:07:15,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284370115] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:07:15,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:07:15,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-11-25 17:07:15,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757825947] [2022-11-25 17:07:15,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:07:15,449 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 17:07:15,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:15,449 INFO L85 PathProgramCache]: Analyzing trace with hash 246645216, now seen corresponding path program 38 times [2022-11-25 17:07:15,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:15,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96737183] [2022-11-25 17:07:15,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:15,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:15,459 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:07:15,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [831808841] [2022-11-25 17:07:15,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:07:15,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:07:15,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:07:15,463 INFO L229 MonitoredProcess]: Starting monitored process 332 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:07:15,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (332)] Waiting until timeout for monitored process [2022-11-25 17:07:15,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:07:15,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:07:15,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-25 17:07:15,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:16,128 INFO L134 CoverageAnalysis]: Checked inductivity of 11663 backedges. 3747 proven. 186 refuted. 0 times theorem prover too weak. 7730 trivial. 0 not checked. [2022-11-25 17:07:16,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:07:18,375 INFO L134 CoverageAnalysis]: Checked inductivity of 11663 backedges. 86 proven. 3007 refuted. 0 times theorem prover too weak. 8570 trivial. 0 not checked. [2022-11-25 17:07:18,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:18,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96737183] [2022-11-25 17:07:18,376 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:07:18,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831808841] [2022-11-25 17:07:18,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831808841] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:07:18,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:07:18,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23] total 28 [2022-11-25 17:07:18,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20374484] [2022-11-25 17:07:18,376 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:07:18,377 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 17:07:18,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:18,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 17:07:18,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2022-11-25 17:07:18,378 INFO L87 Difference]: Start difference. First operand 6213 states and 9285 transitions. cyclomatic complexity: 3170 Second operand has 28 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 17 states have call successors, (24), 2 states have call predecessors, (24), 12 states have return successors, (31), 15 states have call predecessors, (31), 17 states have call successors, (31) [2022-11-25 17:07:20,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:20,098 INFO L93 Difference]: Finished difference Result 8650 states and 13664 transitions. [2022-11-25 17:07:20,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8650 states and 13664 transitions. [2022-11-25 17:07:20,141 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 844 [2022-11-25 17:07:20,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8650 states to 8476 states and 13357 transitions. [2022-11-25 17:07:20,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 834 [2022-11-25 17:07:20,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 834 [2022-11-25 17:07:20,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8476 states and 13357 transitions. [2022-11-25 17:07:20,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 17:07:20,193 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8476 states and 13357 transitions. [2022-11-25 17:07:20,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8476 states and 13357 transitions. [2022-11-25 17:07:20,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8476 to 6007. [2022-11-25 17:07:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6007 states, 3786 states have (on average 1.0607501320655044) internal successors, (4016), 3813 states have internal predecessors, (4016), 1440 states have call successors, (1558), 689 states have call predecessors, (1558), 781 states have return successors, (3504), 1504 states have call predecessors, (3504), 1440 states have call successors, (3504) [2022-11-25 17:07:20,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6007 states to 6007 states and 9078 transitions. [2022-11-25 17:07:20,317 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6007 states and 9078 transitions. [2022-11-25 17:07:20,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-25 17:07:20,318 INFO L428 stractBuchiCegarLoop]: Abstraction has 6007 states and 9078 transitions. [2022-11-25 17:07:20,318 INFO L335 stractBuchiCegarLoop]: ======== Iteration 59 ============ [2022-11-25 17:07:20,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6007 states and 9078 transitions. [2022-11-25 17:07:20,332 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 557 [2022-11-25 17:07:20,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:07:20,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:07:20,335 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [118, 118, 70, 70, 70, 70, 48, 17, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 3, 3, 1, 1, 1, 1] [2022-11-25 17:07:20,335 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [68, 68, 50, 50, 50, 50, 18, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:20,336 INFO L748 eck$LassoCheckResult]: Stem: 721870#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 721848#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; 721849#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 721869#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; 721892#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 725963#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 725961#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 721832#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 721833#factENTRY ~n := #in~n; 726898#L25 assume ~n <= 0;#res := 1; 726895#factFINAL assume true; 726891#factEXIT >#68#return; 721887#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 721888#factENTRY ~n := #in~n; 726310#L25 assume ~n <= 0;#res := 1; 726309#factFINAL assume true; 726305#factEXIT >#70#return; 721829#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 721830#factENTRY ~n := #in~n; 725987#L25 assume ~n <= 0;#res := 1; 725986#factFINAL assume true; 725985#factEXIT >#72#return; 721868#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 721866#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 721867#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 727137#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 727211#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 727175#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 727176#factENTRY ~n := #in~n; 727187#L25 assume !(~n <= 0); 727183#L26 call #t~ret0 := fact(~n - 1);< 727184#factENTRY ~n := #in~n; 727194#L25 assume ~n <= 0;#res := 1; 727192#factFINAL assume true; 727182#factEXIT >#66#return; 727180#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 727178#factFINAL assume true; 727177#factEXIT >#74#return; 727161#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 727163#factENTRY ~n := #in~n; 727171#L25 assume ~n <= 0;#res := 1; 727170#factFINAL assume true; 727160#factEXIT >#76#return; 727154#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 727157#factENTRY ~n := #in~n; 727169#L25 assume !(~n <= 0); 727167#L26 call #t~ret0 := fact(~n - 1);< 727168#factENTRY ~n := #in~n; 727197#L25 assume ~n <= 0;#res := 1; 727196#factFINAL assume true; 727166#factEXIT >#66#return; 727165#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 727159#factFINAL assume true; 727153#factEXIT >#78#return; 727147#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; 727140#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 727141#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 727122#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 721872#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 721807#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 721808#factENTRY ~n := #in~n; 727723#L25 assume !(~n <= 0); 727719#L26 call #t~ret0 := fact(~n - 1);< 727721#factENTRY ~n := #in~n; 727728#L25 assume !(~n <= 0); 727720#L26 call #t~ret0 := fact(~n - 1);< 727726#factENTRY ~n := #in~n; 727729#L25 assume ~n <= 0;#res := 1; 727727#factFINAL assume true; 727725#factEXIT >#66#return; 727724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 727722#factFINAL assume true; 727718#factEXIT >#66#return; 727717#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 727708#factFINAL assume true; 727705#factEXIT >#74#return; 721890#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 721891#factENTRY ~n := #in~n; 727748#L25 assume ~n <= 0;#res := 1; 727749#factFINAL assume true; 727776#factEXIT >#76#return; 727758#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 727760#factENTRY ~n := #in~n; 727777#L25 assume !(~n <= 0); 727408#L26 call #t~ret0 := fact(~n - 1);< 727444#factENTRY ~n := #in~n; 727455#L25 assume !(~n <= 0); 727410#L26 call #t~ret0 := fact(~n - 1);< 727451#factENTRY ~n := #in~n; 727454#L25 assume ~n <= 0;#res := 1; 727453#factFINAL assume true; 727450#factEXIT >#66#return; 727448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 727446#factFINAL assume true; 727442#factEXIT >#66#return; 727412#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 727778#factFINAL assume true; 727759#factEXIT >#78#return; 727755#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; 727754#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 727753#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 727752#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 727751#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 727104#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 727105#factENTRY ~n := #in~n; 727148#L25 assume !(~n <= 0); 727149#L26 call #t~ret0 := fact(~n - 1);< 727303#factENTRY ~n := #in~n; 727276#L25 assume !(~n <= 0); 727223#L26 call #t~ret0 := fact(~n - 1);< 727249#factENTRY ~n := #in~n; 727276#L25 assume !(~n <= 0); 727223#L26 call #t~ret0 := fact(~n - 1);< 727249#factENTRY ~n := #in~n; 727297#L25 assume ~n <= 0;#res := 1; 727298#factFINAL assume true; 727306#factEXIT >#66#return; 727291#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 727292#factFINAL assume true; 727247#factEXIT >#66#return; 727248#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 727222#factFINAL assume true; 727224#factEXIT >#66#return; 727138#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 727139#factFINAL assume true; 727103#factEXIT >#74#return; 727041#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 727055#factENTRY ~n := #in~n; 727056#L25 assume ~n <= 0;#res := 1; 727046#factFINAL assume true; 727040#factEXIT >#76#return; 726027#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 726028#factENTRY ~n := #in~n; 727336#L25 assume !(~n <= 0); 727066#L26 call #t~ret0 := fact(~n - 1);< 727091#factENTRY ~n := #in~n; 727309#L25 assume !(~n <= 0); 727068#L26 call #t~ret0 := fact(~n - 1);< 727077#factENTRY ~n := #in~n; 727120#L25 assume !(~n <= 0); 727070#L26 call #t~ret0 := fact(~n - 1);< 727118#factENTRY ~n := #in~n; 727121#L25 assume ~n <= 0;#res := 1; 727119#factFINAL assume true; 727117#factEXIT >#66#return; 727116#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 727115#factFINAL assume true; 727114#factEXIT >#66#return; 727113#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 727112#factFINAL assume true; 727065#factEXIT >#66#return; 727073#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 727245#factFINAL assume true; 727244#factEXIT >#78#return; 726023#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; 726009#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 725994#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 725992#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 725990#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 725988#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 725983#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 725785#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 725738#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 725740#factENTRY ~n := #in~n; 725750#L25 assume !(~n <= 0); 725747#L26 call #t~ret0 := fact(~n - 1);< 725748#factENTRY ~n := #in~n; 725756#L25 assume ~n <= 0;#res := 1; 725754#factFINAL assume true; 725746#factEXIT >#66#return; 725745#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 725742#factFINAL assume true; 725736#factEXIT >#68#return; 725731#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 725734#factENTRY ~n := #in~n; 725760#L25 assume ~n <= 0;#res := 1; 725759#factFINAL assume true; 725730#factEXIT >#70#return; 725724#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 725728#factENTRY ~n := #in~n; 725765#L25 assume !(~n <= 0); 725676#L26 call #t~ret0 := fact(~n - 1);< 725763#factENTRY ~n := #in~n; 725774#L25 assume ~n <= 0;#res := 1; 725771#factFINAL assume true; 725682#factEXIT >#66#return; 725687#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 725762#factFINAL assume true; 725722#factEXIT >#72#return; 725721#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 725720#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 725719#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 725717#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 725715#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 725705#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 725708#factENTRY ~n := #in~n; 725766#L25 assume !(~n <= 0); 725685#L26 call #t~ret0 := fact(~n - 1);< 725691#factENTRY ~n := #in~n; 725774#L25 assume ~n <= 0;#res := 1; 725771#factFINAL assume true; 725682#factEXIT >#66#return; 725690#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 725764#factFINAL assume true; 725704#factEXIT >#68#return; 725649#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 725652#factENTRY ~n := #in~n; 725775#L25 assume !(~n <= 0); 725683#L26 call #t~ret0 := fact(~n - 1);< 725691#factENTRY ~n := #in~n; 725774#L25 assume ~n <= 0;#res := 1; 725771#factFINAL assume true; 725682#factEXIT >#66#return; 725672#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 725668#factFINAL assume true; 725648#factEXIT >#70#return; 725642#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 725646#factENTRY ~n := #in~n; 725718#L25 assume ~n <= 0;#res := 1; 725716#factFINAL assume true; 725640#factEXIT >#72#return; 725645#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 725700#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 725699#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 725698#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 725696#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 725613#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 725616#factENTRY ~n := #in~n; 725692#L25 assume !(~n <= 0); 725674#L26 call #t~ret0 := fact(~n - 1);< 725681#factENTRY ~n := #in~n; 725895#L25 assume !(~n <= 0); 725678#L26 call #t~ret0 := fact(~n - 1);< 725894#factENTRY ~n := #in~n; 725781#L25 assume ~n <= 0;#res := 1; 725779#factFINAL assume true; 725776#factEXIT >#66#return; 725773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 725767#factFINAL assume true; 725673#factEXIT >#66#return; 725671#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 725670#factFINAL assume true; 725611#factEXIT >#74#return; 725606#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 725608#factENTRY ~n := #in~n; 725714#L25 assume !(~n <= 0); 725619#L26 call #t~ret0 := fact(~n - 1);< 725620#factENTRY ~n := #in~n; 725624#L25 assume ~n <= 0;#res := 1; 725623#factFINAL assume true; 725618#factEXIT >#66#return; 725617#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 725610#factFINAL assume true; 725605#factEXIT >#76#return; 725599#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 725602#factENTRY ~n := #in~n; 725669#L25 assume !(~n <= 0); 725654#L26 call #t~ret0 := fact(~n - 1);< 725667#factENTRY ~n := #in~n; 725749#L25 assume ~n <= 0;#res := 1; 725743#factFINAL assume true; 725653#factEXIT >#66#return; 725609#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 725604#factFINAL assume true; 725596#factEXIT >#78#return; 725593#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; 725590#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 725587#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 725583#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 725581#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 725543#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 725552#factENTRY ~n := #in~n; 725547#L25 assume !(~n <= 0); 725533#L26 call #t~ret0 := fact(~n - 1);< 725537#factENTRY ~n := #in~n; 725554#L25 assume !(~n <= 0); 725534#L26 call #t~ret0 := fact(~n - 1);< 725551#factENTRY ~n := #in~n; 725554#L25 assume !(~n <= 0); 725534#L26 call #t~ret0 := fact(~n - 1);< 725551#factENTRY ~n := #in~n; 725561#L25 assume ~n <= 0;#res := 1; 725560#factFINAL assume true; 725559#factEXIT >#66#return; 725558#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 725557#factFINAL assume true; 725556#factEXIT >#66#return; 725555#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 725553#factFINAL assume true; 725548#factEXIT >#66#return; 725549#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 725576#factFINAL assume true; 725575#factEXIT >#74#return; 725459#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 725466#factENTRY ~n := #in~n; 725463#L25 assume !(~n <= 0); 725420#L26 call #t~ret0 := fact(~n - 1);< 725461#factENTRY ~n := #in~n; 725438#L25 assume ~n <= 0;#res := 1; 725439#factFINAL assume true; 725416#factEXIT >#66#return; 725422#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 725566#factFINAL assume true; 725565#factEXIT >#76#return; 725412#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 725521#factENTRY ~n := #in~n; 725519#L25 assume !(~n <= 0); 725423#L26 call #t~ret0 := fact(~n - 1);< 725424#factENTRY ~n := #in~n; 725442#L25 assume !(~n <= 0); 725431#L26 call #t~ret0 := fact(~n - 1);< 725445#factENTRY ~n := #in~n; 725449#L25 assume ~n <= 0;#res := 1; 725447#factFINAL assume true; 725443#factEXIT >#66#return; 725440#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 725425#factFINAL assume true; 725435#factEXIT >#66#return; 725475#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 725409#factFINAL assume true; 725413#factEXIT >#78#return; 725396#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; 725394#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 725391#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 725388#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 725385#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 725380#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 725370#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 724875#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 724667#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 724668#factENTRY ~n := #in~n; 724678#L25 assume !(~n <= 0); 724676#L26 call #t~ret0 := fact(~n - 1);< 724677#factENTRY ~n := #in~n; 724696#L25 assume !(~n <= 0); 724675#L26 call #t~ret0 := fact(~n - 1);< 724686#factENTRY ~n := #in~n; 724694#L25 assume ~n <= 0;#res := 1; 724692#factFINAL assume true; 724685#factEXIT >#66#return; 724681#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 724679#factFINAL assume true; 724674#factEXIT >#66#return; 724672#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 724670#factFINAL assume true; 724665#factEXIT >#68#return; 724653#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 724654#factENTRY ~n := #in~n; 724858#L25 assume ~n <= 0;#res := 1; 724855#factFINAL assume true; 724651#factEXIT >#70#return; 724647#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 724650#factENTRY ~n := #in~n; 724857#L25 assume !(~n <= 0); 724662#L26 call #t~ret0 := fact(~n - 1);< 724664#factENTRY ~n := #in~n; 724687#L25 assume !(~n <= 0); 724683#L26 call #t~ret0 := fact(~n - 1);< 724684#factENTRY ~n := #in~n; 724859#L25 assume ~n <= 0;#res := 1; 724856#factFINAL assume true; 724682#factEXIT >#66#return; 724680#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 724671#factFINAL assume true; 724660#factEXIT >#66#return; 724659#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 724657#factFINAL assume true; 724646#factEXIT >#72#return; 724649#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 724538#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 724539#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 724531#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 724532#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 724510#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 724513#factENTRY ~n := #in~n; 724673#L25 assume !(~n <= 0); 724661#L26 call #t~ret0 := fact(~n - 1);< 724664#factENTRY ~n := #in~n; 724687#L25 assume !(~n <= 0); 724683#L26 call #t~ret0 := fact(~n - 1);< 724684#factENTRY ~n := #in~n; 724859#L25 assume ~n <= 0;#res := 1; 724856#factFINAL assume true; 724682#factEXIT >#66#return; 724680#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 724671#factFINAL assume true; 724660#factEXIT >#66#return; 724663#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 724522#factFINAL assume true; 724506#factEXIT >#68#return; 724511#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 724534#factENTRY ~n := #in~n; 724778#L25 assume !(~n <= 0); 724773#L26 call #t~ret0 := fact(~n - 1);< 724775#factENTRY ~n := #in~n; 724779#L25 assume ~n <= 0;#res := 1; 724777#factFINAL assume true; 724771#factEXIT >#66#return; 724774#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 724780#factFINAL assume true; 724533#factEXIT >#70#return; 724527#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 724530#factENTRY ~n := #in~n; 724776#L25 assume !(~n <= 0); 724772#L26 call #t~ret0 := fact(~n - 1);< 724775#factENTRY ~n := #in~n; 724779#L25 assume ~n <= 0;#res := 1; 724777#factFINAL assume true; 724771#factEXIT >#66#return; 724769#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 724767#factFINAL assume true; 724526#factEXIT >#72#return; 724529#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 724520#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 724521#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 724516#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 724517#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 724509#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 724513#factENTRY ~n := #in~n; 724673#L25 assume !(~n <= 0); 724661#L26 call #t~ret0 := fact(~n - 1);< 724664#factENTRY ~n := #in~n; 724687#L25 assume !(~n <= 0); 724683#L26 call #t~ret0 := fact(~n - 1);< 724684#factENTRY ~n := #in~n; 724859#L25 assume ~n <= 0;#res := 1; 724856#factFINAL assume true; 724682#factEXIT >#66#return; 724680#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 724671#factFINAL assume true; 724660#factEXIT >#66#return; 724663#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 724522#factFINAL assume true; 724506#factEXIT >#68#return; 724501#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 724502#factENTRY ~n := #in~n; 724797#L25 assume !(~n <= 0); 724563#L26 call #t~ret0 := fact(~n - 1);< 724567#factENTRY ~n := #in~n; 724792#L25 assume !(~n <= 0); 724790#L26 call #t~ret0 := fact(~n - 1);< 724791#factENTRY ~n := #in~n; 724794#L25 assume ~n <= 0;#res := 1; 724793#factFINAL assume true; 724789#factEXIT >#66#return; 724788#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 724784#factFINAL assume true; 724562#factEXIT >#66#return; 724545#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 724543#factFINAL assume true; 724499#factEXIT >#70#return; 724423#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 724426#factENTRY ~n := #in~n; 724443#L25 assume ~n <= 0;#res := 1; 724439#factFINAL assume true; 724422#factEXIT >#72#return; 724425#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 724410#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 724411#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 724405#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 724388#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 724385#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 724386#factENTRY ~n := #in~n; 724395#L25 assume !(~n <= 0); 724392#L26 call #t~ret0 := fact(~n - 1);< 724393#factENTRY ~n := #in~n; 724400#L25 assume !(~n <= 0); 724391#L26 call #t~ret0 := fact(~n - 1);< 724398#factENTRY ~n := #in~n; 724400#L25 assume !(~n <= 0); 724391#L26 call #t~ret0 := fact(~n - 1);< 724398#factENTRY ~n := #in~n; 724404#L25 assume ~n <= 0;#res := 1; 724403#factFINAL assume true; 724402#factEXIT >#66#return; 724401#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 724399#factFINAL assume true; 724397#factEXIT >#66#return; 724396#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 724394#factFINAL assume true; 724390#factEXIT >#66#return; 724389#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 724387#factFINAL assume true; 724384#factEXIT >#74#return; 724375#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 724376#factENTRY ~n := #in~n; 724871#L25 assume !(~n <= 0); 724757#L26 call #t~ret0 := fact(~n - 1);< 724759#factENTRY ~n := #in~n; 724905#L25 assume !(~n <= 0); 724901#L26 call #t~ret0 := fact(~n - 1);< 724906#factENTRY ~n := #in~n; 724907#L25 assume ~n <= 0;#res := 1; 724924#factFINAL assume true; 724918#factEXIT >#66#return; 724920#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 724925#factFINAL assume true; 724921#factEXIT >#66#return; 724754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 724750#factFINAL assume true; 724374#factEXIT >#76#return; 724333#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 724338#factENTRY ~n := #in~n; 724337#L25 assume !(~n <= 0); 724267#L26 call #t~ret0 := fact(~n - 1);< 724331#factENTRY ~n := #in~n; 724336#L25 assume ~n <= 0;#res := 1; 724332#factFINAL assume true; 724328#factEXIT >#66#return; 724329#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 725399#factFINAL assume true; 725397#factEXIT >#78#return; 724242#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; 725393#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 725390#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 725387#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 725384#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 725379#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 725372#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 722733#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 721813#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 721831#factENTRY ~n := #in~n; 722656#L25 assume !(~n <= 0); 722593#L26 call #t~ret0 := fact(~n - 1);< 722595#factENTRY ~n := #in~n; 722658#L25 assume !(~n <= 0); 722591#L26 call #t~ret0 := fact(~n - 1);< 722604#factENTRY ~n := #in~n; 722658#L25 assume !(~n <= 0); 722591#L26 call #t~ret0 := fact(~n - 1);< 722604#factENTRY ~n := #in~n; 722662#L25 assume ~n <= 0;#res := 1; 722661#factFINAL assume true; 722660#factEXIT >#66#return; 722659#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722657#factFINAL assume true; 722603#factEXIT >#66#return; 722601#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722596#factFINAL assume true; 722590#factEXIT >#66#return; 722589#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722586#factFINAL assume true; 722583#factEXIT >#68#return; 722570#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 721886#factENTRY ~n := #in~n; 722610#L25 assume ~n <= 0;#res := 1; 722608#factFINAL assume true; 722568#factEXIT >#70#return; 722205#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 722567#factENTRY ~n := #in~n; 722609#L25 assume !(~n <= 0); 722123#L26 call #t~ret0 := fact(~n - 1);< 722202#factENTRY ~n := #in~n; 722197#L25 assume !(~n <= 0); 722145#L26 call #t~ret0 := fact(~n - 1);< 722153#factENTRY ~n := #in~n; 722199#L25 assume !(~n <= 0); 722162#L26 call #t~ret0 := fact(~n - 1);< 722192#factENTRY ~n := #in~n; 722209#L25 assume ~n <= 0;#res := 1; 722195#factFINAL assume true; 722189#factEXIT >#66#return; 722188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722169#factFINAL assume true; 722161#factEXIT >#66#return; 722160#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722154#factFINAL assume true; 722144#factEXIT >#66#return; 722151#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722664#factFINAL assume true; 722563#factEXIT >#72#return; 722564#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 722745#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 722736#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 722735#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 722734#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 722155#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 722332#factENTRY ~n := #in~n; 722331#L25 assume !(~n <= 0); 722107#L26 call #t~ret0 := fact(~n - 1);< 722159#factENTRY ~n := #in~n; 722291#L25 assume !(~n <= 0); 722088#L26 call #t~ret0 := fact(~n - 1);< 722152#factENTRY ~n := #in~n; 722198#L25 assume !(~n <= 0); 722100#L26 call #t~ret0 := fact(~n - 1);< 722191#factENTRY ~n := #in~n; 722209#L25 assume ~n <= 0;#res := 1; 722195#factFINAL assume true; 722189#factEXIT >#66#return; 722188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722169#factFINAL assume true; 722161#factEXIT >#66#return; 722160#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722154#factFINAL assume true; 722144#factEXIT >#66#return; 722150#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722449#factFINAL assume true; 722405#factEXIT >#68#return; 722223#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 722273#factENTRY ~n := #in~n; 722271#L25 assume !(~n <= 0); 722125#L26 call #t~ret0 := fact(~n - 1);< 722230#factENTRY ~n := #in~n; 722607#L25 assume ~n <= 0;#res := 1; 722500#factFINAL assume true; 722487#factEXIT >#66#return; 722489#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722559#factFINAL assume true; 722555#factEXIT >#70#return; 722171#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 722308#factENTRY ~n := #in~n; 722506#L25 assume !(~n <= 0); 722163#L26 call #t~ret0 := fact(~n - 1);< 722168#factENTRY ~n := #in~n; 722203#L25 assume !(~n <= 0); 722190#L26 call #t~ret0 := fact(~n - 1);< 722194#factENTRY ~n := #in~n; 722209#L25 assume ~n <= 0;#res := 1; 722195#factFINAL assume true; 722189#factEXIT >#66#return; 722188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722169#factFINAL assume true; 722161#factEXIT >#66#return; 722166#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722541#factFINAL assume true; 722515#factEXIT >#72#return; 722522#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 724869#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 724868#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 724867#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 724866#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 722436#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 722453#factENTRY ~n := #in~n; 722452#L25 assume !(~n <= 0); 722122#L26 call #t~ret0 := fact(~n - 1);< 722202#factENTRY ~n := #in~n; 722197#L25 assume !(~n <= 0); 722145#L26 call #t~ret0 := fact(~n - 1);< 722153#factENTRY ~n := #in~n; 722199#L25 assume !(~n <= 0); 722162#L26 call #t~ret0 := fact(~n - 1);< 722192#factENTRY ~n := #in~n; 722209#L25 assume ~n <= 0;#res := 1; 722195#factFINAL assume true; 722189#factEXIT >#66#return; 722188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722169#factFINAL assume true; 722161#factEXIT >#66#return; 722160#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722154#factFINAL assume true; 722144#factEXIT >#66#return; 722150#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722449#factFINAL assume true; 722405#factEXIT >#68#return; 722250#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 722275#factENTRY ~n := #in~n; 722272#L25 assume !(~n <= 0); 722126#L26 call #t~ret0 := fact(~n - 1);< 722204#factENTRY ~n := #in~n; 722200#L25 assume !(~n <= 0); 722147#L26 call #t~ret0 := fact(~n - 1);< 722193#factENTRY ~n := #in~n; 722209#L25 assume ~n <= 0;#res := 1; 722195#factFINAL assume true; 722189#factEXIT >#66#return; 722188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722169#factFINAL assume true; 722161#factEXIT >#66#return; 722167#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722512#factFINAL assume true; 722497#factEXIT >#70#return; 722294#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 722307#factENTRY ~n := #in~n; 722293#L25 assume !(~n <= 0); 722164#L26 call #t~ret0 := fact(~n - 1);< 722490#factENTRY ~n := #in~n; 722607#L25 assume ~n <= 0;#res := 1; 722500#factFINAL assume true; 722487#factEXIT >#66#return; 722482#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722480#factFINAL assume true; 722471#factEXIT >#72#return; 722477#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 724200#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 724199#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 724198#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 724197#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 722422#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 722453#factENTRY ~n := #in~n; 722452#L25 assume !(~n <= 0); 722122#L26 call #t~ret0 := fact(~n - 1);< 722202#factENTRY ~n := #in~n; 722197#L25 assume !(~n <= 0); 722145#L26 call #t~ret0 := fact(~n - 1);< 722153#factENTRY ~n := #in~n; 722199#L25 assume !(~n <= 0); 722162#L26 call #t~ret0 := fact(~n - 1);< 722192#factENTRY ~n := #in~n; 722203#L25 assume !(~n <= 0); 722190#L26 call #t~ret0 := fact(~n - 1);< 722194#factENTRY ~n := #in~n; 722209#L25 assume ~n <= 0;#res := 1; 722195#factFINAL assume true; 722189#factEXIT >#66#return; 722188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722169#factFINAL assume true; 722161#factEXIT >#66#return; 722160#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722154#factFINAL assume true; 722144#factEXIT >#66#return; 722143#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722132#factFINAL assume true; 722119#factEXIT >#66#return; 722130#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722445#factFINAL assume true; 722446#factEXIT >#68#return; 722255#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 722275#factENTRY ~n := #in~n; 722272#L25 assume !(~n <= 0); 722126#L26 call #t~ret0 := fact(~n - 1);< 722204#factENTRY ~n := #in~n; 722200#L25 assume !(~n <= 0); 722147#L26 call #t~ret0 := fact(~n - 1);< 722193#factENTRY ~n := #in~n; 722199#L25 assume !(~n <= 0); 722162#L26 call #t~ret0 := fact(~n - 1);< 722192#factENTRY ~n := #in~n; 722203#L25 assume !(~n <= 0); 722190#L26 call #t~ret0 := fact(~n - 1);< 722194#factENTRY ~n := #in~n; 722209#L25 assume ~n <= 0;#res := 1; 722195#factFINAL assume true; 722189#factEXIT >#66#return; 722188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722169#factFINAL assume true; 722161#factEXIT >#66#return; 722160#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722154#factFINAL assume true; 722144#factEXIT >#66#return; 722143#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722132#factFINAL assume true; 722119#factEXIT >#66#return; 722130#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722445#factFINAL assume true; 722446#factEXIT >#70#return; 722367#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 722404#factENTRY ~n := #in~n; 722587#L25 assume ~n <= 0;#res := 1; 722549#factFINAL assume true; 722364#factEXIT >#72#return; 722386#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 724072#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 724070#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 724071#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 724066#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 722311#L30-5 [2022-11-25 17:07:20,336 INFO L750 eck$LassoCheckResult]: Loop: 722311#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 724160#factENTRY ~n := #in~n; 724156#L25 assume !(~n <= 0); 724142#L26 call #t~ret0 := fact(~n - 1);< 724154#factENTRY ~n := #in~n; 724227#L25 assume !(~n <= 0); 724140#L26 call #t~ret0 := fact(~n - 1);< 724164#factENTRY ~n := #in~n; 724173#L25 assume !(~n <= 0); 724144#L26 call #t~ret0 := fact(~n - 1);< 724171#factENTRY ~n := #in~n; 724173#L25 assume !(~n <= 0); 724144#L26 call #t~ret0 := fact(~n - 1);< 724171#factENTRY ~n := #in~n; 724173#L25 assume !(~n <= 0); 724144#L26 call #t~ret0 := fact(~n - 1);< 724171#factENTRY ~n := #in~n; 724215#L25 assume ~n <= 0;#res := 1; 724213#factFINAL assume true; 724187#factEXIT >#66#return; 724186#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 724175#factFINAL assume true; 724170#factEXIT >#66#return; 724169#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 724168#factFINAL assume true; 724163#factEXIT >#66#return; 724162#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 724161#factFINAL assume true; 724157#factEXIT >#66#return; 724155#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 724153#factFINAL assume true; 724151#factEXIT >#66#return; 724152#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 725145#factFINAL assume true; 725194#factEXIT >#74#return; 721835#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 721889#factENTRY ~n := #in~n; 723904#L25 assume !(~n <= 0); 723901#L26 call #t~ret0 := fact(~n - 1);< 723902#factENTRY ~n := #in~n; 723922#L25 assume !(~n <= 0); 723918#L26 call #t~ret0 := fact(~n - 1);< 723920#factENTRY ~n := #in~n; 723928#L25 assume !(~n <= 0); 723925#L26 call #t~ret0 := fact(~n - 1);< 723926#factENTRY ~n := #in~n; 723934#L25 assume !(~n <= 0); 723931#L26 call #t~ret0 := fact(~n - 1);< 723932#factENTRY ~n := #in~n; 723912#L25 assume ~n <= 0;#res := 1; 723933#factFINAL assume true; 723930#factEXIT >#66#return; 723929#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 723927#factFINAL assume true; 723924#factEXIT >#66#return; 723923#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 723921#factFINAL assume true; 723917#factEXIT >#66#return; 723916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 723915#factFINAL assume true; 723913#factEXIT >#66#return; 723914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 725193#factFINAL assume true; 725192#factEXIT >#76#return; 723938#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 723943#factENTRY ~n := #in~n; 723942#L25 assume !(~n <= 0); 723703#L26 call #t~ret0 := fact(~n - 1);< 723941#factENTRY ~n := #in~n; 723950#L25 assume ~n <= 0;#res := 1; 723949#factFINAL assume true; 723947#factEXIT >#66#return; 723946#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 723945#factFINAL assume true; 723944#factEXIT >#78#return; 723524#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; 725395#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 725392#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 725389#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 725386#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 725381#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 725371#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 724221#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 721816#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 722643#factENTRY ~n := #in~n; 722634#L25 assume !(~n <= 0); 722597#L26 call #t~ret0 := fact(~n - 1);< 722613#factENTRY ~n := #in~n; 722611#L25 assume !(~n <= 0); 722592#L26 call #t~ret0 := fact(~n - 1);< 722599#factENTRY ~n := #in~n; 722658#L25 assume !(~n <= 0); 722591#L26 call #t~ret0 := fact(~n - 1);< 722604#factENTRY ~n := #in~n; 722658#L25 assume !(~n <= 0); 722591#L26 call #t~ret0 := fact(~n - 1);< 722604#factENTRY ~n := #in~n; 722662#L25 assume ~n <= 0;#res := 1; 722661#factFINAL assume true; 722660#factEXIT >#66#return; 722659#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722657#factFINAL assume true; 722603#factEXIT >#66#return; 722601#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722596#factFINAL assume true; 722590#factEXIT >#66#return; 722594#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722654#factFINAL assume true; 722652#factEXIT >#66#return; 722650#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722647#factFINAL assume true; 722644#factEXIT >#68#return; 722578#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 721886#factENTRY ~n := #in~n; 722610#L25 assume ~n <= 0;#res := 1; 722608#factFINAL assume true; 722568#factEXIT >#70#return; 722218#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 722221#factENTRY ~n := #in~n; 722220#L25 assume !(~n <= 0); 722121#L26 call #t~ret0 := fact(~n - 1);< 722211#factENTRY ~n := #in~n; 722210#L25 assume !(~n <= 0); 722148#L26 call #t~ret0 := fact(~n - 1);< 722201#factENTRY ~n := #in~n; 722196#L25 assume !(~n <= 0); 722165#L26 call #t~ret0 := fact(~n - 1);< 722168#factENTRY ~n := #in~n; 722203#L25 assume !(~n <= 0); 722190#L26 call #t~ret0 := fact(~n - 1);< 722194#factENTRY ~n := #in~n; 722209#L25 assume ~n <= 0;#res := 1; 722195#factFINAL assume true; 722189#factEXIT >#66#return; 722188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722169#factFINAL assume true; 722161#factEXIT >#66#return; 722160#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722154#factFINAL assume true; 722144#factEXIT >#66#return; 722143#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722132#factFINAL assume true; 722119#factEXIT >#66#return; 722129#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722655#factFINAL assume true; 722635#factEXIT >#72#return; 722641#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 724220#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 724219#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 724218#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 724217#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 722140#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 722447#factENTRY ~n := #in~n; 723311#L25 assume !(~n <= 0); 722103#L26 call #t~ret0 := fact(~n - 1);< 722141#factENTRY ~n := #in~n; 724063#L25 assume !(~n <= 0); 722099#L26 call #t~ret0 := fact(~n - 1);< 722159#factENTRY ~n := #in~n; 722291#L25 assume !(~n <= 0); 722088#L26 call #t~ret0 := fact(~n - 1);< 722152#factENTRY ~n := #in~n; 722198#L25 assume !(~n <= 0); 722100#L26 call #t~ret0 := fact(~n - 1);< 722191#factENTRY ~n := #in~n; 722209#L25 assume ~n <= 0;#res := 1; 722195#factFINAL assume true; 722189#factEXIT >#66#return; 722188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722169#factFINAL assume true; 722161#factEXIT >#66#return; 722160#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722154#factFINAL assume true; 722144#factEXIT >#66#return; 722143#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722132#factFINAL assume true; 722119#factEXIT >#66#return; 722130#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722445#factFINAL assume true; 722446#factEXIT >#68#return; 722456#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 722560#factENTRY ~n := #in~n; 722629#L25 assume !(~n <= 0); 722488#L26 call #t~ret0 := fact(~n - 1);< 722505#factENTRY ~n := #in~n; 722607#L25 assume ~n <= 0;#res := 1; 722500#factFINAL assume true; 722487#factEXIT >#66#return; 722489#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722559#factFINAL assume true; 722555#factEXIT >#70#return; 722353#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 722363#factENTRY ~n := #in~n; 722347#L25 assume !(~n <= 0); 722120#L26 call #t~ret0 := fact(~n - 1);< 722202#factENTRY ~n := #in~n; 722197#L25 assume !(~n <= 0); 722145#L26 call #t~ret0 := fact(~n - 1);< 722153#factENTRY ~n := #in~n; 722199#L25 assume !(~n <= 0); 722162#L26 call #t~ret0 := fact(~n - 1);< 722192#factENTRY ~n := #in~n; 722209#L25 assume ~n <= 0;#res := 1; 722195#factFINAL assume true; 722189#factEXIT >#66#return; 722188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722169#factFINAL assume true; 722161#factEXIT >#66#return; 722160#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722154#factFINAL assume true; 722144#factEXIT >#66#return; 722149#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722588#factFINAL assume true; 722550#factEXIT >#72#return; 722554#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 724216#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 724214#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 724212#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 724211#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 722278#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 722290#factENTRY ~n := #in~n; 722289#L25 assume !(~n <= 0); 722124#L26 call #t~ret0 := fact(~n - 1);< 722276#factENTRY ~n := #in~n; 722274#L25 assume !(~n <= 0); 722146#L26 call #t~ret0 := fact(~n - 1);< 722153#factENTRY ~n := #in~n; 722199#L25 assume !(~n <= 0); 722162#L26 call #t~ret0 := fact(~n - 1);< 722192#factENTRY ~n := #in~n; 722203#L25 assume !(~n <= 0); 722190#L26 call #t~ret0 := fact(~n - 1);< 722194#factENTRY ~n := #in~n; 722209#L25 assume ~n <= 0;#res := 1; 722195#factFINAL assume true; 722189#factEXIT >#66#return; 722188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722169#factFINAL assume true; 722161#factEXIT >#66#return; 722160#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722154#factFINAL assume true; 722144#factEXIT >#66#return; 722143#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722132#factFINAL assume true; 722119#factEXIT >#66#return; 722130#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722445#factFINAL assume true; 722446#factEXIT >#68#return; 722241#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 722275#factENTRY ~n := #in~n; 722272#L25 assume !(~n <= 0); 722126#L26 call #t~ret0 := fact(~n - 1);< 722204#factENTRY ~n := #in~n; 722200#L25 assume !(~n <= 0); 722147#L26 call #t~ret0 := fact(~n - 1);< 722193#factENTRY ~n := #in~n; 722209#L25 assume ~n <= 0;#res := 1; 722195#factFINAL assume true; 722189#factEXIT >#66#return; 722188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722169#factFINAL assume true; 722161#factEXIT >#66#return; 722167#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722512#factFINAL assume true; 722497#factEXIT >#70#return; 722184#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 722308#factENTRY ~n := #in~n; 722506#L25 assume !(~n <= 0); 722163#L26 call #t~ret0 := fact(~n - 1);< 722168#factENTRY ~n := #in~n; 722203#L25 assume !(~n <= 0); 722190#L26 call #t~ret0 := fact(~n - 1);< 722194#factENTRY ~n := #in~n; 722209#L25 assume ~n <= 0;#res := 1; 722195#factFINAL assume true; 722189#factEXIT >#66#return; 722188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722169#factFINAL assume true; 722161#factEXIT >#66#return; 722166#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722541#factFINAL assume true; 722515#factEXIT >#72#return; 722517#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 724206#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 724205#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 724204#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 724203#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 722287#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 722290#factENTRY ~n := #in~n; 722289#L25 assume !(~n <= 0); 722124#L26 call #t~ret0 := fact(~n - 1);< 722276#factENTRY ~n := #in~n; 722274#L25 assume !(~n <= 0); 722146#L26 call #t~ret0 := fact(~n - 1);< 722153#factENTRY ~n := #in~n; 722199#L25 assume !(~n <= 0); 722162#L26 call #t~ret0 := fact(~n - 1);< 722192#factENTRY ~n := #in~n; 722203#L25 assume !(~n <= 0); 722190#L26 call #t~ret0 := fact(~n - 1);< 722194#factENTRY ~n := #in~n; 722209#L25 assume ~n <= 0;#res := 1; 722195#factFINAL assume true; 722189#factEXIT >#66#return; 722188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722169#factFINAL assume true; 722161#factEXIT >#66#return; 722160#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722154#factFINAL assume true; 722144#factEXIT >#66#return; 722143#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722132#factFINAL assume true; 722119#factEXIT >#66#return; 722130#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722445#factFINAL assume true; 722446#factEXIT >#68#return; 722246#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 722275#factENTRY ~n := #in~n; 722272#L25 assume !(~n <= 0); 722126#L26 call #t~ret0 := fact(~n - 1);< 722204#factENTRY ~n := #in~n; 722200#L25 assume !(~n <= 0); 722147#L26 call #t~ret0 := fact(~n - 1);< 722193#factENTRY ~n := #in~n; 722199#L25 assume !(~n <= 0); 722162#L26 call #t~ret0 := fact(~n - 1);< 722192#factENTRY ~n := #in~n; 722209#L25 assume ~n <= 0;#res := 1; 722195#factFINAL assume true; 722189#factEXIT >#66#return; 722188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722169#factFINAL assume true; 722161#factEXIT >#66#return; 722160#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722154#factFINAL assume true; 722144#factEXIT >#66#return; 722150#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722449#factFINAL assume true; 722405#factEXIT >#70#return; 722295#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 722307#factENTRY ~n := #in~n; 722293#L25 assume !(~n <= 0); 722164#L26 call #t~ret0 := fact(~n - 1);< 722490#factENTRY ~n := #in~n; 722607#L25 assume ~n <= 0;#res := 1; 722500#factFINAL assume true; 722487#factEXIT >#66#return; 722482#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722480#factFINAL assume true; 722471#factEXIT >#72#return; 722388#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 724202#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 724201#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 724177#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 724176#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 722279#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 722290#factENTRY ~n := #in~n; 722289#L25 assume !(~n <= 0); 722124#L26 call #t~ret0 := fact(~n - 1);< 722276#factENTRY ~n := #in~n; 722274#L25 assume !(~n <= 0); 722146#L26 call #t~ret0 := fact(~n - 1);< 722153#factENTRY ~n := #in~n; 722199#L25 assume !(~n <= 0); 722162#L26 call #t~ret0 := fact(~n - 1);< 722192#factENTRY ~n := #in~n; 722203#L25 assume !(~n <= 0); 722190#L26 call #t~ret0 := fact(~n - 1);< 722194#factENTRY ~n := #in~n; 722209#L25 assume ~n <= 0;#res := 1; 722195#factFINAL assume true; 722189#factEXIT >#66#return; 722188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722169#factFINAL assume true; 722161#factEXIT >#66#return; 722160#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722154#factFINAL assume true; 722144#factEXIT >#66#return; 722143#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722132#factFINAL assume true; 722119#factEXIT >#66#return; 722130#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722445#factFINAL assume true; 722446#factEXIT >#68#return; 722264#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 722275#factENTRY ~n := #in~n; 722272#L25 assume !(~n <= 0); 722126#L26 call #t~ret0 := fact(~n - 1);< 722204#factENTRY ~n := #in~n; 722200#L25 assume !(~n <= 0); 722147#L26 call #t~ret0 := fact(~n - 1);< 722193#factENTRY ~n := #in~n; 722199#L25 assume !(~n <= 0); 722162#L26 call #t~ret0 := fact(~n - 1);< 722192#factENTRY ~n := #in~n; 722203#L25 assume !(~n <= 0); 722190#L26 call #t~ret0 := fact(~n - 1);< 722194#factENTRY ~n := #in~n; 722209#L25 assume ~n <= 0;#res := 1; 722195#factFINAL assume true; 722189#factEXIT >#66#return; 722188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722169#factFINAL assume true; 722161#factEXIT >#66#return; 722160#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722154#factFINAL assume true; 722144#factEXIT >#66#return; 722143#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722132#factFINAL assume true; 722119#factEXIT >#66#return; 722130#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 722445#factFINAL assume true; 722446#factEXIT >#70#return; 722371#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 722404#factENTRY ~n := #in~n; 722587#L25 assume ~n <= 0;#res := 1; 722549#factFINAL assume true; 722364#factEXIT >#72#return; 722390#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 724167#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 724166#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 724165#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 723798#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 722311#L30-5 [2022-11-25 17:07:20,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:20,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1630772446, now seen corresponding path program 43 times [2022-11-25 17:07:20,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:20,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646141862] [2022-11-25 17:07:20,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:20,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:20,429 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:07:20,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2107462598] [2022-11-25 17:07:20,429 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 17:07:20,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:07:20,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:07:20,431 INFO L229 MonitoredProcess]: Starting monitored process 333 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:07:20,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (333)] Waiting until timeout for monitored process [2022-11-25 17:07:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:21,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 1699 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 17:07:21,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:21,368 INFO L134 CoverageAnalysis]: Checked inductivity of 33197 backedges. 5108 proven. 540 refuted. 0 times theorem prover too weak. 27549 trivial. 0 not checked. [2022-11-25 17:07:21,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:07:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 33197 backedges. 1892 proven. 653 refuted. 0 times theorem prover too weak. 30652 trivial. 0 not checked. [2022-11-25 17:07:22,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:22,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646141862] [2022-11-25 17:07:22,604 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:07:22,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107462598] [2022-11-25 17:07:22,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107462598] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:07:22,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:07:22,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 16 [2022-11-25 17:07:22,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188639041] [2022-11-25 17:07:22,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:07:22,606 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 17:07:22,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:22,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1313640272, now seen corresponding path program 39 times [2022-11-25 17:07:22,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:22,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98972972] [2022-11-25 17:07:22,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:22,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:22,621 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:07:22,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1588645728] [2022-11-25 17:07:22,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:07:22,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:07:22,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:07:22,626 INFO L229 MonitoredProcess]: Starting monitored process 334 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:07:22,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_088ff810-4e45-4313-9299-81efab011469/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (334)] Waiting until timeout for monitored process [2022-11-25 17:07:25,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 77 check-sat command(s) [2022-11-25 17:07:25,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 17:07:25,223 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:07:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:07:34,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace