./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 b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-numeric/Binomial.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a --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-b5237d8 [2022-11-21 13:55:00,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:55:00,232 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:55:00,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:55:00,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:55:00,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:55:00,271 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:55:00,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:55:00,276 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:55:00,283 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:55:00,285 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:55:00,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:55:00,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:55:00,293 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:55:00,297 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:55:00,298 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:55:00,299 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:55:00,300 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:55:00,302 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:55:00,303 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:55:00,305 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:55:00,308 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:55:00,311 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:55:00,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:55:00,326 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:55:00,326 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:55:00,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:55:00,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:55:00,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:55:00,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:55:00,329 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:55:00,330 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:55:00,331 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:55:00,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:55:00,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:55:00,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:55:00,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:55:00,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:55:00,339 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:55:00,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:55:00,341 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:55:00,342 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-11-21 13:55:00,384 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:55:00,385 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:55:00,386 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:55:00,386 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:55:00,388 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:55:00,388 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:55:00,388 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:55:00,388 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-21 13:55:00,389 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-21 13:55:00,389 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-21 13:55:00,390 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-21 13:55:00,390 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-21 13:55:00,391 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-21 13:55:00,391 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:55:00,391 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 13:55:00,391 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:55:00,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:55:00,392 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-21 13:55:00,392 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-21 13:55:00,392 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-21 13:55:00,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 13:55:00,393 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-21 13:55:00,393 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:55:00,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-21 13:55:00,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:55:00,393 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:55:00,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:55:00,394 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 13:55:00,396 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-21 13:55:00,396 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_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/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_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a 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-21 13:55:00,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:55:00,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:55:00,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:55:00,767 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:55:00,768 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:55:00,769 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/termination-numeric/Binomial.c [2022-11-21 13:55:03,791 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:55:03,953 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:55:03,954 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/sv-benchmarks/c/termination-numeric/Binomial.c [2022-11-21 13:55:03,964 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/data/62549f48a/d0e68abf98934c78ae637c875dc2f356/FLAG6e7c44950 [2022-11-21 13:55:03,980 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/data/62549f48a/d0e68abf98934c78ae637c875dc2f356 [2022-11-21 13:55:03,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:55:03,990 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:55:03,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:55:03,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:55:03,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:55:03,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:55:03" (1/1) ... [2022-11-21 13:55:03,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@267bfee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:03, skipping insertion in model container [2022-11-21 13:55:03,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:55:03" (1/1) ... [2022-11-21 13:55:04,006 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:55:04,031 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:55:04,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:55:04,238 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:55:04,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:55:04,298 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:55:04,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:04 WrapperNode [2022-11-21 13:55:04,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:55:04,326 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:55:04,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:55:04,327 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:55:04,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:04" (1/1) ... [2022-11-21 13:55:04,342 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:04" (1/1) ... [2022-11-21 13:55:04,378 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2022-11-21 13:55:04,378 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:55:04,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:55:04,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:55:04,379 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:55:04,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:04" (1/1) ... [2022-11-21 13:55:04,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:04" (1/1) ... [2022-11-21 13:55:04,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:04" (1/1) ... [2022-11-21 13:55:04,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:04" (1/1) ... [2022-11-21 13:55:04,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:04" (1/1) ... [2022-11-21 13:55:04,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:04" (1/1) ... [2022-11-21 13:55:04,397 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:04" (1/1) ... [2022-11-21 13:55:04,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:04" (1/1) ... [2022-11-21 13:55:04,399 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:55:04,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:55:04,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:55:04,400 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:55:04,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:04" (1/1) ... [2022-11-21 13:55:04,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:04,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:04,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:04,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-21 13:55:04,470 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2022-11-21 13:55:04,470 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2022-11-21 13:55:04,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:55:04,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:55:04,530 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:55:04,532 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:55:04,670 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:55:04,677 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:55:04,677 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-21 13:55:04,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:55:04 BoogieIcfgContainer [2022-11-21 13:55:04,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:55:04,680 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-21 13:55:04,680 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-21 13:55:04,684 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-21 13:55:04,685 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-21 13:55:04,685 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.11 01:55:03" (1/3) ... [2022-11-21 13:55:04,686 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1134e496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 01:55:04, skipping insertion in model container [2022-11-21 13:55:04,686 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-21 13:55:04,686 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:04" (2/3) ... [2022-11-21 13:55:04,687 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1134e496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 01:55:04, skipping insertion in model container [2022-11-21 13:55:04,687 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-21 13:55:04,687 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:55:04" (3/3) ... [2022-11-21 13:55:04,688 INFO L332 chiAutomizerObserver]: Analyzing ICFG Binomial.c [2022-11-21 13:55:04,745 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-21 13:55:04,745 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-21 13:55:04,745 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-21 13:55:04,745 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-21 13:55:04,745 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-21 13:55:04,745 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-21 13:55:04,746 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-21 13:55:04,746 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-21 13:55:04,750 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-21 13:55:04,802 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2022-11-21 13:55:04,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:55:04,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:55:04,808 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-21 13:55:04,808 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-21 13:55:04,808 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-21 13:55:04,809 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-21 13:55:04,828 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2022-11-21 13:55:04,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:55:04,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:55:04,829 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-21 13:55:04,829 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-21 13:55:04,837 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-21 13:55:04,837 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-21 13:55:04,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:04,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 1 times [2022-11-21 13:55:04,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:04,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822953080] [2022-11-21 13:55:04,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:04,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:04,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:05,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:05,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:05,023 INFO L85 PathProgramCache]: Analyzing trace with hash 57812, now seen corresponding path program 1 times [2022-11-21 13:55:05,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:05,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169686653] [2022-11-21 13:55:05,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:05,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:05,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:05,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:05,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:05,065 INFO L85 PathProgramCache]: Analyzing trace with hash 553673357, now seen corresponding path program 1 times [2022-11-21 13:55:05,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:05,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011788039] [2022-11-21 13:55:05,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:05,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:05,230 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-21 13:55:05,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:05,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011788039] [2022-11-21 13:55:05,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011788039] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:55:05,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:55:05,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:55:05,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572652589] [2022-11-21 13:55:05,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:55:05,310 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 13:55:05,311 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 13:55:05,311 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 13:55:05,311 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 13:55:05,312 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-21 13:55:05,312 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:05,312 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 13:55:05,312 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 13:55:05,312 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2022-11-21 13:55:05,313 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 13:55:05,313 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 13:55:05,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-21 13:55:05,341 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-21 13:55:05,397 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 13:55:05,398 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-21 13:55:05,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:05,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:05,407 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:05,415 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:55:05,415 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:05,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-21 13:55:05,444 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-21 13:55:05,445 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-21 13:55:05,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:05,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:05,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:05,453 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:05,463 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:55:05,464 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:05,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-21 13:55:05,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:05,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:05,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:05,498 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:05,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-21 13:55:05,508 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-21 13:55:05,508 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:05,693 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-21 13:55:05,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:05,699 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 13:55:05,699 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 13:55:05,699 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 13:55:05,700 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 13:55:05,700 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-21 13:55:05,700 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:05,700 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 13:55:05,700 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 13:55:05,700 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2022-11-21 13:55:05,700 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 13:55:05,701 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 13:55:05,702 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-21 13:55:05,708 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-21 13:55:05,779 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 13:55:05,783 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-21 13:55:05,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:05,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:05,798 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:05,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:05,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-21 13:55:05,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:05,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:05,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:05,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:05,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:05,826 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:05,826 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:05,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:05,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:05,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:05,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:05,851 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:05,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-21 13:55:05,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:05,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:05,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:05,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:05,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:05,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:05,868 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:05,868 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:05,878 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-21 13:55:05,886 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-11-21 13:55:05,886 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-11-21 13:55:05,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:05,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:05,922 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:05,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-11-21 13:55:05,924 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-21 13:55:05,925 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-21 13:55:05,925 INFO L513 LassoAnalysis]: Proved termination. [2022-11-21 13:55:05,925 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-21 13:55:05,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:05,938 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-21 13:55:05,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:05,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 13:55:05,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:06,005 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 13:55:06,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:06,091 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-21 13:55:06,125 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-21 13:55:06,127 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-21 13:55:06,215 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-21 13:55:06,217 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-21 13:55:06,222 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-21 13:55:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2022-11-21 13:55:06,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 3 letters. [2022-11-21 13:55:06,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:06,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 7 letters. Loop has 3 letters. [2022-11-21 13:55:06,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:06,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 6 letters. [2022-11-21 13:55:06,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:06,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 106 transitions. [2022-11-21 13:55:06,234 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2022-11-21 13:55:06,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 33 states and 48 transitions. [2022-11-21 13:55:06,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-11-21 13:55:06,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-11-21 13:55:06,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 48 transitions. [2022-11-21 13:55:06,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:55:06,245 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 48 transitions. [2022-11-21 13:55:06,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 48 transitions. [2022-11-21 13:55:06,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2022-11-21 13:55:06,275 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-21 13:55:06,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2022-11-21 13:55:06,277 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 42 transitions. [2022-11-21 13:55:06,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:06,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:55:06,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:55:06,282 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-21 13:55:06,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:06,340 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-11-21 13:55:06,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2022-11-21 13:55:06,342 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2022-11-21 13:55:06,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 37 transitions. [2022-11-21 13:55:06,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-11-21 13:55:06,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2022-11-21 13:55:06,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2022-11-21 13:55:06,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:55:06,345 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-11-21 13:55:06,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2022-11-21 13:55:06,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-11-21 13:55:06,348 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-21 13:55:06,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-11-21 13:55:06,349 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-11-21 13:55:06,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:55:06,351 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-11-21 13:55:06,351 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-21 13:55:06,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2022-11-21 13:55:06,353 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2022-11-21 13:55:06,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:55:06,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:55:06,354 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-21 13:55:06,354 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-21 13:55:06,355 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-21 13:55:06,355 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-21 13:55:06,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:06,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 2 times [2022-11-21 13:55:06,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:06,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645301133] [2022-11-21 13:55:06,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:06,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:06,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:06,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:06,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:06,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1284911041, now seen corresponding path program 1 times [2022-11-21 13:55:06,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:06,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099929307] [2022-11-21 13:55:06,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:06,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:06,387 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:06,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1973668156] [2022-11-21 13:55:06,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:06,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:06,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:06,395 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:06,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 13:55:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:06,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 13:55:06,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:06,530 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-21 13:55:06,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:55:06,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:06,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099929307] [2022-11-21 13:55:06,531 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:55:06,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973668156] [2022-11-21 13:55:06,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973668156] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:55:06,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:55:06,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:55:06,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159151954] [2022-11-21 13:55:06,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:55:06,534 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 13:55:06,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:06,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:55:06,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:55:06,537 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-21 13:55:06,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-11-21 13:55:06,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:06,663 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2022-11-21 13:55:06,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2022-11-21 13:55:06,665 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2022-11-21 13:55:06,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 50 transitions. [2022-11-21 13:55:06,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2022-11-21 13:55:06,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2022-11-21 13:55:06,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2022-11-21 13:55:06,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:55:06,668 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 50 transitions. [2022-11-21 13:55:06,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2022-11-21 13:55:06,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2022-11-21 13:55:06,672 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-21 13:55:06,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-11-21 13:55:06,674 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 42 transitions. [2022-11-21 13:55:06,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:55:06,675 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2022-11-21 13:55:06,675 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-21 13:55:06,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 42 transitions. [2022-11-21 13:55:06,677 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2022-11-21 13:55:06,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:55:06,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:55:06,678 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-21 13:55:06,678 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-21 13:55:06,678 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-21 13:55:06,679 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-21 13:55:06,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:06,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 3 times [2022-11-21 13:55:06,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:06,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842278361] [2022-11-21 13:55:06,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:06,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:06,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:06,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:06,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:06,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1183838151, now seen corresponding path program 1 times [2022-11-21 13:55:06,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:06,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951224746] [2022-11-21 13:55:06,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:06,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:06,717 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:06,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1903193703] [2022-11-21 13:55:06,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:06,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:06,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:06,729 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:06,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 13:55:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:06,797 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:06,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:06,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:06,824 INFO L85 PathProgramCache]: Analyzing trace with hash 2107943858, now seen corresponding path program 1 times [2022-11-21 13:55:06,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:06,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309199892] [2022-11-21 13:55:06,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:06,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:06,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:06,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309199892] [2022-11-21 13:55:06,843 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-11-21 13:55:06,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488976782] [2022-11-21 13:55:06,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:06,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:06,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:06,848 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:06,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 13:55:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:06,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 13:55:06,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:06,971 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-21 13:55:06,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:55:06,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488976782] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:55:06,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:55:06,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:55:06,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055360527] [2022-11-21 13:55:06,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:55:07,480 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 13:55:07,481 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 13:55:07,481 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 13:55:07,481 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 13:55:07,481 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-21 13:55:07,481 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:07,481 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 13:55:07,481 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 13:55:07,482 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2022-11-21 13:55:07,482 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 13:55:07,482 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 13:55:07,484 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-21 13:55:07,487 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-21 13:55:07,522 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-21 13:55:07,525 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-21 13:55:07,527 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-21 13:55:07,530 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-21 13:55:07,533 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-21 13:55:07,879 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 13:55:07,879 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-21 13:55:07,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:07,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:07,883 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:07,892 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:55:07,892 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:07,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-11-21 13:55:07,915 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-21 13:55:07,915 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-21 13:55:07,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:07,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:07,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:07,924 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:07,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-11-21 13:55:07,931 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:55:07,932 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:07,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:07,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:07,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:07,961 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:07,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-11-21 13:55:07,975 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-21 13:55:07,975 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:08,014 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-21 13:55:08,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:08,024 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 13:55:08,024 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 13:55:08,025 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 13:55:08,025 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 13:55:08,025 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-21 13:55:08,025 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:08,025 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 13:55:08,025 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 13:55:08,025 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2022-11-21 13:55:08,025 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 13:55:08,025 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 13:55:08,027 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-21 13:55:08,032 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-21 13:55:08,036 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-21 13:55:08,038 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-21 13:55:08,041 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-21 13:55:08,043 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-21 13:55:08,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-21 13:55:08,460 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 13:55:08,460 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-21 13:55:08,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:08,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:08,466 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:08,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-11-21 13:55:08,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:08,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:08,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:08,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:08,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:08,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:08,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:08,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:08,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:08,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:08,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:08,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:08,492 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:08,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-11-21 13:55:08,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:08,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:08,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:08,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:08,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:08,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:08,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:08,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:08,530 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:08,534 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:08,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:08,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:08,536 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:08,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-11-21 13:55:08,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-21 13:55:08,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:08,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:08,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:08,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:08,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:08,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:08,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:08,578 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:08,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:08,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:08,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:08,584 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:08,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:08,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:08,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:08,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:08,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:08,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:08,610 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:08,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:08,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-11-21 13:55:08,623 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:08,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:08,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:08,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:08,634 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:08,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-11-21 13:55:08,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:08,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:08,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:08,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:08,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:08,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:08,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:08,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:08,670 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:08,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:08,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:08,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:08,677 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:08,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 13:55:08,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-11-21 13:55:08,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:08,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:08,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:08,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:08,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:08,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:08,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:08,734 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:08,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:08,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:08,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:08,745 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:08,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:08,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:08,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:08,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:08,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:08,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:08,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-11-21 13:55:08,777 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:08,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:08,790 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:08,800 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:08,800 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-11-21 13:55:08,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:08,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:08,804 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:08,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:08,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-11-21 13:55:08,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:08,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:08,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:08,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:08,828 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-21 13:55:08,829 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-21 13:55:08,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:08,858 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:08,868 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:08,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:08,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:08,869 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:08,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:08,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:08,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:08,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:08,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:08,892 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-21 13:55:08,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-11-21 13:55:08,894 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-21 13:55:08,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:08,903 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:08,908 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:08,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:08,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:08,909 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:08,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-21 13:55:08,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:08,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:08,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:08,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:08,928 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-21 13:55:08,929 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-21 13:55:08,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:08,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-11-21 13:55:08,950 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:08,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:08,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:08,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:08,961 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:08,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:08,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-11-21 13:55:08,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:08,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:08,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:08,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:08,981 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-21 13:55:08,982 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-21 13:55:08,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:08,992 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:09,002 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:09,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:09,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:09,004 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:09,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:09,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:09,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:09,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:09,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:09,021 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-21 13:55:09,022 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-21 13:55:09,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:09,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-11-21 13:55:09,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:09,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:09,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:09,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:09,041 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:09,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 13:55:09,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:09,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:09,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:09,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:09,060 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-21 13:55:09,061 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-21 13:55:09,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:09,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-11-21 13:55:09,071 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:09,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:09,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:09,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:09,082 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:09,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 13:55:09,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:09,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:09,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:09,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:09,102 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-21 13:55:09,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-11-21 13:55:09,109 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-21 13:55:09,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:09,134 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:09,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:09,143 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-11-21 13:55:09,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:09,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:09,145 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:09,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 13:55:09,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:09,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:09,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:09,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:09,162 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-21 13:55:09,163 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-21 13:55:09,163 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:09,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-11-21 13:55:09,186 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:09,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:09,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:09,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:09,197 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:09,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:09,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:09,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:09,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:09,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:09,214 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-21 13:55:09,215 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-21 13:55:09,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:09,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-11-21 13:55:09,234 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:09,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:09,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:09,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:09,244 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:09,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 13:55:09,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:09,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:09,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:09,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:09,262 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-21 13:55:09,263 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-21 13:55:09,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:09,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-11-21 13:55:09,286 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:09,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:09,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:09,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:09,296 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:09,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-21 13:55:09,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:09,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:09,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:09,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:09,316 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-21 13:55:09,318 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-21 13:55:09,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:09,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-11-21 13:55:09,342 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:09,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:09,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:09,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:09,354 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:09,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:09,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-11-21 13:55:09,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:09,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:09,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:09,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:09,378 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-21 13:55:09,379 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-21 13:55:09,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:09,389 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:09,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:09,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:09,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:09,395 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:09,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 13:55:09,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-11-21 13:55:09,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:09,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:09,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:09,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:09,418 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-21 13:55:09,422 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-21 13:55:09,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:09,432 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:09,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:09,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:09,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:09,443 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:09,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:09,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-11-21 13:55:09,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:09,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:09,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:09,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:09,463 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-21 13:55:09,470 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-21 13:55:09,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:09,494 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:09,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:09,504 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-11-21 13:55:09,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:09,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:09,505 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:09,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:09,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:09,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:09,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:09,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:09,522 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-21 13:55:09,523 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-21 13:55:09,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:09,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-11-21 13:55:09,539 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:09,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:09,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:09,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:09,545 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:09,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:09,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:09,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:09,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:09,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:09,564 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-21 13:55:09,565 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-21 13:55:09,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:09,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-11-21 13:55:09,574 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:09,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:09,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:09,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:09,578 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:09,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-11-21 13:55:09,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:09,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:09,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:09,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:09,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:09,592 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-21 13:55:09,594 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-21 13:55:09,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:09,602 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:09,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:09,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:09,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:09,612 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:09,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-11-21 13:55:09,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:09,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:09,627 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:09,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:09,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:09,628 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-21 13:55:09,629 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-21 13:55:09,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:09,647 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:09,650 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-11-21 13:55:09,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:09,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:09,651 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:09,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-11-21 13:55:09,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:09,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:09,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:09,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:09,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:09,666 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-21 13:55:09,667 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-21 13:55:09,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:09,694 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:09,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:09,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:09,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:09,700 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:09,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-11-21 13:55:09,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:09,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:09,720 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:09,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:09,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:09,720 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-21 13:55:09,721 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-21 13:55:09,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:09,732 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:09,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:09,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:09,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:09,745 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:09,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-21 13:55:09,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-11-21 13:55:09,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:09,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:09,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:09,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:09,766 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-21 13:55:09,775 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-21 13:55:09,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:09,794 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:09,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:09,805 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-11-21 13:55:09,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:09,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:09,807 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:09,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-21 13:55:09,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-11-21 13:55:09,829 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:09,829 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-21 13:55:09,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:09,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:09,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:09,830 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-21 13:55:09,831 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-21 13:55:09,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:09,846 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:09,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:09,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:09,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:09,857 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:09,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:09,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-11-21 13:55:09,875 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:09,875 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-21 13:55:09,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:09,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:09,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:09,875 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-21 13:55:09,876 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-21 13:55:09,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:09,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:09,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:09,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:09,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:09,897 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:09,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:09,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-11-21 13:55:09,922 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:09,922 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-21 13:55:09,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:09,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:09,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:09,922 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-21 13:55:09,923 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-21 13:55:09,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:09,942 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:09,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:09,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:09,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:09,957 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:09,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:09,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-11-21 13:55:09,976 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:09,976 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-21 13:55:09,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:09,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:09,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:09,977 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-21 13:55:09,978 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-21 13:55:09,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:09,988 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:09,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:09,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:09,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:09,993 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:09,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:10,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-11-21 13:55:10,012 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:10,013 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-21 13:55:10,013 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:10,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:10,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:10,013 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-21 13:55:10,014 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-21 13:55:10,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:10,024 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:10,028 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:10,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:10,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:10,030 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:10,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:10,048 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:10,048 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-21 13:55:10,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:10,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:10,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:10,048 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-21 13:55:10,049 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-21 13:55:10,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:10,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-11-21 13:55:10,074 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:10,079 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:10,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:10,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:10,081 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:10,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 13:55:10,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-11-21 13:55:10,099 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:10,099 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-21 13:55:10,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:10,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:10,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:10,099 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-21 13:55:10,117 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-21 13:55:10,117 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:10,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:10,140 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:10,140 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-11-21 13:55:10,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:10,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:10,141 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:10,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:10,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-11-21 13:55:10,162 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:10,162 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-21 13:55:10,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:10,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:10,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:10,163 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-21 13:55:10,166 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-21 13:55:10,166 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:10,178 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:10,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:10,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:10,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:10,183 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:10,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:10,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-11-21 13:55:10,205 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:10,206 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-21 13:55:10,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:10,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:10,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:10,206 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-21 13:55:10,208 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-21 13:55:10,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:10,226 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:10,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:10,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:10,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:10,231 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:10,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-11-21 13:55:10,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:10,245 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:10,245 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-21 13:55:10,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:10,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:10,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:10,245 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-21 13:55:10,247 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-21 13:55:10,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:10,258 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:10,263 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:10,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:10,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:10,264 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:10,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-21 13:55:10,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-11-21 13:55:10,286 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:10,286 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-21 13:55:10,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:10,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:10,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:10,286 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-21 13:55:10,287 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-21 13:55:10,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:10,305 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:10,308 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:10,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:10,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:10,310 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:10,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:10,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-11-21 13:55:10,329 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:10,329 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-21 13:55:10,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:10,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:10,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:10,330 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-21 13:55:10,331 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-21 13:55:10,331 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:10,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:10,354 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:10,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:10,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:10,356 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:10,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 13:55:10,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-11-21 13:55:10,376 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:10,376 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-21 13:55:10,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:10,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:10,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:10,376 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-21 13:55:10,378 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-21 13:55:10,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:10,394 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:10,398 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:10,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:10,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:10,400 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:10,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:10,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-11-21 13:55:10,419 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:10,419 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-21 13:55:10,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:10,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:10,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:10,420 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-21 13:55:10,429 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-21 13:55:10,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:10,466 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:10,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:10,471 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-11-21 13:55:10,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:10,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:10,472 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:10,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 13:55:10,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-11-21 13:55:10,492 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:10,492 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-21 13:55:10,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:10,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:10,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:10,492 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-21 13:55:10,494 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-21 13:55:10,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:10,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:10,512 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2022-11-21 13:55:10,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:10,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:10,514 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:10,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 13:55:10,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-11-21 13:55:10,558 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:10,558 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-21 13:55:10,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:10,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:10,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:10,559 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-21 13:55:10,561 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-21 13:55:10,561 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:10,578 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:10,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:10,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:10,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:10,584 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:10,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 13:55:10,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-11-21 13:55:10,601 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:10,601 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-21 13:55:10,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:10,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:10,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:10,602 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-21 13:55:10,604 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-21 13:55:10,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:10,622 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:10,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:10,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:10,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:10,627 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:10,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-11-21 13:55:10,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:10,645 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:10,645 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-21 13:55:10,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:10,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:10,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:10,645 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-21 13:55:10,647 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-21 13:55:10,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:10,670 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:10,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:10,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:10,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:10,676 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:10,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:10,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-11-21 13:55:10,697 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:10,697 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-21 13:55:10,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:10,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:10,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:10,698 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-21 13:55:10,700 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-21 13:55:10,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:10,718 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:10,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:10,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:10,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:10,724 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:10,728 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:10,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-11-21 13:55:10,740 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:10,740 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-21 13:55:10,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:10,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:10,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:10,741 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-21 13:55:10,742 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-21 13:55:10,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:10,755 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:10,759 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-11-21 13:55:10,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:10,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:10,761 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:10,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 13:55:10,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-11-21 13:55:10,786 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:10,786 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-21 13:55:10,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:10,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:10,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:10,786 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-21 13:55:10,799 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-21 13:55:10,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:10,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:10,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:10,847 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-11-21 13:55:10,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:10,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:10,849 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:10,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:10,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-11-21 13:55:10,869 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:10,870 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-21 13:55:10,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:10,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:10,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:10,870 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-21 13:55:10,871 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-21 13:55:10,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:10,898 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:10,902 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:10,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:10,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:10,904 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:10,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 13:55:10,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-11-21 13:55:10,925 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:10,925 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-21 13:55:10,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:10,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:10,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:10,925 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-21 13:55:10,926 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-21 13:55:10,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:10,950 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:10,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:10,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:10,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:10,956 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:10,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:10,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-11-21 13:55:10,975 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:10,975 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-21 13:55:10,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:10,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:10,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:10,975 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-21 13:55:10,976 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-21 13:55:10,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:10,998 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:11,002 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:11,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:11,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:11,004 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:11,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-11-21 13:55:11,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:11,020 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:11,020 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-21 13:55:11,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:11,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:11,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:11,020 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-21 13:55:11,021 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-21 13:55:11,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:11,033 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:11,037 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:11,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:11,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:11,038 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:11,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:11,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-11-21 13:55:11,056 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:11,056 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-21 13:55:11,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:11,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:11,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:11,057 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-21 13:55:11,058 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-21 13:55:11,058 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:11,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:11,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:11,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:11,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:11,088 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:11,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-11-21 13:55:11,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:11,120 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:11,120 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-21 13:55:11,120 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:11,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:11,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:11,120 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-21 13:55:11,121 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-21 13:55:11,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:11,125 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:11,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-11-21 13:55:11,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:11,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:11,129 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:11,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-11-21 13:55:11,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:11,144 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:11,144 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-21 13:55:11,144 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:11,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:11,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:11,144 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-21 13:55:11,151 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-21 13:55:11,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:11,165 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:11,168 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-11-21 13:55:11,168 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-11-21 13:55:11,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:11,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:11,169 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:11,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-11-21 13:55:11,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 13:55:11,187 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:11,187 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-21 13:55:11,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:11,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:11,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:11,187 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-21 13:55:11,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 13:55:11,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:11,194 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:11,196 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2022-11-21 13:55:11,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:11,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:11,198 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:11,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-11-21 13:55:11,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:11,212 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:11,212 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-21 13:55:11,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:11,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:11,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:11,213 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-21 13:55:11,214 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 13:55:11,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:11,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:11,250 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:11,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:11,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:11,252 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:11,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:11,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-11-21 13:55:11,273 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:11,273 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-21 13:55:11,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:11,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:11,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:11,273 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-21 13:55:11,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 13:55:11,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:11,294 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:11,298 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:11,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:11,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:11,300 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:11,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-11-21 13:55:11,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 13:55:11,317 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:11,317 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-21 13:55:11,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:11,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:11,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:11,318 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-21 13:55:11,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 13:55:11,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:11,336 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:11,338 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2022-11-21 13:55:11,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:11,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:11,340 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:11,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-11-21 13:55:11,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:11,366 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:11,367 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-21 13:55:11,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:11,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:11,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:11,367 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-21 13:55:11,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 13:55:11,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:11,381 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:11,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:11,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:11,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:11,386 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:11,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:11,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-11-21 13:55:11,410 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:11,410 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-21 13:55:11,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:11,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:11,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:11,411 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-21 13:55:11,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 13:55:11,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:11,430 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:11,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:11,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:11,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:11,436 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:11,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 13:55:11,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-11-21 13:55:11,456 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-21 13:55:11,456 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-21 13:55:11,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:11,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:11,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:11,456 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-21 13:55:11,467 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 13:55:11,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:11,498 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:11,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:11,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:11,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:55:11,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:55:11,504 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-21 13:55:11,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:11,563 INFO L93 Difference]: Finished difference Result 35 states and 55 transitions. [2022-11-21 13:55:11,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 55 transitions. [2022-11-21 13:55:11,569 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2022-11-21 13:55:11,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 55 transitions. [2022-11-21 13:55:11,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-11-21 13:55:11,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2022-11-21 13:55:11,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 55 transitions. [2022-11-21 13:55:11,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:55:11,580 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 55 transitions. [2022-11-21 13:55:11,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 55 transitions. [2022-11-21 13:55:11,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2022-11-21 13:55:11,589 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-21 13:55:11,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-11-21 13:55:11,591 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2022-11-21 13:55:11,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:55:11,595 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2022-11-21 13:55:11,595 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-21 13:55:11,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 43 transitions. [2022-11-21 13:55:11,596 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-11-21 13:55:11,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:55:11,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:55:11,597 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-21 13:55:11,598 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-21 13:55:11,598 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-21 13:55:11,598 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-21 13:55:11,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:11,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 4 times [2022-11-21 13:55:11,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:11,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042212713] [2022-11-21 13:55:11,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:11,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:11,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:11,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:11,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:11,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1909923709, now seen corresponding path program 1 times [2022-11-21 13:55:11,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:11,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839297195] [2022-11-21 13:55:11,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:11,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:11,618 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:11,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1647446287] [2022-11-21 13:55:11,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:11,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:11,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:11,620 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:11,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-11-21 13:55:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:11,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 13:55:11,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:11,734 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-21 13:55:11,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:11,832 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-21 13:55:11,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:11,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839297195] [2022-11-21 13:55:11,833 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:55:11,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647446287] [2022-11-21 13:55:11,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647446287] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:55:11,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:11,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-11-21 13:55:11,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804174780] [2022-11-21 13:55:11,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:11,835 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 13:55:11,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:11,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:55:11,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:55:11,836 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-21 13:55:12,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:12,028 INFO L93 Difference]: Finished difference Result 41 states and 62 transitions. [2022-11-21 13:55:12,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 62 transitions. [2022-11-21 13:55:12,030 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2022-11-21 13:55:12,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 62 transitions. [2022-11-21 13:55:12,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2022-11-21 13:55:12,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2022-11-21 13:55:12,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 62 transitions. [2022-11-21 13:55:12,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:55:12,033 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 62 transitions. [2022-11-21 13:55:12,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 62 transitions. [2022-11-21 13:55:12,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2022-11-21 13:55:12,038 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-21 13:55:12,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. [2022-11-21 13:55:12,039 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 48 transitions. [2022-11-21 13:55:12,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:55:12,040 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 48 transitions. [2022-11-21 13:55:12,040 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-21 13:55:12,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 48 transitions. [2022-11-21 13:55:12,041 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2022-11-21 13:55:12,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:55:12,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:55:12,042 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-21 13:55:12,042 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-21 13:55:12,043 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-21 13:55:12,043 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-21 13:55:12,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:12,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 5 times [2022-11-21 13:55:12,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:12,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815448689] [2022-11-21 13:55:12,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:12,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:12,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:12,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:12,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:12,052 INFO L85 PathProgramCache]: Analyzing trace with hash -743603515, now seen corresponding path program 1 times [2022-11-21 13:55:12,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:12,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122188833] [2022-11-21 13:55:12,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:12,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:12,061 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:12,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1936388389] [2022-11-21 13:55:12,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:12,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:12,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:12,066 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:12,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-11-21 13:55:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:12,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:12,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:12,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:12,138 INFO L85 PathProgramCache]: Analyzing trace with hash 343305470, now seen corresponding path program 1 times [2022-11-21 13:55:12,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:12,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095222053] [2022-11-21 13:55:12,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:12,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:12,148 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:12,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [118732698] [2022-11-21 13:55:12,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:12,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:12,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:12,154 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:12,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-11-21 13:55:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:12,207 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:12,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:12,624 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 13:55:12,624 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 13:55:12,624 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 13:55:12,624 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 13:55:12,624 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-21 13:55:12,624 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:12,625 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 13:55:12,625 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 13:55:12,625 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration5_Loop [2022-11-21 13:55:12,625 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 13:55:12,625 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 13:55:12,629 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-21 13:55:12,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-21 13:55:12,655 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-21 13:55:12,658 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-21 13:55:12,665 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-21 13:55:12,669 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-21 13:55:12,672 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-21 13:55:12,675 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-21 13:55:12,801 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 13:55:12,801 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-21 13:55:12,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:12,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:12,808 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:12,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-11-21 13:55:12,810 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:55:12,810 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:12,824 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-21 13:55:12,824 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-21 13:55:12,827 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2022-11-21 13:55:12,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:12,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:12,828 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:12,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-11-21 13:55:12,831 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:55:12,831 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:12,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:12,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:12,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:12,849 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:12,860 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-21 13:55:12,860 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:12,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-11-21 13:55:13,463 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-21 13:55:13,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:13,469 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 13:55:13,469 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 13:55:13,469 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 13:55:13,469 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 13:55:13,469 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-21 13:55:13,469 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:13,469 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 13:55:13,469 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 13:55:13,469 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration5_Loop [2022-11-21 13:55:13,469 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 13:55:13,470 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 13:55:13,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-21 13:55:13,478 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-21 13:55:13,512 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-21 13:55:13,514 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-21 13:55:13,517 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-21 13:55:13,520 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-21 13:55:13,522 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-21 13:55:13,525 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-21 13:55:13,644 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 13:55:13,644 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-21 13:55:13,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:13,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:13,646 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:13,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:13,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-11-21 13:55:13,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:13,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:13,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:13,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:13,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:13,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:13,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:13,680 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:13,684 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:13,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:13,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:13,686 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:13,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:13,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-11-21 13:55:13,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:13,705 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:13,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:13,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:13,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:13,708 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:13,708 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:13,722 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-21 13:55:13,748 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-21 13:55:13,748 INFO L444 ModelExtractionUtils]: 6 out of 9 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-21 13:55:13,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:13,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:13,753 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:13,757 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-21 13:55:13,758 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-21 13:55:13,758 INFO L513 LassoAnalysis]: Proved termination. [2022-11-21 13:55:13,758 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-21 13:55:13,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-11-21 13:55:13,761 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2022-11-21 13:55:13,762 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-21 13:55:13,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:13,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 13:55:13,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:13,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-21 13:55:13,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:13,994 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-21 13:55:13,994 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-21 13:55:13,995 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-21 13:55:14,346 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-21 13:55:14,347 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-21 13:55:14,347 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-21 13:55:14,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2022-11-21 13:55:14,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 71 transitions. Stem has 4 letters. Loop has 23 letters. [2022-11-21 13:55:14,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:14,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 71 transitions. Stem has 27 letters. Loop has 23 letters. [2022-11-21 13:55:14,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:14,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 71 transitions. Stem has 4 letters. Loop has 46 letters. [2022-11-21 13:55:14,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:14,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 190 transitions. [2022-11-21 13:55:14,354 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2022-11-21 13:55:14,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 122 states and 189 transitions. [2022-11-21 13:55:14,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2022-11-21 13:55:14,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2022-11-21 13:55:14,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 189 transitions. [2022-11-21 13:55:14,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:55:14,360 INFO L218 hiAutomatonCegarLoop]: Abstraction has 122 states and 189 transitions. [2022-11-21 13:55:14,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 189 transitions. [2022-11-21 13:55:14,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 117. [2022-11-21 13:55:14,385 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-21 13:55:14,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 180 transitions. [2022-11-21 13:55:14,392 INFO L240 hiAutomatonCegarLoop]: Abstraction has 117 states and 180 transitions. [2022-11-21 13:55:14,392 INFO L428 stractBuchiCegarLoop]: Abstraction has 117 states and 180 transitions. [2022-11-21 13:55:14,392 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-21 13:55:14,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 180 transitions. [2022-11-21 13:55:14,394 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2022-11-21 13:55:14,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:55:14,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:55:14,397 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-21 13:55:14,399 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-21 13:55:14,399 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-21 13:55:14,399 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-21 13:55:14,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:14,400 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 1 times [2022-11-21 13:55:14,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:14,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625556291] [2022-11-21 13:55:14,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:14,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:14,412 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:14,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:14,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:14,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1403101825, now seen corresponding path program 2 times [2022-11-21 13:55:14,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:14,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530073121] [2022-11-21 13:55:14,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:14,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:14,429 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:14,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [984618354] [2022-11-21 13:55:14,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:55:14,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:14,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:14,439 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:14,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2022-11-21 13:55:14,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:55:14,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:55:14,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-21 13:55:14,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:14,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:14,719 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-21 13:55:14,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:15,009 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-21 13:55:15,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:15,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530073121] [2022-11-21 13:55:15,010 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:55:15,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984618354] [2022-11-21 13:55:15,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984618354] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:55:15,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:15,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-11-21 13:55:15,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416336548] [2022-11-21 13:55:15,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:15,013 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 13:55:15,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:15,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-21 13:55:15,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-11-21 13:55:15,015 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-21 13:55:16,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:16,006 INFO L93 Difference]: Finished difference Result 284 states and 438 transitions. [2022-11-21 13:55:16,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 284 states and 438 transitions. [2022-11-21 13:55:16,012 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 110 [2022-11-21 13:55:16,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 284 states to 271 states and 424 transitions. [2022-11-21 13:55:16,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2022-11-21 13:55:16,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2022-11-21 13:55:16,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 271 states and 424 transitions. [2022-11-21 13:55:16,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:55:16,021 INFO L218 hiAutomatonCegarLoop]: Abstraction has 271 states and 424 transitions. [2022-11-21 13:55:16,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states and 424 transitions. [2022-11-21 13:55:16,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 153. [2022-11-21 13:55:16,042 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-21 13:55:16,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 236 transitions. [2022-11-21 13:55:16,044 INFO L240 hiAutomatonCegarLoop]: Abstraction has 153 states and 236 transitions. [2022-11-21 13:55:16,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-21 13:55:16,046 INFO L428 stractBuchiCegarLoop]: Abstraction has 153 states and 236 transitions. [2022-11-21 13:55:16,046 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-21 13:55:16,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 153 states and 236 transitions. [2022-11-21 13:55:16,048 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 52 [2022-11-21 13:55:16,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:55:16,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:55:16,050 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-21 13:55:16,050 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-21 13:55:16,050 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-21 13:55:16,050 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-21 13:55:16,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:16,051 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 2 times [2022-11-21 13:55:16,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:16,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881189296] [2022-11-21 13:55:16,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:16,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:16,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:16,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:16,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:16,059 INFO L85 PathProgramCache]: Analyzing trace with hash 885226027, now seen corresponding path program 1 times [2022-11-21 13:55:16,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:16,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039565555] [2022-11-21 13:55:16,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:16,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:16,070 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:16,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [545048487] [2022-11-21 13:55:16,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:16,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:16,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:16,072 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:16,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2022-11-21 13:55:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:16,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-21 13:55:16,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:16,243 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-21 13:55:16,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:16,475 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-21 13:55:16,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:16,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039565555] [2022-11-21 13:55:16,476 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:55:16,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545048487] [2022-11-21 13:55:16,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545048487] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:55:16,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:16,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-11-21 13:55:16,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133690441] [2022-11-21 13:55:16,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:16,478 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 13:55:16,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:16,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 13:55:16,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:55:16,480 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-21 13:55:16,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:16,798 INFO L93 Difference]: Finished difference Result 285 states and 408 transitions. [2022-11-21 13:55:16,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 285 states and 408 transitions. [2022-11-21 13:55:16,804 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 105 [2022-11-21 13:55:16,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 285 states to 285 states and 408 transitions. [2022-11-21 13:55:16,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 140 [2022-11-21 13:55:16,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 [2022-11-21 13:55:16,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 285 states and 408 transitions. [2022-11-21 13:55:16,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:55:16,811 INFO L218 hiAutomatonCegarLoop]: Abstraction has 285 states and 408 transitions. [2022-11-21 13:55:16,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 408 transitions. [2022-11-21 13:55:16,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 165. [2022-11-21 13:55:16,830 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-21 13:55:16,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 252 transitions. [2022-11-21 13:55:16,833 INFO L240 hiAutomatonCegarLoop]: Abstraction has 165 states and 252 transitions. [2022-11-21 13:55:16,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 13:55:16,835 INFO L428 stractBuchiCegarLoop]: Abstraction has 165 states and 252 transitions. [2022-11-21 13:55:16,835 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-21 13:55:16,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 252 transitions. [2022-11-21 13:55:16,837 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2022-11-21 13:55:16,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:55:16,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:55:16,841 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-21 13:55:16,845 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-21 13:55:16,845 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-21 13:55:16,846 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-21 13:55:16,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:16,847 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 3 times [2022-11-21 13:55:16,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:16,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354789298] [2022-11-21 13:55:16,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:16,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:16,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:16,857 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:16,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:16,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:16,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1877972557, now seen corresponding path program 2 times [2022-11-21 13:55:16,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:16,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954437986] [2022-11-21 13:55:16,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:16,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:16,892 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:16,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [583045460] [2022-11-21 13:55:16,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:55:16,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:16,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:16,902 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:16,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2022-11-21 13:55:17,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:55:17,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:55:17,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-21 13:55:17,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:17,174 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-21 13:55:17,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:17,519 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-21 13:55:17,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:17,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954437986] [2022-11-21 13:55:17,520 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:55:17,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583045460] [2022-11-21 13:55:17,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583045460] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:55:17,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:17,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 15 [2022-11-21 13:55:17,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669248417] [2022-11-21 13:55:17,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:17,523 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 13:55:17,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:17,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-21 13:55:17,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-11-21 13:55:17,524 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-21 13:55:18,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:18,010 INFO L93 Difference]: Finished difference Result 300 states and 489 transitions. [2022-11-21 13:55:18,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 300 states and 489 transitions. [2022-11-21 13:55:18,016 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 93 [2022-11-21 13:55:18,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 300 states to 288 states and 477 transitions. [2022-11-21 13:55:18,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2022-11-21 13:55:18,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 [2022-11-21 13:55:18,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 288 states and 477 transitions. [2022-11-21 13:55:18,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:55:18,028 INFO L218 hiAutomatonCegarLoop]: Abstraction has 288 states and 477 transitions. [2022-11-21 13:55:18,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states and 477 transitions. [2022-11-21 13:55:18,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 251. [2022-11-21 13:55:18,066 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-21 13:55:18,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 432 transitions. [2022-11-21 13:55:18,069 INFO L240 hiAutomatonCegarLoop]: Abstraction has 251 states and 432 transitions. [2022-11-21 13:55:18,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 13:55:18,070 INFO L428 stractBuchiCegarLoop]: Abstraction has 251 states and 432 transitions. [2022-11-21 13:55:18,070 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-21 13:55:18,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 251 states and 432 transitions. [2022-11-21 13:55:18,073 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 85 [2022-11-21 13:55:18,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:55:18,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:55:18,075 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-21 13:55:18,076 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-21 13:55:18,076 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-21 13:55:18,076 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-21 13:55:18,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:18,077 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 4 times [2022-11-21 13:55:18,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:18,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762067812] [2022-11-21 13:55:18,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:18,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:18,082 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:18,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:18,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:18,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1233557403, now seen corresponding path program 3 times [2022-11-21 13:55:18,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:18,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511458250] [2022-11-21 13:55:18,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:18,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:18,099 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:18,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1180738496] [2022-11-21 13:55:18,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 13:55:18,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:18,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:18,104 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:18,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2022-11-21 13:55:18,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-21 13:55:18,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:55:18,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-21 13:55:18,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:18,298 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-21 13:55:18,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:18,595 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-21 13:55:18,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:18,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511458250] [2022-11-21 13:55:18,596 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:55:18,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180738496] [2022-11-21 13:55:18,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180738496] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:55:18,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:18,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2022-11-21 13:55:18,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971572468] [2022-11-21 13:55:18,597 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:18,598 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 13:55:18,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:18,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 13:55:18,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:55:18,599 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-21 13:55:18,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:18,813 INFO L93 Difference]: Finished difference Result 305 states and 530 transitions. [2022-11-21 13:55:18,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 305 states and 530 transitions. [2022-11-21 13:55:18,817 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 109 [2022-11-21 13:55:18,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 305 states to 305 states and 530 transitions. [2022-11-21 13:55:18,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2022-11-21 13:55:18,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2022-11-21 13:55:18,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 305 states and 530 transitions. [2022-11-21 13:55:18,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:55:18,824 INFO L218 hiAutomatonCegarLoop]: Abstraction has 305 states and 530 transitions. [2022-11-21 13:55:18,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states and 530 transitions. [2022-11-21 13:55:18,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 269. [2022-11-21 13:55:18,837 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-21 13:55:18,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 482 transitions. [2022-11-21 13:55:18,840 INFO L240 hiAutomatonCegarLoop]: Abstraction has 269 states and 482 transitions. [2022-11-21 13:55:18,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 13:55:18,842 INFO L428 stractBuchiCegarLoop]: Abstraction has 269 states and 482 transitions. [2022-11-21 13:55:18,842 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-21 13:55:18,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 269 states and 482 transitions. [2022-11-21 13:55:18,844 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 95 [2022-11-21 13:55:18,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:55:18,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:55:18,846 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-21 13:55:18,846 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-21 13:55:18,847 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-21 13:55:18,847 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-21 13:55:18,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:18,848 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 5 times [2022-11-21 13:55:18,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:18,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620748617] [2022-11-21 13:55:18,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:18,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:18,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:18,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:18,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:18,855 INFO L85 PathProgramCache]: Analyzing trace with hash -103094629, now seen corresponding path program 4 times [2022-11-21 13:55:18,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:18,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499840246] [2022-11-21 13:55:18,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:18,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:18,867 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:18,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [806604178] [2022-11-21 13:55:18,871 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 13:55:18,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:18,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:18,882 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:18,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2022-11-21 13:55:18,980 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 13:55:18,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:55:18,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-21 13:55:18,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:19,091 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-21 13:55:19,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:19,455 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-21 13:55:19,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:19,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499840246] [2022-11-21 13:55:19,456 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:55:19,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806604178] [2022-11-21 13:55:19,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806604178] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:55:19,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:19,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 15 [2022-11-21 13:55:19,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028081855] [2022-11-21 13:55:19,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:19,460 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 13:55:19,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:19,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-21 13:55:19,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-11-21 13:55:19,461 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-21 13:55:19,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:19,994 INFO L93 Difference]: Finished difference Result 421 states and 736 transitions. [2022-11-21 13:55:19,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 421 states and 736 transitions. [2022-11-21 13:55:20,000 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 167 [2022-11-21 13:55:20,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 421 states to 421 states and 736 transitions. [2022-11-21 13:55:20,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 211 [2022-11-21 13:55:20,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 211 [2022-11-21 13:55:20,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 421 states and 736 transitions. [2022-11-21 13:55:20,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:55:20,025 INFO L218 hiAutomatonCegarLoop]: Abstraction has 421 states and 736 transitions. [2022-11-21 13:55:20,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states and 736 transitions. [2022-11-21 13:55:20,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 313. [2022-11-21 13:55:20,047 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-21 13:55:20,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 576 transitions. [2022-11-21 13:55:20,051 INFO L240 hiAutomatonCegarLoop]: Abstraction has 313 states and 576 transitions. [2022-11-21 13:55:20,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 13:55:20,053 INFO L428 stractBuchiCegarLoop]: Abstraction has 313 states and 576 transitions. [2022-11-21 13:55:20,053 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-11-21 13:55:20,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 313 states and 576 transitions. [2022-11-21 13:55:20,056 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 117 [2022-11-21 13:55:20,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:55:20,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:55:20,059 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-21 13:55:20,059 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-21 13:55:20,059 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-21 13:55:20,060 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-21 13:55:20,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:20,061 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 6 times [2022-11-21 13:55:20,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:20,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083503781] [2022-11-21 13:55:20,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:20,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:20,067 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:20,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:20,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:20,073 INFO L85 PathProgramCache]: Analyzing trace with hash -530535317, now seen corresponding path program 5 times [2022-11-21 13:55:20,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:20,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031813776] [2022-11-21 13:55:20,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:20,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:20,090 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:20,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1447322421] [2022-11-21 13:55:20,091 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 13:55:20,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:20,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:20,099 INFO L229 MonitoredProcess]: Starting monitored process 91 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:20,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2022-11-21 13:55:20,180 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-11-21 13:55:20,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:55:20,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-21 13:55:20,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:20,303 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-21 13:55:20,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:20,668 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-21 13:55:20,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:20,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031813776] [2022-11-21 13:55:20,669 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:55:20,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447322421] [2022-11-21 13:55:20,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447322421] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:55:20,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:20,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 16 [2022-11-21 13:55:20,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662956940] [2022-11-21 13:55:20,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:20,670 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 13:55:20,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:20,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-21 13:55:20,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-11-21 13:55:20,671 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-21 13:55:21,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:21,252 INFO L93 Difference]: Finished difference Result 513 states and 886 transitions. [2022-11-21 13:55:21,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 513 states and 886 transitions. [2022-11-21 13:55:21,258 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 174 [2022-11-21 13:55:21,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 513 states to 497 states and 856 transitions. [2022-11-21 13:55:21,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 249 [2022-11-21 13:55:21,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 249 [2022-11-21 13:55:21,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 497 states and 856 transitions. [2022-11-21 13:55:21,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:55:21,267 INFO L218 hiAutomatonCegarLoop]: Abstraction has 497 states and 856 transitions. [2022-11-21 13:55:21,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states and 856 transitions. [2022-11-21 13:55:21,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 399. [2022-11-21 13:55:21,285 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-21 13:55:21,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 724 transitions. [2022-11-21 13:55:21,288 INFO L240 hiAutomatonCegarLoop]: Abstraction has 399 states and 724 transitions. [2022-11-21 13:55:21,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 13:55:21,292 INFO L428 stractBuchiCegarLoop]: Abstraction has 399 states and 724 transitions. [2022-11-21 13:55:21,292 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-11-21 13:55:21,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 399 states and 724 transitions. [2022-11-21 13:55:21,295 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 148 [2022-11-21 13:55:21,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:55:21,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:55:21,296 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:21,296 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-21 13:55:21,296 INFO L748 eck$LassoCheckResult]: Stem: 8631#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8605#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; 8606#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 8630#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; 8645#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 8739#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 8738#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 8692#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 8595#factENTRY ~n := #in~n; 8711#L25 assume ~n <= 0;#res := 1; 8708#factFINAL assume true; 8672#factEXIT >#68#return; 8520#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 8662#factENTRY ~n := #in~n; 8671#L25 assume !(~n <= 0); 8611#L26 call #t~ret0 := fact(~n - 1);< 8613#factENTRY [2022-11-21 13:55:21,296 INFO L750 eck$LassoCheckResult]: Loop: 8613#factENTRY ~n := #in~n; 8652#L25 assume !(~n <= 0); 8610#L26 call #t~ret0 := fact(~n - 1);< 8613#factENTRY [2022-11-21 13:55:21,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:21,297 INFO L85 PathProgramCache]: Analyzing trace with hash 960037668, now seen corresponding path program 1 times [2022-11-21 13:55:21,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:21,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376354519] [2022-11-21 13:55:21,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:21,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:21,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 13:55:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:21,412 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-21 13:55:21,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:21,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376354519] [2022-11-21 13:55:21,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376354519] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:55:21,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:55:21,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:55:21,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054256240] [2022-11-21 13:55:21,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:55:21,414 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 13:55:21,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:21,414 INFO L85 PathProgramCache]: Analyzing trace with hash 29980, now seen corresponding path program 1 times [2022-11-21 13:55:21,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:21,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117942141] [2022-11-21 13:55:21,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:21,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:21,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:21,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:21,448 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 13:55:21,448 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 13:55:21,448 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 13:55:21,449 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 13:55:21,449 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-21 13:55:21,449 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:21,449 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 13:55:21,449 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 13:55:21,449 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2022-11-21 13:55:21,449 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 13:55:21,450 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 13:55:21,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-21 13:55:21,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-21 13:55:21,455 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-21 13:55:21,457 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-21 13:55:21,484 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 13:55:21,484 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-21 13:55:21,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:21,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:21,489 INFO L229 MonitoredProcess]: Starting monitored process 92 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:21,491 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:55:21,491 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:21,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2022-11-21 13:55:21,513 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-21 13:55:21,513 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#res=0} Honda state: {fact_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-21 13:55:21,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:21,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:21,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:21,518 INFO L229 MonitoredProcess]: Starting monitored process 93 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:21,524 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:55:21,524 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:21,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2022-11-21 13:55:21,551 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-21 13:55:21,551 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-21 13:55:21,554 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:21,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:21,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:21,556 INFO L229 MonitoredProcess]: Starting monitored process 94 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:21,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2022-11-21 13:55:21,559 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:55:21,559 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:21,570 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-21 13:55:21,570 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_~n=0} Honda state: {fact_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-21 13:55:21,572 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2022-11-21 13:55:21,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:21,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:21,574 INFO L229 MonitoredProcess]: Starting monitored process 95 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:21,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2022-11-21 13:55:21,576 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:55:21,576 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:21,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:21,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:21,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:21,591 INFO L229 MonitoredProcess]: Starting monitored process 96 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:21,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2022-11-21 13:55:21,595 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-21 13:55:21,595 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:21,617 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-21 13:55:21,620 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2022-11-21 13:55:21,620 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 13:55:21,620 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 13:55:21,621 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 13:55:21,621 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 13:55:21,621 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-21 13:55:21,621 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:21,621 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 13:55:21,621 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 13:55:21,621 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2022-11-21 13:55:21,621 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 13:55:21,621 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 13:55:21,622 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-21 13:55:21,624 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-21 13:55:21,626 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-21 13:55:21,628 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-21 13:55:21,656 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 13:55:21,656 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-21 13:55:21,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:21,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:21,657 INFO L229 MonitoredProcess]: Starting monitored process 97 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:21,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2022-11-21 13:55:21,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:21,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:21,686 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:21,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:21,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:21,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:21,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:21,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:21,689 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:21,691 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2022-11-21 13:55:21,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:21,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:21,693 INFO L229 MonitoredProcess]: Starting monitored process 98 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:21,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2022-11-21 13:55:21,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:21,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:21,705 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:21,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:21,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:21,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:21,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:21,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:21,707 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:21,710 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2022-11-21 13:55:21,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:21,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:21,711 INFO L229 MonitoredProcess]: Starting monitored process 99 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:21,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2022-11-21 13:55:21,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 13:55:21,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:21,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:21,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:21,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:21,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:21,724 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:21,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:21,725 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:21,729 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2022-11-21 13:55:21,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:21,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:21,730 INFO L229 MonitoredProcess]: Starting monitored process 100 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:21,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2022-11-21 13:55:21,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-21 13:55:21,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:21,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:21,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:21,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:21,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:21,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:21,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:21,757 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-21 13:55:21,760 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-21 13:55:21,760 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-11-21 13:55:21,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:21,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:21,763 INFO L229 MonitoredProcess]: Starting monitored process 101 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:21,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2022-11-21 13:55:21,764 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-21 13:55:21,764 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-21 13:55:21,764 INFO L513 LassoAnalysis]: Proved termination. [2022-11-21 13:55:21,765 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2022-11-21 13:55:21,767 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2022-11-21 13:55:21,768 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-21 13:55:21,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:21,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 13:55:21,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:21,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 13:55:21,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:21,919 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-21 13:55:21,920 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-21 13:55:21,920 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-21 13:55:22,036 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-21 13:55:22,037 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-21 13:55:22,038 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-21 13:55:22,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-11-21 13:55:22,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 16 letters. Loop has 3 letters. [2022-11-21 13:55:22,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:22,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 19 letters. Loop has 3 letters. [2022-11-21 13:55:22,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:22,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 16 letters. Loop has 6 letters. [2022-11-21 13:55:22,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:22,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 501 states and 876 transitions. [2022-11-21 13:55:22,050 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 156 [2022-11-21 13:55:22,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 501 states to 487 states and 860 transitions. [2022-11-21 13:55:22,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 237 [2022-11-21 13:55:22,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 240 [2022-11-21 13:55:22,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 487 states and 860 transitions. [2022-11-21 13:55:22,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:55:22,061 INFO L218 hiAutomatonCegarLoop]: Abstraction has 487 states and 860 transitions. [2022-11-21 13:55:22,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states and 860 transitions. [2022-11-21 13:55:22,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 481. [2022-11-21 13:55:22,081 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-21 13:55:22,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 850 transitions. [2022-11-21 13:55:22,085 INFO L240 hiAutomatonCegarLoop]: Abstraction has 481 states and 850 transitions. [2022-11-21 13:55:22,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:22,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:55:22,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:55:22,086 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-21 13:55:22,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:22,162 INFO L93 Difference]: Finished difference Result 581 states and 964 transitions. [2022-11-21 13:55:22,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 581 states and 964 transitions. [2022-11-21 13:55:22,170 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 178 [2022-11-21 13:55:22,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 581 states to 581 states and 964 transitions. [2022-11-21 13:55:22,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 289 [2022-11-21 13:55:22,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 289 [2022-11-21 13:55:22,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 581 states and 964 transitions. [2022-11-21 13:55:22,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:55:22,179 INFO L218 hiAutomatonCegarLoop]: Abstraction has 581 states and 964 transitions. [2022-11-21 13:55:22,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states and 964 transitions. [2022-11-21 13:55:22,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 505. [2022-11-21 13:55:22,200 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-21 13:55:22,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 868 transitions. [2022-11-21 13:55:22,204 INFO L240 hiAutomatonCegarLoop]: Abstraction has 505 states and 868 transitions. [2022-11-21 13:55:22,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:55:22,205 INFO L428 stractBuchiCegarLoop]: Abstraction has 505 states and 868 transitions. [2022-11-21 13:55:22,205 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-11-21 13:55:22,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 505 states and 868 transitions. [2022-11-21 13:55:22,209 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 156 [2022-11-21 13:55:22,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:55:22,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:55:22,211 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:22,212 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-21 13:55:22,212 INFO L748 eck$LassoCheckResult]: Stem: 10636#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 10606#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; 10607#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 10635#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; 10659#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 10805#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 10804#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, 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; 10881#L25 assume !(~n <= 0); 10757#L26 call #t~ret0 := fact(~n - 1);< 10755#factENTRY ~n := #in~n; 10771#L25 assume ~n <= 0;#res := 1; 10794#factFINAL assume true; 10764#factEXIT >#66#return; 10756#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10750#factFINAL assume true; 10710#factEXIT >#68#return; 10741#L30-1 [2022-11-21 13:55:22,213 INFO L750 eck$LassoCheckResult]: Loop: 10741#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 10883#factENTRY ~n := #in~n; 10885#L25 assume ~n <= 0;#res := 1; 10884#factFINAL assume true; 10882#factEXIT >#70#return; 10720#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 10661#factENTRY ~n := #in~n; 10795#L25 assume !(~n <= 0); 10613#L26 call #t~ret0 := fact(~n - 1);< 10615#factENTRY ~n := #in~n; 10951#L25 assume !(~n <= 0); 10612#L26 call #t~ret0 := fact(~n - 1);< 10615#factENTRY ~n := #in~n; 10951#L25 assume !(~n <= 0); 10612#L26 call #t~ret0 := fact(~n - 1);< 10615#factENTRY ~n := #in~n; 10951#L25 assume ~n <= 0;#res := 1; 10787#factFINAL assume true; 10782#factEXIT >#66#return; 10641#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10644#factFINAL assume true; 10751#factEXIT >#66#return; 10641#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10644#factFINAL assume true; 10751#factEXIT >#66#return; 10753#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10826#factFINAL assume true; 10796#factEXIT >#72#return; 10800#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 11078#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 10657#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 10649#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 10637#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 10638#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 10791#factENTRY ~n := #in~n; 10788#L25 assume !(~n <= 0); 10783#L26 call #t~ret0 := fact(~n - 1);< 10785#factENTRY ~n := #in~n; 10790#L25 assume ~n <= 0;#res := 1; 10787#factFINAL assume true; 10782#factEXIT >#66#return; 10756#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10750#factFINAL assume true; 10710#factEXIT >#68#return; 10719#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 10575#factENTRY ~n := #in~n; 10829#L25 assume !(~n <= 0); 10613#L26 call #t~ret0 := fact(~n - 1);< 10615#factENTRY ~n := #in~n; 10951#L25 assume ~n <= 0;#res := 1; 10787#factFINAL assume true; 10782#factEXIT >#66#return; 10756#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10750#factFINAL assume true; 10710#factEXIT >#70#return; 10742#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 10793#factENTRY ~n := #in~n; 10828#L25 assume ~n <= 0;#res := 1; 10789#factFINAL assume true; 10780#factEXIT >#72#return; 10781#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#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; 10813#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 10812#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 10574#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 10575#factENTRY ~n := #in~n; 10829#L25 assume !(~n <= 0); 10613#L26 call #t~ret0 := fact(~n - 1);< 10615#factENTRY ~n := #in~n; 10951#L25 assume ~n <= 0;#res := 1; 10787#factFINAL assume true; 10782#factEXIT >#66#return; 10756#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10750#factFINAL assume true; 10710#factEXIT >#74#return; 10725#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 10575#factENTRY ~n := #in~n; 10829#L25 assume ~n <= 0;#res := 1; 10789#factFINAL assume true; 10780#factEXIT >#76#return; 10732#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 10661#factENTRY ~n := #in~n; 10795#L25 assume !(~n <= 0); 10613#L26 call #t~ret0 := fact(~n - 1);< 10615#factENTRY ~n := #in~n; 10951#L25 assume ~n <= 0;#res := 1; 10787#factFINAL assume true; 10782#factEXIT >#66#return; 10756#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10750#factFINAL assume true; 10710#factEXIT >#78#return; 10747#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 10819#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 10816#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); 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; 10623#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 10624#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; 10712#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 10575#factENTRY ~n := #in~n; 10829#L25 assume !(~n <= 0); 10613#L26 call #t~ret0 := fact(~n - 1);< 10615#factENTRY ~n := #in~n; 10951#L25 assume ~n <= 0;#res := 1; 10787#factFINAL assume true; 10782#factEXIT >#66#return; 10756#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10750#factFINAL assume true; 10710#factEXIT >#68#return; 10741#L30-1 [2022-11-21 13:55:22,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:22,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1862517908, now seen corresponding path program 1 times [2022-11-21 13:55:22,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:22,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906508403] [2022-11-21 13:55:22,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:22,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:22,223 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:22,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [647401294] [2022-11-21 13:55:22,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:22,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:22,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:22,224 INFO L229 MonitoredProcess]: Starting monitored process 102 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:22,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2022-11-21 13:55:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:22,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 13:55:22,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:22,300 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-21 13:55:22,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:22,354 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-21 13:55:22,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:22,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906508403] [2022-11-21 13:55:22,355 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:55:22,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647401294] [2022-11-21 13:55:22,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647401294] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:55:22,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:22,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2022-11-21 13:55:22,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291366609] [2022-11-21 13:55:22,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:22,356 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 13:55:22,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:22,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1614117339, now seen corresponding path program 6 times [2022-11-21 13:55:22,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:22,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747378703] [2022-11-21 13:55:22,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:22,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:22,365 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:22,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [236201579] [2022-11-21 13:55:22,366 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-21 13:55:22,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:22,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:22,369 INFO L229 MonitoredProcess]: Starting monitored process 103 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:22,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2022-11-21 13:55:22,451 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-11-21 13:55:22,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:55:22,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-21 13:55:22,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:22,544 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 373 proven. 14 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2022-11-21 13:55:22,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:22,825 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 109 proven. 68 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2022-11-21 13:55:22,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:22,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747378703] [2022-11-21 13:55:22,826 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:55:22,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236201579] [2022-11-21 13:55:22,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236201579] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:55:22,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:22,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 15 [2022-11-21 13:55:22,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940063434] [2022-11-21 13:55:22,827 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:22,827 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 13:55:22,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:22,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:55:22,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:55:22,828 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-21 13:55:23,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:23,011 INFO L93 Difference]: Finished difference Result 584 states and 1026 transitions. [2022-11-21 13:55:23,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 584 states and 1026 transitions. [2022-11-21 13:55:23,042 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 195 [2022-11-21 13:55:23,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 584 states to 578 states and 1012 transitions. [2022-11-21 13:55:23,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:23,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 287 [2022-11-21 13:55:23,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 287 [2022-11-21 13:55:23,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 578 states and 1012 transitions. [2022-11-21 13:55:23,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:55:23,053 INFO L218 hiAutomatonCegarLoop]: Abstraction has 578 states and 1012 transitions. [2022-11-21 13:55:23,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states and 1012 transitions. [2022-11-21 13:55:23,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 573. [2022-11-21 13:55:23,075 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-21 13:55:23,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1007 transitions. [2022-11-21 13:55:23,080 INFO L240 hiAutomatonCegarLoop]: Abstraction has 573 states and 1007 transitions. [2022-11-21 13:55:23,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:55:23,081 INFO L428 stractBuchiCegarLoop]: Abstraction has 573 states and 1007 transitions. [2022-11-21 13:55:23,081 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-11-21 13:55:23,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 573 states and 1007 transitions. [2022-11-21 13:55:23,085 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 195 [2022-11-21 13:55:23,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:55:23,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:55:23,087 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:23,087 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:23,087 INFO L748 eck$LassoCheckResult]: Stem: 12513#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 12480#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; 12481#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 12512#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; 12497#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 12498#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 12722#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 12470#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 12471#factENTRY ~n := #in~n; 12738#L25 assume ~n <= 0;#res := 1; 12736#factFINAL assume true; 12733#factEXIT >#68#return; 12730#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 12731#factENTRY ~n := #in~n; 12740#L25 assume ~n <= 0;#res := 1; 12739#factFINAL assume true; 12729#factEXIT >#70#return; 12552#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 12715#factENTRY ~n := #in~n; 12716#L25 assume ~n <= 0;#res := 1; 12741#factFINAL assume true; 12724#factEXIT >#72#return; 12727#L30-3 [2022-11-21 13:55:23,087 INFO L750 eck$LassoCheckResult]: Loop: 12727#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 12737#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 12735#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 12734#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 12732#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 12726#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 12728#factENTRY ~n := #in~n; 12742#L25 assume ~n <= 0;#res := 1; 12741#factFINAL assume true; 12724#factEXIT >#68#return; 12579#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 12715#factENTRY ~n := #in~n; 12716#L25 assume ~n <= 0;#res := 1; 12741#factFINAL assume true; 12724#factEXIT >#70#return; 12725#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 12728#factENTRY ~n := #in~n; 12742#L25 assume ~n <= 0;#res := 1; 12741#factFINAL assume true; 12724#factEXIT >#72#return; 12727#L30-3 [2022-11-21 13:55:23,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:23,088 INFO L85 PathProgramCache]: Analyzing trace with hash -455324880, now seen corresponding path program 1 times [2022-11-21 13:55:23,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:23,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539592402] [2022-11-21 13:55:23,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:23,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:23,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:23,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:23,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:23,104 INFO L85 PathProgramCache]: Analyzing trace with hash 467014384, now seen corresponding path program 1 times [2022-11-21 13:55:23,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:23,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470001736] [2022-11-21 13:55:23,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:23,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:23,107 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:23,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1953842802] [2022-11-21 13:55:23,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:23,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:23,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:23,109 INFO L229 MonitoredProcess]: Starting monitored process 104 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:23,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2022-11-21 13:55:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:23,162 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:23,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:23,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:23,178 INFO L85 PathProgramCache]: Analyzing trace with hash 448000159, now seen corresponding path program 1 times [2022-11-21 13:55:23,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:23,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245979213] [2022-11-21 13:55:23,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:23,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:23,183 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:23,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [998191964] [2022-11-21 13:55:23,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:23,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:23,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:23,188 INFO L229 MonitoredProcess]: Starting monitored process 105 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:23,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2022-11-21 13:55:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:23,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 13:55:23,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:23,299 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-21 13:55:23,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:55:23,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:23,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245979213] [2022-11-21 13:55:23,300 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:55:23,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998191964] [2022-11-21 13:55:23,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998191964] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:55:23,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:55:23,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:55:23,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056343518] [2022-11-21 13:55:23,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:55:23,665 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 13:55:23,665 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 13:55:23,665 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 13:55:23,665 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 13:55:23,665 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-21 13:55:23,666 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:23,666 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 13:55:23,666 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 13:55:23,666 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration14_Loop [2022-11-21 13:55:23,666 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 13:55:23,666 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 13:55:23,667 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-21 13:55:23,686 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-21 13:55:23,689 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-21 13:55:23,691 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-21 13:55:23,693 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-21 13:55:23,695 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-21 13:55:23,699 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-21 13:55:23,793 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 13:55:23,793 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-21 13:55:23,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:23,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:23,794 INFO L229 MonitoredProcess]: Starting monitored process 106 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:23,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2022-11-21 13:55:23,797 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:55:23,797 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:23,812 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:23,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:23,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:23,813 INFO L229 MonitoredProcess]: Starting monitored process 107 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:23,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2022-11-21 13:55:23,816 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-21 13:55:23,816 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:24,573 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-21 13:55:24,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:24,577 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 13:55:24,577 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 13:55:24,578 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 13:55:24,578 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 13:55:24,578 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-21 13:55:24,578 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:24,578 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 13:55:24,578 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 13:55:24,578 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration14_Loop [2022-11-21 13:55:24,578 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 13:55:24,578 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 13:55:24,579 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-21 13:55:24,585 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-21 13:55:24,587 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-21 13:55:24,591 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-21 13:55:24,593 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-21 13:55:24,595 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-21 13:55:24,611 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-21 13:55:24,711 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 13:55:24,711 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-21 13:55:24,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:24,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:24,713 INFO L229 MonitoredProcess]: Starting monitored process 108 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:24,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2022-11-21 13:55:24,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:24,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:24,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:24,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:24,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:24,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:24,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:24,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:24,756 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:24,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:24,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:24,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:24,761 INFO L229 MonitoredProcess]: Starting monitored process 109 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:24,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 13:55:24,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:24,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:24,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:24,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:24,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:24,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:24,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:24,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2022-11-21 13:55:24,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:24,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:24,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:24,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:24,796 INFO L229 MonitoredProcess]: Starting monitored process 110 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:24,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2022-11-21 13:55:24,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:24,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:24,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:24,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:24,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:24,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:24,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:24,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:24,811 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:24,814 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2022-11-21 13:55:24,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:24,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:24,815 INFO L229 MonitoredProcess]: Starting monitored process 111 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:24,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2022-11-21 13:55:24,817 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 13:55:24,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:24,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:24,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:24,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:24,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:24,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:24,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:24,844 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:24,846 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2022-11-21 13:55:24,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:24,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:24,848 INFO L229 MonitoredProcess]: Starting monitored process 112 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:24,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2022-11-21 13:55:24,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:24,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:24,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:24,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:24,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:24,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:24,861 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:24,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:24,870 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:24,873 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2022-11-21 13:55:24,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:24,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:24,874 INFO L229 MonitoredProcess]: Starting monitored process 113 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:24,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2022-11-21 13:55:24,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 13:55:24,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:24,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:24,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:24,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:24,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:24,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:24,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:24,893 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-21 13:55:24,898 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-21 13:55:24,898 INFO L444 ModelExtractionUtils]: 6 out of 9 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-11-21 13:55:24,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:24,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:24,899 INFO L229 MonitoredProcess]: Starting monitored process 114 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:24,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2022-11-21 13:55:24,902 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-21 13:55:24,902 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-21 13:55:24,902 INFO L513 LassoAnalysis]: Proved termination. [2022-11-21 13:55:24,902 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-21 13:55:24,904 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2022-11-21 13:55:24,905 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-21 13:55:24,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:24,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 13:55:24,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:25,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-21 13:55:25,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:25,216 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-21 13:55:25,217 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-21 13:55:25,217 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-21 13:55:25,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:25,507 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-21 13:55:25,511 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-21 13:55:25,512 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-21 13:55:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2022-11-21 13:55:25,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 63 transitions. Stem has 22 letters. Loop has 20 letters. [2022-11-21 13:55:25,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:25,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 63 transitions. Stem has 42 letters. Loop has 20 letters. [2022-11-21 13:55:25,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:25,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 63 transitions. Stem has 22 letters. Loop has 40 letters. [2022-11-21 13:55:25,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:25,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1034 states and 1629 transitions. [2022-11-21 13:55:25,532 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 160 [2022-11-21 13:55:25,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1034 states to 1000 states and 1569 transitions. [2022-11-21 13:55:25,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 356 [2022-11-21 13:55:25,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 361 [2022-11-21 13:55:25,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1000 states and 1569 transitions. [2022-11-21 13:55:25,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:55:25,545 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1000 states and 1569 transitions. [2022-11-21 13:55:25,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states and 1569 transitions. [2022-11-21 13:55:25,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 973. [2022-11-21 13:55:25,576 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-21 13:55:25,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1541 transitions. [2022-11-21 13:55:25,581 INFO L240 hiAutomatonCegarLoop]: Abstraction has 973 states and 1541 transitions. [2022-11-21 13:55:25,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:25,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:55:25,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:55:25,582 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-21 13:55:25,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:25,628 INFO L93 Difference]: Finished difference Result 856 states and 1320 transitions. [2022-11-21 13:55:25,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 856 states and 1320 transitions. [2022-11-21 13:55:25,637 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 160 [2022-11-21 13:55:25,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 856 states to 825 states and 1278 transitions. [2022-11-21 13:55:25,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 320 [2022-11-21 13:55:25,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 320 [2022-11-21 13:55:25,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 825 states and 1278 transitions. [2022-11-21 13:55:25,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:55:25,648 INFO L218 hiAutomatonCegarLoop]: Abstraction has 825 states and 1278 transitions. [2022-11-21 13:55:25,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states and 1278 transitions. [2022-11-21 13:55:25,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 808. [2022-11-21 13:55:25,673 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-21 13:55:25,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1259 transitions. [2022-11-21 13:55:25,681 INFO L240 hiAutomatonCegarLoop]: Abstraction has 808 states and 1259 transitions. [2022-11-21 13:55:25,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:55:25,682 INFO L428 stractBuchiCegarLoop]: Abstraction has 808 states and 1259 transitions. [2022-11-21 13:55:25,682 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-11-21 13:55:25,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 808 states and 1259 transitions. [2022-11-21 13:55:25,688 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 160 [2022-11-21 13:55:25,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:55:25,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:55:25,689 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-21 13:55:25,689 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-21 13:55:25,689 INFO L748 eck$LassoCheckResult]: Stem: 16268#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 16240#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; 16241#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 16267#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; 16287#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 16425#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 16423#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 16224#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 16225#factENTRY ~n := #in~n; 16724#L25 assume ~n <= 0;#res := 1; 16723#factFINAL assume true; 16719#factEXIT >#68#return; 16279#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 16280#factENTRY ~n := #in~n; 16722#L25 assume ~n <= 0;#res := 1; 16716#factFINAL assume true; 16715#factEXIT >#70#return; 16220#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 16221#factENTRY ~n := #in~n; 16794#L25 assume !(~n <= 0); 16229#L26 call #t~ret0 := fact(~n - 1);< 16235#factENTRY ~n := #in~n; 16237#L25 assume ~n <= 0;#res := 1; 16277#factFINAL assume true; 16822#factEXIT >#66#return; 16818#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 16712#factFINAL assume true; 16655#factEXIT >#72#return; 16656#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 16556#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 16551#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 16552#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 16748#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 16726#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 16284#factENTRY ~n := #in~n; 16740#L25 assume !(~n <= 0); 16741#L26 call #t~ret0 := fact(~n - 1);< 16746#factENTRY [2022-11-21 13:55:25,689 INFO L750 eck$LassoCheckResult]: Loop: 16746#factENTRY ~n := #in~n; 16767#L25 assume !(~n <= 0); 16751#L26 call #t~ret0 := fact(~n - 1);< 16746#factENTRY [2022-11-21 13:55:25,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:25,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1580397628, now seen corresponding path program 1 times [2022-11-21 13:55:25,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:25,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252314804] [2022-11-21 13:55:25,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:25,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:25,700 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:25,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [939261393] [2022-11-21 13:55:25,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:25,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:25,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:25,702 INFO L229 MonitoredProcess]: Starting monitored process 115 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:25,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2022-11-21 13:55:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:25,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-21 13:55:25,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:25,823 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-21 13:55:25,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:25,920 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-21 13:55:25,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:25,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252314804] [2022-11-21 13:55:25,920 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:55:25,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939261393] [2022-11-21 13:55:25,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939261393] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:55:25,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:25,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-11-21 13:55:25,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909370717] [2022-11-21 13:55:25,921 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:25,921 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 13:55:25,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:25,922 INFO L85 PathProgramCache]: Analyzing trace with hash 29980, now seen corresponding path program 2 times [2022-11-21 13:55:25,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:25,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039164787] [2022-11-21 13:55:25,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:25,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:25,924 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:25,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:25,952 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 13:55:25,952 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 13:55:25,952 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 13:55:25,952 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 13:55:25,952 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-21 13:55:25,953 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:25,953 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 13:55:25,953 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 13:55:25,953 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration15_Loop [2022-11-21 13:55:25,953 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 13:55:25,953 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 13:55:25,954 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-21 13:55:25,956 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-21 13:55:25,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-21 13:55:25,965 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-21 13:55:25,987 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 13:55:25,987 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-21 13:55:25,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:25,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:25,989 INFO L229 MonitoredProcess]: Starting monitored process 116 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:26,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2022-11-21 13:55:26,003 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:55:26,003 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:26,024 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-21 13:55:26,024 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#res=0} Honda state: {fact_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-21 13:55:26,027 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2022-11-21 13:55:26,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:26,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:26,028 INFO L229 MonitoredProcess]: Starting monitored process 117 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:26,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2022-11-21 13:55:26,030 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:55:26,030 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:26,042 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-21 13:55:26,042 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_~n=0} Honda state: {fact_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-21 13:55:26,045 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2022-11-21 13:55:26,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:26,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:26,046 INFO L229 MonitoredProcess]: Starting monitored process 118 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:26,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2022-11-21 13:55:26,049 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:55:26,049 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:26,060 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-21 13:55:26,060 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-21 13:55:26,063 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2022-11-21 13:55:26,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:26,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:26,064 INFO L229 MonitoredProcess]: Starting monitored process 119 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:26,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2022-11-21 13:55:26,067 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:55:26,067 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:26,080 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2022-11-21 13:55:26,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:26,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:26,081 INFO L229 MonitoredProcess]: Starting monitored process 120 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:26,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2022-11-21 13:55:26,084 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-21 13:55:26,084 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:26,103 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-21 13:55:26,106 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2022-11-21 13:55:26,107 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 13:55:26,107 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 13:55:26,107 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 13:55:26,107 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 13:55:26,107 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-21 13:55:26,107 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:26,107 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 13:55:26,107 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 13:55:26,107 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration15_Loop [2022-11-21 13:55:26,107 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 13:55:26,107 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 13:55:26,108 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-21 13:55:26,124 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-21 13:55:26,126 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-21 13:55:26,131 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-21 13:55:26,157 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 13:55:26,157 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-21 13:55:26,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:26,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:26,159 INFO L229 MonitoredProcess]: Starting monitored process 121 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:26,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2022-11-21 13:55:26,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-21 13:55:26,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:26,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:26,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:26,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:26,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:26,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:26,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:26,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:26,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:26,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:26,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:26,188 INFO L229 MonitoredProcess]: Starting monitored process 122 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:26,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2022-11-21 13:55:26,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 13:55:26,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:26,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:26,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:26,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:26,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:26,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:26,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:26,204 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:26,209 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2022-11-21 13:55:26,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:26,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:26,210 INFO L229 MonitoredProcess]: Starting monitored process 123 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:26,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2022-11-21 13:55:26,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 13:55:26,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:26,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:26,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:26,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:26,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:26,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:26,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:26,225 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-21 13:55:26,227 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-11-21 13:55:26,227 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-21 13:55:26,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:26,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:26,228 INFO L229 MonitoredProcess]: Starting monitored process 124 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:26,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2022-11-21 13:55:26,230 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-21 13:55:26,231 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-21 13:55:26,231 INFO L513 LassoAnalysis]: Proved termination. [2022-11-21 13:55:26,231 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2022-11-21 13:55:26,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:26,234 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-21 13:55:26,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:26,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-21 13:55:26,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:26,506 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:26,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 13:55:26,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:26,552 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-21 13:55:26,552 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-21 13:55:26,553 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-21 13:55:26,661 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-21 13:55:26,662 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-21 13:55:26,662 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-21 13:55:26,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-11-21 13:55:26,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 37 letters. Loop has 3 letters. [2022-11-21 13:55:26,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:26,663 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-21 13:55:26,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:26,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-21 13:55:26,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:26,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 13:55:26,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:26,941 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-21 13:55:26,941 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-21 13:55:26,942 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-21 13:55:27,042 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-21 13:55:27,043 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-21 13:55:27,044 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-21 13:55:27,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-11-21 13:55:27,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 37 letters. Loop has 3 letters. [2022-11-21 13:55:27,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:27,044 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-21 13:55:27,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:27,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-21 13:55:27,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:27,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 13:55:27,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:27,316 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-21 13:55:27,317 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-21 13:55:27,317 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-21 13:55:27,433 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-21 13:55:27,434 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-21 13:55:27,434 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-21 13:55:27,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-11-21 13:55:27,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 37 letters. Loop has 3 letters. [2022-11-21 13:55:27,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:27,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 40 letters. Loop has 3 letters. [2022-11-21 13:55:27,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:27,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 37 letters. Loop has 6 letters. [2022-11-21 13:55:27,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:27,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 996 states and 1473 transitions. [2022-11-21 13:55:27,447 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 154 [2022-11-21 13:55:27,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 996 states to 861 states and 1335 transitions. [2022-11-21 13:55:27,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 310 [2022-11-21 13:55:27,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 319 [2022-11-21 13:55:27,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 861 states and 1335 transitions. [2022-11-21 13:55:27,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:55:27,459 INFO L218 hiAutomatonCegarLoop]: Abstraction has 861 states and 1335 transitions. [2022-11-21 13:55:27,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states and 1335 transitions. [2022-11-21 13:55:27,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 811. [2022-11-21 13:55:27,512 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-21 13:55:27,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1253 transitions. [2022-11-21 13:55:27,524 INFO L240 hiAutomatonCegarLoop]: Abstraction has 811 states and 1253 transitions. [2022-11-21 13:55:27,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:27,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 13:55:27,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:55:27,525 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-21 13:55:27,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:27,780 INFO L93 Difference]: Finished difference Result 852 states and 1328 transitions. [2022-11-21 13:55:27,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 852 states and 1328 transitions. [2022-11-21 13:55:27,789 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 188 [2022-11-21 13:55:27,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 852 states to 818 states and 1288 transitions. [2022-11-21 13:55:27,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 328 [2022-11-21 13:55:27,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 328 [2022-11-21 13:55:27,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 818 states and 1288 transitions. [2022-11-21 13:55:27,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:55:27,800 INFO L218 hiAutomatonCegarLoop]: Abstraction has 818 states and 1288 transitions. [2022-11-21 13:55:27,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states and 1288 transitions. [2022-11-21 13:55:27,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 749. [2022-11-21 13:55:27,825 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-21 13:55:27,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1161 transitions. [2022-11-21 13:55:27,829 INFO L240 hiAutomatonCegarLoop]: Abstraction has 749 states and 1161 transitions. [2022-11-21 13:55:27,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 13:55:27,830 INFO L428 stractBuchiCegarLoop]: Abstraction has 749 states and 1161 transitions. [2022-11-21 13:55:27,830 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-11-21 13:55:27,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 749 states and 1161 transitions. [2022-11-21 13:55:27,835 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 154 [2022-11-21 13:55:27,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:55:27,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:55:27,836 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-21 13:55:27,837 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-21 13:55:27,837 INFO L748 eck$LassoCheckResult]: Stem: 22162#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 22133#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; 22134#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 22161#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; 22186#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 22336#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 22552#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 22120#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 22121#factENTRY ~n := #in~n; 22612#L25 assume ~n <= 0;#res := 1; 22611#factFINAL assume true; 22609#factEXIT >#68#return; 22181#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 22182#factENTRY ~n := #in~n; 22788#L25 assume ~n <= 0;#res := 1; 22787#factFINAL assume true; 22784#factEXIT >#70#return; 22116#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 22117#factENTRY ~n := #in~n; 22617#L25 assume ~n <= 0;#res := 1; 22614#factFINAL assume true; 22613#factEXIT >#72#return; 22152#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 22153#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 22713#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 22712#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 22709#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 22706#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 22707#factENTRY ~n := #in~n; 22710#L25 assume ~n <= 0;#res := 1; 22708#factFINAL assume true; 22705#factEXIT >#74#return; 22112#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 22635#factENTRY ~n := #in~n; 22691#L25 assume ~n <= 0;#res := 1; 22689#factFINAL assume true; 22632#factEXIT >#76#return; 22424#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 22425#factENTRY ~n := #in~n; 22699#L25 assume !(~n <= 0); 22661#L26 call #t~ret0 := fact(~n - 1);< 22697#factENTRY ~n := #in~n; 22702#L25 assume ~n <= 0;#res := 1; 22701#factFINAL assume true; 22696#factEXIT >#66#return; 22652#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22695#factFINAL assume true; 22675#factEXIT >#78#return; 22423#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 22416#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 22417#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 22197#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 22159#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 22160#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 22147#L42-3 [2022-11-21 13:55:27,837 INFO L750 eck$LassoCheckResult]: Loop: 22147#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 22347#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 22250#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 22268#factENTRY ~n := #in~n; 22314#L25 assume !(~n <= 0); 22273#L26 call #t~ret0 := fact(~n - 1);< 22289#factENTRY ~n := #in~n; 22288#L25 assume !(~n <= 0); 22272#L26 call #t~ret0 := fact(~n - 1);< 22287#factENTRY ~n := #in~n; 22291#L25 assume ~n <= 0;#res := 1; 22304#factFINAL assume true; 22303#factEXIT >#66#return; 22276#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22295#factFINAL assume true; 22271#factEXIT >#66#return; 22269#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22270#factFINAL assume true; 22227#factEXIT >#68#return; 22261#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 22346#factENTRY ~n := #in~n; 22350#L25 assume ~n <= 0;#res := 1; 22348#factFINAL assume true; 22345#factEXIT >#70#return; 22244#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 22188#factENTRY ~n := #in~n; 22292#L25 assume !(~n <= 0); 22273#L26 call #t~ret0 := fact(~n - 1);< 22289#factENTRY ~n := #in~n; 22288#L25 assume !(~n <= 0); 22272#L26 call #t~ret0 := fact(~n - 1);< 22287#factENTRY ~n := #in~n; 22291#L25 assume ~n <= 0;#res := 1; 22304#factFINAL assume true; 22303#factEXIT >#66#return; 22276#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22295#factFINAL assume true; 22271#factEXIT >#66#return; 22269#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22270#factFINAL assume true; 22227#factEXIT >#72#return; 22260#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 22343#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 22339#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 22335#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 22332#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 22228#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 22268#factENTRY ~n := #in~n; 22314#L25 assume !(~n <= 0); 22273#L26 call #t~ret0 := fact(~n - 1);< 22289#factENTRY ~n := #in~n; 22290#L25 assume ~n <= 0;#res := 1; 22279#factFINAL assume true; 22281#factEXIT >#66#return; 22294#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22263#factFINAL assume true; 22267#factEXIT >#68#return; 22241#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 22268#factENTRY ~n := #in~n; 22314#L25 assume !(~n <= 0); 22273#L26 call #t~ret0 := fact(~n - 1);< 22289#factENTRY ~n := #in~n; 22290#L25 assume ~n <= 0;#res := 1; 22279#factFINAL assume true; 22281#factEXIT >#66#return; 22294#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22263#factFINAL assume true; 22267#factEXIT >#70#return; 22259#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 22313#factENTRY ~n := #in~n; 22315#L25 assume ~n <= 0;#res := 1; 22297#factFINAL assume true; 22310#factEXIT >#72#return; 22311#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 22504#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 22467#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 22457#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 22455#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 22251#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 22268#factENTRY ~n := #in~n; 22314#L25 assume !(~n <= 0); 22273#L26 call #t~ret0 := fact(~n - 1);< 22289#factENTRY ~n := #in~n; 22290#L25 assume ~n <= 0;#res := 1; 22279#factFINAL assume true; 22281#factEXIT >#66#return; 22294#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22263#factFINAL assume true; 22267#factEXIT >#74#return; 22236#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 22268#factENTRY ~n := #in~n; 22314#L25 assume ~n <= 0;#res := 1; 22297#factFINAL assume true; 22310#factEXIT >#76#return; 22187#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 22188#factENTRY ~n := #in~n; 22292#L25 assume !(~n <= 0); 22273#L26 call #t~ret0 := fact(~n - 1);< 22289#factENTRY ~n := #in~n; 22290#L25 assume ~n <= 0;#res := 1; 22279#factFINAL assume true; 22281#factEXIT >#66#return; 22294#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22263#factFINAL assume true; 22267#factEXIT >#78#return; 22262#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 22195#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 22196#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 22191#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 22158#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 22146#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 22147#L42-3 [2022-11-21 13:55:27,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:27,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1078509977, now seen corresponding path program 1 times [2022-11-21 13:55:27,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:27,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730024739] [2022-11-21 13:55:27,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:27,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:27,844 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:27,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1611551984] [2022-11-21 13:55:27,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:27,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:27,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:27,847 INFO L229 MonitoredProcess]: Starting monitored process 125 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:27,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2022-11-21 13:55:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:27,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 13:55:27,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:27,957 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-21 13:55:27,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:55:27,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:27,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730024739] [2022-11-21 13:55:27,957 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:55:27,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611551984] [2022-11-21 13:55:27,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611551984] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:55:27,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:55:27,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 13:55:27,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013945161] [2022-11-21 13:55:27,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:55:27,958 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 13:55:27,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:27,959 INFO L85 PathProgramCache]: Analyzing trace with hash 860202787, now seen corresponding path program 7 times [2022-11-21 13:55:27,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:27,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185445554] [2022-11-21 13:55:27,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:27,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:27,966 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:27,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1430647436] [2022-11-21 13:55:27,966 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-21 13:55:27,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:27,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:27,969 INFO L229 MonitoredProcess]: Starting monitored process 126 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:27,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2022-11-21 13:55:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:28,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-21 13:55:28,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:28,163 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 373 proven. 54 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-11-21 13:55:28,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:28,532 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 55 proven. 170 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2022-11-21 13:55:28,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:28,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185445554] [2022-11-21 13:55:28,533 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:55:28,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430647436] [2022-11-21 13:55:28,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430647436] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:55:28,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:28,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 16 [2022-11-21 13:55:28,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353276460] [2022-11-21 13:55:28,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:28,534 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 13:55:28,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:28,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:55:28,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:55:28,534 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-21 13:55:28,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:28,685 INFO L93 Difference]: Finished difference Result 683 states and 1003 transitions. [2022-11-21 13:55:28,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 683 states and 1003 transitions. [2022-11-21 13:55:28,692 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 146 [2022-11-21 13:55:28,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 683 states to 579 states and 863 transitions. [2022-11-21 13:55:28,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 285 [2022-11-21 13:55:28,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 285 [2022-11-21 13:55:28,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 579 states and 863 transitions. [2022-11-21 13:55:28,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:55:28,700 INFO L218 hiAutomatonCegarLoop]: Abstraction has 579 states and 863 transitions. [2022-11-21 13:55:28,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states and 863 transitions. [2022-11-21 13:55:28,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 517. [2022-11-21 13:55:28,722 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-21 13:55:28,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 785 transitions. [2022-11-21 13:55:28,724 INFO L240 hiAutomatonCegarLoop]: Abstraction has 517 states and 785 transitions. [2022-11-21 13:55:28,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:55:28,725 INFO L428 stractBuchiCegarLoop]: Abstraction has 517 states and 785 transitions. [2022-11-21 13:55:28,725 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-11-21 13:55:28,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 517 states and 785 transitions. [2022-11-21 13:55:28,729 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2022-11-21 13:55:28,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:55:28,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:55:28,731 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-21 13:55:28,731 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-21 13:55:28,732 INFO L748 eck$LassoCheckResult]: Stem: 24446#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 24409#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; 24410#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 24445#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; 24429#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 24430#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 24822#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 24398#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 24399#factENTRY ~n := #in~n; 24836#L25 assume ~n <= 0;#res := 1; 24834#factFINAL assume true; 24830#factEXIT >#68#return; 24825#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 24826#factENTRY ~n := #in~n; 24829#L25 assume ~n <= 0;#res := 1; 24828#factFINAL assume true; 24824#factEXIT >#70#return; 24394#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 24395#factENTRY ~n := #in~n; 24864#L25 assume ~n <= 0;#res := 1; 24863#factFINAL assume true; 24862#factEXIT >#72#return; 24861#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 24859#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 24857#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 24856#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 24855#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 24675#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 24677#factENTRY ~n := #in~n; 24847#L25 assume !(~n <= 0); 24424#L26 call #t~ret0 := fact(~n - 1);< 24845#factENTRY ~n := #in~n; 24866#L25 assume ~n <= 0;#res := 1; 24865#factFINAL assume true; 24853#factEXIT >#66#return; 24852#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 24841#factFINAL assume true; 24669#factEXIT >#74#return; 24672#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 24386#factENTRY ~n := #in~n; 24860#L25 assume ~n <= 0;#res := 1; 24858#factFINAL assume true; 24854#factEXIT >#76#return; 24674#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 24677#factENTRY ~n := #in~n; 24847#L25 assume !(~n <= 0); 24424#L26 call #t~ret0 := fact(~n - 1);< 24845#factENTRY ~n := #in~n; 24866#L25 assume ~n <= 0;#res := 1; 24865#factFINAL assume true; 24853#factEXIT >#66#return; 24852#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 24841#factFINAL assume true; 24669#factEXIT >#78#return; 24676#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 24660#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 24661#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 24607#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 24443#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 24444#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 24606#L42-3 [2022-11-21 13:55:28,732 INFO L750 eck$LassoCheckResult]: Loop: 24606#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 24583#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 24502#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 24517#factENTRY ~n := #in~n; 24592#L25 assume !(~n <= 0); 24522#L26 call #t~ret0 := fact(~n - 1);< 24536#factENTRY ~n := #in~n; 24537#L25 assume ~n <= 0;#res := 1; 24554#factFINAL assume true; 24520#factEXIT >#66#return; 24526#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 24512#factFINAL assume true; 24516#factEXIT >#68#return; 24612#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 24666#factENTRY ~n := #in~n; 24678#L25 assume ~n <= 0;#res := 1; 24668#factFINAL assume true; 24665#factEXIT >#70#return; 24478#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 24462#factENTRY ~n := #in~n; 24566#L25 assume !(~n <= 0); 24522#L26 call #t~ret0 := fact(~n - 1);< 24536#factENTRY ~n := #in~n; 24535#L25 assume !(~n <= 0); 24529#L26 call #t~ret0 := fact(~n - 1);< 24534#factENTRY ~n := #in~n; 24538#L25 assume ~n <= 0;#res := 1; 24567#factFINAL assume true; 24558#factEXIT >#66#return; 24555#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 24528#factFINAL assume true; 24530#factEXIT >#66#return; 24518#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 24519#factFINAL assume true; 24477#factEXIT >#72#return; 24434#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 24435#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 24438#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 24460#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 24623#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 24513#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 24565#factENTRY ~n := #in~n; 24562#L25 assume !(~n <= 0); 24524#L26 call #t~ret0 := fact(~n - 1);< 24527#factENTRY ~n := #in~n; 24537#L25 assume ~n <= 0;#res := 1; 24554#factFINAL assume true; 24520#factEXIT >#66#return; 24526#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 24512#factFINAL assume true; 24516#factEXIT >#68#return; 24493#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 24517#factENTRY ~n := #in~n; 24592#L25 assume !(~n <= 0); 24522#L26 call #t~ret0 := fact(~n - 1);< 24536#factENTRY ~n := #in~n; 24537#L25 assume ~n <= 0;#res := 1; 24554#factFINAL assume true; 24520#factEXIT >#66#return; 24526#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 24512#factFINAL assume true; 24516#factEXIT >#70#return; 24506#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 24584#factENTRY ~n := #in~n; 24593#L25 assume ~n <= 0;#res := 1; 24563#factFINAL assume true; 24580#factEXIT >#72#return; 24581#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 24634#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 24633#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 24627#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 24628#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 24488#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 24517#factENTRY ~n := #in~n; 24592#L25 assume !(~n <= 0); 24522#L26 call #t~ret0 := fact(~n - 1);< 24536#factENTRY ~n := #in~n; 24537#L25 assume ~n <= 0;#res := 1; 24554#factFINAL assume true; 24520#factEXIT >#66#return; 24526#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 24512#factFINAL assume true; 24516#factEXIT >#74#return; 24497#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 24517#factENTRY ~n := #in~n; 24592#L25 assume ~n <= 0;#res := 1; 24563#factFINAL assume true; 24580#factEXIT >#76#return; 24461#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 24462#factENTRY ~n := #in~n; 24566#L25 assume !(~n <= 0); 24522#L26 call #t~ret0 := fact(~n - 1);< 24536#factENTRY ~n := #in~n; 24537#L25 assume ~n <= 0;#res := 1; 24554#factFINAL assume true; 24520#factEXIT >#66#return; 24526#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 24512#factFINAL assume true; 24516#factEXIT >#78#return; 24411#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 24412#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 24467#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 24468#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 24441#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 24442#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 24606#L42-3 [2022-11-21 13:55:28,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:28,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 2 times [2022-11-21 13:55:28,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:28,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882166590] [2022-11-21 13:55:28,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:28,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:28,740 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:28,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1748930204] [2022-11-21 13:55:28,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:55:28,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:28,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:28,746 INFO L229 MonitoredProcess]: Starting monitored process 127 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:28,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2022-11-21 13:55:28,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:55:28,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-21 13:55:28,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:28,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:28,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:28,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1908626325, now seen corresponding path program 8 times [2022-11-21 13:55:28,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:28,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167673616] [2022-11-21 13:55:28,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:28,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:28,893 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:28,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1185753754] [2022-11-21 13:55:28,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:55:28,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:28,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:28,901 INFO L229 MonitoredProcess]: Starting monitored process 128 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:28,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2022-11-21 13:55:28,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:55:28,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:55:28,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-21 13:55:28,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 302 proven. 90 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-21 13:55:29,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:29,579 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 42 proven. 199 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2022-11-21 13:55:29,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:29,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167673616] [2022-11-21 13:55:29,579 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:55:29,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185753754] [2022-11-21 13:55:29,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185753754] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:55:29,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:29,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 19 [2022-11-21 13:55:29,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884449333] [2022-11-21 13:55:29,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:29,581 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 13:55:29,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:29,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-21 13:55:29,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-11-21 13:55:29,581 INFO L87 Difference]: Start difference. First operand 517 states and 785 transitions. cyclomatic complexity: 278 Second operand has 19 states, 14 states have (on average 3.5) internal successors, (49), 17 states have internal predecessors, (49), 12 states have call successors, (23), 2 states have call predecessors, (23), 6 states have return successors, (23), 9 states have call predecessors, (23), 12 states have call successors, (23) [2022-11-21 13:55:30,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:30,308 INFO L93 Difference]: Finished difference Result 667 states and 988 transitions. [2022-11-21 13:55:30,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 667 states and 988 transitions. [2022-11-21 13:55:30,315 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 180 [2022-11-21 13:55:30,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 667 states to 667 states and 988 transitions. [2022-11-21 13:55:30,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 328 [2022-11-21 13:55:30,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 328 [2022-11-21 13:55:30,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 667 states and 988 transitions. [2022-11-21 13:55:30,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:55:30,323 INFO L218 hiAutomatonCegarLoop]: Abstraction has 667 states and 988 transitions. [2022-11-21 13:55:30,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states and 988 transitions. [2022-11-21 13:55:30,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 523. [2022-11-21 13:55:30,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 327 states have (on average 1.1345565749235473) internal successors, (371), 334 states have internal predecessors, (371), 156 states have call successors, (156), 40 states have call predecessors, (156), 40 states have return successors, (270), 148 states have call predecessors, (270), 156 states have call successors, (270) [2022-11-21 13:55:30,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 797 transitions. [2022-11-21 13:55:30,343 INFO L240 hiAutomatonCegarLoop]: Abstraction has 523 states and 797 transitions. [2022-11-21 13:55:30,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-21 13:55:30,344 INFO L428 stractBuchiCegarLoop]: Abstraction has 523 states and 797 transitions. [2022-11-21 13:55:30,344 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-11-21 13:55:30,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 523 states and 797 transitions. [2022-11-21 13:55:30,349 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 125 [2022-11-21 13:55:30,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:55:30,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:55:30,350 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-21 13:55:30,351 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-21 13:55:30,351 INFO L748 eck$LassoCheckResult]: Stem: 26295#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 26268#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; 26269#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 26294#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; 26321#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 26459#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 26458#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 26260#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 26261#factENTRY ~n := #in~n; 26448#L25 assume ~n <= 0;#res := 1; 26444#factFINAL assume true; 26442#factEXIT >#68#return; 26310#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 26311#factENTRY ~n := #in~n; 26514#L25 assume ~n <= 0;#res := 1; 26513#factFINAL assume true; 26512#factEXIT >#70#return; 26254#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 26255#factENTRY ~n := #in~n; 26264#L25 assume ~n <= 0;#res := 1; 26526#factFINAL assume true; 26525#factEXIT >#72#return; 26288#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 26289#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 26292#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 26544#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 26515#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 26275#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 26322#factENTRY ~n := #in~n; 26330#L25 assume !(~n <= 0); 26274#L26 call #t~ret0 := fact(~n - 1);< 26276#factENTRY ~n := #in~n; 26523#L25 assume ~n <= 0;#res := 1; 26537#factFINAL assume true; 26535#factEXIT >#66#return; 26536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26542#factFINAL assume true; 26543#factEXIT >#74#return; 26246#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 26241#factENTRY ~n := #in~n; 26333#L25 assume ~n <= 0;#res := 1; 26258#factFINAL assume true; 26244#factEXIT >#76#return; 26249#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 26322#factENTRY ~n := #in~n; 26330#L25 assume !(~n <= 0); 26274#L26 call #t~ret0 := fact(~n - 1);< 26276#factENTRY ~n := #in~n; 26523#L25 assume ~n <= 0;#res := 1; 26537#factFINAL assume true; 26535#factEXIT >#66#return; 26536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26542#factFINAL assume true; 26543#factEXIT >#78#return; 26541#L30-8 [2022-11-21 13:55:30,351 INFO L750 eck$LassoCheckResult]: Loop: 26541#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 26545#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 26318#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 26319#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 26524#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 26240#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 26241#factENTRY ~n := #in~n; 26333#L25 assume !(~n <= 0); 26274#L26 call #t~ret0 := fact(~n - 1);< 26276#factENTRY ~n := #in~n; 26522#L25 assume !(~n <= 0); 26307#L26 call #t~ret0 := fact(~n - 1);< 26521#factENTRY ~n := #in~n; 26306#L25 assume ~n <= 0;#res := 1; 26308#factFINAL assume true; 26532#factEXIT >#66#return; 26533#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26538#factFINAL assume true; 26534#factEXIT >#66#return; 26299#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26300#factFINAL assume true; 26540#factEXIT >#74#return; 26245#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 26241#factENTRY ~n := #in~n; 26333#L25 assume ~n <= 0;#res := 1; 26258#factFINAL assume true; 26244#factEXIT >#76#return; 26250#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 26322#factENTRY ~n := #in~n; 26330#L25 assume !(~n <= 0); 26274#L26 call #t~ret0 := fact(~n - 1);< 26276#factENTRY ~n := #in~n; 26522#L25 assume !(~n <= 0); 26307#L26 call #t~ret0 := fact(~n - 1);< 26521#factENTRY ~n := #in~n; 26306#L25 assume ~n <= 0;#res := 1; 26308#factFINAL assume true; 26532#factEXIT >#66#return; 26533#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26538#factFINAL assume true; 26534#factEXIT >#66#return; 26299#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26300#factFINAL assume true; 26540#factEXIT >#78#return; 26541#L30-8 [2022-11-21 13:55:30,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:30,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1908361933, now seen corresponding path program 1 times [2022-11-21 13:55:30,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:30,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142964107] [2022-11-21 13:55:30,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:30,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:30,360 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:30,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1242097311] [2022-11-21 13:55:30,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:30,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:30,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:30,366 INFO L229 MonitoredProcess]: Starting monitored process 129 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:30,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2022-11-21 13:55:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:30,428 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:30,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:30,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:30,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1514306572, now seen corresponding path program 1 times [2022-11-21 13:55:30,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:30,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655685233] [2022-11-21 13:55:30,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:30,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:30,461 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:30,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1003034774] [2022-11-21 13:55:30,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:30,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:30,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:30,466 INFO L229 MonitoredProcess]: Starting monitored process 130 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:30,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Waiting until timeout for monitored process [2022-11-21 13:55:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:30,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:30,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:30,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:30,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1326926298, now seen corresponding path program 1 times [2022-11-21 13:55:30,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:30,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238640983] [2022-11-21 13:55:30,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:30,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:30,581 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:30,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [359927582] [2022-11-21 13:55:30,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:30,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:30,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:30,586 INFO L229 MonitoredProcess]: Starting monitored process 131 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:30,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Waiting until timeout for monitored process [2022-11-21 13:55:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:30,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:30,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:31,355 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 13:55:31,355 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 13:55:31,355 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 13:55:31,355 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 13:55:31,355 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-21 13:55:31,356 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:31,356 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 13:55:31,356 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 13:55:31,356 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration18_Loop [2022-11-21 13:55:31,356 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 13:55:31,356 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 13:55: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-21 13:55:31,387 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-21 13:55: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-21 13:55: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-21 13:55:31,393 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-21 13:55:31,512 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 13:55:31,512 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-21 13:55:31,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:31,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:31,518 INFO L229 MonitoredProcess]: Starting monitored process 132 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:31,529 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:55:31,529 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:31,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2022-11-21 13:55:31,556 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:31,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:31,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:31,558 INFO L229 MonitoredProcess]: Starting monitored process 133 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:31,562 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-21 13:55:31,562 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:31,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2022-11-21 13:55:31,606 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-21 13:55:31,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:31,611 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 13:55:31,611 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 13:55:31,611 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 13:55:31,611 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 13:55:31,611 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-21 13:55:31,611 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:31,611 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 13:55:31,611 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 13:55:31,611 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration18_Loop [2022-11-21 13:55:31,611 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 13:55:31,611 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 13:55:31,612 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-21 13:55:31,615 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-21 13:55:31,617 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-21 13:55:31,619 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-21 13:55:31,648 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-21 13:55:31,764 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 13:55:31,764 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-21 13:55:31,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:31,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:31,766 INFO L229 MonitoredProcess]: Starting monitored process 134 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:31,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:31,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2022-11-21 13:55:31,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:31,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:31,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:31,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:31,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:31,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:31,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:31,806 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:31,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:31,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:31,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:31,812 INFO L229 MonitoredProcess]: Starting monitored process 135 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:31,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-21 13:55:31,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:31,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:31,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:31,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:31,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:31,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:31,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:31,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2022-11-21 13:55:31,842 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:31,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:31,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:31,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:31,847 INFO L229 MonitoredProcess]: Starting monitored process 136 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:31,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 13:55:31,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:31,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:31,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:31,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:31,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:31,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:31,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:31,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2022-11-21 13:55:31,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:31,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:31,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:31,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:31,880 INFO L229 MonitoredProcess]: Starting monitored process 137 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:31,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:31,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2022-11-21 13:55:31,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:31,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:31,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:31,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:31,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:31,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:31,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:31,904 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-21 13:55:31,908 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-21 13:55:31,908 INFO L444 ModelExtractionUtils]: 8 out of 11 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-21 13:55:31,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:31,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:31,910 INFO L229 MonitoredProcess]: Starting monitored process 138 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:31,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2022-11-21 13:55:31,912 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-21 13:55:31,912 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-21 13:55:31,912 INFO L513 LassoAnalysis]: Proved termination. [2022-11-21 13:55:31,912 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~k~0#1) = 1*ULTIMATE.start_main_~x~0#1 - 1*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2022-11-21 13:55:31,915 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2022-11-21 13:55:31,916 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-21 13:55:31,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:32,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-21 13:55:32,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:32,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-21 13:55:32,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:32,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-11-21 13:55:32,523 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-21 13:55:32,523 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 523 states and 797 transitions. cyclomatic complexity: 284 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-21 13:55:32,632 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 523 states and 797 transitions. cyclomatic complexity: 284. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Result 650 states and 947 transitions. Complement of second has 13 states. [2022-11-21 13:55:32,633 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-21 13:55:32,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-21 13:55:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-11-21 13:55:32,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 54 letters. Loop has 44 letters. [2022-11-21 13:55:32,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:32,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 98 letters. Loop has 44 letters. [2022-11-21 13:55:32,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:32,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 54 letters. Loop has 88 letters. [2022-11-21 13:55:32,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:32,642 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 650 states and 947 transitions. [2022-11-21 13:55:32,650 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 116 [2022-11-21 13:55:32,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 650 states to 525 states and 795 transitions. [2022-11-21 13:55:32,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 199 [2022-11-21 13:55:32,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 199 [2022-11-21 13:55:32,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 525 states and 795 transitions. [2022-11-21 13:55:32,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:55:32,657 INFO L218 hiAutomatonCegarLoop]: Abstraction has 525 states and 795 transitions. [2022-11-21 13:55:32,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states and 795 transitions. [2022-11-21 13:55:32,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 523. [2022-11-21 13:55:32,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 329 states have (on average 1.1428571428571428) internal successors, (376), 335 states have internal predecessors, (376), 151 states have call successors, (151), 41 states have call predecessors, (151), 43 states have return successors, (265), 146 states have call predecessors, (265), 151 states have call successors, (265) [2022-11-21 13:55:32,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 792 transitions. [2022-11-21 13:55:32,676 INFO L240 hiAutomatonCegarLoop]: Abstraction has 523 states and 792 transitions. [2022-11-21 13:55:32,676 INFO L428 stractBuchiCegarLoop]: Abstraction has 523 states and 792 transitions. [2022-11-21 13:55:32,676 INFO L335 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2022-11-21 13:55:32,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 523 states and 792 transitions. [2022-11-21 13:55:32,680 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 116 [2022-11-21 13:55:32,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:55:32,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:55:32,681 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-21 13:55:32,681 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-21 13:55:32,681 INFO L748 eck$LassoCheckResult]: Stem: 27801#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 27768#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; 27769#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 27800#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; 27786#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 27787#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 28044#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 28042#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 28043#factENTRY ~n := #in~n; 28046#L25 assume ~n <= 0;#res := 1; 28045#factFINAL assume true; 28041#factEXIT >#68#return; 28039#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 28040#factENTRY ~n := #in~n; 28048#L25 assume ~n <= 0;#res := 1; 28047#factFINAL assume true; 28038#factEXIT >#70#return; 28036#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 28037#factENTRY ~n := #in~n; 28050#L25 assume ~n <= 0;#res := 1; 28049#factFINAL assume true; 28035#factEXIT >#72#return; 28034#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 28031#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 28029#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 28028#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 28027#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 28019#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 28021#factENTRY ~n := #in~n; 28070#L25 assume !(~n <= 0); 28033#L26 call #t~ret0 := fact(~n - 1);< 28061#factENTRY ~n := #in~n; 28068#L25 assume ~n <= 0;#res := 1; 28067#factFINAL assume true; 28060#factEXIT >#66#return; 28058#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28024#factFINAL assume true; 28016#factEXIT >#74#return; 28018#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 28025#factENTRY ~n := #in~n; 28032#L25 assume ~n <= 0;#res := 1; 28030#factFINAL assume true; 28026#factEXIT >#76#return; 28020#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 28021#factENTRY ~n := #in~n; 28070#L25 assume !(~n <= 0); 28033#L26 call #t~ret0 := fact(~n - 1);< 28061#factENTRY ~n := #in~n; 28068#L25 assume ~n <= 0;#res := 1; 28067#factFINAL assume true; 28060#factEXIT >#66#return; 28058#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28024#factFINAL assume true; 28016#factEXIT >#78#return; 28009#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 27993#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 27992#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 27984#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 27798#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 27799#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 27964#L42-3 [2022-11-21 13:55:32,682 INFO L750 eck$LassoCheckResult]: Loop: 27964#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 27963#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 27815#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 27743#factENTRY ~n := #in~n; 27966#L25 assume !(~n <= 0); 27911#L26 call #t~ret0 := fact(~n - 1);< 27931#factENTRY ~n := #in~n; 27914#L25 assume ~n <= 0;#res := 1; 27912#factFINAL assume true; 27908#factEXIT >#66#return; 27805#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27832#factFINAL assume true; 27971#factEXIT >#68#return; 27751#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 27764#factENTRY ~n := #in~n; 27765#L25 assume ~n <= 0;#res := 1; 27762#factFINAL assume true; 27750#factEXIT >#70#return; 27753#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 27747#factENTRY ~n := #in~n; 27938#L25 assume !(~n <= 0); 27911#L26 call #t~ret0 := fact(~n - 1);< 27931#factENTRY ~n := #in~n; 27914#L25 assume ~n <= 0;#res := 1; 27912#factFINAL assume true; 27908#factEXIT >#66#return; 27805#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27832#factFINAL assume true; 27971#factEXIT >#72#return; 27790#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 27791#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 27794#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 27852#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 27853#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 27777#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 27949#factENTRY ~n := #in~n; 27944#L25 assume !(~n <= 0); 27774#L26 call #t~ret0 := fact(~n - 1);< 27778#factENTRY ~n := #in~n; 27914#L25 assume ~n <= 0;#res := 1; 27912#factFINAL assume true; 27908#factEXIT >#66#return; 27805#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27832#factFINAL assume true; 27971#factEXIT >#68#return; 27824#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 27743#factENTRY ~n := #in~n; 27966#L25 assume !(~n <= 0); 27911#L26 call #t~ret0 := fact(~n - 1);< 27931#factENTRY ~n := #in~n; 27914#L25 assume ~n <= 0;#res := 1; 27912#factFINAL assume true; 27908#factEXIT >#66#return; 27805#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27832#factFINAL assume true; 27971#factEXIT >#70#return; 27959#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 27965#factENTRY ~n := #in~n; 27967#L25 assume ~n <= 0;#res := 1; 27945#factFINAL assume true; 27957#factEXIT >#72#return; 27962#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 28001#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 27999#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 27997#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 27995#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 27823#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 27743#factENTRY ~n := #in~n; 27966#L25 assume !(~n <= 0); 27911#L26 call #t~ret0 := fact(~n - 1);< 27931#factENTRY ~n := #in~n; 27914#L25 assume ~n <= 0;#res := 1; 27912#factFINAL assume true; 27908#factEXIT >#66#return; 27805#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27832#factFINAL assume true; 27971#factEXIT >#74#return; 27818#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 27743#factENTRY ~n := #in~n; 27966#L25 assume ~n <= 0;#res := 1; 27945#factFINAL assume true; 27957#factEXIT >#76#return; 27827#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 27747#factENTRY ~n := #in~n; 27938#L25 assume !(~n <= 0); 27911#L26 call #t~ret0 := fact(~n - 1);< 27931#factENTRY ~n := #in~n; 27914#L25 assume ~n <= 0;#res := 1; 27912#factFINAL assume true; 27908#factEXIT >#66#return; 27805#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27832#factFINAL assume true; 27971#factEXIT >#78#return; 27973#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 27864#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 27865#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 27860#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 27796#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 27797#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 27964#L42-3 [2022-11-21 13:55:32,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:32,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 3 times [2022-11-21 13:55:32,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:32,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313758480] [2022-11-21 13:55:32,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:32,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:32,689 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:32,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1450922337] [2022-11-21 13:55:32,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 13:55:32,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:32,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:32,691 INFO L229 MonitoredProcess]: Starting monitored process 139 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:32,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Waiting until timeout for monitored process [2022-11-21 13:55:32,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-21 13:55:32,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-21 13:55:32,770 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:32,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:32,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:32,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1813506637, now seen corresponding path program 9 times [2022-11-21 13:55:32,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:32,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408021235] [2022-11-21 13:55:32,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:32,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:32,818 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:32,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [334468617] [2022-11-21 13:55:32,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 13:55:32,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:32,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:32,823 INFO L229 MonitoredProcess]: Starting monitored process 140 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:32,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Waiting until timeout for monitored process [2022-11-21 13:55:32,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-21 13:55:32,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:55:32,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-21 13:55:32,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:33,079 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 96 proven. 53 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2022-11-21 13:55:33,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:33,441 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 94 proven. 56 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2022-11-21 13:55:33,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:33,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408021235] [2022-11-21 13:55:33,442 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:55:33,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334468617] [2022-11-21 13:55:33,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334468617] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:55:33,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:33,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2022-11-21 13:55:33,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716474266] [2022-11-21 13:55:33,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:33,443 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 13:55:33,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:33,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-21 13:55:33,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-11-21 13:55:33,444 INFO L87 Difference]: Start difference. First operand 523 states and 792 transitions. cyclomatic complexity: 279 Second operand has 23 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 23 states have internal predecessors, (46), 11 states have call successors, (17), 1 states have call predecessors, (17), 4 states have return successors, (17), 6 states have call predecessors, (17), 11 states have call successors, (17) [2022-11-21 13:55:34,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:34,586 INFO L93 Difference]: Finished difference Result 846 states and 1312 transitions. [2022-11-21 13:55:34,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 846 states and 1312 transitions. [2022-11-21 13:55:34,594 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 186 [2022-11-21 13:55:34,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 846 states to 840 states and 1306 transitions. [2022-11-21 13:55:34,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 350 [2022-11-21 13:55:34,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 350 [2022-11-21 13:55:34,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 840 states and 1306 transitions. [2022-11-21 13:55:34,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:55:34,604 INFO L218 hiAutomatonCegarLoop]: Abstraction has 840 states and 1306 transitions. [2022-11-21 13:55:34,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states and 1306 transitions. [2022-11-21 13:55:34,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 574. [2022-11-21 13:55:34,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 360 states have (on average 1.1444444444444444) internal successors, (412), 364 states have internal predecessors, (412), 171 states have call successors, (171), 41 states have call predecessors, (171), 43 states have return successors, (299), 168 states have call predecessors, (299), 171 states have call successors, (299) [2022-11-21 13:55:34,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 882 transitions. [2022-11-21 13:55:34,629 INFO L240 hiAutomatonCegarLoop]: Abstraction has 574 states and 882 transitions. [2022-11-21 13:55:34,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 13:55:34,630 INFO L428 stractBuchiCegarLoop]: Abstraction has 574 states and 882 transitions. [2022-11-21 13:55:34,630 INFO L335 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2022-11-21 13:55:34,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 574 states and 882 transitions. [2022-11-21 13:55:34,634 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 122 [2022-11-21 13:55:34,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:55:34,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:55:34,636 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-21 13:55:34,636 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-21 13:55:34,636 INFO L748 eck$LassoCheckResult]: Stem: 29834#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 29807#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; 29808#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 29833#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; 29818#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 29819#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 29836#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 29792#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 29793#factENTRY ~n := #in~n; 30195#L25 assume ~n <= 0;#res := 1; 30194#factFINAL assume true; 30193#factEXIT >#68#return; 30177#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 30186#factENTRY ~n := #in~n; 30190#L25 assume ~n <= 0;#res := 1; 30187#factFINAL assume true; 30176#factEXIT >#70#return; 30178#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 30220#factENTRY ~n := #in~n; 30222#L25 assume ~n <= 0;#res := 1; 30221#factFINAL assume true; 30219#factEXIT >#72#return; 30218#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 30217#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 30213#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 30214#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 30209#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 30210#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 30226#factENTRY ~n := #in~n; 30268#L25 assume !(~n <= 0); 29815#L26 call #t~ret0 := fact(~n - 1);< 30261#factENTRY ~n := #in~n; 30270#L25 assume ~n <= 0;#res := 1; 30269#factFINAL assume true; 30267#factEXIT >#66#return; 30266#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30265#factFINAL assume true; 30252#factEXIT >#74#return; 30245#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 30229#factENTRY ~n := #in~n; 30264#L25 assume ~n <= 0;#res := 1; 30263#factFINAL assume true; 30251#factEXIT >#76#return; 30225#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 30226#factENTRY ~n := #in~n; 30268#L25 assume !(~n <= 0); 29815#L26 call #t~ret0 := fact(~n - 1);< 30261#factENTRY ~n := #in~n; 30270#L25 assume ~n <= 0;#res := 1; 30269#factFINAL assume true; 30267#factEXIT >#66#return; 30266#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30265#factFINAL assume true; 30252#factEXIT >#78#return; 30253#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 30330#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 30329#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 30327#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 29831#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 29832#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 29947#L42-3 [2022-11-21 13:55:34,637 INFO L750 eck$LassoCheckResult]: Loop: 29947#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 29946#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 29888#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 29909#factENTRY ~n := #in~n; 29919#L25 assume !(~n <= 0); 29920#L26 call #t~ret0 := fact(~n - 1);< 29932#factENTRY ~n := #in~n; 29935#L25 assume ~n <= 0;#res := 1; 29928#factFINAL assume true; 29925#factEXIT >#66#return; 29924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 29903#factFINAL assume true; 29907#factEXIT >#68#return; 29922#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 29971#factENTRY ~n := #in~n; 29973#L25 assume ~n <= 0;#res := 1; 29972#factFINAL assume true; 29970#factEXIT >#70#return; 29890#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 29902#factENTRY ~n := #in~n; 29934#L25 assume !(~n <= 0); 29920#L26 call #t~ret0 := fact(~n - 1);< 29932#factENTRY ~n := #in~n; 29935#L25 assume ~n <= 0;#res := 1; 29928#factFINAL assume true; 29925#factEXIT >#66#return; 29924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 29903#factFINAL assume true; 29907#factEXIT >#72#return; 29923#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 29995#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 29992#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 29988#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 29986#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 29906#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 29908#factENTRY ~n := #in~n; 29933#L25 assume !(~n <= 0); 29926#L26 call #t~ret0 := fact(~n - 1);< 29814#factENTRY ~n := #in~n; 29935#L25 assume ~n <= 0;#res := 1; 29928#factFINAL assume true; 29925#factEXIT >#66#return; 29924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 29903#factFINAL assume true; 29907#factEXIT >#68#return; 29880#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 29909#factENTRY ~n := #in~n; 29919#L25 assume !(~n <= 0); 29920#L26 call #t~ret0 := fact(~n - 1);< 29932#factENTRY ~n := #in~n; 29935#L25 assume ~n <= 0;#res := 1; 29928#factFINAL assume true; 29925#factEXIT >#66#return; 29924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 29903#factFINAL assume true; 29907#factEXIT >#70#return; 29899#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 29917#factENTRY ~n := #in~n; 29918#L25 assume ~n <= 0;#res := 1; 29916#factFINAL assume true; 29912#factEXIT >#72#return; 29914#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 29945#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 29944#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 29943#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 29942#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 29874#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 29909#factENTRY ~n := #in~n; 29919#L25 assume !(~n <= 0); 29920#L26 call #t~ret0 := fact(~n - 1);< 29932#factENTRY ~n := #in~n; 29979#L25 assume !(~n <= 0); 29930#L26 call #t~ret0 := fact(~n - 1);< 29976#factENTRY ~n := #in~n; 29980#L25 assume ~n <= 0;#res := 1; 29982#factFINAL assume true; 29981#factEXIT >#66#return; 29931#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 29975#factFINAL assume true; 29929#factEXIT >#66#return; 29910#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 29911#factFINAL assume true; 29862#factEXIT >#74#return; 29893#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 29909#factENTRY ~n := #in~n; 29919#L25 assume !(~n <= 0); 29920#L26 call #t~ret0 := fact(~n - 1);< 29932#factENTRY ~n := #in~n; 29935#L25 assume ~n <= 0;#res := 1; 29928#factFINAL assume true; 29925#factEXIT >#66#return; 29924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 29903#factFINAL assume true; 29907#factEXIT >#76#return; 29872#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 29902#factENTRY ~n := #in~n; 29934#L25 assume !(~n <= 0); 29920#L26 call #t~ret0 := fact(~n - 1);< 29932#factENTRY ~n := #in~n; 29935#L25 assume ~n <= 0;#res := 1; 29928#factFINAL assume true; 29925#factEXIT >#66#return; 29924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 29903#factFINAL assume true; 29907#factEXIT >#78#return; 29895#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 29941#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 29940#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 29851#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 29829#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 29830#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 29947#L42-3 [2022-11-21 13:55:34,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:34,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 4 times [2022-11-21 13:55:34,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:34,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063377156] [2022-11-21 13:55:34,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:34,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:34,644 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:34,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1060142538] [2022-11-21 13:55:34,645 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 13:55:34,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:34,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:34,650 INFO L229 MonitoredProcess]: Starting monitored process 141 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:34,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Waiting until timeout for monitored process [2022-11-21 13:55:34,720 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 13:55:34,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-21 13:55:34,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:34,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:34,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:34,753 INFO L85 PathProgramCache]: Analyzing trace with hash 590406435, now seen corresponding path program 10 times [2022-11-21 13:55:34,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:34,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130545587] [2022-11-21 13:55:34,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:34,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:34,764 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:34,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1402464178] [2022-11-21 13:55:34,764 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 13:55:34,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:34,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:34,770 INFO L229 MonitoredProcess]: Starting monitored process 142 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:34,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Waiting until timeout for monitored process [2022-11-21 13:55:34,870 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 13:55:34,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-21 13:55:34,871 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:34,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:34,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:34,931 INFO L85 PathProgramCache]: Analyzing trace with hash 736681859, now seen corresponding path program 5 times [2022-11-21 13:55:34,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:34,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305786749] [2022-11-21 13:55:34,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:34,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:34,947 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:34,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [982286270] [2022-11-21 13:55:34,947 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 13:55:34,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:34,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:34,955 INFO L229 MonitoredProcess]: Starting monitored process 143 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:34,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Waiting until timeout for monitored process [2022-11-21 13:55:35,077 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2022-11-21 13:55:35,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:55:35,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-21 13:55:35,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:35,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1355 backedges. 628 proven. 95 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2022-11-21 13:55:35,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1355 backedges. 76 proven. 146 refuted. 0 times theorem prover too weak. 1133 trivial. 0 not checked. [2022-11-21 13:55:35,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:35,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305786749] [2022-11-21 13:55:35,546 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:55:35,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982286270] [2022-11-21 13:55:35,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982286270] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:55:35,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:35,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 18 [2022-11-21 13:55:35,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638735378] [2022-11-21 13:55:35,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:39,489 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 13:55:39,489 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 13:55:39,489 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 13:55:39,489 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 13:55:39,489 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-21 13:55:39,489 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:39,489 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 13:55:39,489 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 13:55:39,489 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration20_Loop [2022-11-21 13:55:39,489 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 13:55:39,489 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 13:55:39,491 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-21 13:55:39,492 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-21 13:55:39,497 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-21 13:55:39,498 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-21 13:55:39,500 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-21 13:55:39,502 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-21 13:55:39,580 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-21 13:55:39,582 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-21 13:55:39,990 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 13:55:39,990 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-21 13:55:39,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:39,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:39,993 INFO L229 MonitoredProcess]: Starting monitored process 144 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:39,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2022-11-21 13:55:39,995 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:55:39,995 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:40,006 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-21 13:55:40,006 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-21 13:55:40,009 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:40,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:40,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:40,010 INFO L229 MonitoredProcess]: Starting monitored process 145 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:40,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2022-11-21 13:55:40,013 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:55:40,013 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:40,024 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-21 13:55:40,024 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-21 13:55:40,027 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2022-11-21 13:55:40,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:40,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:40,028 INFO L229 MonitoredProcess]: Starting monitored process 146 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:40,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2022-11-21 13:55:40,031 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:55:40,031 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:40,043 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-21 13:55:40,043 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-21 13:55:40,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:40,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:40,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:40,052 INFO L229 MonitoredProcess]: Starting monitored process 147 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:40,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2022-11-21 13:55:40,055 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:55:40,055 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:40,066 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-21 13:55:40,066 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-21 13:55:40,069 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2022-11-21 13:55:40,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:40,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:40,070 INFO L229 MonitoredProcess]: Starting monitored process 148 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:40,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2022-11-21 13:55:40,072 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:55:40,072 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:40,084 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-21 13:55:40,084 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-21 13:55:40,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:40,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:40,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:40,088 INFO L229 MonitoredProcess]: Starting monitored process 149 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:40,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2022-11-21 13:55:40,090 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:55:40,091 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:40,138 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2022-11-21 13:55:40,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:40,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:40,139 INFO L229 MonitoredProcess]: Starting monitored process 150 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:40,143 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-21 13:55:40,143 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:40,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2022-11-21 13:55:40,173 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-21 13:55:40,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2022-11-21 13:55:40,176 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 13:55:40,176 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 13:55:40,176 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 13:55:40,176 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 13:55:40,176 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-21 13:55:40,176 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:40,176 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 13:55:40,176 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 13:55:40,176 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration20_Loop [2022-11-21 13:55:40,176 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 13:55:40,176 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 13:55:40,177 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-21 13:55:40,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-21 13:55:40,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-21 13:55:40,192 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-21 13:55:40,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-21 13:55:40,202 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-21 13:55:40,204 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-21 13:55:40,291 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-21 13:55:40,700 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 13:55:40,701 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-21 13:55:40,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:40,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:40,707 INFO L229 MonitoredProcess]: Starting monitored process 151 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:40,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2022-11-21 13:55:40,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:40,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:40,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:40,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:40,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:40,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:40,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:40,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:40,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:40,725 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2022-11-21 13:55:40,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:40,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:40,727 INFO L229 MonitoredProcess]: Starting monitored process 152 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:40,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2022-11-21 13:55:40,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 13:55:40,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:40,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:40,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:40,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:40,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:40,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:40,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:40,743 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:40,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:40,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:40,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:40,747 INFO L229 MonitoredProcess]: Starting monitored process 153 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:40,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2022-11-21 13:55:40,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:40,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:40,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:40,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:40,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:40,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:40,761 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:40,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:40,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:40,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:40,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:40,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:40,767 INFO L229 MonitoredProcess]: Starting monitored process 154 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:40,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2022-11-21 13:55:40,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 13:55:40,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:40,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:40,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:40,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:40,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:40,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:40,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:40,782 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:40,784 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2022-11-21 13:55:40,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:40,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:40,786 INFO L229 MonitoredProcess]: Starting monitored process 155 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:40,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2022-11-21 13:55:40,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:40,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:40,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:40,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:40,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:40,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:40,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:40,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:40,800 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:40,802 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2022-11-21 13:55:40,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:40,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:40,803 INFO L229 MonitoredProcess]: Starting monitored process 156 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:40,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2022-11-21 13:55:40,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:40,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:40,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:40,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:40,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:40,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:40,817 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:40,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:40,818 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:40,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:40,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:40,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:40,822 INFO L229 MonitoredProcess]: Starting monitored process 157 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:40,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2022-11-21 13:55:40,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 13:55:40,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:40,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:40,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:40,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:40,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:40,838 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:40,838 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:40,843 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-21 13:55:40,848 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-11-21 13:55:40,848 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-11-21 13:55:40,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:40,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:40,850 INFO L229 MonitoredProcess]: Starting monitored process 158 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:40,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2022-11-21 13:55:40,873 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-21 13:55:40,873 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-21 13:55:40,873 INFO L513 LassoAnalysis]: Proved termination. [2022-11-21 13:55:40,873 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~n~0#1) = 1*ULTIMATE.start_main_~x~0#1 - 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2022-11-21 13:55:40,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:40,880 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-21 13:55:40,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:40,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-21 13:55:40,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:41,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-21 13:55:41,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:41,848 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 29 proven. 94 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2022-11-21 13:55:41,849 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 11 loop predicates [2022-11-21 13:55:41,849 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 574 states and 882 transitions. cyclomatic complexity: 319 Second operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 7 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (18), 8 states have call predecessors, (18), 7 states have call successors, (18) [2022-11-21 13:55:42,435 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 574 states and 882 transitions. cyclomatic complexity: 319. Second operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 7 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (18), 8 states have call predecessors, (18), 7 states have call successors, (18) Result 2098 states and 3085 transitions. Complement of second has 58 states. [2022-11-21 13:55:42,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2022-11-21 13:55:42,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 7 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (18), 8 states have call predecessors, (18), 7 states have call successors, (18) [2022-11-21 13:55:42,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 120 transitions. [2022-11-21 13:55:42,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 120 transitions. Stem has 60 letters. Loop has 111 letters. [2022-11-21 13:55:42,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:42,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 120 transitions. Stem has 171 letters. Loop has 111 letters. [2022-11-21 13:55:42,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:42,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 120 transitions. Stem has 60 letters. Loop has 222 letters. [2022-11-21 13:55:42,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:42,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2098 states and 3085 transitions. [2022-11-21 13:55:42,460 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 81 [2022-11-21 13:55:42,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2098 states to 1191 states and 1692 transitions. [2022-11-21 13:55:42,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 321 [2022-11-21 13:55:42,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 322 [2022-11-21 13:55:42,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1191 states and 1692 transitions. [2022-11-21 13:55:42,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:55:42,474 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1191 states and 1692 transitions. [2022-11-21 13:55:42,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states and 1692 transitions. [2022-11-21 13:55:42,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1086. [2022-11-21 13:55:42,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 716 states have (on average 1.1201117318435754) internal successors, (802), 709 states have internal predecessors, (802), 261 states have call successors, (261), 98 states have call predecessors, (261), 109 states have return successors, (443), 278 states have call predecessors, (443), 261 states have call successors, (443) [2022-11-21 13:55:42,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1506 transitions. [2022-11-21 13:55:42,577 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1086 states and 1506 transitions. [2022-11-21 13:55:42,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:42,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-21 13:55:42,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-11-21 13:55:42,578 INFO L87 Difference]: Start difference. First operand 1086 states and 1506 transitions. Second operand has 18 states, 16 states have (on average 4.25) internal successors, (68), 18 states have internal predecessors, (68), 11 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (29), 8 states have call predecessors, (29), 11 states have call successors, (29) [2022-11-21 13:55:42,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:43,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:43,259 INFO L93 Difference]: Finished difference Result 1723 states and 2476 transitions. [2022-11-21 13:55:43,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1723 states and 2476 transitions. [2022-11-21 13:55:43,277 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 111 [2022-11-21 13:55:43,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1723 states to 1344 states and 1938 transitions. [2022-11-21 13:55:43,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 360 [2022-11-21 13:55:43,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 360 [2022-11-21 13:55:43,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1344 states and 1938 transitions. [2022-11-21 13:55:43,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:55:43,293 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1344 states and 1938 transitions. [2022-11-21 13:55:43,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states and 1938 transitions. [2022-11-21 13:55:43,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1012. [2022-11-21 13:55:43,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 668 states have (on average 1.1152694610778444) internal successors, (745), 661 states have internal predecessors, (745), 235 states have call successors, (235), 98 states have call predecessors, (235), 109 states have return successors, (398), 252 states have call predecessors, (398), 235 states have call successors, (398) [2022-11-21 13:55:43,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1378 transitions. [2022-11-21 13:55:43,333 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1012 states and 1378 transitions. [2022-11-21 13:55:43,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-21 13:55:43,334 INFO L428 stractBuchiCegarLoop]: Abstraction has 1012 states and 1378 transitions. [2022-11-21 13:55:43,334 INFO L335 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2022-11-21 13:55:43,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1012 states and 1378 transitions. [2022-11-21 13:55:43,338 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 68 [2022-11-21 13:55:43,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:55:43,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:55:43,340 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 6, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:43,340 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 21, 12, 12, 12, 12, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:43,341 INFO L748 eck$LassoCheckResult]: Stem: 36983#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 36956#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; 36957#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 36982#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; 36969#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 36970#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 37780#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 36940#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 36941#factENTRY ~n := #in~n; 37783#L25 assume ~n <= 0;#res := 1; 37782#factFINAL assume true; 37781#factEXIT >#68#return; 37005#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 37006#factENTRY ~n := #in~n; 37816#L25 assume ~n <= 0;#res := 1; 37815#factFINAL assume true; 37813#factEXIT >#70#return; 37814#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 37822#factENTRY ~n := #in~n; 37823#L25 assume ~n <= 0;#res := 1; 37819#factFINAL assume true; 37820#factEXIT >#72#return; 37832#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 37830#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 37831#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 37846#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 37824#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 37825#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 37839#factENTRY ~n := #in~n; 37873#L25 assume !(~n <= 0); 37869#L26 call #t~ret0 := fact(~n - 1);< 37872#factENTRY ~n := #in~n; 37877#L25 assume !(~n <= 0); 37870#L26 call #t~ret0 := fact(~n - 1);< 37876#factENTRY ~n := #in~n; 37881#L25 assume ~n <= 0;#res := 1; 37880#factFINAL assume true; 37879#factEXIT >#66#return; 37871#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37875#factFINAL assume true; 37868#factEXIT >#66#return; 37867#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37865#factFINAL assume true; 37857#factEXIT >#74#return; 37842#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 37843#factENTRY ~n := #in~n; 37887#L25 assume !(~n <= 0); 37869#L26 call #t~ret0 := fact(~n - 1);< 37872#factENTRY ~n := #in~n; 37878#L25 assume ~n <= 0;#res := 1; 37895#factFINAL assume true; 37893#factEXIT >#66#return; 37891#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37890#factFINAL assume true; 37888#factEXIT >#76#return; 37859#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 37839#factENTRY ~n := #in~n; 37873#L25 assume !(~n <= 0); 37869#L26 call #t~ret0 := fact(~n - 1);< 37872#factENTRY ~n := #in~n; 37878#L25 assume ~n <= 0;#res := 1; 37895#factFINAL assume true; 37893#factEXIT >#66#return; 37891#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37890#factFINAL assume true; 37888#factEXIT >#78#return; 37889#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#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; 37923#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 37261#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 37259#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 37257#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 37136#L42-3 [2022-11-21 13:55:43,341 INFO L750 eck$LassoCheckResult]: Loop: 37136#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 37134#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 37123#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 37132#factENTRY ~n := #in~n; 37171#L25 assume !(~n <= 0); 37045#L26 call #t~ret0 := fact(~n - 1);< 36963#factENTRY ~n := #in~n; 37071#L25 assume !(~n <= 0); 37042#L26 call #t~ret0 := fact(~n - 1);< 37070#factENTRY ~n := #in~n; 37072#L25 assume ~n <= 0;#res := 1; 37080#factFINAL assume true; 37077#factEXIT >#66#return; 37048#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37068#factFINAL assume true; 37038#factEXIT >#66#return; 37051#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37165#factFINAL assume true; 37156#factEXIT >#68#return; 37158#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 37167#factENTRY ~n := #in~n; 37170#L25 assume ~n <= 0;#res := 1; 37169#factFINAL assume true; 37166#factEXIT >#70#return; 37129#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 37160#factENTRY ~n := #in~n; 37172#L25 assume !(~n <= 0); 37045#L26 call #t~ret0 := fact(~n - 1);< 36963#factENTRY ~n := #in~n; 37071#L25 assume !(~n <= 0); 37042#L26 call #t~ret0 := fact(~n - 1);< 37070#factENTRY ~n := #in~n; 37072#L25 assume ~n <= 0;#res := 1; 37080#factFINAL assume true; 37077#factEXIT >#66#return; 37048#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37068#factFINAL assume true; 37038#factEXIT >#66#return; 37051#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37165#factFINAL assume true; 37156#factEXIT >#72#return; 37157#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 37191#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 37189#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 37184#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 37179#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 37119#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 37132#factENTRY ~n := #in~n; 37171#L25 assume !(~n <= 0); 37045#L26 call #t~ret0 := fact(~n - 1);< 36963#factENTRY ~n := #in~n; 37071#L25 assume !(~n <= 0); 37042#L26 call #t~ret0 := fact(~n - 1);< 37070#factENTRY ~n := #in~n; 37072#L25 assume ~n <= 0;#res := 1; 37080#factFINAL assume true; 37077#factEXIT >#66#return; 37048#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37068#factFINAL assume true; 37038#factEXIT >#66#return; 37051#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37165#factFINAL assume true; 37156#factEXIT >#68#return; 37122#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 37132#factENTRY ~n := #in~n; 37171#L25 assume !(~n <= 0); 37045#L26 call #t~ret0 := fact(~n - 1);< 36963#factENTRY ~n := #in~n; 37066#L25 assume ~n <= 0;#res := 1; 37065#factFINAL assume true; 37052#factEXIT >#66#return; 37063#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37168#factFINAL assume true; 37161#factEXIT >#70#return; 37125#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 37132#factENTRY ~n := #in~n; 37171#L25 assume !(~n <= 0); 37045#L26 call #t~ret0 := fact(~n - 1);< 36963#factENTRY ~n := #in~n; 37071#L25 assume !(~n <= 0); 37042#L26 call #t~ret0 := fact(~n - 1);< 37070#factENTRY ~n := #in~n; 37072#L25 assume ~n <= 0;#res := 1; 37080#factFINAL assume true; 37077#factEXIT >#66#return; 37048#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37068#factFINAL assume true; 37038#factEXIT >#66#return; 37051#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37165#factFINAL assume true; 37156#factEXIT >#72#return; 37159#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 37176#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 37173#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 37073#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 37074#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 37019#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 37027#factENTRY ~n := #in~n; 37034#L25 assume !(~n <= 0); 37035#L26 call #t~ret0 := fact(~n - 1);< 36963#factENTRY ~n := #in~n; 37071#L25 assume !(~n <= 0); 37042#L26 call #t~ret0 := fact(~n - 1);< 37070#factENTRY ~n := #in~n; 37072#L25 assume ~n <= 0;#res := 1; 37080#factFINAL assume true; 37077#factEXIT >#66#return; 37048#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37068#factFINAL assume true; 37038#factEXIT >#66#return; 37037#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37036#factFINAL assume true; 37029#factEXIT >#74#return; 37021#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 37027#factENTRY ~n := #in~n; 37034#L25 assume ~n <= 0;#res := 1; 37033#factFINAL assume true; 37028#factEXIT >#76#return; 37023#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 37025#factENTRY ~n := #in~n; 37064#L25 assume !(~n <= 0); 37035#L26 call #t~ret0 := fact(~n - 1);< 36963#factENTRY ~n := #in~n; 37066#L25 assume ~n <= 0;#res := 1; 37065#factFINAL assume true; 37052#factEXIT >#66#return; 37030#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37026#factFINAL assume true; 37018#factEXIT >#78#return; 37017#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 37016#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 37015#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 37013#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 36978#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 36979#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 37136#L42-3 [2022-11-21 13:55:43,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:43,342 INFO L85 PathProgramCache]: Analyzing trace with hash -90593263, now seen corresponding path program 6 times [2022-11-21 13:55:43,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:43,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468851188] [2022-11-21 13:55:43,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:43,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:43,351 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:43,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1992684310] [2022-11-21 13:55:43,351 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-21 13:55:43,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:43,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:43,353 INFO L229 MonitoredProcess]: Starting monitored process 159 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:43,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (159)] Waiting until timeout for monitored process [2022-11-21 13:55:43,433 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-11-21 13:55:43,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:55:43,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 13:55:43,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:43,482 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 98 proven. 1 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-11-21 13:55:43,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:43,583 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-11-21 13:55:43,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:43,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468851188] [2022-11-21 13:55:43,583 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:55:43,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992684310] [2022-11-21 13:55:43,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992684310] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:55:43,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:43,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-11-21 13:55:43,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866615128] [2022-11-21 13:55:43,584 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:43,584 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 13:55:43,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:43,584 INFO L85 PathProgramCache]: Analyzing trace with hash 124067347, now seen corresponding path program 11 times [2022-11-21 13:55:43,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:43,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401934479] [2022-11-21 13:55:43,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:43,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:43,595 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:43,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [989935586] [2022-11-21 13:55:43,595 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 13:55:43,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:43,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:43,597 INFO L229 MonitoredProcess]: Starting monitored process 160 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:43,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (160)] Waiting until timeout for monitored process [2022-11-21 13:55:43,703 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-11-21 13:55:43,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:55:43,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-21 13:55:43,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:43,850 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 531 proven. 154 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2022-11-21 13:55:43,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 117 proven. 298 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2022-11-21 13:55:44,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:44,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401934479] [2022-11-21 13:55:44,433 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:55:44,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989935586] [2022-11-21 13:55:44,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989935586] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:55:44,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:44,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 20 [2022-11-21 13:55:44,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827358843] [2022-11-21 13:55:44,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:44,434 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 13:55:44,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:44,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:55:44,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:55:44,435 INFO L87 Difference]: Start difference. First operand 1012 states and 1378 transitions. cyclomatic complexity: 382 Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-21 13:55:44,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:44,618 INFO L93 Difference]: Finished difference Result 1022 states and 1386 transitions. [2022-11-21 13:55:44,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1022 states and 1386 transitions. [2022-11-21 13:55:44,626 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 68 [2022-11-21 13:55:44,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1022 states to 1022 states and 1386 transitions. [2022-11-21 13:55:44,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 288 [2022-11-21 13:55:44,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 288 [2022-11-21 13:55:44,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1022 states and 1386 transitions. [2022-11-21 13:55:44,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:55:44,637 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1022 states and 1386 transitions. [2022-11-21 13:55:44,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states and 1386 transitions. [2022-11-21 13:55:44,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1008. [2022-11-21 13:55:44,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 666 states have (on average 1.1156156156156156) internal successors, (743), 659 states have internal predecessors, (743), 234 states have call successors, (234), 98 states have call predecessors, (234), 108 states have return successors, (390), 250 states have call predecessors, (390), 234 states have call successors, (390) [2022-11-21 13:55:44,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1367 transitions. [2022-11-21 13:55:44,667 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1008 states and 1367 transitions. [2022-11-21 13:55:44,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:55:44,671 INFO L428 stractBuchiCegarLoop]: Abstraction has 1008 states and 1367 transitions. [2022-11-21 13:55:44,672 INFO L335 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2022-11-21 13:55:44,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1008 states and 1367 transitions. [2022-11-21 13:55:44,677 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 68 [2022-11-21 13:55:44,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:55:44,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:55:44,678 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 9, 6, 3, 3, 3, 3, 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-21 13:55:44,678 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 21, 12, 12, 12, 12, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:44,678 INFO L748 eck$LassoCheckResult]: Stem: 40272#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 40244#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; 40245#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 40271#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; 40257#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 40258#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 41100#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 40231#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 40232#factENTRY ~n := #in~n; 41109#L25 assume ~n <= 0;#res := 1; 41108#factFINAL assume true; 41095#factEXIT >#68#return; 40294#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 40295#factENTRY ~n := #in~n; 41093#L25 assume ~n <= 0;#res := 1; 41092#factFINAL assume true; 41089#factEXIT >#70#return; 41085#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 41086#factENTRY ~n := #in~n; 41091#L25 assume ~n <= 0;#res := 1; 41088#factFINAL assume true; 41084#factEXIT >#72#return; 41081#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 41080#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 41079#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 41077#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 41072#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 41060#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 41062#factENTRY ~n := #in~n; 41078#L25 assume !(~n <= 0); 41068#L26 call #t~ret0 := fact(~n - 1);< 41076#factENTRY ~n := #in~n; 41087#L25 assume !(~n <= 0); 41074#L26 call #t~ret0 := fact(~n - 1);< 41083#factENTRY ~n := #in~n; 41090#L25 assume ~n <= 0;#res := 1; 41107#factFINAL assume true; 41106#factEXIT >#66#return; 41075#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 41082#factFINAL assume true; 41073#factEXIT >#66#return; 41071#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 41070#factFINAL assume true; 41069#factEXIT >#74#return; 41059#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 41065#factENTRY ~n := #in~n; 41067#L25 assume ~n <= 0;#res := 1; 41066#factFINAL assume true; 41064#factEXIT >#76#return; 41061#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 41062#factENTRY ~n := #in~n; 41078#L25 assume !(~n <= 0); 41068#L26 call #t~ret0 := fact(~n - 1);< 41076#factENTRY ~n := #in~n; 41105#L25 assume ~n <= 0;#res := 1; 41104#factFINAL assume true; 41103#factEXIT >#66#return; 41102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 41101#factFINAL assume true; 41056#factEXIT >#78#return; 41054#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 40657#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 40654#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 40493#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 40494#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 40495#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 40469#L42-3 [2022-11-21 13:55:44,679 INFO L750 eck$LassoCheckResult]: Loop: 40469#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 40435#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 40393#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 40401#factENTRY ~n := #in~n; 40442#L25 assume !(~n <= 0); 40330#L26 call #t~ret0 := fact(~n - 1);< 40341#factENTRY ~n := #in~n; 40357#L25 assume !(~n <= 0); 40328#L26 call #t~ret0 := fact(~n - 1);< 40354#factENTRY ~n := #in~n; 40360#L25 assume ~n <= 0;#res := 1; 40361#factFINAL assume true; 40358#factEXIT >#66#return; 40335#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40353#factFINAL assume true; 40326#factEXIT >#66#return; 40337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40436#factFINAL assume true; 40385#factEXIT >#68#return; 40398#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 40428#factENTRY ~n := #in~n; 40468#L25 assume ~n <= 0;#res := 1; 40452#factFINAL assume true; 40422#factEXIT >#70#return; 40392#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 40418#factENTRY ~n := #in~n; 40443#L25 assume !(~n <= 0); 40330#L26 call #t~ret0 := fact(~n - 1);< 40341#factENTRY ~n := #in~n; 40357#L25 assume !(~n <= 0); 40328#L26 call #t~ret0 := fact(~n - 1);< 40354#factENTRY ~n := #in~n; 40360#L25 assume ~n <= 0;#res := 1; 40361#factFINAL assume true; 40358#factEXIT >#66#return; 40335#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40353#factFINAL assume true; 40326#factEXIT >#66#return; 40337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40436#factFINAL assume true; 40385#factEXIT >#72#return; 40397#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 40482#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 40480#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 40478#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 40476#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 40386#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 40401#factENTRY ~n := #in~n; 40442#L25 assume !(~n <= 0); 40330#L26 call #t~ret0 := fact(~n - 1);< 40341#factENTRY ~n := #in~n; 40357#L25 assume !(~n <= 0); 40328#L26 call #t~ret0 := fact(~n - 1);< 40354#factENTRY ~n := #in~n; 40360#L25 assume ~n <= 0;#res := 1; 40361#factFINAL assume true; 40358#factEXIT >#66#return; 40335#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40353#factFINAL assume true; 40326#factEXIT >#66#return; 40337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40436#factFINAL assume true; 40385#factEXIT >#68#return; 40388#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 40401#factENTRY ~n := #in~n; 40442#L25 assume !(~n <= 0); 40330#L26 call #t~ret0 := fact(~n - 1);< 40341#factENTRY ~n := #in~n; 40359#L25 assume ~n <= 0;#res := 1; 40356#factFINAL assume true; 40342#factEXIT >#66#return; 40347#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40415#factFINAL assume true; 40417#factEXIT >#70#return; 40394#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 40401#factENTRY ~n := #in~n; 40442#L25 assume !(~n <= 0); 40330#L26 call #t~ret0 := fact(~n - 1);< 40341#factENTRY ~n := #in~n; 40359#L25 assume ~n <= 0;#res := 1; 40356#factFINAL assume true; 40342#factEXIT >#66#return; 40347#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40415#factFINAL assume true; 40417#factEXIT >#72#return; 40382#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 40383#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 40438#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 40373#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 40319#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 40310#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 40315#factENTRY ~n := #in~n; 40322#L25 assume !(~n <= 0); 40323#L26 call #t~ret0 := fact(~n - 1);< 40341#factENTRY ~n := #in~n; 40357#L25 assume !(~n <= 0); 40328#L26 call #t~ret0 := fact(~n - 1);< 40354#factENTRY ~n := #in~n; 40360#L25 assume ~n <= 0;#res := 1; 40361#factFINAL assume true; 40358#factEXIT >#66#return; 40335#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40353#factFINAL assume true; 40326#factEXIT >#66#return; 40325#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40324#factFINAL assume true; 40317#factEXIT >#74#return; 40311#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 40315#factENTRY ~n := #in~n; 40322#L25 assume !(~n <= 0); 40323#L26 call #t~ret0 := fact(~n - 1);< 40341#factENTRY ~n := #in~n; 40359#L25 assume ~n <= 0;#res := 1; 40356#factFINAL assume true; 40342#factEXIT >#66#return; 40318#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40314#factFINAL assume true; 40306#factEXIT >#76#return; 40309#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 40313#factENTRY ~n := #in~n; 40355#L25 assume !(~n <= 0); 40323#L26 call #t~ret0 := fact(~n - 1);< 40341#factENTRY ~n := #in~n; 40359#L25 assume ~n <= 0;#res := 1; 40356#factFINAL assume true; 40342#factEXIT >#66#return; 40318#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40314#factFINAL assume true; 40306#factEXIT >#78#return; 40305#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 40304#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 40303#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 40301#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 40267#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 40268#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 40469#L42-3 [2022-11-21 13:55:44,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:44,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1443030823, now seen corresponding path program 7 times [2022-11-21 13:55:44,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:44,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806497859] [2022-11-21 13:55:44,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:44,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:44,687 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:44,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1420391490] [2022-11-21 13:55:44,687 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-21 13:55:44,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:44,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:44,694 INFO L229 MonitoredProcess]: Starting monitored process 161 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:44,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (161)] Waiting until timeout for monitored process [2022-11-21 13:55:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:44,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-21 13:55:44,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:44,829 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 105 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-21 13:55:44,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:45,019 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 29 proven. 28 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-11-21 13:55:45,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:45,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806497859] [2022-11-21 13:55:45,019 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:55:45,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420391490] [2022-11-21 13:55:45,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420391490] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:55:45,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:45,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2022-11-21 13:55:45,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139518243] [2022-11-21 13:55:45,020 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:45,021 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 13:55:45,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:45,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1421429331, now seen corresponding path program 12 times [2022-11-21 13:55:45,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:45,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546490596] [2022-11-21 13:55:45,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:45,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:45,029 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:45,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [679257572] [2022-11-21 13:55:45,029 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-21 13:55:45,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:45,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:45,034 INFO L229 MonitoredProcess]: Starting monitored process 162 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:45,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (162)] Waiting until timeout for monitored process [2022-11-21 13:55:45,139 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-11-21 13:55:45,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:55:45,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-21 13:55:45,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:45,251 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 65 proven. 32 refuted. 0 times theorem prover too weak. 892 trivial. 0 not checked. [2022-11-21 13:55:45,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:45,489 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 65 proven. 32 refuted. 0 times theorem prover too weak. 892 trivial. 0 not checked. [2022-11-21 13:55:45,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:45,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546490596] [2022-11-21 13:55:45,490 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:55:45,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679257572] [2022-11-21 13:55:45,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679257572] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:55:45,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:45,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2022-11-21 13:55:45,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933869641] [2022-11-21 13:55:45,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:45,491 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 13:55:45,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:45,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 13:55:45,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:55:45,492 INFO L87 Difference]: Start difference. First operand 1008 states and 1367 transitions. cyclomatic complexity: 375 Second operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 10 states have internal predecessors, (39), 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-21 13:55:45,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:45,727 INFO L93 Difference]: Finished difference Result 1240 states and 1697 transitions. [2022-11-21 13:55:45,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1240 states and 1697 transitions. [2022-11-21 13:55:45,737 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 87 [2022-11-21 13:55:45,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1240 states to 1082 states and 1500 transitions. [2022-11-21 13:55:45,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 361 [2022-11-21 13:55:45,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 361 [2022-11-21 13:55:45,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1082 states and 1500 transitions. [2022-11-21 13:55:45,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:55:45,750 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1082 states and 1500 transitions. [2022-11-21 13:55:45,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states and 1500 transitions. [2022-11-21 13:55:45,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 841. [2022-11-21 13:55:45,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 552 states have (on average 1.1123188405797102) internal successors, (614), 548 states have internal predecessors, (614), 202 states have call successors, (202), 85 states have call predecessors, (202), 87 states have return successors, (329), 207 states have call predecessors, (329), 202 states have call successors, (329) [2022-11-21 13:55:45,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1145 transitions. [2022-11-21 13:55:45,779 INFO L240 hiAutomatonCegarLoop]: Abstraction has 841 states and 1145 transitions. [2022-11-21 13:55:45,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 13:55:45,780 INFO L428 stractBuchiCegarLoop]: Abstraction has 841 states and 1145 transitions. [2022-11-21 13:55:45,781 INFO L335 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2022-11-21 13:55:45,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 841 states and 1145 transitions. [2022-11-21 13:55:45,785 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 68 [2022-11-21 13:55:45,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:55:45,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:55:45,786 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [14, 14, 9, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:45,786 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-21 13:55:45,787 INFO L748 eck$LassoCheckResult]: Stem: 43747#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 43720#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; 43721#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 43746#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; 43732#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 43733#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 44384#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 43699#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 43700#factENTRY ~n := #in~n; 44444#L25 assume ~n <= 0;#res := 1; 44442#factFINAL assume true; 44441#factEXIT >#68#return; 44439#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 44440#factENTRY ~n := #in~n; 44446#L25 assume ~n <= 0;#res := 1; 44445#factFINAL assume true; 44438#factEXIT >#70#return; 43686#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 43687#factENTRY ~n := #in~n; 44427#L25 assume ~n <= 0;#res := 1; 44426#factFINAL assume true; 44425#factEXIT >#72#return; 44424#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 44423#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 44422#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 44421#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 44420#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 43682#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 43683#factENTRY ~n := #in~n; 44468#L25 assume !(~n <= 0); 44458#L26 call #t~ret0 := fact(~n - 1);< 44465#factENTRY ~n := #in~n; 44469#L25 assume ~n <= 0;#res := 1; 44467#factFINAL assume true; 44464#factEXIT >#66#return; 44462#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44460#factFINAL assume true; 44454#factEXIT >#74#return; 44450#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 44456#factENTRY ~n := #in~n; 44457#L25 assume ~n <= 0;#res := 1; 44449#factFINAL assume true; 44451#factEXIT >#76#return; 43765#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 43683#factENTRY ~n := #in~n; 44468#L25 assume !(~n <= 0); 44458#L26 call #t~ret0 := fact(~n - 1);< 44465#factENTRY ~n := #in~n; 44469#L25 assume ~n <= 0;#res := 1; 44467#factFINAL assume true; 44464#factEXIT >#66#return; 44462#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44460#factFINAL assume true; 44454#factEXIT >#78#return; 43724#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 43725#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 43731#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 44305#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 44303#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 43989#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 44270#factENTRY ~n := #in~n; 44345#L25 assume !(~n <= 0); 44317#L26 call #t~ret0 := fact(~n - 1);< 44319#factENTRY ~n := #in~n; 44399#L25 assume !(~n <= 0); 44316#L26 call #t~ret0 := fact(~n - 1);< 44397#factENTRY ~n := #in~n; 44404#L25 assume ~n <= 0;#res := 1; 44403#factFINAL assume true; 44402#factEXIT >#66#return; 44318#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44396#factFINAL assume true; 44315#factEXIT >#66#return; 44313#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44310#factFINAL assume true; 44302#factEXIT >#74#return; 43990#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 44270#factENTRY ~n := #in~n; 44345#L25 assume ~n <= 0;#res := 1; 44432#factFINAL assume true; 44256#factEXIT >#76#return; 43991#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 43993#factENTRY ~n := #in~n; 44321#L25 assume !(~n <= 0); 44317#L26 call #t~ret0 := fact(~n - 1);< 44319#factENTRY ~n := #in~n; 44401#L25 assume ~n <= 0;#res := 1; 44466#factFINAL assume true; 44463#factEXIT >#66#return; 44461#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44459#factFINAL assume true; 43988#factEXIT >#78#return; 43992#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 43984#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 43985#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 44153#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 43905#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 43906#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 43897#L42-3 [2022-11-21 13:55:45,787 INFO L750 eck$LassoCheckResult]: Loop: 43897#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 43895#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 43891#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 43894#factENTRY ~n := #in~n; 43933#L25 assume !(~n <= 0); 43795#L26 call #t~ret0 := fact(~n - 1);< 43728#factENTRY ~n := #in~n; 43820#L25 assume !(~n <= 0); 43793#L26 call #t~ret0 := fact(~n - 1);< 43819#factENTRY ~n := #in~n; 43821#L25 assume ~n <= 0;#res := 1; 43827#factFINAL assume true; 43826#factEXIT >#66#return; 43799#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43818#factFINAL assume true; 43789#factEXIT >#66#return; 43801#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43957#factFINAL assume true; 43953#factEXIT >#68#return; 43956#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 43964#factENTRY ~n := #in~n; 43966#L25 assume ~n <= 0;#res := 1; 43965#factFINAL assume true; 43963#factEXIT >#70#return; 43893#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 43951#factENTRY ~n := #in~n; 43952#L25 assume !(~n <= 0); 43795#L26 call #t~ret0 := fact(~n - 1);< 43728#factENTRY ~n := #in~n; 43820#L25 assume !(~n <= 0); 43793#L26 call #t~ret0 := fact(~n - 1);< 43819#factENTRY ~n := #in~n; 43821#L25 assume ~n <= 0;#res := 1; 43827#factFINAL assume true; 43826#factEXIT >#66#return; 43799#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43818#factFINAL assume true; 43789#factEXIT >#66#return; 43801#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43957#factFINAL assume true; 43953#factEXIT >#72#return; 43954#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 43961#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 43943#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 43940#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 43938#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 43881#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 43894#factENTRY ~n := #in~n; 43933#L25 assume !(~n <= 0); 43795#L26 call #t~ret0 := fact(~n - 1);< 43728#factENTRY ~n := #in~n; 43820#L25 assume !(~n <= 0); 43793#L26 call #t~ret0 := fact(~n - 1);< 43819#factENTRY ~n := #in~n; 43821#L25 assume ~n <= 0;#res := 1; 43827#factFINAL assume true; 43826#factEXIT >#66#return; 43799#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43818#factFINAL assume true; 43789#factEXIT >#66#return; 43801#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43957#factFINAL assume true; 43953#factEXIT >#68#return; 43886#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 43894#factENTRY ~n := #in~n; 43933#L25 assume !(~n <= 0); 43795#L26 call #t~ret0 := fact(~n - 1);< 43728#factENTRY ~n := #in~n; 43816#L25 assume ~n <= 0;#res := 1; 43815#factFINAL assume true; 43803#factEXIT >#66#return; 43813#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43950#factFINAL assume true; 43946#factEXIT >#70#return; 43889#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 43894#factENTRY ~n := #in~n; 43933#L25 assume !(~n <= 0); 43795#L26 call #t~ret0 := fact(~n - 1);< 43728#factENTRY ~n := #in~n; 43816#L25 assume ~n <= 0;#res := 1; 43815#factFINAL assume true; 43803#factEXIT >#66#return; 43813#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43950#factFINAL assume true; 43946#factEXIT >#72#return; 43944#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 43941#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 43824#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 43825#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 43783#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 43771#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 43779#factENTRY ~n := #in~n; 43785#L25 assume !(~n <= 0); 43786#L26 call #t~ret0 := fact(~n - 1);< 43728#factENTRY ~n := #in~n; 43820#L25 assume !(~n <= 0); 43793#L26 call #t~ret0 := fact(~n - 1);< 43819#factENTRY ~n := #in~n; 43821#L25 assume ~n <= 0;#res := 1; 43827#factFINAL assume true; 43826#factEXIT >#66#return; 43799#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43818#factFINAL assume true; 43789#factEXIT >#66#return; 43788#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43787#factFINAL assume true; 43781#factEXIT >#74#return; 43774#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 43779#factENTRY ~n := #in~n; 43785#L25 assume ~n <= 0;#res := 1; 43784#factFINAL assume true; 43780#factEXIT >#76#return; 43775#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 43777#factENTRY ~n := #in~n; 43814#L25 assume !(~n <= 0); 43786#L26 call #t~ret0 := fact(~n - 1);< 43728#factENTRY ~n := #in~n; 43816#L25 assume ~n <= 0;#res := 1; 43815#factFINAL assume true; 43803#factEXIT >#66#return; 43782#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43778#factFINAL assume true; 43770#factEXIT >#78#return; 43769#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 43768#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 43767#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 43766#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 43742#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 43743#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 43897#L42-3 [2022-11-21 13:55:45,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:45,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1866173276, now seen corresponding path program 8 times [2022-11-21 13:55:45,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:45,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347038342] [2022-11-21 13:55:45,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:45,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:45,795 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:45,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [406223323] [2022-11-21 13:55:45,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:55:45,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:45,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:45,802 INFO L229 MonitoredProcess]: Starting monitored process 163 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:45,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (163)] Waiting until timeout for monitored process [2022-11-21 13:55:45,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:55:45,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:55:45,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-21 13:55:45,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:46,027 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 95 proven. 5 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2022-11-21 13:55:46,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:46,279 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 95 proven. 6 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-11-21 13:55:46,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:46,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347038342] [2022-11-21 13:55:46,279 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:55:46,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406223323] [2022-11-21 13:55:46,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406223323] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:55:46,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:46,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2022-11-21 13:55:46,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607938594] [2022-11-21 13:55:46,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:46,280 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 13:55:46,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:46,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1946948763, now seen corresponding path program 13 times [2022-11-21 13:55:46,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:46,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377827140] [2022-11-21 13:55:46,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:46,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:46,288 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:46,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1135797464] [2022-11-21 13:55:46,289 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-21 13:55:46,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:46,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:46,293 INFO L229 MonitoredProcess]: Starting monitored process 164 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:46,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (164)] Waiting until timeout for monitored process [2022-11-21 13:55:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:46,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-21 13:55:46,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:46,569 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 403 proven. 131 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2022-11-21 13:55:46,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:46,952 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 19 proven. 198 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2022-11-21 13:55:46,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:46,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377827140] [2022-11-21 13:55:46,952 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:55:46,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135797464] [2022-11-21 13:55:46,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135797464] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:55:46,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:46,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2022-11-21 13:55:46,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117311993] [2022-11-21 13:55:46,953 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:46,954 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 13:55:46,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:46,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-21 13:55:46,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-21 13:55:46,954 INFO L87 Difference]: Start difference. First operand 841 states and 1145 transitions. cyclomatic complexity: 317 Second operand has 16 states, 14 states have (on average 3.642857142857143) internal successors, (51), 16 states have internal predecessors, (51), 9 states have call successors, (21), 1 states have call predecessors, (21), 3 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) [2022-11-21 13:55:47,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:47,332 INFO L93 Difference]: Finished difference Result 937 states and 1263 transitions. [2022-11-21 13:55:47,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 937 states and 1263 transitions. [2022-11-21 13:55:47,339 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 68 [2022-11-21 13:55:47,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 937 states to 914 states and 1235 transitions. [2022-11-21 13:55:47,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 299 [2022-11-21 13:55:47,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 299 [2022-11-21 13:55:47,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 914 states and 1235 transitions. [2022-11-21 13:55:47,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:55:47,349 INFO L218 hiAutomatonCegarLoop]: Abstraction has 914 states and 1235 transitions. [2022-11-21 13:55:47,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states and 1235 transitions. [2022-11-21 13:55:47,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 836. [2022-11-21 13:55:47,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 550 states have (on average 1.1090909090909091) internal successors, (610), 542 states have internal predecessors, (610), 202 states have call successors, (202), 87 states have call predecessors, (202), 84 states have return successors, (318), 206 states have call predecessors, (318), 202 states have call successors, (318) [2022-11-21 13:55:47,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1130 transitions. [2022-11-21 13:55:47,375 INFO L240 hiAutomatonCegarLoop]: Abstraction has 836 states and 1130 transitions. [2022-11-21 13:55:47,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-21 13:55:47,376 INFO L428 stractBuchiCegarLoop]: Abstraction has 836 states and 1130 transitions. [2022-11-21 13:55:47,376 INFO L335 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2022-11-21 13:55:47,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 836 states and 1130 transitions. [2022-11-21 13:55:47,380 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 68 [2022-11-21 13:55:47,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:55:47,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:55:47,383 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:47,383 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-21 13:55:47,383 INFO L748 eck$LassoCheckResult]: Stem: 46919#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 46890#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; 46891#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 46918#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; 46903#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 46904#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 47541#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 46881#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 46882#factENTRY ~n := #in~n; 47542#L25 assume ~n <= 0;#res := 1; 47540#factFINAL assume true; 47537#factEXIT >#68#return; 46943#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 46944#factENTRY ~n := #in~n; 47678#L25 assume ~n <= 0;#res := 1; 47677#factFINAL assume true; 47675#factEXIT >#70#return; 47670#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 47671#factENTRY ~n := #in~n; 47674#L25 assume ~n <= 0;#res := 1; 47673#factFINAL assume true; 47669#factEXIT >#72#return; 46908#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 46909#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 47667#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 47654#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 46922#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 46923#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 47657#factENTRY ~n := #in~n; 47663#L25 assume !(~n <= 0); 47660#L26 call #t~ret0 := fact(~n - 1);< 47661#factENTRY ~n := #in~n; 47665#L25 assume ~n <= 0;#res := 1; 47664#factFINAL assume true; 47659#factEXIT >#66#return; 47626#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 47627#factFINAL assume true; 47613#factEXIT >#74#return; 47614#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 47658#factENTRY ~n := #in~n; 47662#L25 assume ~n <= 0;#res := 1; 47631#factFINAL assume true; 47632#factEXIT >#76#return; 47615#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 47657#factENTRY ~n := #in~n; 47663#L25 assume !(~n <= 0); 47660#L26 call #t~ret0 := fact(~n - 1);< 47661#factENTRY ~n := #in~n; 47665#L25 assume ~n <= 0;#res := 1; 47664#factFINAL assume true; 47659#factEXIT >#66#return; 47626#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 47627#factFINAL assume true; 47613#factEXIT >#78#return; 47616#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 47622#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 47621#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 47617#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 47604#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 47595#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 47601#factENTRY ~n := #in~n; 47611#L25 assume !(~n <= 0); 47607#L26 call #t~ret0 := fact(~n - 1);< 47610#factENTRY ~n := #in~n; 47620#L25 assume !(~n <= 0); 47608#L26 call #t~ret0 := fact(~n - 1);< 47619#factENTRY ~n := #in~n; 47630#L25 assume ~n <= 0;#res := 1; 47629#factFINAL assume true; 47628#factEXIT >#66#return; 47609#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 47618#factFINAL assume true; 47606#factEXIT >#66#return; 47605#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 47603#factFINAL assume true; 47600#factEXIT >#74#return; 47596#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 47597#factENTRY ~n := #in~n; 47602#L25 assume ~n <= 0;#res := 1; 47599#factFINAL assume true; 47594#factEXIT >#76#return; 47529#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 47530#factENTRY ~n := #in~n; 47612#L25 assume !(~n <= 0); 47607#L26 call #t~ret0 := fact(~n - 1);< 47610#factENTRY ~n := #in~n; 47620#L25 assume !(~n <= 0); 47608#L26 call #t~ret0 := fact(~n - 1);< 47619#factENTRY ~n := #in~n; 47630#L25 assume ~n <= 0;#res := 1; 47629#factFINAL assume true; 47628#factEXIT >#66#return; 47609#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 47618#factFINAL assume true; 47606#factEXIT >#66#return; 47605#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 47603#factFINAL assume true; 47600#factEXIT >#78#return; 47525#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 47524#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 47519#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 47515#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 47514#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 47503#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 47063#L42-3 [2022-11-21 13:55:47,384 INFO L750 eck$LassoCheckResult]: Loop: 47063#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 47053#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 47024#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 47030#factENTRY ~n := #in~n; 47058#L25 assume !(~n <= 0); 46979#L26 call #t~ret0 := fact(~n - 1);< 46897#factENTRY ~n := #in~n; 47005#L25 assume !(~n <= 0); 46975#L26 call #t~ret0 := fact(~n - 1);< 47004#factENTRY ~n := #in~n; 47006#L25 assume ~n <= 0;#res := 1; 47011#factFINAL assume true; 47009#factEXIT >#66#return; 46982#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 47003#factFINAL assume true; 46974#factEXIT >#66#return; 46986#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 47031#factFINAL assume true; 47032#factEXIT >#68#return; 47038#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 47051#factENTRY ~n := #in~n; 47061#L25 assume ~n <= 0;#res := 1; 47060#factFINAL assume true; 47050#factEXIT >#70#return; 47017#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 47034#factENTRY ~n := #in~n; 47040#L25 assume !(~n <= 0); 46979#L26 call #t~ret0 := fact(~n - 1);< 46897#factENTRY ~n := #in~n; 47005#L25 assume !(~n <= 0); 46975#L26 call #t~ret0 := fact(~n - 1);< 47004#factENTRY ~n := #in~n; 47006#L25 assume ~n <= 0;#res := 1; 47011#factFINAL assume true; 47009#factEXIT >#66#return; 46982#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 47003#factFINAL assume true; 46974#factEXIT >#66#return; 46986#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 47031#factFINAL assume true; 47032#factEXIT >#72#return; 47036#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 47044#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 47043#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 47042#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 47041#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 47018#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 47030#factENTRY ~n := #in~n; 47058#L25 assume !(~n <= 0); 46979#L26 call #t~ret0 := fact(~n - 1);< 46897#factENTRY ~n := #in~n; 47005#L25 assume !(~n <= 0); 46975#L26 call #t~ret0 := fact(~n - 1);< 47004#factENTRY ~n := #in~n; 47006#L25 assume ~n <= 0;#res := 1; 47011#factFINAL assume true; 47009#factEXIT >#66#return; 46982#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 47003#factFINAL assume true; 46974#factEXIT >#66#return; 46986#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 47031#factFINAL assume true; 47032#factEXIT >#68#return; 47014#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 47030#factENTRY ~n := #in~n; 47058#L25 assume !(~n <= 0); 46979#L26 call #t~ret0 := fact(~n - 1);< 46897#factENTRY ~n := #in~n; 47001#L25 assume ~n <= 0;#res := 1; 47000#factFINAL assume true; 46988#factEXIT >#66#return; 46993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 47039#factFINAL assume true; 47013#factEXIT >#70#return; 47023#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 47030#factENTRY ~n := #in~n; 47058#L25 assume !(~n <= 0); 46979#L26 call #t~ret0 := fact(~n - 1);< 46897#factENTRY ~n := #in~n; 47001#L25 assume ~n <= 0;#res := 1; 47000#factFINAL assume true; 46988#factEXIT >#66#return; 46993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 47039#factFINAL assume true; 47013#factEXIT >#72#return; 47012#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 47010#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 47008#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 47007#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 46967#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 46958#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 46963#factENTRY ~n := #in~n; 46970#L25 assume !(~n <= 0); 46971#L26 call #t~ret0 := fact(~n - 1);< 46897#factENTRY ~n := #in~n; 47005#L25 assume !(~n <= 0); 46975#L26 call #t~ret0 := fact(~n - 1);< 47004#factENTRY ~n := #in~n; 47006#L25 assume ~n <= 0;#res := 1; 47011#factFINAL assume true; 47009#factEXIT >#66#return; 46982#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 47003#factFINAL assume true; 46974#factEXIT >#66#return; 46973#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 46972#factFINAL assume true; 46965#factEXIT >#74#return; 46956#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 46963#factENTRY ~n := #in~n; 46970#L25 assume ~n <= 0;#res := 1; 46969#factFINAL assume true; 46964#factEXIT >#76#return; 46960#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 46961#factENTRY ~n := #in~n; 46999#L25 assume !(~n <= 0); 46971#L26 call #t~ret0 := fact(~n - 1);< 46897#factENTRY ~n := #in~n; 47001#L25 assume ~n <= 0;#res := 1; 47000#factFINAL assume true; 46988#factEXIT >#66#return; 46966#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 46962#factFINAL assume true; 46955#factEXIT >#78#return; 46954#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 46953#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 46952#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 46951#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 46914#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 46915#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 47063#L42-3 [2022-11-21 13:55:47,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:47,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1161858644, now seen corresponding path program 9 times [2022-11-21 13:55:47,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:47,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191525464] [2022-11-21 13:55:47,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:47,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:47,392 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:47,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1676033439] [2022-11-21 13:55:47,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 13:55:47,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:47,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:47,398 INFO L229 MonitoredProcess]: Starting monitored process 165 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:47,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (165)] Waiting until timeout for monitored process [2022-11-21 13:55:47,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-11-21 13:55:47,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-21 13:55:47,509 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:47,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:47,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:47,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1946948763, now seen corresponding path program 14 times [2022-11-21 13:55:47,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:47,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57160741] [2022-11-21 13:55:47,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:47,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:47,572 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:47,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1315887250] [2022-11-21 13:55:47,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:55:47,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:47,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:47,577 INFO L229 MonitoredProcess]: Starting monitored process 166 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:47,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (166)] Waiting until timeout for monitored process [2022-11-21 13:55:47,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:55:47,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:55:47,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-21 13:55:47,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:47,840 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 403 proven. 131 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2022-11-21 13:55:47,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:48,213 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 19 proven. 198 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2022-11-21 13:55:48,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:48,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57160741] [2022-11-21 13:55:48,214 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:55:48,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315887250] [2022-11-21 13:55:48,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315887250] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:55:48,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:48,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2022-11-21 13:55:48,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195217352] [2022-11-21 13:55:48,214 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:48,215 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 13:55:48,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:48,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-21 13:55:48,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-11-21 13:55:48,215 INFO L87 Difference]: Start difference. First operand 836 states and 1130 transitions. cyclomatic complexity: 307 Second operand has 20 states, 16 states have (on average 3.4375) internal successors, (55), 18 states have internal predecessors, (55), 13 states have call successors, (23), 2 states have call predecessors, (23), 5 states have return successors, (23), 10 states have call predecessors, (23), 13 states have call successors, (23) [2022-11-21 13:55:49,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:49,270 INFO L93 Difference]: Finished difference Result 977 states and 1343 transitions. [2022-11-21 13:55:49,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 977 states and 1343 transitions. [2022-11-21 13:55:49,277 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 78 [2022-11-21 13:55:49,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 977 states to 858 states and 1162 transitions. [2022-11-21 13:55:49,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 286 [2022-11-21 13:55:49,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 286 [2022-11-21 13:55:49,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 858 states and 1162 transitions. [2022-11-21 13:55:49,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:55:49,287 INFO L218 hiAutomatonCegarLoop]: Abstraction has 858 states and 1162 transitions. [2022-11-21 13:55:49,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states and 1162 transitions. [2022-11-21 13:55:49,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 722. [2022-11-21 13:55:49,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 478 states have (on average 1.0899581589958158) internal successors, (521), 471 states have internal predecessors, (521), 173 states have call successors, (173), 75 states have call predecessors, (173), 71 states have return successors, (261), 175 states have call predecessors, (261), 173 states have call successors, (261) [2022-11-21 13:55:49,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 955 transitions. [2022-11-21 13:55:49,309 INFO L240 hiAutomatonCegarLoop]: Abstraction has 722 states and 955 transitions. [2022-11-21 13:55:49,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-21 13:55:49,310 INFO L428 stractBuchiCegarLoop]: Abstraction has 722 states and 955 transitions. [2022-11-21 13:55:49,310 INFO L335 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2022-11-21 13:55:49,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 722 states and 955 transitions. [2022-11-21 13:55:49,313 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 65 [2022-11-21 13:55:49,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:55:49,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:55:49,316 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [18, 18, 11, 7, 7, 7, 7, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:49,316 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:49,317 INFO L748 eck$LassoCheckResult]: Stem: 49555#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 49529#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; 49530#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 49554#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; 49542#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 49543#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 50038#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 50034#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 50035#factENTRY ~n := #in~n; 50039#L25 assume ~n <= 0;#res := 1; 50037#factFINAL assume true; 50033#factEXIT >#68#return; 50029#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 50030#factENTRY ~n := #in~n; 50036#L25 assume ~n <= 0;#res := 1; 50032#factFINAL assume true; 50028#factEXIT >#70#return; 50025#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 50026#factENTRY ~n := #in~n; 50031#L25 assume ~n <= 0;#res := 1; 50027#factFINAL assume true; 50024#factEXIT >#72#return; 50023#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 50022#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 50017#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 50018#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 50053#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 50007#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 49999#factENTRY ~n := #in~n; 50019#L25 assume !(~n <= 0); 50015#L26 call #t~ret0 := fact(~n - 1);< 50016#factENTRY ~n := #in~n; 50068#L25 assume ~n <= 0;#res := 1; 50067#factFINAL assume true; 50014#factEXIT >#66#return; 50012#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50006#factFINAL assume true; 50009#factEXIT >#74#return; 50008#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 50045#factENTRY ~n := #in~n; 50048#L25 assume ~n <= 0;#res := 1; 50049#factFINAL assume true; 50044#factEXIT >#76#return; 49998#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 49999#factENTRY ~n := #in~n; 50019#L25 assume !(~n <= 0); 50015#L26 call #t~ret0 := fact(~n - 1);< 50016#factENTRY ~n := #in~n; 50068#L25 assume ~n <= 0;#res := 1; 50067#factFINAL assume true; 50014#factEXIT >#66#return; 50012#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50006#factFINAL assume true; 50009#factEXIT >#78#return; 49985#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 50020#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 50021#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 50013#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 50011#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 49502#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 49503#factENTRY ~n := #in~n; 50156#L25 assume !(~n <= 0); 49538#L26 call #t~ret0 := fact(~n - 1);< 50153#factENTRY ~n := #in~n; 50160#L25 assume !(~n <= 0); 49537#L26 call #t~ret0 := fact(~n - 1);< 49539#factENTRY ~n := #in~n; 50159#L25 assume ~n <= 0;#res := 1; 50158#factFINAL assume true; 50157#factEXIT >#66#return; 50152#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50155#factFINAL assume true; 50151#factEXIT >#66#return; 50150#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50147#factFINAL assume true; 49914#factEXIT >#74#return; 49575#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 49576#factENTRY ~n := #in~n; 50168#L25 assume ~n <= 0;#res := 1; 50166#factFINAL assume true; 50164#factEXIT >#76#return; 49915#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 49917#factENTRY ~n := #in~n; 50154#L25 assume !(~n <= 0); 49538#L26 call #t~ret0 := fact(~n - 1);< 50153#factENTRY ~n := #in~n; 50160#L25 assume !(~n <= 0); 49537#L26 call #t~ret0 := fact(~n - 1);< 49539#factENTRY ~n := #in~n; 50159#L25 assume ~n <= 0;#res := 1; 50158#factFINAL assume true; 50157#factEXIT >#66#return; 50152#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50155#factFINAL assume true; 50151#factEXIT >#66#return; 50150#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50147#factFINAL assume true; 49914#factEXIT >#78#return; 49916#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 50103#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 50096#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 49855#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 49552#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 49553#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 49708#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 49706#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 49690#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 49704#factENTRY ~n := #in~n; 49762#L25 assume !(~n <= 0); 49621#L26 call #t~ret0 := fact(~n - 1);< 49634#factENTRY ~n := #in~n; 49643#L25 assume ~n <= 0;#res := 1; 49641#factFINAL assume true; 49620#factEXIT >#66#return; 49630#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49759#factFINAL assume true; 49756#factEXIT >#68#return; 49757#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 49571#factENTRY ~n := #in~n; 49766#L25 assume ~n <= 0;#res := 1; 49765#factFINAL assume true; 49764#factEXIT >#70#return; 49700#L30-2 [2022-11-21 13:55:49,317 INFO L750 eck$LassoCheckResult]: Loop: 49700#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 49758#factENTRY ~n := #in~n; 49761#L25 assume !(~n <= 0); 49621#L26 call #t~ret0 := fact(~n - 1);< 49634#factENTRY ~n := #in~n; 49735#L25 assume !(~n <= 0); 49655#L26 call #t~ret0 := fact(~n - 1);< 49682#factENTRY ~n := #in~n; 49733#L25 assume ~n <= 0;#res := 1; 49732#factFINAL assume true; 49729#factEXIT >#66#return; 49657#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49681#factFINAL assume true; 49654#factEXIT >#66#return; 49656#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49783#factFINAL assume true; 49779#factEXIT >#72#return; 49777#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 49774#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 49771#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 49768#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 49763#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 49697#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 49749#factENTRY ~n := #in~n; 49747#L25 assume !(~n <= 0); 49622#L26 call #t~ret0 := fact(~n - 1);< 49536#factENTRY ~n := #in~n; 49643#L25 assume ~n <= 0;#res := 1; 49641#factFINAL assume true; 49620#factEXIT >#66#return; 49630#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49759#factFINAL assume true; 49756#factEXIT >#68#return; 49689#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 49745#factENTRY ~n := #in~n; 49746#L25 assume ~n <= 0;#res := 1; 49744#factFINAL assume true; 49686#factEXIT >#70#return; 49700#L30-2 [2022-11-21 13:55:49,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:49,317 INFO L85 PathProgramCache]: Analyzing trace with hash -2123627213, now seen corresponding path program 10 times [2022-11-21 13:55:49,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:49,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233421969] [2022-11-21 13:55:49,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:49,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:49,325 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:49,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [808525507] [2022-11-21 13:55:49,325 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 13:55:49,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:49,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:49,330 INFO L229 MonitoredProcess]: Starting monitored process 167 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:49,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (167)] Waiting until timeout for monitored process [2022-11-21 13:55:49,438 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 13:55:49,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-21 13:55:49,438 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:49,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:49,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:49,502 INFO L85 PathProgramCache]: Analyzing trace with hash -893475734, now seen corresponding path program 1 times [2022-11-21 13:55:49,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:49,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822739892] [2022-11-21 13:55:49,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:49,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:49,505 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:49,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1281871825] [2022-11-21 13:55:49,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:49,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:49,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:49,514 INFO L229 MonitoredProcess]: Starting monitored process 168 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:49,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (168)] Waiting until timeout for monitored process [2022-11-21 13:55:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:49,580 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:49,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:49,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:49,600 INFO L85 PathProgramCache]: Analyzing trace with hash 573518876, now seen corresponding path program 11 times [2022-11-21 13:55:49,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:49,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310435080] [2022-11-21 13:55:49,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:49,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:49,609 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:49,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [645395281] [2022-11-21 13:55:49,609 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 13:55:49,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:49,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:49,613 INFO L229 MonitoredProcess]: Starting monitored process 169 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:49,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (169)] Waiting until timeout for monitored process [2022-11-21 13:55:49,777 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-11-21 13:55:49,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:55:49,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-21 13:55:49,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:49,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 432 proven. 23 refuted. 0 times theorem prover too weak. 785 trivial. 0 not checked. [2022-11-21 13:55:49,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:50,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 162 proven. 46 refuted. 0 times theorem prover too weak. 1032 trivial. 0 not checked. [2022-11-21 13:55:50,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:50,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310435080] [2022-11-21 13:55:50,254 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:55:50,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645395281] [2022-11-21 13:55:50,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645395281] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:55:50,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:50,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 15 [2022-11-21 13:55:50,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528417373] [2022-11-21 13:55:50,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:50,829 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 13:55:50,829 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 13:55:50,829 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 13:55:50,829 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 13:55:50,829 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-21 13:55:50,829 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:50,829 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 13:55:50,829 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 13:55:50,829 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration25_Loop [2022-11-21 13:55:50,829 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 13:55:50,830 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 13:55:50,830 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-21 13:55:50,857 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-21 13:55:50,859 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-21 13:55:50,862 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-21 13:55:50,864 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-21 13:55:50,866 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-21 13:55:50,977 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 13:55:50,977 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-21 13:55:50,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:50,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:50,981 INFO L229 MonitoredProcess]: Starting monitored process 170 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:51,007 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:55:51,007 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:51,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2022-11-21 13:55:51,027 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0 [2022-11-21 13:55:51,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:51,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:51,029 INFO L229 MonitoredProcess]: Starting monitored process 171 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:51,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2022-11-21 13:55:51,031 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-21 13:55:51,031 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:51,662 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-21 13:55:51,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:51,667 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 13:55:51,667 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 13:55:51,667 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 13:55:51,667 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 13:55:51,667 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-21 13:55:51,667 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:51,668 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 13:55:51,668 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 13:55:51,668 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration25_Loop [2022-11-21 13:55:51,668 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 13:55:51,668 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 13:55:51,669 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-21 13:55:51,671 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-21 13:55:51,673 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-21 13:55:51,696 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-21 13:55:51,698 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-21 13:55:51,700 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-21 13:55:51,795 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 13:55:51,795 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-21 13:55:51,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:51,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:51,797 INFO L229 MonitoredProcess]: Starting monitored process 172 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:51,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2022-11-21 13:55:51,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:51,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:51,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:51,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:51,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:51,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:51,810 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:51,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:51,811 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:51,814 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0 [2022-11-21 13:55:51,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:51,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:51,815 INFO L229 MonitoredProcess]: Starting monitored process 173 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:51,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2022-11-21 13:55:51,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-21 13:55:51,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:51,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:51,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:51,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:51,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:51,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:51,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:51,830 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:55:51,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:51,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:51,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:51,834 INFO L229 MonitoredProcess]: Starting monitored process 174 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:51,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2022-11-21 13:55:51,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 13:55:51,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:51,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:51,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:51,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:51,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:51,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:51,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:51,854 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-21 13:55:51,867 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-11-21 13:55:51,867 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-11-21 13:55:51,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:51,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:51,869 INFO L229 MonitoredProcess]: Starting monitored process 175 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:51,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2022-11-21 13:55:51,871 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-21 13:55:51,871 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-21 13:55:51,871 INFO L513 LassoAnalysis]: Proved termination. [2022-11-21 13:55:51,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-21 13:55:51,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Ended with exit code 0 [2022-11-21 13:55:51,874 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-21 13:55:51,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:52,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-21 13:55:52,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:52,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-21 13:55:52,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:53,000 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-21 13:55:53,001 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-21 13:55:53,002 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 722 states and 955 transitions. cyclomatic complexity: 247 Second operand has 11 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2022-11-21 13:55:53,160 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:53,225 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 722 states and 955 transitions. cyclomatic complexity: 247. Second operand has 11 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Result 848 states and 1098 transitions. Complement of second has 40 states. [2022-11-21 13:55:53,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2022-11-21 13:55:53,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2022-11-21 13:55:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2022-11-21 13:55:53,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 51 transitions. Stem has 122 letters. Loop has 38 letters. [2022-11-21 13:55:53,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:53,227 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-21 13:55:53,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:53,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-21 13:55:53,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:54,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-21 13:55:54,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-21 13:55:54,368 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2022-11-21 13:55:54,368 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 722 states and 955 transitions. cyclomatic complexity: 247 Second operand has 11 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2022-11-21 13:55:54,595 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 722 states and 955 transitions. cyclomatic complexity: 247. Second operand has 11 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Result 841 states and 1091 transitions. Complement of second has 42 states. [2022-11-21 13:55:54,595 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-21 13:55:54,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2022-11-21 13:55:54,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-11-21 13:55:54,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 122 letters. Loop has 38 letters. [2022-11-21 13:55:54,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:54,597 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-21 13:55:54,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:54,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-21 13:55:54,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:55,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-21 13:55:55,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:55,799 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-21 13:55:55,799 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2022-11-21 13:55:55,800 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 722 states and 955 transitions. cyclomatic complexity: 247 Second operand has 11 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2022-11-21 13:55:56,162 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 722 states and 955 transitions. cyclomatic complexity: 247. Second operand has 11 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Result 2212 states and 2767 transitions. Complement of second has 72 states. [2022-11-21 13:55:56,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2022-11-21 13:55:56,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2022-11-21 13:55:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-11-21 13:55:56,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 100 transitions. Stem has 122 letters. Loop has 38 letters. [2022-11-21 13:55:56,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:56,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 100 transitions. Stem has 160 letters. Loop has 38 letters. [2022-11-21 13:55:56,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:56,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 100 transitions. Stem has 122 letters. Loop has 76 letters. [2022-11-21 13:55:56,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:55:56,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2212 states and 2767 transitions. [2022-11-21 13:55:56,212 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 39 [2022-11-21 13:55:56,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2212 states to 1658 states and 2094 transitions. [2022-11-21 13:55:56,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 244 [2022-11-21 13:55:56,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 254 [2022-11-21 13:55:56,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1658 states and 2094 transitions. [2022-11-21 13:55:56,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:55:56,229 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1658 states and 2094 transitions. [2022-11-21 13:55:56,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states and 2094 transitions. [2022-11-21 13:55:56,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1463. [2022-11-21 13:55:56,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1463 states, 957 states have (on average 1.0564263322884013) internal successors, (1011), 966 states have internal predecessors, (1011), 296 states have call successors, (317), 152 states have call predecessors, (317), 210 states have return successors, (491), 344 states have call predecessors, (491), 296 states have call successors, (491) [2022-11-21 13:55:56,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 1819 transitions. [2022-11-21 13:55:56,281 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1463 states and 1819 transitions. [2022-11-21 13:55:56,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:56,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-21 13:55:56,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-11-21 13:55:56,282 INFO L87 Difference]: Start difference. First operand 1463 states and 1819 transitions. Second operand has 15 states, 13 states have (on average 3.923076923076923) internal successors, (51), 15 states have internal predecessors, (51), 9 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) [2022-11-21 13:55:57,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:57,148 INFO L93 Difference]: Finished difference Result 2134 states and 2924 transitions. [2022-11-21 13:55:57,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2134 states and 2924 transitions. [2022-11-21 13:55:57,168 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 48 [2022-11-21 13:55:57,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2134 states to 2134 states and 2924 transitions. [2022-11-21 13:55:57,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 261 [2022-11-21 13:55:57,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 261 [2022-11-21 13:55:57,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2134 states and 2924 transitions. [2022-11-21 13:55:57,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:55:57,197 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2134 states and 2924 transitions. [2022-11-21 13:55:57,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states and 2924 transitions. [2022-11-21 13:55:57,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 1510. [2022-11-21 13:55:57,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 979 states have (on average 1.0582226762002043) internal successors, (1036), 990 states have internal predecessors, (1036), 321 states have call successors, (344), 152 states have call predecessors, (344), 210 states have return successors, (527), 367 states have call predecessors, (527), 321 states have call successors, (527) [2022-11-21 13:55:57,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 1907 transitions. [2022-11-21 13:55:57,269 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1510 states and 1907 transitions. [2022-11-21 13:55:57,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 13:55:57,270 INFO L428 stractBuchiCegarLoop]: Abstraction has 1510 states and 1907 transitions. [2022-11-21 13:55:57,271 INFO L335 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2022-11-21 13:55:57,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1510 states and 1907 transitions. [2022-11-21 13:55:57,277 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2022-11-21 13:55:57,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:55:57,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:55:57,279 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 23, 15, 8, 8, 8, 8, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:57,279 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-21 13:55:57,280 INFO L748 eck$LassoCheckResult]: Stem: 60448#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 60407#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; 60408#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 60447#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; 60434#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 60435#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 60950#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 60945#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60946#factENTRY ~n := #in~n; 60949#L25 assume ~n <= 0;#res := 1; 60948#factFINAL assume true; 60944#factEXIT >#68#return; 60940#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 60941#factENTRY ~n := #in~n; 60947#L25 assume ~n <= 0;#res := 1; 60943#factFINAL assume true; 60939#factEXIT >#70#return; 60933#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60934#factENTRY ~n := #in~n; 60942#L25 assume ~n <= 0;#res := 1; 60938#factFINAL assume true; 60932#factEXIT >#72#return; 60931#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 60930#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 60928#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 60917#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 60912#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 60905#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60908#factENTRY ~n := #in~n; 60929#L25 assume !(~n <= 0); 60926#L26 call #t~ret0 := fact(~n - 1);< 60927#factENTRY ~n := #in~n; 60937#L25 assume ~n <= 0;#res := 1; 60935#factFINAL assume true; 60925#factEXIT >#66#return; 60916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60911#factFINAL assume true; 60904#factEXIT >#74#return; 60906#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 60915#factENTRY ~n := #in~n; 60924#L25 assume ~n <= 0;#res := 1; 60923#factFINAL assume true; 60914#factEXIT >#76#return; 60895#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60896#factENTRY ~n := #in~n; 60983#L25 assume !(~n <= 0); 60980#L26 call #t~ret0 := fact(~n - 1);< 60981#factENTRY ~n := #in~n; 60984#L25 assume ~n <= 0;#res := 1; 60982#factFINAL assume true; 60979#factEXIT >#66#return; 60977#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60975#factFINAL assume true; 60894#factEXIT >#78#return; 60893#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 60889#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 60885#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 60881#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 60873#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 60865#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60869#factENTRY ~n := #in~n; 60883#L25 assume !(~n <= 0); 60877#L26 call #t~ret0 := fact(~n - 1);< 60880#factENTRY ~n := #in~n; 60888#L25 assume !(~n <= 0); 60878#L26 call #t~ret0 := fact(~n - 1);< 60887#factENTRY ~n := #in~n; 60892#L25 assume ~n <= 0;#res := 1; 60891#factFINAL assume true; 60890#factEXIT >#66#return; 60879#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60886#factFINAL assume true; 60876#factEXIT >#66#return; 60872#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60868#factFINAL assume true; 60863#factEXIT >#74#return; 60866#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 60871#factENTRY ~n := #in~n; 60882#L25 assume ~n <= 0;#res := 1; 60875#factFINAL assume true; 60870#factEXIT >#76#return; 60864#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60867#factENTRY ~n := #in~n; 60884#L25 assume !(~n <= 0); 60877#L26 call #t~ret0 := fact(~n - 1);< 60880#factENTRY ~n := #in~n; 60888#L25 assume !(~n <= 0); 60878#L26 call #t~ret0 := fact(~n - 1);< 60887#factENTRY ~n := #in~n; 60892#L25 assume ~n <= 0;#res := 1; 60891#factFINAL assume true; 60890#factEXIT >#66#return; 60879#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60886#factFINAL assume true; 60876#factEXIT >#66#return; 60872#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60868#factFINAL assume true; 60863#factEXIT >#78#return; 60862#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 60861#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 60860#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 60802#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 60445#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 60446#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 60515#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 60516#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 60414#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60508#factENTRY ~n := #in~n; 60505#L25 assume ~n <= 0;#res := 1; 60506#factFINAL assume true; 60814#factEXIT >#68#return; 60744#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 60745#factENTRY ~n := #in~n; 60754#L25 assume ~n <= 0;#res := 1; 60746#factFINAL assume true; 60742#factEXIT >#70#return; 60735#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60738#factENTRY ~n := #in~n; 60766#L25 assume ~n <= 0;#res := 1; 60755#factFINAL assume true; 60747#factEXIT >#72#return; 60749#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 61849#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 61848#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 61847#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 61845#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 60377#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60378#factENTRY ~n := #in~n; 61837#L25 assume !(~n <= 0); 60587#L26 call #t~ret0 := fact(~n - 1);< 60614#factENTRY ~n := #in~n; 60616#L25 assume ~n <= 0;#res := 1; 60613#factFINAL assume true; 60581#factEXIT >#66#return; 60604#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 61857#factFINAL assume true; 61858#factEXIT >#74#return; 60381#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 61718#factENTRY ~n := #in~n; 61785#L25 assume ~n <= 0;#res := 1; 61786#factFINAL assume true; 60379#factEXIT >#76#return; 60383#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60469#factENTRY ~n := #in~n; 61144#L25 assume !(~n <= 0); 60481#L26 call #t~ret0 := fact(~n - 1);< 60496#factENTRY ~n := #in~n; 60502#L25 assume ~n <= 0;#res := 1; 60531#factFINAL assume true; 60525#factEXIT >#66#return; 60452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60453#factFINAL assume true; 61875#factEXIT >#78#return; 60409#L30-8 [2022-11-21 13:55:57,280 INFO L750 eck$LassoCheckResult]: Loop: 60409#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 60410#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 60432#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 60456#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 60449#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 60375#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60376#factENTRY ~n := #in~n; 60504#L25 assume !(~n <= 0); 60488#L26 call #t~ret0 := fact(~n - 1);< 60496#factENTRY ~n := #in~n; 60500#L25 assume !(~n <= 0); 60483#L26 call #t~ret0 := fact(~n - 1);< 60499#factENTRY ~n := #in~n; 60501#L25 assume ~n <= 0;#res := 1; 60513#factFINAL assume true; 60512#factEXIT >#66#return; 60492#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60498#factFINAL assume true; 60480#factEXIT >#66#return; 60479#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60477#factFINAL assume true; 60472#factEXIT >#74#return; 60467#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 60376#factENTRY ~n := #in~n; 60504#L25 assume ~n <= 0;#res := 1; 60523#factFINAL assume true; 60514#factEXIT >#76#return; 60475#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60478#factENTRY ~n := #in~n; 60497#L25 assume !(~n <= 0); 60488#L26 call #t~ret0 := fact(~n - 1);< 60496#factENTRY ~n := #in~n; 60500#L25 assume !(~n <= 0); 60483#L26 call #t~ret0 := fact(~n - 1);< 60499#factENTRY ~n := #in~n; 60501#L25 assume ~n <= 0;#res := 1; 60513#factFINAL assume true; 60512#factEXIT >#66#return; 60492#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60498#factFINAL assume true; 60480#factEXIT >#66#return; 60479#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60477#factFINAL assume true; 60472#factEXIT >#78#return; 60409#L30-8 [2022-11-21 13:55:57,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:57,281 INFO L85 PathProgramCache]: Analyzing trace with hash -214456813, now seen corresponding path program 12 times [2022-11-21 13:55:57,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:57,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027819188] [2022-11-21 13:55:57,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:57,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:57,291 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:57,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [441496545] [2022-11-21 13:55:57,291 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-21 13:55:57,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:57,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:57,293 INFO L229 MonitoredProcess]: Starting monitored process 176 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:57,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (176)] Waiting until timeout for monitored process [2022-11-21 13:55:57,379 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-21 13:55:57,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:55:57,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 13:55:57,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 413 proven. 2 refuted. 0 times theorem prover too weak. 701 trivial. 0 not checked. [2022-11-21 13:55:57,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:57,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2022-11-21 13:55:57,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:57,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027819188] [2022-11-21 13:55:57,656 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:55:57,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441496545] [2022-11-21 13:55:57,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441496545] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:55:57,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:57,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-11-21 13:55:57,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236191623] [2022-11-21 13:55:57,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:57,657 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 13:55:57,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:57,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1514306572, now seen corresponding path program 2 times [2022-11-21 13:55:57,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:57,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664774237] [2022-11-21 13:55:57,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:57,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:57,661 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:55:57,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [119317478] [2022-11-21 13:55:57,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:55:57,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:55:57,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:57,668 INFO L229 MonitoredProcess]: Starting monitored process 177 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:55:57,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (177)] Waiting until timeout for monitored process [2022-11-21 13:55:57,753 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:55:57,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-21 13:55:57,753 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:57,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:58,540 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 13:55:58,540 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 13:55:58,540 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 13:55:58,540 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 13:55:58,540 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-21 13:55:58,540 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:58,540 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 13:55:58,540 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 13:55:58,540 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration26_Loop [2022-11-21 13:55:58,540 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 13:55:58,541 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 13:55:58,542 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-21 13:55:58,544 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-21 13:55:58,546 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-21 13:55:58,578 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-21 13:55:58,580 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-21 13:55:58,704 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 13:55:58,704 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-21 13:55:58,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:58,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:58,706 INFO L229 MonitoredProcess]: Starting monitored process 178 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:58,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2022-11-21 13:55:58,709 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:55:58,709 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:58,721 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-21 13:55:58,721 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-21 13:55:58,725 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:58,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:58,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:58,727 INFO L229 MonitoredProcess]: Starting monitored process 179 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:58,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2022-11-21 13:55:58,729 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:55:58,730 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:58,742 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-21 13:55:58,742 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-21 13:55:58,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:58,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:58,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:58,746 INFO L229 MonitoredProcess]: Starting monitored process 180 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:58,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2022-11-21 13:55:58,749 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:55:58,749 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:58,767 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Ended with exit code 0 [2022-11-21 13:55:58,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:58,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:58,768 INFO L229 MonitoredProcess]: Starting monitored process 181 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:58,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2022-11-21 13:55:58,771 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-21 13:55:58,771 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:55:58,795 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-21 13:55:58,798 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2022-11-21 13:55:58,798 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 13:55:58,798 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 13:55:58,798 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 13:55:58,798 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 13:55:58,798 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-21 13:55:58,798 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:58,798 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 13:55:58,798 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 13:55:58,799 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration26_Loop [2022-11-21 13:55:58,799 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 13:55:58,799 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 13:55:58,800 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-21 13:55:58,833 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-21 13:55:58,835 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-21 13:55:58,838 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-21 13:55:58,841 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-21 13:55:58,991 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 13:55:58,991 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-21 13:55:58,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:58,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:58,992 INFO L229 MonitoredProcess]: Starting monitored process 182 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:59,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:55:59,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2022-11-21 13:55:59,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:55:59,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:55:59,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:55:59,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:55:59,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:55:59,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:55:59,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:55:59,025 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-21 13:55:59,029 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-21 13:55:59,029 INFO L444 ModelExtractionUtils]: 8 out of 11 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-21 13:55:59,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:55:59,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:59,033 INFO L229 MonitoredProcess]: Starting monitored process 183 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:59,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2022-11-21 13:55:59,035 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-21 13:55:59,035 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-21 13:55:59,035 INFO L513 LassoAnalysis]: Proved termination. [2022-11-21 13:55:59,036 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-21 13:55:59,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0 [2022-11-21 13:55:59,040 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-21 13:55:59,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:59,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-21 13:55:59,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:00,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-21 13:56:00,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:00,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0 [2022-11-21 13:56:00,678 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-21 13:56:00,679 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-21 13:56:00,679 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1510 states and 1907 transitions. cyclomatic complexity: 418 Second operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-11-21 13:56:01,002 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1510 states and 1907 transitions. cyclomatic complexity: 418. Second operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Result 1680 states and 2112 transitions. Complement of second has 41 states. [2022-11-21 13:56:01,003 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-21 13:56:01,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-11-21 13:56:01,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 69 transitions. [2022-11-21 13:56:01,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 69 transitions. Stem has 153 letters. Loop has 44 letters. [2022-11-21 13:56:01,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:56:01,014 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-21 13:56:01,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:01,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-21 13:56:01,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:02,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-21 13:56:02,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:02,525 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-21 13:56:02,526 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2022-11-21 13:56:02,527 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1510 states and 1907 transitions. cyclomatic complexity: 418 Second operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-11-21 13:56:02,807 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1510 states and 1907 transitions. cyclomatic complexity: 418. Second operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Result 1679 states and 2108 transitions. Complement of second has 39 states. [2022-11-21 13:56:02,807 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-21 13:56:02,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-11-21 13:56:02,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 68 transitions. [2022-11-21 13:56:02,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 68 transitions. Stem has 153 letters. Loop has 44 letters. [2022-11-21 13:56:02,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:56:02,809 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-21 13:56:02,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:02,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-21 13:56:02,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:04,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-21 13:56:04,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:04,231 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-21 13:56:04,231 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 9 loop predicates [2022-11-21 13:56:04,232 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1510 states and 1907 transitions. cyclomatic complexity: 418 Second operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-11-21 13:56:04,559 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1510 states and 1907 transitions. cyclomatic complexity: 418. Second operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Result 3218 states and 4037 transitions. Complement of second has 55 states. [2022-11-21 13:56:04,560 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-21 13:56:04,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-11-21 13:56:04,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 81 transitions. [2022-11-21 13:56:04,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 81 transitions. Stem has 153 letters. Loop has 44 letters. [2022-11-21 13:56:04,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:56:04,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 81 transitions. Stem has 197 letters. Loop has 44 letters. [2022-11-21 13:56:04,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:56:04,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 81 transitions. Stem has 153 letters. Loop has 88 letters. [2022-11-21 13:56:04,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:56:04,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3218 states and 4037 transitions. [2022-11-21 13:56:04,587 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2022-11-21 13:56:04,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3218 states to 2616 states and 3293 transitions. [2022-11-21 13:56:04,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 261 [2022-11-21 13:56:04,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 264 [2022-11-21 13:56:04,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2616 states and 3293 transitions. [2022-11-21 13:56:04,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:56:04,610 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2616 states and 3293 transitions. [2022-11-21 13:56:04,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2616 states and 3293 transitions. [2022-11-21 13:56:04,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2616 to 2155. [2022-11-21 13:56:04,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 1412 states have (on average 1.0793201133144477) internal successors, (1524), 1415 states have internal predecessors, (1524), 411 states have call successors, (443), 244 states have call predecessors, (443), 332 states have return successors, (749), 495 states have call predecessors, (749), 411 states have call successors, (749) [2022-11-21 13:56:04,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 2716 transitions. [2022-11-21 13:56:04,672 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2155 states and 2716 transitions. [2022-11-21 13:56:04,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:56:04,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:56:04,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:56:04,673 INFO L87 Difference]: Start difference. First operand 2155 states and 2716 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2022-11-21 13:56:04,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:56:04,818 INFO L93 Difference]: Finished difference Result 2363 states and 2963 transitions. [2022-11-21 13:56:04,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2363 states and 2963 transitions. [2022-11-21 13:56:04,832 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2022-11-21 13:56:04,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2363 states to 2353 states and 2951 transitions. [2022-11-21 13:56:04,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 248 [2022-11-21 13:56:04,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 248 [2022-11-21 13:56:04,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2353 states and 2951 transitions. [2022-11-21 13:56:04,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:56:04,876 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2353 states and 2951 transitions. [2022-11-21 13:56:04,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states and 2951 transitions. [2022-11-21 13:56:04,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2078. [2022-11-21 13:56:04,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2078 states, 1365 states have (on average 1.0798534798534798) internal successors, (1474), 1370 states have internal predecessors, (1474), 385 states have call successors, (413), 241 states have call predecessors, (413), 328 states have return successors, (698), 466 states have call predecessors, (698), 385 states have call successors, (698) [2022-11-21 13:56:04,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 2585 transitions. [2022-11-21 13:56:04,937 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2078 states and 2585 transitions. [2022-11-21 13:56:04,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:56:04,938 INFO L428 stractBuchiCegarLoop]: Abstraction has 2078 states and 2585 transitions. [2022-11-21 13:56:04,938 INFO L335 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2022-11-21 13:56:04,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2078 states and 2585 transitions. [2022-11-21 13:56:04,945 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2022-11-21 13:56:04,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:56:04,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:56:04,948 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [35, 35, 21, 14, 14, 14, 14, 7, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 13:56:04,948 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 9, 9, 9, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:56:04,948 INFO L748 eck$LassoCheckResult]: Stem: 75940#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 75911#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; 75912#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 75939#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; 75930#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 75931#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 76462#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 76460#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 76461#factENTRY ~n := #in~n; 76464#L25 assume ~n <= 0;#res := 1; 76463#factFINAL assume true; 76459#factEXIT >#68#return; 76456#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 76457#factENTRY ~n := #in~n; 76466#L25 assume ~n <= 0;#res := 1; 76465#factFINAL assume true; 76455#factEXIT >#70#return; 76452#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 76453#factENTRY ~n := #in~n; 76458#L25 assume ~n <= 0;#res := 1; 76454#factFINAL assume true; 76451#factEXIT >#72#return; 76450#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 76449#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 76448#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 76447#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 76446#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 76423#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 76424#factENTRY ~n := #in~n; 76436#L25 assume !(~n <= 0); 76434#L26 call #t~ret0 := fact(~n - 1);< 76435#factENTRY ~n := #in~n; 76439#L25 assume ~n <= 0;#res := 1; 76438#factFINAL assume true; 76433#factEXIT >#66#return; 76431#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76427#factFINAL assume true; 76422#factEXIT >#74#return; 76419#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 76420#factENTRY ~n := #in~n; 76445#L25 assume ~n <= 0;#res := 1; 76444#factFINAL assume true; 76418#factEXIT >#76#return; 76415#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 76416#factENTRY ~n := #in~n; 76432#L25 assume !(~n <= 0); 76429#L26 call #t~ret0 := fact(~n - 1);< 76430#factENTRY ~n := #in~n; 76441#L25 assume ~n <= 0;#res := 1; 76440#factFINAL assume true; 76428#factEXIT >#66#return; 76426#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76425#factFINAL assume true; 76414#factEXIT >#78#return; 76370#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 76365#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 76363#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 76360#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 76358#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 76348#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 76351#factENTRY ~n := #in~n; 76379#L25 assume !(~n <= 0); 76374#L26 call #t~ret0 := fact(~n - 1);< 76375#factENTRY ~n := #in~n; 76397#L25 assume !(~n <= 0); 76373#L26 call #t~ret0 := fact(~n - 1);< 76395#factENTRY ~n := #in~n; 76398#L25 assume ~n <= 0;#res := 1; 76396#factFINAL assume true; 76394#factEXIT >#66#return; 76392#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76384#factFINAL assume true; 76372#factEXIT >#66#return; 76369#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76353#factFINAL assume true; 76347#factEXIT >#74#return; 76307#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 76308#factENTRY ~n := #in~n; 76316#L25 assume ~n <= 0;#res := 1; 76317#factFINAL assume true; 76306#factEXIT >#76#return; 76299#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 76300#factENTRY ~n := #in~n; 76393#L25 assume !(~n <= 0); 76388#L26 call #t~ret0 := fact(~n - 1);< 76391#factENTRY ~n := #in~n; 76413#L25 assume !(~n <= 0); 76387#L26 call #t~ret0 := fact(~n - 1);< 76411#factENTRY ~n := #in~n; 76443#L25 assume ~n <= 0;#res := 1; 76442#factFINAL assume true; 76421#factEXIT >#66#return; 76417#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76410#factFINAL assume true; 76406#factEXIT >#66#return; 76383#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76382#factFINAL assume true; 76298#factEXIT >#78#return; 76297#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 76295#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 76293#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 76291#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 76284#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 76281#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 76279#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 76277#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 75919#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 76257#factENTRY ~n := #in~n; 76380#L25 assume ~n <= 0;#res := 1; 76381#factFINAL assume true; 76567#factEXIT >#68#return; 75905#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 75908#factENTRY ~n := #in~n; 75909#L25 assume ~n <= 0;#res := 1; 75903#factFINAL assume true; 75906#factEXIT >#70#return; 77858#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 77861#factENTRY ~n := #in~n; 77865#L25 assume !(~n <= 0); 76217#L26 call #t~ret0 := fact(~n - 1);< 76231#factENTRY ~n := #in~n; 76237#L25 assume ~n <= 0;#res := 1; 76235#factFINAL assume true; 76204#factEXIT >#66#return; 76229#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 77863#factFINAL assume true; 77856#factEXIT >#72#return; 76595#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 76594#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 76577#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 76575#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 76570#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 76565#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 76566#factENTRY ~n := #in~n; 76574#L25 assume !(~n <= 0); 76213#L26 call #t~ret0 := fact(~n - 1);< 76238#factENTRY ~n := #in~n; 76237#L25 assume ~n <= 0;#res := 1; 76235#factFINAL assume true; 76204#factEXIT >#66#return; 76226#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76572#factFINAL assume true; 76564#factEXIT >#68#return; 76025#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 76203#factENTRY ~n := #in~n; 76576#L25 assume !(~n <= 0); 76214#L26 call #t~ret0 := fact(~n - 1);< 76231#factENTRY ~n := #in~n; 76237#L25 assume ~n <= 0;#res := 1; 76235#factFINAL assume true; 76204#factEXIT >#66#return; 76227#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 77953#factFINAL assume true; 77951#factEXIT >#70#return; 75893#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 77915#factENTRY ~n := #in~n; 75952#L25 assume ~n <= 0;#res := 1; 75907#factFINAL assume true; 75892#factEXIT >#72#return; 75894#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 75935#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 75937#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 76583#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 76336#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 76176#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 76178#factENTRY ~n := #in~n; 76573#L25 assume !(~n <= 0); 76205#L26 call #t~ret0 := fact(~n - 1);< 76231#factENTRY ~n := #in~n; 76237#L25 assume ~n <= 0;#res := 1; 76235#factFINAL assume true; 76204#factEXIT >#66#return; 76220#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76337#factFINAL assume true; 76174#factEXIT >#74#return; 76171#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 76173#factENTRY ~n := #in~n; 76234#L25 assume ~n <= 0;#res := 1; 76232#factFINAL assume true; 76196#factEXIT >#76#return; 76163#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 76164#factENTRY ~n := #in~n; 76236#L25 assume !(~n <= 0); 76210#L26 call #t~ret0 := fact(~n - 1);< 76231#factENTRY ~n := #in~n; 76237#L25 assume ~n <= 0;#res := 1; 76235#factFINAL assume true; 76204#factEXIT >#66#return; 76195#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76187#factFINAL assume true; 76162#factEXIT >#78#return; 76111#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 76157#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 76081#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 76079#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 76077#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 76074#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 76075#factENTRY ~n := #in~n; 76156#L25 assume !(~n <= 0); 76118#L26 call #t~ret0 := fact(~n - 1);< 76120#factENTRY ~n := #in~n; 76130#L25 assume ~n <= 0;#res := 1; 76126#factFINAL assume true; 76115#factEXIT >#66#return; 76112#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76109#factFINAL assume true; 76071#factEXIT >#74#return; 76057#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 76060#factENTRY ~n := #in~n; 76088#L25 assume ~n <= 0;#res := 1; 76086#factFINAL assume true; 76056#factEXIT >#76#return; 76008#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 76049#factENTRY ~n := #in~n; 76042#L25 assume !(~n <= 0); 75982#L26 call #t~ret0 := fact(~n - 1);< 75989#factENTRY ~n := #in~n; 76013#L25 assume !(~n <= 0); 75984#L26 call #t~ret0 := fact(~n - 1);< 76009#factENTRY ~n := #in~n; 76016#L25 assume ~n <= 0;#res := 1; 76026#factFINAL assume true; 76024#factEXIT >#66#return; 76021#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76019#factFINAL assume true; 76014#factEXIT >#66#return; 75986#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76240#factFINAL assume true; 76030#factEXIT >#78#return; 75913#L30-8 [2022-11-21 13:56:04,949 INFO L750 eck$LassoCheckResult]: Loop: 75913#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 75914#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 75927#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 75977#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 75967#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 75885#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 75886#factENTRY ~n := #in~n; 76033#L25 assume !(~n <= 0); 75983#L26 call #t~ret0 := fact(~n - 1);< 75989#factENTRY ~n := #in~n; 76013#L25 assume !(~n <= 0); 75984#L26 call #t~ret0 := fact(~n - 1);< 76009#factENTRY ~n := #in~n; 76013#L25 assume !(~n <= 0); 75984#L26 call #t~ret0 := fact(~n - 1);< 76009#factENTRY ~n := #in~n; 76016#L25 assume ~n <= 0;#res := 1; 76026#factFINAL assume true; 76024#factEXIT >#66#return; 76021#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76019#factFINAL assume true; 76014#factEXIT >#66#return; 75987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76007#factFINAL assume true; 75981#factEXIT >#66#return; 75978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75968#factFINAL assume true; 75971#factEXIT >#74#return; 75970#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 75886#factENTRY ~n := #in~n; 76033#L25 assume !(~n <= 0); 75983#L26 call #t~ret0 := fact(~n - 1);< 75989#factENTRY ~n := #in~n; 76013#L25 assume !(~n <= 0); 75984#L26 call #t~ret0 := fact(~n - 1);< 76009#factENTRY ~n := #in~n; 76013#L25 assume !(~n <= 0); 75984#L26 call #t~ret0 := fact(~n - 1);< 76009#factENTRY ~n := #in~n; 76016#L25 assume ~n <= 0;#res := 1; 76026#factFINAL assume true; 76024#factEXIT >#66#return; 76021#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76019#factFINAL assume true; 76014#factEXIT >#66#return; 75987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76007#factFINAL assume true; 75981#factEXIT >#66#return; 75978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75968#factFINAL assume true; 75971#factEXIT >#76#return; 75969#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 75972#factENTRY ~n := #in~n; 76010#L25 assume !(~n <= 0); 75983#L26 call #t~ret0 := fact(~n - 1);< 75989#factENTRY ~n := #in~n; 76013#L25 assume !(~n <= 0); 75984#L26 call #t~ret0 := fact(~n - 1);< 76009#factENTRY ~n := #in~n; 76013#L25 assume !(~n <= 0); 75984#L26 call #t~ret0 := fact(~n - 1);< 76009#factENTRY ~n := #in~n; 76016#L25 assume ~n <= 0;#res := 1; 76026#factFINAL assume true; 76024#factEXIT >#66#return; 76021#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76019#factFINAL assume true; 76014#factEXIT >#66#return; 75987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76007#factFINAL assume true; 75981#factEXIT >#66#return; 75978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75968#factFINAL assume true; 75971#factEXIT >#78#return; 75913#L30-8 [2022-11-21 13:56:04,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:04,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1189275067, now seen corresponding path program 13 times [2022-11-21 13:56:04,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:56:04,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646195804] [2022-11-21 13:56:04,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:56:04,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:56:04,962 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:56:04,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [644855891] [2022-11-21 13:56:04,962 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-21 13:56:04,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:56:04,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:56:04,967 INFO L229 MonitoredProcess]: Starting monitored process 184 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:56:04,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (184)] Waiting until timeout for monitored process [2022-11-21 13:56:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:05,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 13:56:05,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:05,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2666 backedges. 1427 proven. 1 refuted. 0 times theorem prover too weak. 1238 trivial. 0 not checked. [2022-11-21 13:56:05,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:56:05,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2666 backedges. 115 proven. 58 refuted. 0 times theorem prover too weak. 2493 trivial. 0 not checked. [2022-11-21 13:56:05,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:56:05,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646195804] [2022-11-21 13:56:05,435 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:56:05,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644855891] [2022-11-21 13:56:05,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644855891] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:56:05,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:56:05,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-11-21 13:56:05,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112514146] [2022-11-21 13:56:05,436 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:56:05,436 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 13:56:05,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:05,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1678442820, now seen corresponding path program 3 times [2022-11-21 13:56:05,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:56:05,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961255082] [2022-11-21 13:56:05,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:56:05,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:56:05,441 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:56:05,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [661932546] [2022-11-21 13:56:05,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 13:56:05,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:56:05,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:56:05,451 INFO L229 MonitoredProcess]: Starting monitored process 185 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:56:05,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (185)] Waiting until timeout for monitored process [2022-11-21 13:56:05,526 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-11-21 13:56:05,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:56:05,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-21 13:56:05,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:05,683 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 48 proven. 179 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-11-21 13:56:05,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:56:06,741 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 48 proven. 204 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-21 13:56:06,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:56:06,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961255082] [2022-11-21 13:56:06,742 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:56:06,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661932546] [2022-11-21 13:56:06,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661932546] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:56:06,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:56:06,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 22 [2022-11-21 13:56:06,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708631715] [2022-11-21 13:56:06,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:56:06,744 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 13:56:06,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:56:06,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-21 13:56:06,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-11-21 13:56:06,745 INFO L87 Difference]: Start difference. First operand 2078 states and 2585 transitions. cyclomatic complexity: 540 Second operand has 23 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 13 states have call successors, (13), 1 states have call predecessors, (13), 9 states have return successors, (17), 12 states have call predecessors, (17), 13 states have call successors, (17) [2022-11-21 13:56:08,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:56:08,057 INFO L93 Difference]: Finished difference Result 4771 states and 6693 transitions. [2022-11-21 13:56:08,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4771 states and 6693 transitions. [2022-11-21 13:56:08,087 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 109 [2022-11-21 13:56:08,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4771 states to 4525 states and 6330 transitions. [2022-11-21 13:56:08,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 524 [2022-11-21 13:56:08,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 530 [2022-11-21 13:56:08,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4525 states and 6330 transitions. [2022-11-21 13:56:08,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:56:08,126 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4525 states and 6330 transitions. [2022-11-21 13:56:08,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4525 states and 6330 transitions. [2022-11-21 13:56:08,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4525 to 2751. [2022-11-21 13:56:08,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2751 states, 1746 states have (on average 1.065864833906071) internal successors, (1861), 1756 states have internal predecessors, (1861), 537 states have call successors, (565), 309 states have call predecessors, (565), 468 states have return successors, (1496), 685 states have call predecessors, (1496), 537 states have call successors, (1496) [2022-11-21 13:56:08,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2751 states to 2751 states and 3922 transitions. [2022-11-21 13:56:08,239 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2751 states and 3922 transitions. [2022-11-21 13:56:08,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 13:56:08,240 INFO L428 stractBuchiCegarLoop]: Abstraction has 2751 states and 3922 transitions. [2022-11-21 13:56:08,240 INFO L335 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2022-11-21 13:56:08,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2751 states and 3922 transitions. [2022-11-21 13:56:08,249 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2022-11-21 13:56:08,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:56:08,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:56:08,251 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [35, 35, 21, 14, 14, 14, 14, 7, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 13:56:08,252 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [16, 16, 13, 13, 13, 13, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:56:08,252 INFO L748 eck$LassoCheckResult]: Stem: 84655#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 84630#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; 84631#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 84654#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; 84642#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 84643#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 85533#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 85529#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 85530#factENTRY ~n := #in~n; 85534#L25 assume ~n <= 0;#res := 1; 85532#factFINAL assume true; 85528#factEXIT >#68#return; 85524#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 85525#factENTRY ~n := #in~n; 85531#L25 assume ~n <= 0;#res := 1; 85527#factFINAL assume true; 85523#factEXIT >#70#return; 85520#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 85521#factENTRY ~n := #in~n; 85526#L25 assume ~n <= 0;#res := 1; 85522#factFINAL assume true; 85519#factEXIT >#72#return; 85517#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 85514#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 85513#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 85509#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 85506#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 85497#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 85498#factENTRY ~n := #in~n; 85516#L25 assume !(~n <= 0); 85511#L26 call #t~ret0 := fact(~n - 1);< 85512#factENTRY ~n := #in~n; 85518#L25 assume ~n <= 0;#res := 1; 85515#factFINAL assume true; 85510#factEXIT >#66#return; 85508#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85505#factFINAL assume true; 85496#factEXIT >#74#return; 85492#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 85493#factENTRY ~n := #in~n; 85502#L25 assume ~n <= 0;#res := 1; 85495#factFINAL assume true; 85491#factEXIT >#76#return; 85488#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 85489#factENTRY ~n := #in~n; 85503#L25 assume !(~n <= 0); 85500#L26 call #t~ret0 := fact(~n - 1);< 85501#factENTRY ~n := #in~n; 85507#L25 assume ~n <= 0;#res := 1; 85504#factFINAL assume true; 85499#factEXIT >#66#return; 85494#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85490#factFINAL assume true; 85487#factEXIT >#78#return; 85486#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 85478#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 85474#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 85472#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 85429#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 85425#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 85427#factENTRY ~n := #in~n; 85437#L25 assume !(~n <= 0); 85434#L26 call #t~ret0 := fact(~n - 1);< 85435#factENTRY ~n := #in~n; 85442#L25 assume !(~n <= 0); 85433#L26 call #t~ret0 := fact(~n - 1);< 85440#factENTRY ~n := #in~n; 85443#L25 assume ~n <= 0;#res := 1; 85441#factFINAL assume true; 85439#factEXIT >#66#return; 85438#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85436#factFINAL assume true; 85432#factEXIT >#66#return; 85431#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85428#factFINAL assume true; 85424#factEXIT >#74#return; 85417#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 85446#factENTRY ~n := #in~n; 85447#L25 assume ~n <= 0;#res := 1; 85416#factFINAL assume true; 85418#factEXIT >#76#return; 85411#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 85412#factENTRY ~n := #in~n; 85464#L25 assume !(~n <= 0); 85452#L26 call #t~ret0 := fact(~n - 1);< 85455#factENTRY ~n := #in~n; 85459#L25 assume !(~n <= 0); 85451#L26 call #t~ret0 := fact(~n - 1);< 85462#factENTRY ~n := #in~n; 85468#L25 assume ~n <= 0;#res := 1; 85467#factFINAL assume true; 85466#factEXIT >#66#return; 85465#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85463#factFINAL assume true; 85460#factEXIT >#66#return; 85454#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85469#factFINAL assume true; 85470#factEXIT >#78#return; 85407#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 85400#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 85399#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 85397#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 85396#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 85391#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 85387#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 85111#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 84637#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 85102#factENTRY ~n := #in~n; 85112#L25 assume ~n <= 0;#res := 1; 85106#factFINAL assume true; 85101#factEXIT >#68#return; 85059#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 85060#factENTRY ~n := #in~n; 85062#L25 assume ~n <= 0;#res := 1; 85061#factFINAL assume true; 85057#factEXIT >#70#return; 85037#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 85040#factENTRY ~n := #in~n; 85056#L25 assume !(~n <= 0); 85002#L26 call #t~ret0 := fact(~n - 1);< 85028#factENTRY ~n := #in~n; 85031#L25 assume ~n <= 0;#res := 1; 85026#factFINAL assume true; 84990#factEXIT >#66#return; 85017#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85042#factFINAL assume true; 85035#factEXIT >#72#return; 85034#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 85032#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 85030#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 85021#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 84980#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 84972#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 84973#factENTRY ~n := #in~n; 85029#L25 assume !(~n <= 0); 84992#L26 call #t~ret0 := fact(~n - 1);< 85020#factENTRY ~n := #in~n; 85031#L25 assume ~n <= 0;#res := 1; 85026#factFINAL assume true; 84990#factEXIT >#66#return; 84979#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84978#factFINAL assume true; 84971#factEXIT >#68#return; 84966#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 84970#factENTRY ~n := #in~n; 85258#L25 assume !(~n <= 0); 85001#L26 call #t~ret0 := fact(~n - 1);< 85028#factENTRY ~n := #in~n; 85031#L25 assume ~n <= 0;#res := 1; 85026#factFINAL assume true; 84990#factEXIT >#66#return; 85016#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85349#factFINAL assume true; 85348#factEXIT >#70#return; 85157#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 85282#factENTRY ~n := #in~n; 85284#L25 assume ~n <= 0;#res := 1; 85283#factFINAL assume true; 85281#factEXIT >#72#return; 85280#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 85268#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 85265#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 85147#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 85025#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 84984#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 84989#factENTRY ~n := #in~n; 85117#L25 assume !(~n <= 0); 85004#L26 call #t~ret0 := fact(~n - 1);< 85028#factENTRY ~n := #in~n; 85031#L25 assume ~n <= 0;#res := 1; 85026#factFINAL assume true; 84990#factEXIT >#66#return; 85009#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85023#factFINAL assume true; 84982#factEXIT >#74#return; 84975#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 84977#factENTRY ~n := #in~n; 85263#L25 assume ~n <= 0;#res := 1; 85262#factFINAL assume true; 85261#factEXIT >#76#return; 85027#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 85259#factENTRY ~n := #in~n; 85260#L25 assume !(~n <= 0); 84998#L26 call #t~ret0 := fact(~n - 1);< 85028#factENTRY ~n := #in~n; 85031#L25 assume ~n <= 0;#res := 1; 85026#factFINAL assume true; 84990#factEXIT >#66#return; 85014#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85404#factFINAL assume true; 85401#factEXIT >#78#return; 84800#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 85398#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 85395#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 85389#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 84761#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 84744#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 84746#factENTRY ~n := #in~n; 84845#L25 assume !(~n <= 0); 84778#L26 call #t~ret0 := fact(~n - 1);< 84781#factENTRY ~n := #in~n; 84788#L25 assume ~n <= 0;#res := 1; 84785#factFINAL assume true; 84776#factEXIT >#66#return; 84763#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84760#factFINAL assume true; 84739#factEXIT >#74#return; 84733#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 84736#factENTRY ~n := #in~n; 84757#L25 assume ~n <= 0;#res := 1; 84756#factFINAL assume true; 84738#factEXIT >#76#return; 84610#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 84723#factENTRY ~n := #in~n; 84720#L25 assume !(~n <= 0); 84700#L26 call #t~ret0 := fact(~n - 1);< 84703#factENTRY ~n := #in~n; 84708#L25 assume !(~n <= 0); 84698#L26 call #t~ret0 := fact(~n - 1);< 84705#factENTRY ~n := #in~n; 84716#L25 assume ~n <= 0;#res := 1; 84730#factFINAL assume true; 84726#factEXIT >#66#return; 84722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84717#factFINAL assume true; 84709#factEXIT >#66#return; 84713#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85386#factFINAL assume true; 85385#factEXIT >#78#return; 84611#L30-8 [2022-11-21 13:56:08,252 INFO L750 eck$LassoCheckResult]: Loop: 84611#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 84632#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 84640#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 84673#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 84679#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 84680#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 84671#factENTRY ~n := #in~n; 84865#L25 assume !(~n <= 0); 84699#L26 call #t~ret0 := fact(~n - 1);< 84703#factENTRY ~n := #in~n; 84708#L25 assume !(~n <= 0); 84698#L26 call #t~ret0 := fact(~n - 1);< 84705#factENTRY ~n := #in~n; 84708#L25 assume !(~n <= 0); 84698#L26 call #t~ret0 := fact(~n - 1);< 84705#factENTRY ~n := #in~n; 84708#L25 assume !(~n <= 0); 84698#L26 call #t~ret0 := fact(~n - 1);< 84705#factENTRY ~n := #in~n; 84708#L25 assume !(~n <= 0); 84698#L26 call #t~ret0 := fact(~n - 1);< 84705#factENTRY ~n := #in~n; 84716#L25 assume ~n <= 0;#res := 1; 84730#factFINAL assume true; 84726#factEXIT >#66#return; 84722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84717#factFINAL assume true; 84709#factEXIT >#66#return; 84707#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84704#factFINAL assume true; 84697#factEXIT >#66#return; 84702#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84913#factFINAL assume true; 84906#factEXIT >#66#return; 84907#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84917#factFINAL assume true; 84912#factEXIT >#66#return; 84904#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84905#factFINAL assume true; 84846#factEXIT >#74#return; 84691#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 84671#factENTRY ~n := #in~n; 84865#L25 assume !(~n <= 0); 84699#L26 call #t~ret0 := fact(~n - 1);< 84703#factENTRY ~n := #in~n; 84708#L25 assume !(~n <= 0); 84698#L26 call #t~ret0 := fact(~n - 1);< 84705#factENTRY ~n := #in~n; 84708#L25 assume !(~n <= 0); 84698#L26 call #t~ret0 := fact(~n - 1);< 84705#factENTRY ~n := #in~n; 84708#L25 assume !(~n <= 0); 84698#L26 call #t~ret0 := fact(~n - 1);< 84705#factENTRY ~n := #in~n; 84716#L25 assume ~n <= 0;#res := 1; 84730#factFINAL assume true; 84726#factEXIT >#66#return; 84722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84717#factFINAL assume true; 84709#factEXIT >#66#return; 84707#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84704#factFINAL assume true; 84697#factEXIT >#66#return; 84702#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84913#factFINAL assume true; 84906#factEXIT >#66#return; 84908#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84847#factFINAL assume true; 84848#factEXIT >#76#return; 84688#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 84689#factENTRY ~n := #in~n; 84706#L25 assume !(~n <= 0); 84699#L26 call #t~ret0 := fact(~n - 1);< 84703#factENTRY ~n := #in~n; 84708#L25 assume !(~n <= 0); 84698#L26 call #t~ret0 := fact(~n - 1);< 84705#factENTRY ~n := #in~n; 84708#L25 assume !(~n <= 0); 84698#L26 call #t~ret0 := fact(~n - 1);< 84705#factENTRY ~n := #in~n; 84708#L25 assume !(~n <= 0); 84698#L26 call #t~ret0 := fact(~n - 1);< 84705#factENTRY ~n := #in~n; 84716#L25 assume ~n <= 0;#res := 1; 84730#factFINAL assume true; 84726#factEXIT >#66#return; 84722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84717#factFINAL assume true; 84709#factEXIT >#66#return; 84707#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84704#factFINAL assume true; 84697#factEXIT >#66#return; 84702#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84913#factFINAL assume true; 84906#factEXIT >#66#return; 84908#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84847#factFINAL assume true; 84848#factEXIT >#78#return; 84611#L30-8 [2022-11-21 13:56:08,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:08,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1189275067, now seen corresponding path program 14 times [2022-11-21 13:56:08,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:56:08,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340980872] [2022-11-21 13:56:08,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:56:08,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:56:08,263 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:56:08,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1049632706] [2022-11-21 13:56:08,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:56:08,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:56:08,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:56:08,290 INFO L229 MonitoredProcess]: Starting monitored process 186 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:56:08,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (186)] Waiting until timeout for monitored process [2022-11-21 13:56:08,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:56:08,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:56:08,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 13:56:08,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2666 backedges. 1427 proven. 1 refuted. 0 times theorem prover too weak. 1238 trivial. 0 not checked. [2022-11-21 13:56:08,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:56:08,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2666 backedges. 115 proven. 58 refuted. 0 times theorem prover too weak. 2493 trivial. 0 not checked. [2022-11-21 13:56:08,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:56:08,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340980872] [2022-11-21 13:56:08,823 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:56:08,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049632706] [2022-11-21 13:56:08,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049632706] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:56:08,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:56:08,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-11-21 13:56:08,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613855388] [2022-11-21 13:56:08,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:56:08,824 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 13:56:08,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:08,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1557554236, now seen corresponding path program 4 times [2022-11-21 13:56:08,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:56:08,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126339899] [2022-11-21 13:56:08,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:56:08,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:56:08,830 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:56:08,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2109472860] [2022-11-21 13:56:08,830 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 13:56:08,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:56:08,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:56:08,839 INFO L229 MonitoredProcess]: Starting monitored process 187 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:56:08,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (187)] Waiting until timeout for monitored process [2022-11-21 13:56:08,935 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 13:56:08,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:56:08,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-21 13:56:08,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 54 proven. 389 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2022-11-21 13:56:09,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:56:11,136 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 54 proven. 432 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-21 13:56:11,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:56:11,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126339899] [2022-11-21 13:56:11,137 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:56:11,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109472860] [2022-11-21 13:56:11,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109472860] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:56:11,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:56:11,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23] total 26 [2022-11-21 13:56:11,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257824008] [2022-11-21 13:56:11,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:56:11,138 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 13:56:11,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:56:11,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-21 13:56:11,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2022-11-21 13:56:11,139 INFO L87 Difference]: Start difference. First operand 2751 states and 3922 transitions. cyclomatic complexity: 1204 Second operand has 27 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 states have internal predecessors, (55), 15 states have call successors, (16), 1 states have call predecessors, (16), 11 states have return successors, (23), 14 states have call predecessors, (23), 15 states have call successors, (23) [2022-11-21 13:56:12,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:56:12,307 INFO L93 Difference]: Finished difference Result 4535 states and 6579 transitions. [2022-11-21 13:56:12,307 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4535 states and 6579 transitions. [2022-11-21 13:56:12,341 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2022-11-21 13:56:12,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4535 states to 4382 states and 6351 transitions. [2022-11-21 13:56:12,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 509 [2022-11-21 13:56:12,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 509 [2022-11-21 13:56:12,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4382 states and 6351 transitions. [2022-11-21 13:56:12,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:56:12,384 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4382 states and 6351 transitions. [2022-11-21 13:56:12,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4382 states and 6351 transitions. [2022-11-21 13:56:12,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4382 to 2959. [2022-11-21 13:56:12,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2959 states, 1859 states have (on average 1.0618612157073695) internal successors, (1974), 1866 states have internal predecessors, (1974), 591 states have call successors, (619), 326 states have call predecessors, (619), 509 states have return successors, (1820), 766 states have call predecessors, (1820), 591 states have call successors, (1820) [2022-11-21 13:56:12,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 4413 transitions. [2022-11-21 13:56:12,510 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2959 states and 4413 transitions. [2022-11-21 13:56:12,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-21 13:56:12,511 INFO L428 stractBuchiCegarLoop]: Abstraction has 2959 states and 4413 transitions. [2022-11-21 13:56:12,511 INFO L335 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2022-11-21 13:56:12,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2959 states and 4413 transitions. [2022-11-21 13:56:12,523 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2022-11-21 13:56:12,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:56:12,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:56:12,525 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [29, 29, 18, 11, 11, 11, 11, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 13:56:12,525 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 9, 9, 9, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:56:12,526 INFO L748 eck$LassoCheckResult]: Stem: 93958#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 93928#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; 93929#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 93957#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; 93945#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 93946#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 94605#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 94601#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 94602#factENTRY ~n := #in~n; 94606#L25 assume ~n <= 0;#res := 1; 94604#factFINAL assume true; 94600#factEXIT >#68#return; 94596#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 94597#factENTRY ~n := #in~n; 94603#L25 assume ~n <= 0;#res := 1; 94599#factFINAL assume true; 94595#factEXIT >#70#return; 94592#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 94593#factENTRY ~n := #in~n; 94598#L25 assume ~n <= 0;#res := 1; 94594#factFINAL assume true; 94591#factEXIT >#72#return; 94590#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 94587#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 94583#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 94582#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 94581#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 94569#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 94570#factENTRY ~n := #in~n; 94580#L25 assume !(~n <= 0); 94578#L26 call #t~ret0 := fact(~n - 1);< 94579#factENTRY ~n := #in~n; 94589#L25 assume ~n <= 0;#res := 1; 94586#factFINAL assume true; 94577#factEXIT >#66#return; 94576#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94575#factFINAL assume true; 94568#factEXIT >#74#return; 94564#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 94565#factENTRY ~n := #in~n; 94574#L25 assume ~n <= 0;#res := 1; 94567#factFINAL assume true; 94563#factEXIT >#76#return; 94560#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 94561#factENTRY ~n := #in~n; 94585#L25 assume !(~n <= 0); 94572#L26 call #t~ret0 := fact(~n - 1);< 94573#factENTRY ~n := #in~n; 94588#L25 assume ~n <= 0;#res := 1; 94584#factFINAL assume true; 94571#factEXIT >#66#return; 94566#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94562#factFINAL assume true; 94559#factEXIT >#78#return; 94558#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 94555#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 94553#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 94551#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 94486#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 94481#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 94483#factENTRY ~n := #in~n; 94496#L25 assume !(~n <= 0); 94492#L26 call #t~ret0 := fact(~n - 1);< 94494#factENTRY ~n := #in~n; 94501#L25 assume !(~n <= 0); 94493#L26 call #t~ret0 := fact(~n - 1);< 94499#factENTRY ~n := #in~n; 94502#L25 assume ~n <= 0;#res := 1; 94500#factFINAL assume true; 94498#factEXIT >#66#return; 94497#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94495#factFINAL assume true; 94491#factEXIT >#66#return; 94490#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94485#factFINAL assume true; 94480#factEXIT >#74#return; 94476#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 94504#factENTRY ~n := #in~n; 94505#L25 assume ~n <= 0;#res := 1; 94475#factFINAL assume true; 94477#factEXIT >#76#return; 94467#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 94468#factENTRY ~n := #in~n; 94523#L25 assume !(~n <= 0); 94512#L26 call #t~ret0 := fact(~n - 1);< 94515#factENTRY ~n := #in~n; 94520#L25 assume !(~n <= 0); 94511#L26 call #t~ret0 := fact(~n - 1);< 94522#factENTRY ~n := #in~n; 94525#L25 assume ~n <= 0;#res := 1; 94524#factFINAL assume true; 94521#factEXIT >#66#return; 94519#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94516#factFINAL assume true; 94509#factEXIT >#66#return; 94514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94941#factFINAL assume true; 94466#factEXIT >#78#return; 94465#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 94459#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 94457#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 94454#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 94450#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 94425#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 94391#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 94382#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 94377#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 94378#factENTRY ~n := #in~n; 94387#L25 assume ~n <= 0;#res := 1; 94388#factFINAL assume true; 94448#factEXIT >#68#return; 94444#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 94446#factENTRY ~n := #in~n; 94449#L25 assume ~n <= 0;#res := 1; 94447#factFINAL assume true; 94443#factEXIT >#70#return; 94339#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 94343#factENTRY ~n := #in~n; 94365#L25 assume !(~n <= 0); 94308#L26 call #t~ret0 := fact(~n - 1);< 94327#factENTRY ~n := #in~n; 94328#L25 assume ~n <= 0;#res := 1; 94325#factFINAL assume true; 94292#factEXIT >#66#return; 94321#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94357#factFINAL assume true; 94338#factEXIT >#72#return; 94336#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 94337#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 94332#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 94333#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 94329#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 94278#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 94682#factENTRY ~n := #in~n; 94683#L25 assume !(~n <= 0); 94293#L26 call #t~ret0 := fact(~n - 1);< 94324#factENTRY ~n := #in~n; 94328#L25 assume ~n <= 0;#res := 1; 94325#factFINAL assume true; 94292#factEXIT >#66#return; 94287#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94288#factFINAL assume true; 94277#factEXIT >#68#return; 94279#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 94773#factENTRY ~n := #in~n; 94831#L25 assume !(~n <= 0); 94307#L26 call #t~ret0 := fact(~n - 1);< 94327#factENTRY ~n := #in~n; 94328#L25 assume ~n <= 0;#res := 1; 94325#factFINAL assume true; 94292#factEXIT >#66#return; 94320#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94830#factFINAL assume true; 94828#factEXIT >#70#return; 94290#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 94825#factENTRY ~n := #in~n; 94827#L25 assume ~n <= 0;#res := 1; 94826#factFINAL assume true; 94824#factEXIT >#72#return; 94817#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 94814#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 94812#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 94805#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 94747#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 94738#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 94745#factENTRY ~n := #in~n; 94880#L25 assume !(~n <= 0); 94298#L26 call #t~ret0 := fact(~n - 1);< 94327#factENTRY ~n := #in~n; 94328#L25 assume ~n <= 0;#res := 1; 94325#factFINAL assume true; 94292#factEXIT >#66#return; 94314#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94753#factFINAL assume true; 94736#factEXIT >#74#return; 94721#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 94723#factENTRY ~n := #in~n; 94733#L25 assume ~n <= 0;#res := 1; 94732#factFINAL assume true; 94720#factEXIT >#76#return; 93980#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 93981#factENTRY ~n := #in~n; 94772#L25 assume !(~n <= 0); 94533#L26 call #t~ret0 := fact(~n - 1);< 94545#factENTRY ~n := #in~n; 94549#L25 assume ~n <= 0;#res := 1; 94546#factFINAL assume true; 94528#factEXIT >#66#return; 94542#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94949#factFINAL assume true; 94946#factEXIT >#78#return; 94703#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 93931#L30-9 [2022-11-21 13:56:12,526 INFO L750 eck$LassoCheckResult]: Loop: 93931#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 93942#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 93978#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 94000#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 93900#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 93901#factENTRY ~n := #in~n; 94012#L25 assume !(~n <= 0); 94013#L26 call #t~ret0 := fact(~n - 1);< 94029#factENTRY ~n := #in~n; 94041#L25 assume !(~n <= 0); 94020#L26 call #t~ret0 := fact(~n - 1);< 94040#factENTRY ~n := #in~n; 94041#L25 assume !(~n <= 0); 94020#L26 call #t~ret0 := fact(~n - 1);< 94040#factENTRY ~n := #in~n; 94041#L25 assume !(~n <= 0); 94020#L26 call #t~ret0 := fact(~n - 1);< 94040#factENTRY ~n := #in~n; 94043#L25 assume ~n <= 0;#res := 1; 94082#factFINAL assume true; 94075#factEXIT >#66#return; 94073#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94068#factFINAL assume true; 94016#factEXIT >#66#return; 94024#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94086#factFINAL assume true; 94084#factEXIT >#66#return; 94083#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94081#factFINAL assume true; 94080#factEXIT >#66#return; 94032#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94030#factFINAL assume true; 94011#factEXIT >#74#return; 93989#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 93901#factENTRY ~n := #in~n; 94012#L25 assume !(~n <= 0); 94013#L26 call #t~ret0 := fact(~n - 1);< 94029#factENTRY ~n := #in~n; 94041#L25 assume !(~n <= 0); 94020#L26 call #t~ret0 := fact(~n - 1);< 94040#factENTRY ~n := #in~n; 94041#L25 assume !(~n <= 0); 94020#L26 call #t~ret0 := fact(~n - 1);< 94040#factENTRY ~n := #in~n; 94043#L25 assume ~n <= 0;#res := 1; 94082#factFINAL assume true; 94075#factEXIT >#66#return; 94073#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94068#factFINAL assume true; 94016#factEXIT >#66#return; 94024#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94086#factFINAL assume true; 94084#factEXIT >#66#return; 94085#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94026#factFINAL assume true; 94014#factEXIT >#76#return; 94004#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 94008#factENTRY ~n := #in~n; 94078#L25 assume !(~n <= 0); 94021#L26 call #t~ret0 := fact(~n - 1);< 94025#factENTRY ~n := #in~n; 94130#L25 assume !(~n <= 0); 94076#L26 call #t~ret0 := fact(~n - 1);< 94077#factENTRY ~n := #in~n; 94043#L25 assume ~n <= 0;#res := 1; 94082#factFINAL assume true; 94075#factEXIT >#66#return; 94073#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94068#factFINAL assume true; 94016#factEXIT >#66#return; 94015#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94007#factFINAL assume true; 94005#factEXIT >#78#return; 93930#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 93931#L30-9 [2022-11-21 13:56:12,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:12,527 INFO L85 PathProgramCache]: Analyzing trace with hash 938914793, now seen corresponding path program 15 times [2022-11-21 13:56:12,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:56:12,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617169416] [2022-11-21 13:56:12,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:56:12,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:56:12,541 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:56:12,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1429959599] [2022-11-21 13:56:12,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 13:56:12,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:56:12,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:56:12,550 INFO L229 MonitoredProcess]: Starting monitored process 188 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:56:12,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (188)] Waiting until timeout for monitored process [2022-11-21 13:56:12,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-21 13:56:12,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:56:12,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-21 13:56:12,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:12,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 538 proven. 4 refuted. 0 times theorem prover too weak. 1267 trivial. 0 not checked. [2022-11-21 13:56:12,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:56:13,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 206 proven. 25 refuted. 0 times theorem prover too weak. 1578 trivial. 0 not checked. [2022-11-21 13:56:13,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:56:13,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617169416] [2022-11-21 13:56:13,163 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:56:13,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429959599] [2022-11-21 13:56:13,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429959599] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:56:13,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:56:13,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2022-11-21 13:56:13,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555728868] [2022-11-21 13:56:13,163 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:56:13,167 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 13:56:13,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:13,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1408742218, now seen corresponding path program 5 times [2022-11-21 13:56:13,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:56:13,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431436874] [2022-11-21 13:56:13,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:56:13,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:56:13,188 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:56:13,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2129578999] [2022-11-21 13:56:13,194 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 13:56:13,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:56:13,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:56:13,206 INFO L229 MonitoredProcess]: Starting monitored process 189 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:56:13,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (189)] Waiting until timeout for monitored process [2022-11-21 13:56:13,327 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2022-11-21 13:56:13,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:56:13,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-21 13:56:13,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:13,529 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 31 proven. 200 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-11-21 13:56:13,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:56:14,904 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 31 proven. 226 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-11-21 13:56:14,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:56:14,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431436874] [2022-11-21 13:56:14,905 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:56:14,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129578999] [2022-11-21 13:56:14,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129578999] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:56:14,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:56:14,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20] total 23 [2022-11-21 13:56:14,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140265845] [2022-11-21 13:56:14,906 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:56:14,906 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 13:56:14,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:56:14,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-21 13:56:14,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-11-21 13:56:14,907 INFO L87 Difference]: Start difference. First operand 2959 states and 4413 transitions. cyclomatic complexity: 1487 Second operand has 23 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 13 states have call successors, (13), 1 states have call predecessors, (13), 9 states have return successors, (18), 11 states have call predecessors, (18), 13 states have call successors, (18) [2022-11-21 13:56:15,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:56:15,703 INFO L93 Difference]: Finished difference Result 4285 states and 6141 transitions. [2022-11-21 13:56:15,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4285 states and 6141 transitions. [2022-11-21 13:56:15,730 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2022-11-21 13:56:15,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4285 states to 4213 states and 6066 transitions. [2022-11-21 13:56:15,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 491 [2022-11-21 13:56:15,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 491 [2022-11-21 13:56:15,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4213 states and 6066 transitions. [2022-11-21 13:56:15,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:56:15,773 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4213 states and 6066 transitions. [2022-11-21 13:56:15,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4213 states and 6066 transitions. [2022-11-21 13:56:15,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4213 to 2959. [2022-11-21 13:56:15,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2959 states, 1859 states have (on average 1.0618612157073695) internal successors, (1974), 1866 states have internal predecessors, (1974), 591 states have call successors, (619), 326 states have call predecessors, (619), 509 states have return successors, (1808), 766 states have call predecessors, (1808), 591 states have call successors, (1808) [2022-11-21 13:56:15,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 4401 transitions. [2022-11-21 13:56:15,888 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2959 states and 4401 transitions. [2022-11-21 13:56:15,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 13:56:15,889 INFO L428 stractBuchiCegarLoop]: Abstraction has 2959 states and 4401 transitions. [2022-11-21 13:56:15,889 INFO L335 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2022-11-21 13:56:15,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2959 states and 4401 transitions. [2022-11-21 13:56:15,900 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2022-11-21 13:56:15,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:56:15,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:56:15,902 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [29, 29, 18, 11, 11, 11, 11, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 13:56:15,902 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 21, 18, 18, 18, 18, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:56:15,903 INFO L748 eck$LassoCheckResult]: Stem: 102844#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 102816#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; 102817#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 102843#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; 102830#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 102831#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 103216#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 103212#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 103213#factENTRY ~n := #in~n; 103217#L25 assume ~n <= 0;#res := 1; 103215#factFINAL assume true; 103211#factEXIT >#68#return; 103207#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 103208#factENTRY ~n := #in~n; 103214#L25 assume ~n <= 0;#res := 1; 103210#factFINAL assume true; 103206#factEXIT >#70#return; 103203#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 103204#factENTRY ~n := #in~n; 103209#L25 assume ~n <= 0;#res := 1; 103205#factFINAL assume true; 103202#factEXIT >#72#return; 103201#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 103198#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 103194#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 103193#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 103192#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 103180#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 103181#factENTRY ~n := #in~n; 103191#L25 assume !(~n <= 0); 103189#L26 call #t~ret0 := fact(~n - 1);< 103190#factENTRY ~n := #in~n; 103200#L25 assume ~n <= 0;#res := 1; 103197#factFINAL assume true; 103188#factEXIT >#66#return; 103187#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103186#factFINAL assume true; 103179#factEXIT >#74#return; 103175#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 103176#factENTRY ~n := #in~n; 103185#L25 assume ~n <= 0;#res := 1; 103178#factFINAL assume true; 103174#factEXIT >#76#return; 103171#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 103172#factENTRY ~n := #in~n; 103196#L25 assume !(~n <= 0); 103183#L26 call #t~ret0 := fact(~n - 1);< 103184#factENTRY ~n := #in~n; 103199#L25 assume ~n <= 0;#res := 1; 103195#factFINAL assume true; 103182#factEXIT >#66#return; 103177#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103173#factFINAL assume true; 103170#factEXIT >#78#return; 103169#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 103160#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 103157#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 103139#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 103115#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 103109#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 103112#factENTRY ~n := #in~n; 103125#L25 assume !(~n <= 0); 103121#L26 call #t~ret0 := fact(~n - 1);< 103123#factENTRY ~n := #in~n; 103130#L25 assume !(~n <= 0); 103122#L26 call #t~ret0 := fact(~n - 1);< 103128#factENTRY ~n := #in~n; 103131#L25 assume ~n <= 0;#res := 1; 103129#factFINAL assume true; 103127#factEXIT >#66#return; 103126#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103124#factFINAL assume true; 103120#factEXIT >#66#return; 103119#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103114#factFINAL assume true; 103108#factEXIT >#74#return; 103100#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 103101#factENTRY ~n := #in~n; 103106#L25 assume ~n <= 0;#res := 1; 103107#factFINAL assume true; 103099#factEXIT >#76#return; 103097#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 103098#factENTRY ~n := #in~n; 103154#L25 assume !(~n <= 0); 103143#L26 call #t~ret0 := fact(~n - 1);< 103147#factENTRY ~n := #in~n; 103155#L25 assume !(~n <= 0); 103142#L26 call #t~ret0 := fact(~n - 1);< 103152#factENTRY ~n := #in~n; 103156#L25 assume ~n <= 0;#res := 1; 103153#factFINAL assume true; 103151#factEXIT >#66#return; 103150#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103148#factFINAL assume true; 103141#factEXIT >#66#return; 103146#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103832#factFINAL assume true; 103096#factEXIT >#78#return; 103091#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 103088#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 103086#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 103084#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 103080#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 103076#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 103051#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 103021#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 103013#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 103015#factENTRY ~n := #in~n; 103018#L25 assume ~n <= 0;#res := 1; 103017#factFINAL assume true; 103012#factEXIT >#68#return; 103008#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 103009#factENTRY ~n := #in~n; 103016#L25 assume ~n <= 0;#res := 1; 103011#factFINAL assume true; 103006#factEXIT >#70#return; 102969#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 102973#factENTRY ~n := #in~n; 102987#L25 assume !(~n <= 0); 102933#L26 call #t~ret0 := fact(~n - 1);< 102986#factENTRY ~n := #in~n; 102952#L25 assume ~n <= 0;#res := 1; 102950#factFINAL assume true; 102917#factEXIT >#66#return; 102947#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102984#factFINAL assume true; 102968#factEXIT >#72#return; 102966#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 102964#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 102961#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 102959#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 102957#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 102904#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 102905#factENTRY ~n := #in~n; 102962#L25 assume !(~n <= 0); 102920#L26 call #t~ret0 := fact(~n - 1);< 102949#factENTRY ~n := #in~n; 102952#L25 assume ~n <= 0;#res := 1; 102950#factFINAL assume true; 102917#factEXIT >#66#return; 102912#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102913#factFINAL assume true; 102903#factEXIT >#68#return; 102897#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 102900#factENTRY ~n := #in~n; 103420#L25 assume !(~n <= 0); 102931#L26 call #t~ret0 := fact(~n - 1);< 102986#factENTRY ~n := #in~n; 102952#L25 assume ~n <= 0;#res := 1; 102950#factFINAL assume true; 102917#factEXIT >#66#return; 102946#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103721#factFINAL assume true; 103720#factEXIT >#70#return; 102915#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 103716#factENTRY ~n := #in~n; 103718#L25 assume ~n <= 0;#res := 1; 103717#factFINAL assume true; 103715#factEXIT >#72#return; 103714#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 103713#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 103680#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 103455#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 103425#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 103409#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 103415#factENTRY ~n := #in~n; 103432#L25 assume !(~n <= 0); 102932#L26 call #t~ret0 := fact(~n - 1);< 102986#factENTRY ~n := #in~n; 102952#L25 assume ~n <= 0;#res := 1; 102950#factFINAL assume true; 102917#factEXIT >#66#return; 102937#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103421#factFINAL assume true; 103406#factEXIT >#74#return; 103414#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 103435#factENTRY ~n := #in~n; 103805#L25 assume ~n <= 0;#res := 1; 103804#factFINAL assume true; 103803#factEXIT >#76#return; 102864#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 102865#factENTRY ~n := #in~n; 103811#L25 assume !(~n <= 0); 103313#L26 call #t~ret0 := fact(~n - 1);< 103326#factENTRY ~n := #in~n; 103327#L25 assume ~n <= 0;#res := 1; 103325#factFINAL assume true; 103307#factEXIT >#66#return; 103321#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103849#factFINAL assume true; 103848#factEXIT >#78#return; 103733#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 102819#L30-9 [2022-11-21 13:56:15,903 INFO L750 eck$LassoCheckResult]: Loop: 102819#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 102828#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 102863#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 102868#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 102869#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 102882#factENTRY ~n := #in~n; 103473#L25 assume !(~n <= 0); 103474#L26 call #t~ret0 := fact(~n - 1);< 103482#factENTRY ~n := #in~n; 103496#L25 assume !(~n <= 0); 103478#L26 call #t~ret0 := fact(~n - 1);< 103495#factENTRY ~n := #in~n; 103496#L25 assume !(~n <= 0); 103478#L26 call #t~ret0 := fact(~n - 1);< 103495#factENTRY ~n := #in~n; 103496#L25 assume !(~n <= 0); 103478#L26 call #t~ret0 := fact(~n - 1);< 103495#factENTRY ~n := #in~n; 103496#L25 assume !(~n <= 0); 103478#L26 call #t~ret0 := fact(~n - 1);< 103495#factENTRY ~n := #in~n; 103496#L25 assume !(~n <= 0); 103478#L26 call #t~ret0 := fact(~n - 1);< 103495#factENTRY ~n := #in~n; 103498#L25 assume ~n <= 0;#res := 1; 103531#factFINAL assume true; 103527#factEXIT >#66#return; 103525#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103523#factFINAL assume true; 103486#factEXIT >#66#return; 103489#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103522#factFINAL assume true; 103508#factEXIT >#66#return; 103506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103504#factFINAL assume true; 103500#factEXIT >#66#return; 103497#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103494#factFINAL assume true; 103477#factEXIT >#66#return; 103481#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103686#factFINAL assume true; 103685#factEXIT >#66#return; 103681#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103456#factFINAL assume true; 103457#factEXIT >#74#return; 102881#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 102882#factENTRY ~n := #in~n; 103473#L25 assume !(~n <= 0); 103474#L26 call #t~ret0 := fact(~n - 1);< 103482#factENTRY ~n := #in~n; 103496#L25 assume !(~n <= 0); 103478#L26 call #t~ret0 := fact(~n - 1);< 103495#factENTRY ~n := #in~n; 103496#L25 assume !(~n <= 0); 103478#L26 call #t~ret0 := fact(~n - 1);< 103495#factENTRY ~n := #in~n; 103496#L25 assume !(~n <= 0); 103478#L26 call #t~ret0 := fact(~n - 1);< 103495#factENTRY ~n := #in~n; 103496#L25 assume !(~n <= 0); 103478#L26 call #t~ret0 := fact(~n - 1);< 103495#factENTRY ~n := #in~n; 103496#L25 assume !(~n <= 0); 103478#L26 call #t~ret0 := fact(~n - 1);< 103495#factENTRY ~n := #in~n; 103498#L25 assume ~n <= 0;#res := 1; 103531#factFINAL assume true; 103527#factEXIT >#66#return; 103525#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103523#factFINAL assume true; 103486#factEXIT >#66#return; 103489#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103522#factFINAL assume true; 103508#factEXIT >#66#return; 103506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103504#factFINAL assume true; 103500#factEXIT >#66#return; 103497#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103494#factFINAL assume true; 103477#factEXIT >#66#return; 103481#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103686#factFINAL assume true; 103685#factEXIT >#66#return; 103681#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103456#factFINAL assume true; 103457#factEXIT >#76#return; 102877#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 103458#factENTRY ~n := #in~n; 103483#L25 assume !(~n <= 0); 103474#L26 call #t~ret0 := fact(~n - 1);< 103482#factENTRY ~n := #in~n; 103496#L25 assume !(~n <= 0); 103478#L26 call #t~ret0 := fact(~n - 1);< 103495#factENTRY ~n := #in~n; 103496#L25 assume !(~n <= 0); 103478#L26 call #t~ret0 := fact(~n - 1);< 103495#factENTRY ~n := #in~n; 103496#L25 assume !(~n <= 0); 103478#L26 call #t~ret0 := fact(~n - 1);< 103495#factENTRY ~n := #in~n; 103496#L25 assume !(~n <= 0); 103478#L26 call #t~ret0 := fact(~n - 1);< 103495#factENTRY ~n := #in~n; 103496#L25 assume !(~n <= 0); 103478#L26 call #t~ret0 := fact(~n - 1);< 103495#factENTRY ~n := #in~n; 103498#L25 assume ~n <= 0;#res := 1; 103531#factFINAL assume true; 103527#factEXIT >#66#return; 103525#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103523#factFINAL assume true; 103486#factEXIT >#66#return; 103489#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103522#factFINAL assume true; 103508#factEXIT >#66#return; 103506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103504#factFINAL assume true; 103500#factEXIT >#66#return; 103497#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103494#factFINAL assume true; 103477#factEXIT >#66#return; 103481#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103686#factFINAL assume true; 103685#factEXIT >#66#return; 103681#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103456#factFINAL assume true; 103457#factEXIT >#78#return; 102818#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 102819#L30-9 [2022-11-21 13:56:15,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:15,904 INFO L85 PathProgramCache]: Analyzing trace with hash 938914793, now seen corresponding path program 16 times [2022-11-21 13:56:15,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:56:15,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724204501] [2022-11-21 13:56:15,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:56:15,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:56:15,914 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:56:15,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [688186520] [2022-11-21 13:56:15,915 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 13:56:15,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:56:15,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:56:15,922 INFO L229 MonitoredProcess]: Starting monitored process 190 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:56:15,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (190)] Waiting until timeout for monitored process [2022-11-21 13:56:16,137 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 13:56:16,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:56:16,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 13:56:16,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:16,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 987 proven. 1 refuted. 0 times theorem prover too weak. 821 trivial. 0 not checked. [2022-11-21 13:56:16,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:56:16,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 95 proven. 40 refuted. 0 times theorem prover too weak. 1674 trivial. 0 not checked. [2022-11-21 13:56:16,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:56:16,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724204501] [2022-11-21 13:56:16,454 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:56:16,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688186520] [2022-11-21 13:56:16,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688186520] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:56:16,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:56:16,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-11-21 13:56:16,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187806723] [2022-11-21 13:56:16,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:56:16,456 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 13:56:16,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:16,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1026830290, now seen corresponding path program 6 times [2022-11-21 13:56:16,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:56:16,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012341703] [2022-11-21 13:56:16,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:56:16,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:56:16,468 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:56:16,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [561433052] [2022-11-21 13:56:16,469 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-21 13:56:16,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:56:16,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:56:16,473 INFO L229 MonitoredProcess]: Starting monitored process 191 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:56:16,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (191)] Waiting until timeout for monitored process [2022-11-21 13:56:16,679 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2022-11-21 13:56:16,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:56:16,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-21 13:56:16,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:17,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 205 proven. 579 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2022-11-21 13:56:17,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:56:20,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 205 proven. 697 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2022-11-21 13:56:20,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:56:20,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012341703] [2022-11-21 13:56:20,556 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:56:20,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561433052] [2022-11-21 13:56:20,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561433052] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:56:20,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:56:20,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 30] total 35 [2022-11-21 13:56:20,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380757587] [2022-11-21 13:56:20,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:56:20,558 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 13:56:20,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:56:20,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-21 13:56:20,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1013, Unknown=0, NotChecked=0, Total=1190 [2022-11-21 13:56:20,559 INFO L87 Difference]: Start difference. First operand 2959 states and 4401 transitions. cyclomatic complexity: 1475 Second operand has 35 states, 31 states have (on average 2.225806451612903) internal successors, (69), 31 states have internal predecessors, (69), 19 states have call successors, (20), 1 states have call predecessors, (20), 15 states have return successors, (30), 19 states have call predecessors, (30), 19 states have call successors, (30) [2022-11-21 13:56:23,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:56:23,399 INFO L93 Difference]: Finished difference Result 6255 states and 10008 transitions. [2022-11-21 13:56:23,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6255 states and 10008 transitions. [2022-11-21 13:56:23,477 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 118 [2022-11-21 13:56:23,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6255 states to 6165 states and 9790 transitions. [2022-11-21 13:56:23,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 709 [2022-11-21 13:56:23,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 733 [2022-11-21 13:56:23,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6165 states and 9790 transitions. [2022-11-21 13:56:23,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:56:23,533 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6165 states and 9790 transitions. [2022-11-21 13:56:23,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6165 states and 9790 transitions. [2022-11-21 13:56:23,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6165 to 3538. [2022-11-21 13:56:23,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3538 states, 2192 states have (on average 1.0757299270072993) internal successors, (2358), 2184 states have internal predecessors, (2358), 749 states have call successors, (777), 412 states have call predecessors, (777), 597 states have return successors, (2935), 941 states have call predecessors, (2935), 749 states have call successors, (2935) [2022-11-21 13:56:23,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3538 states to 3538 states and 6070 transitions. [2022-11-21 13:56:23,702 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3538 states and 6070 transitions. [2022-11-21 13:56:23,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-21 13:56:23,703 INFO L428 stractBuchiCegarLoop]: Abstraction has 3538 states and 6070 transitions. [2022-11-21 13:56:23,703 INFO L335 stractBuchiCegarLoop]: ======== Iteration 31 ============ [2022-11-21 13:56:23,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3538 states and 6070 transitions. [2022-11-21 13:56:23,717 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2022-11-21 13:56:23,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:56:23,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:56:23,719 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [35, 35, 21, 14, 14, 14, 14, 7, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 13:56:23,720 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 14, 11, 11, 11, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:56:23,720 INFO L748 eck$LassoCheckResult]: Stem: 114054#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 114028#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; 114029#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 114053#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; 114042#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 114043#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 114485#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 114481#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 114482#factENTRY ~n := #in~n; 114486#L25 assume ~n <= 0;#res := 1; 114484#factFINAL assume true; 114480#factEXIT >#68#return; 114476#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 114477#factENTRY ~n := #in~n; 114483#L25 assume ~n <= 0;#res := 1; 114479#factFINAL assume true; 114475#factEXIT >#70#return; 114472#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 114473#factENTRY ~n := #in~n; 114478#L25 assume ~n <= 0;#res := 1; 114474#factFINAL assume true; 114471#factEXIT >#72#return; 114470#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 114468#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 114465#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 114460#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 114457#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 114449#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 114450#factENTRY ~n := #in~n; 114467#L25 assume !(~n <= 0); 114463#L26 call #t~ret0 := fact(~n - 1);< 114464#factENTRY ~n := #in~n; 114469#L25 assume ~n <= 0;#res := 1; 114466#factFINAL assume true; 114462#factEXIT >#66#return; 114459#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114456#factFINAL assume true; 114448#factEXIT >#74#return; 114444#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 114445#factENTRY ~n := #in~n; 114454#L25 assume ~n <= 0;#res := 1; 114447#factFINAL assume true; 114443#factEXIT >#76#return; 114440#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 114441#factENTRY ~n := #in~n; 114455#L25 assume !(~n <= 0); 114452#L26 call #t~ret0 := fact(~n - 1);< 114453#factENTRY ~n := #in~n; 114461#L25 assume ~n <= 0;#res := 1; 114458#factFINAL assume true; 114451#factEXIT >#66#return; 114446#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114442#factFINAL assume true; 114439#factEXIT >#78#return; 114438#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 114436#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 114434#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 114432#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 114390#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 114386#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 114388#factENTRY ~n := #in~n; 114398#L25 assume !(~n <= 0); 114394#L26 call #t~ret0 := fact(~n - 1);< 114396#factENTRY ~n := #in~n; 114403#L25 assume !(~n <= 0); 114395#L26 call #t~ret0 := fact(~n - 1);< 114401#factENTRY ~n := #in~n; 114404#L25 assume ~n <= 0;#res := 1; 114402#factFINAL assume true; 114400#factEXIT >#66#return; 114399#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114397#factFINAL assume true; 114393#factEXIT >#66#return; 114392#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114389#factFINAL assume true; 114385#factEXIT >#74#return; 114377#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 114408#factENTRY ~n := #in~n; 114409#L25 assume ~n <= 0;#res := 1; 114376#factFINAL assume true; 114378#factEXIT >#76#return; 114369#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 114370#factENTRY ~n := #in~n; 114429#L25 assume !(~n <= 0); 114417#L26 call #t~ret0 := fact(~n - 1);< 114420#factENTRY ~n := #in~n; 114427#L25 assume !(~n <= 0); 114416#L26 call #t~ret0 := fact(~n - 1);< 114425#factENTRY ~n := #in~n; 114428#L25 assume ~n <= 0;#res := 1; 114426#factFINAL assume true; 114424#factEXIT >#66#return; 114423#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114421#factFINAL assume true; 114414#factEXIT >#66#return; 114418#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114740#factFINAL assume true; 114368#factEXIT >#78#return; 114367#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 114366#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 114365#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 114364#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 114363#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 114358#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 114354#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 114309#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 114244#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 114245#factENTRY ~n := #in~n; 114251#L25 assume ~n <= 0;#res := 1; 114252#factFINAL assume true; 114318#factEXIT >#68#return; 114312#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 114313#factENTRY ~n := #in~n; 114315#L25 assume ~n <= 0;#res := 1; 114314#factFINAL assume true; 114310#factEXIT >#70#return; 114211#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 114212#factENTRY ~n := #in~n; 114235#L25 assume !(~n <= 0); 114165#L26 call #t~ret0 := fact(~n - 1);< 114228#factENTRY ~n := #in~n; 114188#L25 assume ~n <= 0;#res := 1; 114186#factFINAL assume true; 114151#factEXIT >#66#return; 114180#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114215#factFINAL assume true; 114217#factEXIT >#72#return; 114202#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 114200#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 114201#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 114196#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 114197#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 114112#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 114113#factENTRY ~n := #in~n; 114321#L25 assume !(~n <= 0); 114155#L26 call #t~ret0 := fact(~n - 1);< 114185#factENTRY ~n := #in~n; 114188#L25 assume ~n <= 0;#res := 1; 114186#factFINAL assume true; 114151#factEXIT >#66#return; 114149#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114150#factFINAL assume true; 114111#factEXIT >#68#return; 114107#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 114109#factENTRY ~n := #in~n; 114646#L25 assume !(~n <= 0); 114172#L26 call #t~ret0 := fact(~n - 1);< 114228#factENTRY ~n := #in~n; 114188#L25 assume ~n <= 0;#res := 1; 114186#factFINAL assume true; 114151#factEXIT >#66#return; 114184#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114725#factFINAL assume true; 114723#factEXIT >#70#return; 114193#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 114720#factENTRY ~n := #in~n; 114722#L25 assume ~n <= 0;#res := 1; 114721#factFINAL assume true; 114719#factEXIT >#72#return; 114718#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 114717#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 114716#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 114715#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 114672#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 114643#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 114645#factENTRY ~n := #in~n; 114699#L25 assume !(~n <= 0); 114163#L26 call #t~ret0 := fact(~n - 1);< 114228#factENTRY ~n := #in~n; 114188#L25 assume ~n <= 0;#res := 1; 114186#factFINAL assume true; 114151#factEXIT >#66#return; 114174#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114691#factFINAL assume true; 114661#factEXIT >#74#return; 114663#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 114695#factENTRY ~n := #in~n; 114697#L25 assume ~n <= 0;#res := 1; 114696#factFINAL assume true; 114693#factEXIT >#76#return; 114624#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 114647#factENTRY ~n := #in~n; 114648#L25 assume !(~n <= 0); 114164#L26 call #t~ret0 := fact(~n - 1);< 114228#factENTRY ~n := #in~n; 114188#L25 assume ~n <= 0;#res := 1; 114186#factFINAL assume true; 114151#factEXIT >#66#return; 114179#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115256#factFINAL assume true; 115254#factEXIT >#78#return; 114662#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 115251#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 115250#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 115247#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 114972#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 114961#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 114967#factENTRY ~n := #in~n; 115103#L25 assume !(~n <= 0); 114976#L26 call #t~ret0 := fact(~n - 1);< 114978#factENTRY ~n := #in~n; 115002#L25 assume ~n <= 0;#res := 1; 114994#factFINAL assume true; 114973#factEXIT >#66#return; 114971#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114970#factFINAL assume true; 114956#factEXIT >#74#return; 114948#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 114949#factENTRY ~n := #in~n; 114969#L25 assume ~n <= 0;#res := 1; 114955#factFINAL assume true; 114947#factEXIT >#76#return; 114089#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 114931#factENTRY ~n := #in~n; 114929#L25 assume !(~n <= 0); 114913#L26 call #t~ret0 := fact(~n - 1);< 114923#factENTRY ~n := #in~n; 114922#L25 assume !(~n <= 0); 114911#L26 call #t~ret0 := fact(~n - 1);< 114921#factENTRY ~n := #in~n; 114024#L25 assume ~n <= 0;#res := 1; 115088#factFINAL assume true; 115082#factEXIT >#66#return; 115078#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115076#factFINAL assume true; 115069#factEXIT >#66#return; 115071#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115249#factFINAL assume true; 115248#factEXIT >#78#return; 114030#L30-8 [2022-11-21 13:56:23,720 INFO L750 eck$LassoCheckResult]: Loop: 114030#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 114031#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 114040#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 114090#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 114091#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 114000#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 114001#factENTRY ~n := #in~n; 115195#L25 assume !(~n <= 0); 114910#L26 call #t~ret0 := fact(~n - 1);< 114923#factENTRY ~n := #in~n; 114922#L25 assume !(~n <= 0); 114911#L26 call #t~ret0 := fact(~n - 1);< 114921#factENTRY ~n := #in~n; 114922#L25 assume !(~n <= 0); 114911#L26 call #t~ret0 := fact(~n - 1);< 114921#factENTRY ~n := #in~n; 114922#L25 assume !(~n <= 0); 114911#L26 call #t~ret0 := fact(~n - 1);< 114921#factENTRY ~n := #in~n; 114922#L25 assume !(~n <= 0); 114911#L26 call #t~ret0 := fact(~n - 1);< 114921#factENTRY ~n := #in~n; 114024#L25 assume ~n <= 0;#res := 1; 115088#factFINAL assume true; 115082#factEXIT >#66#return; 115078#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115076#factFINAL assume true; 115069#factEXIT >#66#return; 115067#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115066#factFINAL assume true; 115061#factEXIT >#66#return; 115062#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114918#factFINAL assume true; 114907#factEXIT >#66#return; 114915#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115092#factFINAL assume true; 115090#factEXIT >#66#return; 115086#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115085#factFINAL assume true; 115083#factEXIT >#74#return; 114897#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 114001#factENTRY ~n := #in~n; 115195#L25 assume !(~n <= 0); 114910#L26 call #t~ret0 := fact(~n - 1);< 114923#factENTRY ~n := #in~n; 114922#L25 assume !(~n <= 0); 114911#L26 call #t~ret0 := fact(~n - 1);< 114921#factENTRY ~n := #in~n; 114024#L25 assume ~n <= 0;#res := 1; 115088#factFINAL assume true; 115082#factEXIT >#66#return; 115078#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115076#factFINAL assume true; 115069#factEXIT >#66#return; 115056#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115052#factFINAL assume true; 115049#factEXIT >#76#return; 114899#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 115043#factENTRY ~n := #in~n; 115037#L25 assume !(~n <= 0); 114912#L26 call #t~ret0 := fact(~n - 1);< 114917#factENTRY ~n := #in~n; 115094#L25 assume !(~n <= 0); 114909#L26 call #t~ret0 := fact(~n - 1);< 115081#factENTRY ~n := #in~n; 115098#L25 assume !(~n <= 0); 114919#L26 call #t~ret0 := fact(~n - 1);< 114920#factENTRY ~n := #in~n; 115095#L25 assume !(~n <= 0); 114034#L26 call #t~ret0 := fact(~n - 1);< 115072#factENTRY ~n := #in~n; 114024#L25 assume ~n <= 0;#res := 1; 115088#factFINAL assume true; 115082#factEXIT >#66#return; 115078#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115076#factFINAL assume true; 115069#factEXIT >#66#return; 115067#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115066#factFINAL assume true; 115061#factEXIT >#66#return; 115062#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114918#factFINAL assume true; 114907#factEXIT >#66#return; 114914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115058#factFINAL assume true; 114903#factEXIT >#78#return; 114030#L30-8 [2022-11-21 13:56:23,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:23,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1189275067, now seen corresponding path program 17 times [2022-11-21 13:56:23,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:56:23,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794874437] [2022-11-21 13:56:23,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:56:23,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:56:23,735 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:56:23,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1492577078] [2022-11-21 13:56:23,735 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 13:56:23,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:56:23,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:56:23,739 INFO L229 MonitoredProcess]: Starting monitored process 192 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:56:23,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (192)] Waiting until timeout for monitored process [2022-11-21 13:56:23,952 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-11-21 13:56:23,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:56:23,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-21 13:56:23,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:24,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2666 backedges. 1388 proven. 24 refuted. 0 times theorem prover too weak. 1254 trivial. 0 not checked. [2022-11-21 13:56:24,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:56:24,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2666 backedges. 194 proven. 106 refuted. 0 times theorem prover too weak. 2366 trivial. 0 not checked. [2022-11-21 13:56:24,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:56:24,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794874437] [2022-11-21 13:56:24,319 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:56:24,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492577078] [2022-11-21 13:56:24,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492577078] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:56:24,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:56:24,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-11-21 13:56:24,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715747747] [2022-11-21 13:56:24,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:56:24,320 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 13:56:24,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:24,321 INFO L85 PathProgramCache]: Analyzing trace with hash 693841020, now seen corresponding path program 7 times [2022-11-21 13:56:24,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:56:24,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690007179] [2022-11-21 13:56:24,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:56:24,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:56:24,326 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:56:24,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2012374671] [2022-11-21 13:56:24,326 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-21 13:56:24,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:56:24,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:56:24,330 INFO L229 MonitoredProcess]: Starting monitored process 193 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:56:24,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (193)] Waiting until timeout for monitored process [2022-11-21 13:56:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:24,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-21 13:56:24,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 60 proven. 267 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-21 13:56:24,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:56:26,421 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 60 proven. 310 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-11-21 13:56:26,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:56:26,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690007179] [2022-11-21 13:56:26,422 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:56:26,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012374671] [2022-11-21 13:56:26,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012374671] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:56:26,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:56:26,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23] total 26 [2022-11-21 13:56:26,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342531538] [2022-11-21 13:56:26,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:56:26,423 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 13:56:26,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:56:26,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-21 13:56:26,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2022-11-21 13:56:26,424 INFO L87 Difference]: Start difference. First operand 3538 states and 6070 transitions. cyclomatic complexity: 2565 Second operand has 27 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 15 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (22), 13 states have call predecessors, (22), 15 states have call successors, (22) [2022-11-21 13:56:27,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:56:27,707 INFO L93 Difference]: Finished difference Result 5649 states and 8985 transitions. [2022-11-21 13:56:27,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5649 states and 8985 transitions. [2022-11-21 13:56:27,753 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 104 [2022-11-21 13:56:27,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5649 states to 5634 states and 8970 transitions. [2022-11-21 13:56:27,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 662 [2022-11-21 13:56:27,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 662 [2022-11-21 13:56:27,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5634 states and 8970 transitions. [2022-11-21 13:56:27,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:56:27,817 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5634 states and 8970 transitions. [2022-11-21 13:56:27,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5634 states and 8970 transitions. [2022-11-21 13:56:28,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5634 to 3675. [2022-11-21 13:56:28,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3675 states, 2271 states have (on average 1.0757375605460149) internal successors, (2443), 2248 states have internal predecessors, (2443), 801 states have call successors, (829), 453 states have call predecessors, (829), 603 states have return successors, (3059), 973 states have call predecessors, (3059), 801 states have call successors, (3059) [2022-11-21 13:56:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3675 states to 3675 states and 6331 transitions. [2022-11-21 13:56:28,061 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3675 states and 6331 transitions. [2022-11-21 13:56:28,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-21 13:56:28,062 INFO L428 stractBuchiCegarLoop]: Abstraction has 3675 states and 6331 transitions. [2022-11-21 13:56:28,062 INFO L335 stractBuchiCegarLoop]: ======== Iteration 32 ============ [2022-11-21 13:56:28,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3675 states and 6331 transitions. [2022-11-21 13:56:28,081 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2022-11-21 13:56:28,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:56:28,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:56:28,083 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [35, 35, 21, 14, 14, 14, 14, 7, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 13:56:28,084 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 12, 12, 12, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:56:28,084 INFO L748 eck$LassoCheckResult]: Stem: 125200#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 125171#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; 125172#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 125199#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; 125187#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 125188#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 125608#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 125604#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 125605#factENTRY ~n := #in~n; 125609#L25 assume ~n <= 0;#res := 1; 125607#factFINAL assume true; 125603#factEXIT >#68#return; 125599#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 125600#factENTRY ~n := #in~n; 125606#L25 assume ~n <= 0;#res := 1; 125602#factFINAL assume true; 125598#factEXIT >#70#return; 125595#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 125596#factENTRY ~n := #in~n; 125601#L25 assume ~n <= 0;#res := 1; 125597#factFINAL assume true; 125594#factEXIT >#72#return; 125593#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 125592#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 125591#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 125587#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 125583#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 125572#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 125573#factENTRY ~n := #in~n; 125589#L25 assume !(~n <= 0); 125581#L26 call #t~ret0 := fact(~n - 1);< 125582#factENTRY ~n := #in~n; 125590#L25 assume ~n <= 0;#res := 1; 125586#factFINAL assume true; 125580#factEXIT >#66#return; 125579#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125578#factFINAL assume true; 125571#factEXIT >#74#return; 125567#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 125568#factENTRY ~n := #in~n; 125577#L25 assume ~n <= 0;#res := 1; 125570#factFINAL assume true; 125566#factEXIT >#76#return; 125563#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 125564#factENTRY ~n := #in~n; 125585#L25 assume !(~n <= 0); 125575#L26 call #t~ret0 := fact(~n - 1);< 125576#factENTRY ~n := #in~n; 125588#L25 assume ~n <= 0;#res := 1; 125584#factFINAL assume true; 125574#factEXIT >#66#return; 125569#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125565#factFINAL assume true; 125562#factEXIT >#78#return; 125560#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 125557#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 125554#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 125529#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 125512#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 125506#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 125508#factENTRY ~n := #in~n; 125520#L25 assume !(~n <= 0); 125516#L26 call #t~ret0 := fact(~n - 1);< 125518#factENTRY ~n := #in~n; 125525#L25 assume !(~n <= 0); 125517#L26 call #t~ret0 := fact(~n - 1);< 125523#factENTRY ~n := #in~n; 125526#L25 assume ~n <= 0;#res := 1; 125524#factFINAL assume true; 125522#factEXIT >#66#return; 125521#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125519#factFINAL assume true; 125515#factEXIT >#66#return; 125514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125509#factFINAL assume true; 125505#factEXIT >#74#return; 125500#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 125531#factENTRY ~n := #in~n; 125532#L25 assume ~n <= 0;#res := 1; 125499#factFINAL assume true; 125501#factEXIT >#76#return; 125492#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 125493#factENTRY ~n := #in~n; 125550#L25 assume !(~n <= 0); 125538#L26 call #t~ret0 := fact(~n - 1);< 125543#factENTRY ~n := #in~n; 125551#L25 assume !(~n <= 0); 125540#L26 call #t~ret0 := fact(~n - 1);< 125548#factENTRY ~n := #in~n; 125552#L25 assume ~n <= 0;#res := 1; 125549#factFINAL assume true; 125547#factEXIT >#66#return; 125546#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125544#factFINAL assume true; 125537#factEXIT >#66#return; 125542#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125702#factFINAL assume true; 125491#factEXIT >#78#return; 125490#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 125489#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 125488#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 125487#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 125486#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 125483#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 125482#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 125453#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 125430#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 125432#factENTRY ~n := #in~n; 125439#L25 assume ~n <= 0;#res := 1; 125440#factFINAL assume true; 125444#factEXIT >#68#return; 125417#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 125419#factENTRY ~n := #in~n; 125421#L25 assume ~n <= 0;#res := 1; 125420#factFINAL assume true; 125416#factEXIT >#70#return; 125342#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 125346#factENTRY ~n := #in~n; 125360#L25 assume !(~n <= 0); 125300#L26 call #t~ret0 := fact(~n - 1);< 125359#factENTRY ~n := #in~n; 125323#L25 assume ~n <= 0;#res := 1; 125320#factFINAL assume true; 125283#factEXIT >#66#return; 125316#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125357#factFINAL assume true; 125341#factEXIT >#72#return; 125339#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 125337#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 125334#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 125332#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 125330#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 125241#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 125242#factENTRY ~n := #in~n; 125336#L25 assume !(~n <= 0); 125293#L26 call #t~ret0 := fact(~n - 1);< 125319#factENTRY ~n := #in~n; 125323#L25 assume ~n <= 0;#res := 1; 125320#factFINAL assume true; 125283#factEXIT >#66#return; 125281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125282#factFINAL assume true; 125240#factEXIT >#68#return; 125235#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 125238#factENTRY ~n := #in~n; 125885#L25 assume !(~n <= 0); 125302#L26 call #t~ret0 := fact(~n - 1);< 125359#factENTRY ~n := #in~n; 125323#L25 assume ~n <= 0;#res := 1; 125320#factFINAL assume true; 125283#factEXIT >#66#return; 125317#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125913#factFINAL assume true; 125912#factEXIT >#70#return; 125325#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 125904#factENTRY ~n := #in~n; 125910#L25 assume ~n <= 0;#res := 1; 125907#factFINAL assume true; 125903#factEXIT >#72#return; 125902#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 125898#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 125897#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 125795#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 125784#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 125781#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 125782#factENTRY ~n := #in~n; 125861#L25 assume !(~n <= 0); 125301#L26 call #t~ret0 := fact(~n - 1);< 125359#factENTRY ~n := #in~n; 125323#L25 assume ~n <= 0;#res := 1; 125320#factFINAL assume true; 125283#factEXIT >#66#return; 125310#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125866#factFINAL assume true; 125862#factEXIT >#74#return; 125864#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 125889#factENTRY ~n := #in~n; 125892#L25 assume ~n <= 0;#res := 1; 125891#factFINAL assume true; 125888#factEXIT >#76#return; 125841#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 125886#factENTRY ~n := #in~n; 125887#L25 assume !(~n <= 0); 125288#L26 call #t~ret0 := fact(~n - 1);< 125359#factENTRY ~n := #in~n; 125323#L25 assume ~n <= 0;#res := 1; 125320#factFINAL assume true; 125283#factEXIT >#66#return; 125311#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126424#factFINAL assume true; 126421#factEXIT >#78#return; 125863#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 126415#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 126413#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 126411#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 126162#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 126138#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 126142#factENTRY ~n := #in~n; 126273#L25 assume !(~n <= 0); 126168#L26 call #t~ret0 := fact(~n - 1);< 126171#factENTRY ~n := #in~n; 126180#L25 assume ~n <= 0;#res := 1; 126176#factFINAL assume true; 126166#factEXIT >#66#return; 126164#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126161#factFINAL assume true; 126131#factEXIT >#74#return; 126122#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 126126#factENTRY ~n := #in~n; 126144#L25 assume ~n <= 0;#res := 1; 126130#factFINAL assume true; 126121#factEXIT >#76#return; 125157#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 126105#factENTRY ~n := #in~n; 126103#L25 assume !(~n <= 0); 126084#L26 call #t~ret0 := fact(~n - 1);< 126098#factENTRY ~n := #in~n; 126096#L25 assume !(~n <= 0); 126082#L26 call #t~ret0 := fact(~n - 1);< 126094#factENTRY ~n := #in~n; 126097#L25 assume ~n <= 0;#res := 1; 126255#factFINAL assume true; 126252#factEXIT >#66#return; 126248#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126230#factFINAL assume true; 126223#factEXIT >#66#return; 126224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126420#factFINAL assume true; 126419#factEXIT >#78#return; 125173#L30-8 [2022-11-21 13:56:28,085 INFO L750 eck$LassoCheckResult]: Loop: 125173#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 125174#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 125185#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 125221#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 125222#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 125142#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 125143#factENTRY ~n := #in~n; 126220#L25 assume !(~n <= 0); 126085#L26 call #t~ret0 := fact(~n - 1);< 126098#factENTRY ~n := #in~n; 126096#L25 assume !(~n <= 0); 126082#L26 call #t~ret0 := fact(~n - 1);< 126094#factENTRY ~n := #in~n; 126096#L25 assume !(~n <= 0); 126082#L26 call #t~ret0 := fact(~n - 1);< 126094#factENTRY ~n := #in~n; 126096#L25 assume !(~n <= 0); 126082#L26 call #t~ret0 := fact(~n - 1);< 126094#factENTRY ~n := #in~n; 126096#L25 assume !(~n <= 0); 126082#L26 call #t~ret0 := fact(~n - 1);< 126094#factENTRY ~n := #in~n; 126096#L25 assume !(~n <= 0); 126082#L26 call #t~ret0 := fact(~n - 1);< 126094#factENTRY ~n := #in~n; 126097#L25 assume ~n <= 0;#res := 1; 126255#factFINAL assume true; 126252#factEXIT >#66#return; 126248#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126230#factFINAL assume true; 126223#factEXIT >#66#return; 126221#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126091#factFINAL assume true; 126093#factEXIT >#66#return; 126228#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126231#factFINAL assume true; 126081#factEXIT >#66#return; 126088#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126245#factFINAL assume true; 126243#factEXIT >#66#return; 126244#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126256#factFINAL assume true; 126253#factEXIT >#66#return; 126251#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126246#factFINAL assume true; 126242#factEXIT >#74#return; 126064#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 125143#factENTRY ~n := #in~n; 126220#L25 assume ~n <= 0;#res := 1; 126262#factFINAL assume true; 126260#factEXIT >#76#return; 126065#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 126247#factENTRY ~n := #in~n; 126102#L25 assume !(~n <= 0); 126085#L26 call #t~ret0 := fact(~n - 1);< 126098#factENTRY ~n := #in~n; 126096#L25 assume !(~n <= 0); 126082#L26 call #t~ret0 := fact(~n - 1);< 126094#factENTRY ~n := #in~n; 126096#L25 assume !(~n <= 0); 126082#L26 call #t~ret0 := fact(~n - 1);< 126094#factENTRY ~n := #in~n; 126096#L25 assume !(~n <= 0); 126082#L26 call #t~ret0 := fact(~n - 1);< 126094#factENTRY ~n := #in~n; 126096#L25 assume !(~n <= 0); 126082#L26 call #t~ret0 := fact(~n - 1);< 126094#factENTRY ~n := #in~n; 126096#L25 assume !(~n <= 0); 126082#L26 call #t~ret0 := fact(~n - 1);< 126094#factENTRY ~n := #in~n; 126097#L25 assume ~n <= 0;#res := 1; 126255#factFINAL assume true; 126252#factEXIT >#66#return; 126248#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126230#factFINAL assume true; 126223#factEXIT >#66#return; 126221#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126091#factFINAL assume true; 126093#factEXIT >#66#return; 126228#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126231#factFINAL assume true; 126081#factEXIT >#66#return; 126088#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126245#factFINAL assume true; 126243#factEXIT >#66#return; 126244#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126256#factFINAL assume true; 126253#factEXIT >#66#return; 126251#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126246#factFINAL assume true; 126242#factEXIT >#78#return; 125173#L30-8 [2022-11-21 13:56:28,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:28,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1189275067, now seen corresponding path program 18 times [2022-11-21 13:56:28,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:56:28,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35463815] [2022-11-21 13:56:28,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:56:28,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:56:28,102 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:56:28,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1451413054] [2022-11-21 13:56:28,103 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-21 13:56:28,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:56:28,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:56:28,111 INFO L229 MonitoredProcess]: Starting monitored process 194 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:56:28,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (194)] Waiting until timeout for monitored process [2022-11-21 13:56:28,359 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-11-21 13:56:28,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:56:28,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-21 13:56:28,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:28,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2666 backedges. 778 proven. 76 refuted. 0 times theorem prover too weak. 1812 trivial. 0 not checked. [2022-11-21 13:56:28,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:56:29,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2666 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 2574 trivial. 0 not checked. [2022-11-21 13:56:29,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:56:29,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35463815] [2022-11-21 13:56:29,054 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:56:29,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451413054] [2022-11-21 13:56:29,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451413054] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:56:29,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:56:29,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-11-21 13:56:29,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469749133] [2022-11-21 13:56:29,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:56:29,055 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 13:56:29,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:29,055 INFO L85 PathProgramCache]: Analyzing trace with hash 2078612212, now seen corresponding path program 8 times [2022-11-21 13:56:29,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:56:29,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890466675] [2022-11-21 13:56:29,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:56:29,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:56:29,067 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:56:29,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [801009008] [2022-11-21 13:56:29,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:56:29,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:56:29,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:56:29,073 INFO L229 MonitoredProcess]: Starting monitored process 195 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:56:29,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (195)] Waiting until timeout for monitored process [2022-11-21 13:56:29,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:56:29,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-21 13:56:29,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:56:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:56:29,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:56:31,487 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 13:56:31,487 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 13:56:31,487 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 13:56:31,488 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 13:56:31,488 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-21 13:56:31,488 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:56:31,488 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 13:56:31,488 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 13:56:31,488 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration32_Loop [2022-11-21 13:56:31,488 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 13:56:31,488 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 13:56:31,490 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-21 13:56:31,494 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-21 13:56:31,496 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-21 13:56:31,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-21 13:56:31,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-21 13:56:31,756 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 13:56:31,756 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-21 13:56:31,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:56:31,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:56:31,758 INFO L229 MonitoredProcess]: Starting monitored process 196 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:56:31,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2022-11-21 13:56:31,762 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:56:31,762 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:56:31,773 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-21 13:56:31,773 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=1} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-21 13:56:31,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Forceful destruction successful, exit code 0 [2022-11-21 13:56:31,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:56:31,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:56:31,777 INFO L229 MonitoredProcess]: Starting monitored process 197 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:56:31,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2022-11-21 13:56:31,780 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:56:31,780 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:56:31,791 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-21 13:56:31,791 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-21 13:56:31,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Forceful destruction successful, exit code 0 [2022-11-21 13:56:31,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:56:31,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:56:31,796 INFO L229 MonitoredProcess]: Starting monitored process 198 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:56:31,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2022-11-21 13:56:31,798 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:56:31,798 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:56:31,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Ended with exit code 0 [2022-11-21 13:56:31,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:56:31,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:56:31,816 INFO L229 MonitoredProcess]: Starting monitored process 199 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:56:31,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2022-11-21 13:56:31,819 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-21 13:56:31,819 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:56:31,843 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-21 13:56:31,846 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Ended with exit code 0 [2022-11-21 13:56:31,846 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 13:56:31,846 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 13:56:31,846 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 13:56:31,846 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 13:56:31,846 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-21 13:56:31,846 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:56:31,846 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 13:56:31,846 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 13:56:31,846 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration32_Loop [2022-11-21 13:56:31,846 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 13:56:31,847 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 13:56:31,849 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-21 13:56:31,857 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-21 13:56:31,860 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-21 13:56:31,929 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-21 13:56:31,931 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-21 13:56:32,123 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 13:56:32,123 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-21 13:56:32,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:56:32,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:56:32,125 INFO L229 MonitoredProcess]: Starting monitored process 200 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:56:32,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2022-11-21 13:56:32,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:56:32,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:56:32,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:56:32,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:56:32,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:56:32,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:56:32,138 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:56:32,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:56:32,139 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:56:32,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Forceful destruction successful, exit code 0 [2022-11-21 13:56:32,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:56:32,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:56:32,146 INFO L229 MonitoredProcess]: Starting monitored process 201 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:56:32,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2022-11-21 13:56:32,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:56:32,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:56:32,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:56:32,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:56:32,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:56:32,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:56:32,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:56:32,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:56:32,161 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 13:56:32,164 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Ended with exit code 0 [2022-11-21 13:56:32,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:56:32,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:56:32,165 INFO L229 MonitoredProcess]: Starting monitored process 202 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:56:32,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2022-11-21 13:56:32,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 13:56:32,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 13:56:32,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 13:56:32,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 13:56:32,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 13:56:32,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 13:56:32,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 13:56:32,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 13:56:32,186 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-21 13:56:32,190 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-21 13:56:32,190 INFO L444 ModelExtractionUtils]: 8 out of 11 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-21 13:56:32,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:56:32,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:56:32,193 INFO L229 MonitoredProcess]: Starting monitored process 203 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:56:32,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Waiting until timeout for monitored process [2022-11-21 13:56:32,194 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-21 13:56:32,194 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-21 13:56:32,194 INFO L513 LassoAnalysis]: Proved termination. [2022-11-21 13:56:32,194 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 11 Supporting invariants [] [2022-11-21 13:56:32,197 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Ended with exit code 0 [2022-11-21 13:56:32,197 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-21 13:56:32,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:32,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Ended with exit code 0 [2022-11-21 13:56:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:32,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 1521 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-21 13:56:32,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:34,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-21 13:56:34,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:34,543 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2022-11-21 13:56:34,544 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 13 loop predicates [2022-11-21 13:56:34,544 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3675 states and 6331 transitions. cyclomatic complexity: 2689 Second operand has 16 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 6 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) [2022-11-21 13:56:35,114 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3675 states and 6331 transitions. cyclomatic complexity: 2689. Second operand has 16 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 6 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) Result 4263 states and 7063 transitions. Complement of second has 65 states. [2022-11-21 13:56:35,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2022-11-21 13:56:35,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 6 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) [2022-11-21 13:56:35,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 93 transitions. [2022-11-21 13:56:35,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 93 transitions. Stem has 229 letters. Loop has 92 letters. [2022-11-21 13:56:35,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:56:35,116 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-21 13:56:35,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:35,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 1521 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-21 13:56:35,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:36,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-21 13:56:36,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:37,293 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2022-11-21 13:56:37,293 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 13 loop predicates [2022-11-21 13:56:37,294 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3675 states and 6331 transitions. cyclomatic complexity: 2689 Second operand has 16 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 6 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) [2022-11-21 13:56:37,759 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3675 states and 6331 transitions. cyclomatic complexity: 2689. Second operand has 16 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 6 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) Result 4265 states and 7041 transitions. Complement of second has 63 states. [2022-11-21 13:56:37,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 2 stem states 13 non-accepting loop states 1 accepting loop states [2022-11-21 13:56:37,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 6 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) [2022-11-21 13:56:37,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 92 transitions. [2022-11-21 13:56:37,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 92 transitions. Stem has 229 letters. Loop has 92 letters. [2022-11-21 13:56:37,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:56:37,769 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-21 13:56:37,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:38,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 1521 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-21 13:56:38,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:39,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-21 13:56:39,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:40,079 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2022-11-21 13:56:40,080 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 13 loop predicates [2022-11-21 13:56:40,080 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3675 states and 6331 transitions. cyclomatic complexity: 2689 Second operand has 16 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 6 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) [2022-11-21 13:56:40,587 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3675 states and 6331 transitions. cyclomatic complexity: 2689. Second operand has 16 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 6 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) Result 7673 states and 11886 transitions. Complement of second has 87 states. [2022-11-21 13:56:40,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2022-11-21 13:56:40,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 6 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) [2022-11-21 13:56:40,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 110 transitions. [2022-11-21 13:56:40,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 110 transitions. Stem has 229 letters. Loop has 92 letters. [2022-11-21 13:56:40,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:56:40,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 110 transitions. Stem has 321 letters. Loop has 92 letters. [2022-11-21 13:56:40,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:56:40,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 110 transitions. Stem has 229 letters. Loop has 184 letters. [2022-11-21 13:56:40,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 13:56:40,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7673 states and 11886 transitions. [2022-11-21 13:56:40,652 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 36 [2022-11-21 13:56:40,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7673 states to 5648 states and 9001 transitions. [2022-11-21 13:56:40,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 479 [2022-11-21 13:56:40,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 483 [2022-11-21 13:56:40,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5648 states and 9001 transitions. [2022-11-21 13:56:40,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:56:40,706 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5648 states and 9001 transitions. [2022-11-21 13:56:40,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5648 states and 9001 transitions. [2022-11-21 13:56:40,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5648 to 4834. [2022-11-21 13:56:40,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4834 states, 3007 states have (on average 1.0741602926504823) internal successors, (3230), 2986 states have internal predecessors, (3230), 978 states have call successors, (1032), 580 states have call predecessors, (1032), 849 states have return successors, (3831), 1267 states have call predecessors, (3831), 978 states have call successors, (3831) [2022-11-21 13:56:40,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4834 states to 4834 states and 8093 transitions. [2022-11-21 13:56:40,883 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4834 states and 8093 transitions. [2022-11-21 13:56:40,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:56:40,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-21 13:56:40,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-11-21 13:56:40,884 INFO L87 Difference]: Start difference. First operand 4834 states and 8093 transitions. Second operand has 19 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 19 states have internal predecessors, (73), 12 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 12 states have call predecessors, (38), 12 states have call successors, (38) [2022-11-21 13:56:42,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:56:42,617 INFO L93 Difference]: Finished difference Result 10040 states and 24251 transitions. [2022-11-21 13:56:42,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10040 states and 24251 transitions. [2022-11-21 13:56:42,724 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2022-11-21 13:56:42,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10040 states to 8886 states and 20947 transitions. [2022-11-21 13:56:42,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 793 [2022-11-21 13:56:42,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 793 [2022-11-21 13:56:42,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8886 states and 20947 transitions. [2022-11-21 13:56:42,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:56:42,891 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8886 states and 20947 transitions. [2022-11-21 13:56:42,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8886 states and 20947 transitions. [2022-11-21 13:56:43,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8886 to 5303. [2022-11-21 13:56:43,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5303 states, 3236 states have (on average 1.072929542645241) internal successors, (3472), 3225 states have internal predecessors, (3472), 1218 states have call successors, (1292), 580 states have call predecessors, (1292), 849 states have return successors, (4788), 1497 states have call predecessors, (4788), 1218 states have call successors, (4788) [2022-11-21 13:56:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5303 states to 5303 states and 9552 transitions. [2022-11-21 13:56:43,237 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5303 states and 9552 transitions. [2022-11-21 13:56:43,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-21 13:56:43,238 INFO L428 stractBuchiCegarLoop]: Abstraction has 5303 states and 9552 transitions. [2022-11-21 13:56:43,239 INFO L335 stractBuchiCegarLoop]: ======== Iteration 33 ============ [2022-11-21 13:56:43,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5303 states and 9552 transitions. [2022-11-21 13:56:43,258 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 62 [2022-11-21 13:56:43,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:56:43,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:56:43,261 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [41, 41, 21, 20, 20, 20, 20, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 13:56:43,261 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [23, 23, 20, 20, 20, 20, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:56:43,262 INFO L748 eck$LassoCheckResult]: Stem: 164630#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 164599#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; 164600#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 164629#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; 164617#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 164618#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 164960#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 164955#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 164956#factENTRY ~n := #in~n; 164962#L25 assume ~n <= 0;#res := 1; 164961#factFINAL assume true; 164954#factEXIT >#68#return; 164948#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 164949#factENTRY ~n := #in~n; 164959#L25 assume ~n <= 0;#res := 1; 164953#factFINAL assume true; 164947#factEXIT >#70#return; 164945#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 164946#factENTRY ~n := #in~n; 164967#L25 assume ~n <= 0;#res := 1; 164964#factFINAL assume true; 164944#factEXIT >#72#return; 164942#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 164941#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 164940#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 164936#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 164932#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 164921#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 164922#factENTRY ~n := #in~n; 164938#L25 assume !(~n <= 0); 164930#L26 call #t~ret0 := fact(~n - 1);< 164931#factENTRY ~n := #in~n; 164939#L25 assume ~n <= 0;#res := 1; 164935#factFINAL assume true; 164929#factEXIT >#66#return; 164928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 164927#factFINAL assume true; 164920#factEXIT >#74#return; 164916#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 164917#factENTRY ~n := #in~n; 164926#L25 assume ~n <= 0;#res := 1; 164919#factFINAL assume true; 164915#factEXIT >#76#return; 164912#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 164913#factENTRY ~n := #in~n; 164934#L25 assume !(~n <= 0); 164924#L26 call #t~ret0 := fact(~n - 1);< 164925#factENTRY ~n := #in~n; 164937#L25 assume ~n <= 0;#res := 1; 164933#factFINAL assume true; 164923#factEXIT >#66#return; 164918#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 164914#factFINAL assume true; 164911#factEXIT >#78#return; 164908#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 164910#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 165049#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 165048#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 164982#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 164983#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 165078#factENTRY ~n := #in~n; 165174#L25 assume !(~n <= 0); 165101#L26 call #t~ret0 := fact(~n - 1);< 165106#factENTRY ~n := #in~n; 165205#L25 assume !(~n <= 0); 165102#L26 call #t~ret0 := fact(~n - 1);< 165203#factENTRY ~n := #in~n; 165208#L25 assume ~n <= 0;#res := 1; 165207#factFINAL assume true; 165206#factEXIT >#66#return; 165204#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165202#factFINAL assume true; 165200#factEXIT >#66#return; 165199#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165197#factFINAL assume true; 165196#factEXIT >#74#return; 165180#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 165185#factENTRY ~n := #in~n; 165254#L25 assume ~n <= 0;#res := 1; 165250#factFINAL assume true; 165244#factEXIT >#76#return; 165007#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 165008#factENTRY ~n := #in~n; 165262#L25 assume !(~n <= 0); 165018#L26 call #t~ret0 := fact(~n - 1);< 165021#factENTRY ~n := #in~n; 165178#L25 assume !(~n <= 0); 165017#L26 call #t~ret0 := fact(~n - 1);< 165177#factENTRY ~n := #in~n; 165239#L25 assume ~n <= 0;#res := 1; 165238#factFINAL assume true; 165237#factEXIT >#66#return; 165232#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165176#factFINAL assume true; 165015#factEXIT >#66#return; 165013#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165014#factFINAL assume true; 165006#factEXIT >#78#return; 165005#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 165004#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 164999#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 164998#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 164993#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 164860#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 164873#factENTRY ~n := #in~n; 164906#L25 assume !(~n <= 0); 164900#L26 call #t~ret0 := fact(~n - 1);< 164904#factENTRY ~n := #in~n; 164958#L25 assume !(~n <= 0); 164901#L26 call #t~ret0 := fact(~n - 1);< 164952#factENTRY ~n := #in~n; 164958#L25 assume !(~n <= 0); 164901#L26 call #t~ret0 := fact(~n - 1);< 164952#factENTRY ~n := #in~n; 164958#L25 assume !(~n <= 0); 164901#L26 call #t~ret0 := fact(~n - 1);< 164952#factENTRY ~n := #in~n; 164958#L25 assume !(~n <= 0); 164901#L26 call #t~ret0 := fact(~n - 1);< 164952#factENTRY ~n := #in~n; 164958#L25 assume !(~n <= 0); 164901#L26 call #t~ret0 := fact(~n - 1);< 164952#factENTRY ~n := #in~n; 164958#L25 assume !(~n <= 0); 164901#L26 call #t~ret0 := fact(~n - 1);< 164952#factENTRY ~n := #in~n; 164981#L25 assume ~n <= 0;#res := 1; 164980#factFINAL assume true; 164979#factEXIT >#66#return; 164978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 164977#factFINAL assume true; 164976#factEXIT >#66#return; 164975#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 164974#factFINAL assume true; 164973#factEXIT >#66#return; 164972#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 164971#factFINAL assume true; 164970#factEXIT >#66#return; 164969#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 164968#factFINAL assume true; 164966#factEXIT >#66#return; 164963#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 164957#factFINAL assume true; 164950#factEXIT >#66#return; 164903#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 164943#factFINAL assume true; 164898#factEXIT >#66#return; 164890#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 164886#factFINAL assume true; 164884#factEXIT >#74#return; 164875#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 164877#factENTRY ~n := #in~n; 164907#L25 assume ~n <= 0;#res := 1; 164878#factFINAL assume true; 164874#factEXIT >#76#return; 164861#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 164887#factENTRY ~n := #in~n; 164905#L25 assume !(~n <= 0); 164900#L26 call #t~ret0 := fact(~n - 1);< 164904#factENTRY ~n := #in~n; 164958#L25 assume !(~n <= 0); 164901#L26 call #t~ret0 := fact(~n - 1);< 164952#factENTRY ~n := #in~n; 164981#L25 assume ~n <= 0;#res := 1; 164980#factFINAL assume true; 164979#factEXIT >#66#return; 164978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 164977#factFINAL assume true; 164976#factEXIT >#66#return; 164951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 164990#factFINAL assume true; 164858#factEXIT >#78#return; 164853#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 164849#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 164839#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 164838#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 164837#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 164834#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 164833#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 164832#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 164814#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 164815#factENTRY ~n := #in~n; 164825#L25 assume ~n <= 0;#res := 1; 164826#factFINAL assume true; 165136#factEXIT >#68#return; 165131#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 165133#factENTRY ~n := #in~n; 165135#L25 assume ~n <= 0;#res := 1; 165134#factFINAL assume true; 165130#factEXIT >#70#return; 165119#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 165123#factENTRY ~n := #in~n; 165127#L25 assume !(~n <= 0); 164739#L26 call #t~ret0 := fact(~n - 1);< 164776#factENTRY ~n := #in~n; 164778#L25 assume ~n <= 0;#res := 1; 164774#factFINAL assume true; 164737#factEXIT >#66#return; 164762#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165125#factFINAL assume true; 165118#factEXIT >#72#return; 165117#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 165039#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 164797#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 164782#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 164780#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 164733#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 164734#factENTRY ~n := #in~n; 164777#L25 assume !(~n <= 0); 164747#L26 call #t~ret0 := fact(~n - 1);< 164773#factENTRY ~n := #in~n; 164778#L25 assume ~n <= 0;#res := 1; 164774#factFINAL assume true; 164737#factEXIT >#66#return; 164736#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 164735#factFINAL assume true; 164732#factEXIT >#68#return; 164724#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 164728#factENTRY ~n := #in~n; 165520#L25 assume !(~n <= 0); 164751#L26 call #t~ret0 := fact(~n - 1);< 164776#factENTRY ~n := #in~n; 164778#L25 assume ~n <= 0;#res := 1; 164774#factFINAL assume true; 164737#factEXIT >#66#return; 164769#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165519#factFINAL assume true; 165517#factEXIT >#70#return; 165299#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 165513#factENTRY ~n := #in~n; 165515#L25 assume ~n <= 0;#res := 1; 165514#factFINAL assume true; 165512#factEXIT >#72#return; 165501#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 165494#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 165493#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 165490#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 165488#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 165480#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 165482#factENTRY ~n := #in~n; 165486#L25 assume !(~n <= 0); 164744#L26 call #t~ret0 := fact(~n - 1);< 164776#factENTRY ~n := #in~n; 164778#L25 assume ~n <= 0;#res := 1; 164774#factFINAL assume true; 164737#factEXIT >#66#return; 164766#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165483#factFINAL assume true; 165468#factEXIT >#74#return; 165463#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 165464#factENTRY ~n := #in~n; 165467#L25 assume ~n <= 0;#res := 1; 165466#factFINAL assume true; 165462#factEXIT >#76#return; 165347#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 165351#factENTRY ~n := #in~n; 165349#L25 assume !(~n <= 0); 164690#L26 call #t~ret0 := fact(~n - 1);< 164698#factENTRY ~n := #in~n; 164720#L25 assume ~n <= 0;#res := 1; 164717#factFINAL assume true; 164702#factEXIT >#66#return; 164713#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165740#factFINAL assume true; 165739#factEXIT >#78#return; 165384#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 164602#L30-9 [2022-11-21 13:56:43,262 INFO L750 eck$LassoCheckResult]: Loop: 164602#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 164615#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 164659#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 164657#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 164568#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 164569#factENTRY ~n := #in~n; 165774#L25 assume !(~n <= 0); 165752#L26 call #t~ret0 := fact(~n - 1);< 165760#factENTRY ~n := #in~n; 165766#L25 assume !(~n <= 0); 165755#L26 call #t~ret0 := fact(~n - 1);< 165765#factENTRY ~n := #in~n; 165766#L25 assume !(~n <= 0); 165755#L26 call #t~ret0 := fact(~n - 1);< 165765#factENTRY ~n := #in~n; 165766#L25 assume !(~n <= 0); 165755#L26 call #t~ret0 := fact(~n - 1);< 165765#factENTRY ~n := #in~n; 165766#L25 assume !(~n <= 0); 165755#L26 call #t~ret0 := fact(~n - 1);< 165765#factENTRY ~n := #in~n; 165766#L25 assume !(~n <= 0); 165755#L26 call #t~ret0 := fact(~n - 1);< 165765#factENTRY ~n := #in~n; 165766#L25 assume !(~n <= 0); 165755#L26 call #t~ret0 := fact(~n - 1);< 165765#factENTRY ~n := #in~n; 165767#L25 assume ~n <= 0;#res := 1; 165828#factFINAL assume true; 165827#factEXIT >#66#return; 165826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165823#factFINAL assume true; 165814#factEXIT >#66#return; 165809#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165803#factFINAL assume true; 165798#factEXIT >#66#return; 165795#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165793#factFINAL assume true; 165788#factEXIT >#66#return; 165787#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165784#factFINAL assume true; 165779#factEXIT >#66#return; 165778#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165777#factFINAL assume true; 165775#factEXIT >#66#return; 165769#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165770#factFINAL assume true; 165750#factEXIT >#66#return; 165748#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165749#factFINAL assume true; 165741#factEXIT >#74#return; 164649#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 164569#factENTRY ~n := #in~n; 165774#L25 assume !(~n <= 0); 165752#L26 call #t~ret0 := fact(~n - 1);< 165760#factENTRY ~n := #in~n; 165766#L25 assume !(~n <= 0); 165755#L26 call #t~ret0 := fact(~n - 1);< 165765#factENTRY ~n := #in~n; 165766#L25 assume !(~n <= 0); 165755#L26 call #t~ret0 := fact(~n - 1);< 165765#factENTRY ~n := #in~n; 165766#L25 assume !(~n <= 0); 165755#L26 call #t~ret0 := fact(~n - 1);< 165765#factENTRY ~n := #in~n; 165766#L25 assume !(~n <= 0); 165755#L26 call #t~ret0 := fact(~n - 1);< 165765#factENTRY ~n := #in~n; 165766#L25 assume !(~n <= 0); 165755#L26 call #t~ret0 := fact(~n - 1);< 165765#factENTRY ~n := #in~n; 165766#L25 assume !(~n <= 0); 165755#L26 call #t~ret0 := fact(~n - 1);< 165765#factENTRY ~n := #in~n; 165766#L25 assume !(~n <= 0); 165755#L26 call #t~ret0 := fact(~n - 1);< 165765#factENTRY ~n := #in~n; 165767#L25 assume ~n <= 0;#res := 1; 165828#factFINAL assume true; 165827#factEXIT >#66#return; 165826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165823#factFINAL assume true; 165814#factEXIT >#66#return; 165809#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165803#factFINAL assume true; 165798#factEXIT >#66#return; 165795#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165793#factFINAL assume true; 165788#factEXIT >#66#return; 165787#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165784#factFINAL assume true; 165779#factEXIT >#66#return; 165778#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165777#factFINAL assume true; 165775#factEXIT >#66#return; 165769#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165770#factFINAL assume true; 165750#factEXIT >#66#return; 165759#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165762#factFINAL assume true; 165763#factEXIT >#66#return; 166107#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165745#factFINAL assume true; 165746#factEXIT >#76#return; 165744#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 165915#factENTRY ~n := #in~n; 165830#L25 assume !(~n <= 0); 165781#L26 call #t~ret0 := fact(~n - 1);< 165786#factENTRY ~n := #in~n; 165794#L25 assume !(~n <= 0); 165789#L26 call #t~ret0 := fact(~n - 1);< 165792#factENTRY ~n := #in~n; 165806#L25 assume !(~n <= 0); 165799#L26 call #t~ret0 := fact(~n - 1);< 165802#factENTRY ~n := #in~n; 165825#L25 assume !(~n <= 0); 164607#L26 call #t~ret0 := fact(~n - 1);< 165819#factENTRY ~n := #in~n; 164644#L25 assume !(~n <= 0); 164605#L26 call #t~ret0 := fact(~n - 1);< 164609#factENTRY ~n := #in~n; 165767#L25 assume ~n <= 0;#res := 1; 165828#factFINAL assume true; 165827#factEXIT >#66#return; 165826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165823#factFINAL assume true; 165814#factEXIT >#66#return; 165809#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165803#factFINAL assume true; 165798#factEXIT >#66#return; 165795#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165793#factFINAL assume true; 165788#factEXIT >#66#return; 165787#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165784#factFINAL assume true; 165779#factEXIT >#66#return; 165783#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 165913#factFINAL assume true; 165914#factEXIT >#78#return; 164601#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 164602#L30-9 [2022-11-21 13:56:43,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:43,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1148404516, now seen corresponding path program 19 times [2022-11-21 13:56:43,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:56:43,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077902723] [2022-11-21 13:56:43,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:56:43,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:56:43,279 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:56:43,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [879409101] [2022-11-21 13:56:43,279 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-21 13:56:43,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:56:43,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:56:43,283 INFO L229 MonitoredProcess]: Starting monitored process 204 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:56:43,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (204)] Waiting until timeout for monitored process [2022-11-21 13:56:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:43,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-21 13:56:43,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:43,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3767 backedges. 2193 proven. 53 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2022-11-21 13:56:43,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:56:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3767 backedges. 355 proven. 334 refuted. 0 times theorem prover too weak. 3078 trivial. 0 not checked. [2022-11-21 13:56:44,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:56:44,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077902723] [2022-11-21 13:56:44,366 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:56:44,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879409101] [2022-11-21 13:56:44,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879409101] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:56:44,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:56:44,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 16 [2022-11-21 13:56:44,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445524286] [2022-11-21 13:56:44,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:56:44,367 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 13:56:44,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:44,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1584993566, now seen corresponding path program 9 times [2022-11-21 13:56:44,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:56:44,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620288860] [2022-11-21 13:56:44,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:56:44,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:56:44,375 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:56:44,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1562016098] [2022-11-21 13:56:44,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 13:56:44,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:56:44,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:56:44,380 INFO L229 MonitoredProcess]: Starting monitored process 205 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:56:44,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (205)] Waiting until timeout for monitored process [2022-11-21 13:56:44,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2022-11-21 13:56:44,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:56:44,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-21 13:56:44,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 185 proven. 753 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2022-11-21 13:56:44,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:56:50,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 185 proven. 926 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2022-11-21 13:56:50,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:56:50,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620288860] [2022-11-21 13:56:50,276 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:56:50,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562016098] [2022-11-21 13:56:50,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562016098] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:56:50,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:56:50,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 36] total 41 [2022-11-21 13:56:50,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554939795] [2022-11-21 13:56:50,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:56:50,277 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 13:56:50,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:56:50,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-21 13:56:50,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1404, Unknown=0, NotChecked=0, Total=1640 [2022-11-21 13:56:50,279 INFO L87 Difference]: Start difference. First operand 5303 states and 9552 transitions. cyclomatic complexity: 4292 Second operand has 41 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 22 states have call successors, (22), 1 states have call predecessors, (22), 18 states have return successors, (35), 21 states have call predecessors, (35), 22 states have call successors, (35) [2022-11-21 13:56:53,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:56:53,980 INFO L93 Difference]: Finished difference Result 10438 states and 18398 transitions. [2022-11-21 13:56:53,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10438 states and 18398 transitions. [2022-11-21 13:56:54,114 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 214 [2022-11-21 13:56:54,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10438 states to 10240 states and 17984 transitions. [2022-11-21 13:56:54,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 990 [2022-11-21 13:56:54,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1008 [2022-11-21 13:56:54,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10240 states and 17984 transitions. [2022-11-21 13:56:54,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 13:56:54,243 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10240 states and 17984 transitions. [2022-11-21 13:56:54,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10240 states and 17984 transitions. [2022-11-21 13:56:54,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10240 to 5703. [2022-11-21 13:56:54,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5703 states, 3454 states have (on average 1.070063694267516) internal successors, (3696), 3425 states have internal predecessors, (3696), 1330 states have call successors, (1404), 628 states have call predecessors, (1404), 919 states have return successors, (5549), 1649 states have call predecessors, (5549), 1330 states have call successors, (5549) [2022-11-21 13:56:54,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5703 states to 5703 states and 10649 transitions. [2022-11-21 13:56:54,587 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5703 states and 10649 transitions. [2022-11-21 13:56:54,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-21 13:56:54,588 INFO L428 stractBuchiCegarLoop]: Abstraction has 5703 states and 10649 transitions. [2022-11-21 13:56:54,588 INFO L335 stractBuchiCegarLoop]: ======== Iteration 34 ============ [2022-11-21 13:56:54,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5703 states and 10649 transitions. [2022-11-21 13:56:54,612 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 67 [2022-11-21 13:56:54,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 13:56:54,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 13:56:54,614 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [36, 36, 21, 15, 15, 15, 15, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 13:56:54,614 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 18, 15, 15, 15, 15, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:56:54,615 INFO L748 eck$LassoCheckResult]: Stem: 182905#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 182875#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; 182876#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 182904#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; 182893#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 182894#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 184007#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 184003#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 184004#factENTRY ~n := #in~n; 184008#L25 assume ~n <= 0;#res := 1; 184006#factFINAL assume true; 184002#factEXIT >#68#return; 183998#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 183999#factENTRY ~n := #in~n; 184005#L25 assume ~n <= 0;#res := 1; 184001#factFINAL assume true; 183997#factEXIT >#70#return; 183994#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 183995#factENTRY ~n := #in~n; 184000#L25 assume ~n <= 0;#res := 1; 183996#factFINAL assume true; 183993#factEXIT >#72#return; 183992#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 183989#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 183985#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 183984#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 183983#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 183971#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 183972#factENTRY ~n := #in~n; 183982#L25 assume !(~n <= 0); 183980#L26 call #t~ret0 := fact(~n - 1);< 183981#factENTRY ~n := #in~n; 183991#L25 assume ~n <= 0;#res := 1; 183988#factFINAL assume true; 183979#factEXIT >#66#return; 183978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 183977#factFINAL assume true; 183970#factEXIT >#74#return; 183966#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 183967#factENTRY ~n := #in~n; 183976#L25 assume ~n <= 0;#res := 1; 183969#factFINAL assume true; 183965#factEXIT >#76#return; 183962#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 183963#factENTRY ~n := #in~n; 183987#L25 assume !(~n <= 0); 183974#L26 call #t~ret0 := fact(~n - 1);< 183975#factENTRY ~n := #in~n; 183990#L25 assume ~n <= 0;#res := 1; 183986#factFINAL assume true; 183973#factEXIT >#66#return; 183968#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 183964#factFINAL assume true; 183961#factEXIT >#78#return; 183958#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 183959#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 184016#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 184017#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 184012#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 183951#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 184135#factENTRY ~n := #in~n; 184170#L25 assume !(~n <= 0); 184163#L26 call #t~ret0 := fact(~n - 1);< 184166#factENTRY ~n := #in~n; 184178#L25 assume !(~n <= 0); 184161#L26 call #t~ret0 := fact(~n - 1);< 184174#factENTRY ~n := #in~n; 184177#L25 assume ~n <= 0;#res := 1; 184176#factFINAL assume true; 184173#factEXIT >#66#return; 184172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 184168#factFINAL assume true; 184160#factEXIT >#66#return; 184154#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 184152#factFINAL assume true; 184150#factEXIT >#74#return; 184126#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 184145#factENTRY ~n := #in~n; 184171#L25 assume ~n <= 0;#res := 1; 184129#factFINAL assume true; 184125#factEXIT >#76#return; 184123#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 184124#factENTRY ~n := #in~n; 184175#L25 assume !(~n <= 0); 184162#L26 call #t~ret0 := fact(~n - 1);< 184166#factENTRY ~n := #in~n; 184178#L25 assume !(~n <= 0); 184161#L26 call #t~ret0 := fact(~n - 1);< 184174#factENTRY ~n := #in~n; 184177#L25 assume ~n <= 0;#res := 1; 184176#factFINAL assume true; 184173#factEXIT >#66#return; 184172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 184168#factFINAL assume true; 184160#factEXIT >#66#return; 184165#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 184687#factFINAL assume true; 184122#factEXIT >#78#return; 184119#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 184117#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 184113#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 184095#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 183950#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 183952#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 184059#factENTRY ~n := #in~n; 184060#L25 assume !(~n <= 0); 184056#L26 call #t~ret0 := fact(~n - 1);< 184057#factENTRY ~n := #in~n; 184078#L25 assume !(~n <= 0); 184072#L26 call #t~ret0 := fact(~n - 1);< 184076#factENTRY ~n := #in~n; 184079#L25 assume ~n <= 0;#res := 1; 184077#factFINAL assume true; 184075#factEXIT >#66#return; 184074#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 184073#factFINAL assume true; 184071#factEXIT >#66#return; 184070#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 184069#factFINAL assume true; 184067#factEXIT >#74#return; 183935#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 183937#factENTRY ~n := #in~n; 184011#L25 assume ~n <= 0;#res := 1; 183933#factFINAL assume true; 183936#factEXIT >#76#return; 183921#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 183924#factENTRY ~n := #in~n; 184030#L25 assume !(~n <= 0); 184022#L26 call #t~ret0 := fact(~n - 1);< 184026#factENTRY ~n := #in~n; 184029#L25 assume !(~n <= 0); 184023#L26 call #t~ret0 := fact(~n - 1);< 184033#factENTRY ~n := #in~n; 184050#L25 assume ~n <= 0;#res := 1; 184049#factFINAL assume true; 184048#factEXIT >#66#return; 184047#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 184046#factFINAL assume true; 184045#factEXIT >#66#return; 184024#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 184539#factFINAL assume true; 183920#factEXIT >#78#return; 183909#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 183907#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 183905#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 183903#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 183902#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 183899#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 183897#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 183775#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 183739#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 183742#factENTRY ~n := #in~n; 183748#L25 assume ~n <= 0;#res := 1; 183749#factFINAL assume true; 183773#factEXIT >#68#return; 183769#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 183771#factENTRY ~n := #in~n; 183774#L25 assume ~n <= 0;#res := 1; 183772#factFINAL assume true; 183768#factEXIT >#70#return; 183669#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 183670#factENTRY ~n := #in~n; 183689#L25 assume !(~n <= 0); 183619#L26 call #t~ret0 := fact(~n - 1);< 183640#factENTRY ~n := #in~n; 183641#L25 assume ~n <= 0;#res := 1; 183639#factFINAL assume true; 183600#factEXIT >#66#return; 183636#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 183672#factFINAL assume true; 183674#factEXIT >#72#return; 183703#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 183658#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 183659#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 183654#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 183655#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 183590#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 183591#factENTRY ~n := #in~n; 183793#L25 assume !(~n <= 0); 183612#L26 call #t~ret0 := fact(~n - 1);< 183638#factENTRY ~n := #in~n; 183641#L25 assume ~n <= 0;#res := 1; 183639#factFINAL assume true; 183600#factEXIT >#66#return; 183598#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 183599#factFINAL assume true; 183589#factEXIT >#68#return; 182869#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 183586#factENTRY ~n := #in~n; 184566#L25 assume !(~n <= 0); 183617#L26 call #t~ret0 := fact(~n - 1);< 183640#factENTRY ~n := #in~n; 183641#L25 assume ~n <= 0;#res := 1; 183639#factFINAL assume true; 183600#factEXIT >#66#return; 183635#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 184665#factFINAL assume true; 183891#factEXIT >#70#return; 183644#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 183886#factENTRY ~n := #in~n; 183888#L25 assume ~n <= 0;#res := 1; 183887#factFINAL assume true; 183885#factEXIT >#72#return; 183884#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 183883#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 183882#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 183881#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 183879#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 183872#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 183878#factENTRY ~n := #in~n; 184568#L25 assume !(~n <= 0); 183620#L26 call #t~ret0 := fact(~n - 1);< 183640#factENTRY ~n := #in~n; 183641#L25 assume ~n <= 0;#res := 1; 183639#factFINAL assume true; 183600#factEXIT >#66#return; 183626#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 183863#factFINAL assume true; 183877#factEXIT >#74#return; 184347#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 184349#factENTRY ~n := #in~n; 184352#L25 assume ~n <= 0;#res := 1; 184350#factFINAL assume true; 184346#factEXIT >#76#return; 183913#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 184344#factENTRY ~n := #in~n; 184351#L25 assume !(~n <= 0); 183822#L26 call #t~ret0 := fact(~n - 1);< 183836#factENTRY ~n := #in~n; 183837#L25 assume ~n <= 0;#res := 1; 183835#factFINAL assume true; 183811#factEXIT >#66#return; 183833#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 183918#factFINAL assume true; 183912#factEXIT >#78#return; 183910#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 182878#L30-9 [2022-11-21 13:56:54,615 INFO L750 eck$LassoCheckResult]: Loop: 182878#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 182891#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 183898#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 182949#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 182844#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 182845#factENTRY ~n := #in~n; 183154#L25 assume !(~n <= 0); 182961#L26 call #t~ret0 := fact(~n - 1);< 182970#factENTRY ~n := #in~n; 182976#L25 assume !(~n <= 0); 182962#L26 call #t~ret0 := fact(~n - 1);< 182973#factENTRY ~n := #in~n; 182976#L25 assume !(~n <= 0); 182962#L26 call #t~ret0 := fact(~n - 1);< 182973#factENTRY ~n := #in~n; 182976#L25 assume !(~n <= 0); 182962#L26 call #t~ret0 := fact(~n - 1);< 182973#factENTRY ~n := #in~n; 182976#L25 assume !(~n <= 0); 182962#L26 call #t~ret0 := fact(~n - 1);< 182973#factENTRY ~n := #in~n; 182976#L25 assume !(~n <= 0); 182962#L26 call #t~ret0 := fact(~n - 1);< 182973#factENTRY ~n := #in~n; 182976#L25 assume !(~n <= 0); 182962#L26 call #t~ret0 := fact(~n - 1);< 182973#factENTRY ~n := #in~n; 182980#L25 assume ~n <= 0;#res := 1; 183148#factFINAL assume true; 183145#factEXIT >#66#return; 183143#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 183139#factFINAL assume true; 183049#factEXIT >#66#return; 183030#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 183025#factFINAL assume true; 183018#factEXIT >#66#return; 183009#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 183001#factFINAL assume true; 182992#factEXIT >#66#return; 182990#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 182987#factFINAL assume true; 182984#factEXIT >#66#return; 182983#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 182981#factFINAL assume true; 182977#factEXIT >#66#return; 182975#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 182971#factFINAL assume true; 182960#factEXIT >#66#return; 182959#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 182958#factFINAL assume true; 182957#factEXIT >#74#return; 182934#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 182845#factENTRY ~n := #in~n; 183154#L25 assume ~n <= 0;#res := 1; 183152#factFINAL assume true; 182955#factEXIT >#76#return; 182935#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 182952#factENTRY ~n := #in~n; 182974#L25 assume !(~n <= 0); 182961#L26 call #t~ret0 := fact(~n - 1);< 182970#factENTRY ~n := #in~n; 182976#L25 assume !(~n <= 0); 182962#L26 call #t~ret0 := fact(~n - 1);< 182973#factENTRY ~n := #in~n; 182976#L25 assume !(~n <= 0); 182962#L26 call #t~ret0 := fact(~n - 1);< 182973#factENTRY ~n := #in~n; 182976#L25 assume !(~n <= 0); 182962#L26 call #t~ret0 := fact(~n - 1);< 182973#factENTRY ~n := #in~n; 182976#L25 assume !(~n <= 0); 182962#L26 call #t~ret0 := fact(~n - 1);< 182973#factENTRY ~n := #in~n; 182976#L25 assume !(~n <= 0); 182962#L26 call #t~ret0 := fact(~n - 1);< 182973#factENTRY ~n := #in~n; 182976#L25 assume !(~n <= 0); 182962#L26 call #t~ret0 := fact(~n - 1);< 182973#factENTRY ~n := #in~n; 182976#L25 assume !(~n <= 0); 182962#L26 call #t~ret0 := fact(~n - 1);< 182973#factENTRY ~n := #in~n; 182980#L25 assume ~n <= 0;#res := 1; 183148#factFINAL assume true; 183145#factEXIT >#66#return; 183143#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 183139#factFINAL assume true; 183049#factEXIT >#66#return; 183030#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 183025#factFINAL assume true; 183018#factEXIT >#66#return; 183009#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 183001#factFINAL assume true; 182992#factEXIT >#66#return; 182990#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 182987#factFINAL assume true; 182984#factEXIT >#66#return; 182983#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 182981#factFINAL assume true; 182977#factEXIT >#66#return; 182975#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 182971#factFINAL assume true; 182960#factEXIT >#66#return; 182968#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 183305#factFINAL assume true; 183164#factEXIT >#66#return; 183165#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 182950#factFINAL assume true; 182951#factEXIT >#78#return; 182877#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 182878#L30-9 [2022-11-21 13:56:54,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:54,619 INFO L85 PathProgramCache]: Analyzing trace with hash 351154460, now seen corresponding path program 20 times [2022-11-21 13:56:54,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:56:54,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576263112] [2022-11-21 13:56:54,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:56:54,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:56:54,634 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:56:54,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [836358642] [2022-11-21 13:56:54,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:56:54,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:56:54,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:56:54,642 INFO L229 MonitoredProcess]: Starting monitored process 206 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:56:54,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (206)] Waiting until timeout for monitored process [2022-11-21 13:56:54,985 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:56:54,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:56:54,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-21 13:56:54,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2837 backedges. 1652 proven. 9 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2022-11-21 13:56:55,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:56:55,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2837 backedges. 244 proven. 203 refuted. 0 times theorem prover too weak. 2390 trivial. 0 not checked. [2022-11-21 13:56:55,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:56:55,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576263112] [2022-11-21 13:56:55,558 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:56:55,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836358642] [2022-11-21 13:56:55,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836358642] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:56:55,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:56:55,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 14 [2022-11-21 13:56:55,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176608442] [2022-11-21 13:56:55,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:56:55,560 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 13:56:55,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:55,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1336007974, now seen corresponding path program 10 times [2022-11-21 13:56:55,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:56:55,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531325523] [2022-11-21 13:56:55,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:56:55,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:56:55,567 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:56:55,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1363898290] [2022-11-21 13:56:55,567 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 13:56:55,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:56:55,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:56:55,571 INFO L229 MonitoredProcess]: Starting monitored process 207 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:56:55,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (207)] Waiting until timeout for monitored process [2022-11-21 13:56:55,877 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 13:56:55,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-21 13:56:55,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:56:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:56:55,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:57:33,943 WARN L233 SmtUtils]: Spent 36.11s on a formula simplification. DAG size of input: 107 DAG size of output: 104 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-21 13:57:59,959 WARN L233 SmtUtils]: Spent 24.03s on a formula simplification that was a NOOP. DAG size: 96 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 13:58:13,056 WARN L233 SmtUtils]: Spent 12.21s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 13:58:35,074 WARN L233 SmtUtils]: Spent 13.55s 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-21 13:58:47,312 WARN L233 SmtUtils]: Spent 12.24s 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-21 13:58:51,150 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 13:58:51,150 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 13:58:51,150 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 13:58:51,150 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 13:58:51,150 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-21 13:58:51,150 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:58:51,150 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 13:58:51,150 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 13:58:51,151 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration34_Loop [2022-11-21 13:58:51,151 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 13:58:51,151 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 13:58:51,153 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-21 13:58:51,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-21 13:58:51,157 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-21 13:58:51,159 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-21 13:58:51,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-21 13:58:51,163 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-21 13:59:06,379 WARN L233 SmtUtils]: Spent 15.21s on a formula simplification that was a NOOP. DAG size: 122 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.setFormulaAndSimplify) [2022-11-21 13:59:31,169 WARN L233 SmtUtils]: Spent 24.78s on a formula simplification. DAG size of input: 144 DAG size of output: 135 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2022-11-21 13:59:49,295 WARN L233 SmtUtils]: Spent 18.11s on a formula simplification that was a NOOP. DAG size: 253 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2022-11-21 13:59:49,297 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 13:59:49,297 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-21 13:59:49,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:59:49,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:49,301 INFO L229 MonitoredProcess]: Starting monitored process 208 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:59:49,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Waiting until timeout for monitored process [2022-11-21 13:59:49,303 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:59:49,304 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:59:49,316 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-21 13:59:49,316 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-21 13:59:49,320 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Forceful destruction successful, exit code 0 [2022-11-21 13:59:49,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:59:49,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:49,322 INFO L229 MonitoredProcess]: Starting monitored process 209 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:59:49,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Waiting until timeout for monitored process [2022-11-21 13:59:49,325 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:59:49,325 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:59:49,337 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-21 13:59:49,337 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-21 13:59:49,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Ended with exit code 0 [2022-11-21 13:59:49,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:59:49,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:49,341 INFO L229 MonitoredProcess]: Starting monitored process 210 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:59:49,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Waiting until timeout for monitored process [2022-11-21 13:59:49,344 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:59:49,344 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:59:49,357 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-21 13:59:49,357 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-21 13:59:49,360 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Ended with exit code 0 [2022-11-21 13:59:49,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:59:49,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:49,361 INFO L229 MonitoredProcess]: Starting monitored process 211 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:59:49,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Waiting until timeout for monitored process [2022-11-21 13:59:49,364 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:59:49,364 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:59:49,376 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-21 13:59:49,377 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-21 13:59:49,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Forceful destruction successful, exit code 0 [2022-11-21 13:59:49,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:59:49,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:49,381 INFO L229 MonitoredProcess]: Starting monitored process 212 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:59:49,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Waiting until timeout for monitored process [2022-11-21 13:59:49,384 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:59:49,384 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:59:49,396 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-21 13:59:49,396 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-21 13:59:49,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Ended with exit code 0 [2022-11-21 13:59:49,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:59:49,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:49,401 INFO L229 MonitoredProcess]: Starting monitored process 213 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:59:49,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Waiting until timeout for monitored process [2022-11-21 13:59:49,403 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 13:59:49,404 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:59:49,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Forceful destruction successful, exit code 0 [2022-11-21 13:59:49,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:59:49,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:49,423 INFO L229 MonitoredProcess]: Starting monitored process 214 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 13:59:49,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Waiting until timeout for monitored process [2022-11-21 13:59:49,425 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-21 13:59:49,425 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 13:59:49,448 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-21 13:59:49,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Forceful destruction successful, exit code 0 [2022-11-21 13:59:49,455 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 13:59:49,455 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 13:59:49,455 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 13:59:49,455 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 13:59:49,455 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-21 13:59:49,455 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 13:59:49,455 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 13:59:49,455 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 13:59:49,455 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration34_Loop [2022-11-21 13:59:49,455 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 13:59:49,455 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 13:59:49,458 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-21 13:59:49,461 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-21 13:59:49,463 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-21 14:00:14,286 WARN L233 SmtUtils]: Spent 24.81s on a formula simplification that was a NOOP. DAG size: 122 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.setFormulaAndSimplify) [2022-11-21 14:00:14,286 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-21 14:00:14,288 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-21 14:00:14,290 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-21 14:00:21,053 WARN L233 SmtUtils]: Spent 6.75s on a formula simplification. DAG size of input: 144 DAG size of output: 135 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2022-11-21 14:01:08,692 WARN L233 SmtUtils]: Spent 47.63s on a formula simplification that was a NOOP. DAG size: 253 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2022-11-21 14:01:08,697 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 14:01:08,698 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-21 14:01:08,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 14:01:08,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:01:08,701 INFO L229 MonitoredProcess]: Starting monitored process 215 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 14:01:08,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Waiting until timeout for monitored process [2022-11-21 14:01:08,702 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 14:01:08,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 14:01:08,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 14:01:08,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 14:01:08,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 14:01:08,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 14:01:08,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 14:01:08,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 14:01:08,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 14:01:08,722 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Ended with exit code 0 [2022-11-21 14:01:08,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 14:01:08,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:01:08,728 INFO L229 MonitoredProcess]: Starting monitored process 216 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 14:01:08,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Waiting until timeout for monitored process [2022-11-21 14:01:08,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 14:01:08,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 14:01:08,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 14:01:08,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 14:01:08,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 14:01:08,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 14:01:08,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 14:01:08,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 14:01:08,743 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 14:01:08,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Forceful destruction successful, exit code 0 [2022-11-21 14:01:08,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 14:01:08,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:01:08,748 INFO L229 MonitoredProcess]: Starting monitored process 217 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 14:01:08,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Waiting until timeout for monitored process [2022-11-21 14:01:08,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-21 14:01:08,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 14:01:08,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 14:01:08,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 14:01:08,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 14:01:08,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 14:01:08,766 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 14:01:08,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 14:01:08,795 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-21 14:01:08,802 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-11-21 14:01:08,802 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-11-21 14:01:08,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 14:01:08,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:01:08,810 INFO L229 MonitoredProcess]: Starting monitored process 218 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 14:01:08,812 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-21 14:01:08,812 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-21 14:01:08,812 INFO L513 LassoAnalysis]: Proved termination. [2022-11-21 14:01:08,812 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~k~0#1) = 13*ULTIMATE.start_main_~x~0#1 - 14*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2022-11-21 14:01:08,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Waiting until timeout for monitored process [2022-11-21 14:01:08,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Forceful destruction successful, exit code 0 [2022-11-21 14:01:08,817 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-21 14:01:08,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:09,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-21 14:01:09,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:10,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-21 14:01:10,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:11,522 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2022-11-21 14:01:11,522 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 15 loop predicates [2022-11-21 14:01:11,523 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5703 states and 10649 transitions. cyclomatic complexity: 4989 Second operand has 18 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) [2022-11-21 14:01:12,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Forceful destruction successful, exit code 0 [2022-11-21 14:01:12,403 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5703 states and 10649 transitions. cyclomatic complexity: 4989. Second operand has 18 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) Result 6612 states and 11792 transitions. Complement of second has 73 states. [2022-11-21 14:01:12,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 2 stem states 14 non-accepting loop states 1 accepting loop states [2022-11-21 14:01:12,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) [2022-11-21 14:01:12,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 100 transitions. [2022-11-21 14:01:12,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 100 transitions. Stem has 236 letters. Loop has 110 letters. [2022-11-21 14:01:12,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 14:01:12,406 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-21 14:01:12,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:12,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-21 14:01:12,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:14,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-21 14:01:14,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:15,045 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2022-11-21 14:01:15,046 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 15 loop predicates [2022-11-21 14:01:15,046 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5703 states and 10649 transitions. cyclomatic complexity: 4989 Second operand has 18 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) [2022-11-21 14:01:15,695 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5703 states and 10649 transitions. cyclomatic complexity: 4989. Second operand has 18 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) Result 6617 states and 11811 transitions. Complement of second has 71 states. [2022-11-21 14:01:15,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 2 stem states 15 non-accepting loop states 1 accepting loop states [2022-11-21 14:01:15,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) [2022-11-21 14:01:15,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 99 transitions. [2022-11-21 14:01:15,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 99 transitions. Stem has 236 letters. Loop has 110 letters. [2022-11-21 14:01:15,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 14:01:15,697 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-21 14:01:15,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:15,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-21 14:01:15,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:17,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-21 14:01:17,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:18,237 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2022-11-21 14:01:18,238 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 15 loop predicates [2022-11-21 14:01:18,238 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5703 states and 10649 transitions. cyclomatic complexity: 4989 Second operand has 18 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) [2022-11-21 14:01:19,004 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5703 states and 10649 transitions. cyclomatic complexity: 4989. Second operand has 18 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) Result 13259 states and 21765 transitions. Complement of second has 97 states. [2022-11-21 14:01:19,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 2 stem states 14 non-accepting loop states 1 accepting loop states [2022-11-21 14:01:19,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) [2022-11-21 14:01:19,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 120 transitions. [2022-11-21 14:01:19,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 120 transitions. Stem has 236 letters. Loop has 110 letters. [2022-11-21 14:01:19,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 14:01:19,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 120 transitions. Stem has 346 letters. Loop has 110 letters. [2022-11-21 14:01:19,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 14:01:19,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 120 transitions. Stem has 236 letters. Loop has 220 letters. [2022-11-21 14:01:19,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 14:01:19,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13259 states and 21765 transitions. [2022-11-21 14:01:19,124 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 66 [2022-11-21 14:01:19,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13259 states to 9393 states and 16002 transitions. [2022-11-21 14:01:19,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 614 [2022-11-21 14:01:19,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 619 [2022-11-21 14:01:19,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9393 states and 16002 transitions. [2022-11-21 14:01:19,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 14:01:19,230 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9393 states and 16002 transitions. [2022-11-21 14:01:19,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9393 states and 16002 transitions. [2022-11-21 14:01:19,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9393 to 7316. [2022-11-21 14:01:19,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7316 states, 4461 states have (on average 1.0717327953373683) internal successors, (4781), 4425 states have internal predecessors, (4781), 1642 states have call successors, (1776), 839 states have call predecessors, (1776), 1213 states have return successors, (6811), 2051 states have call predecessors, (6811), 1642 states have call successors, (6811) [2022-11-21 14:01:19,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7316 states to 7316 states and 13368 transitions. [2022-11-21 14:01:19,593 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7316 states and 13368 transitions. [2022-11-21 14:01:19,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:19,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-21 14:01:19,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-11-21 14:01:19,594 INFO L87 Difference]: Start difference. First operand 7316 states and 13368 transitions. Second operand has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 9 states have call successors, (27), 2 states have call predecessors, (27), 5 states have return successors, (28), 7 states have call predecessors, (28), 9 states have call successors, (28) [2022-11-21 14:01:20,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:20,186 INFO L93 Difference]: Finished difference Result 7996 states and 15877 transitions. [2022-11-21 14:01:20,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7996 states and 15877 transitions. [2022-11-21 14:01:20,257 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 66 [2022-11-21 14:01:20,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7996 states to 5295 states and 10059 transitions. [2022-11-21 14:01:20,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 691 [2022-11-21 14:01:20,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 698 [2022-11-21 14:01:20,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5295 states and 10059 transitions. [2022-11-21 14:01:20,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 14:01:20,329 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5295 states and 10059 transitions. [2022-11-21 14:01:20,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5295 states and 10059 transitions. [2022-11-21 14:01:20,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5295 to 4545. [2022-11-21 14:01:20,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4545 states, 2817 states have (on average 1.065672701455449) internal successors, (3002), 2794 states have internal predecessors, (3002), 1055 states have call successors, (1131), 463 states have call predecessors, (1131), 673 states have return successors, (4022), 1287 states have call predecessors, (4022), 1055 states have call successors, (4022) [2022-11-21 14:01:20,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4545 states to 4545 states and 8155 transitions. [2022-11-21 14:01:20,516 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4545 states and 8155 transitions. [2022-11-21 14:01:20,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 14:01:20,517 INFO L428 stractBuchiCegarLoop]: Abstraction has 4545 states and 8155 transitions. [2022-11-21 14:01:20,517 INFO L335 stractBuchiCegarLoop]: ======== Iteration 35 ============ [2022-11-21 14:01:20,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4545 states and 8155 transitions. [2022-11-21 14:01:20,536 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 66 [2022-11-21 14:01:20,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 14:01:20,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 14:01:20,538 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [37, 37, 21, 16, 16, 16, 16, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 14:01:20,538 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [22, 22, 19, 19, 19, 19, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:01:20,539 INFO L748 eck$LassoCheckResult]: Stem: 235364#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 235334#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; 235335#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 235363#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; 235350#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 235351#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 235787#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 235782#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 235783#factENTRY ~n := #in~n; 235789#L25 assume ~n <= 0;#res := 1; 235786#factFINAL assume true; 235781#factEXIT >#68#return; 235775#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 235776#factENTRY ~n := #in~n; 235784#L25 assume ~n <= 0;#res := 1; 235780#factFINAL assume true; 235774#factEXIT >#70#return; 235769#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 235770#factENTRY ~n := #in~n; 235794#L25 assume ~n <= 0;#res := 1; 235793#factFINAL assume true; 235768#factEXIT >#72#return; 235767#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 235761#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 235758#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 235757#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 235756#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 235736#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 235737#factENTRY ~n := #in~n; 235754#L25 assume !(~n <= 0); 235751#L26 call #t~ret0 := fact(~n - 1);< 235752#factENTRY ~n := #in~n; 235755#L25 assume ~n <= 0;#res := 1; 235753#factFINAL assume true; 235750#factEXIT >#66#return; 235748#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 235745#factFINAL assume true; 235735#factEXIT >#74#return; 235729#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 235730#factENTRY ~n := #in~n; 235743#L25 assume ~n <= 0;#res := 1; 235734#factFINAL assume true; 235728#factEXIT >#76#return; 235722#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 235723#factENTRY ~n := #in~n; 235744#L25 assume !(~n <= 0); 235741#L26 call #t~ret0 := fact(~n - 1);< 235742#factENTRY ~n := #in~n; 235749#L25 assume ~n <= 0;#res := 1; 235747#factFINAL assume true; 235740#factEXIT >#66#return; 235733#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 235727#factFINAL assume true; 235721#factEXIT >#78#return; 235713#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 235715#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 235720#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 235712#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 235707#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 235708#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 236041#factENTRY ~n := #in~n; 236062#L25 assume !(~n <= 0); 236057#L26 call #t~ret0 := fact(~n - 1);< 236059#factENTRY ~n := #in~n; 236067#L25 assume !(~n <= 0); 236058#L26 call #t~ret0 := fact(~n - 1);< 236065#factENTRY ~n := #in~n; 236068#L25 assume ~n <= 0;#res := 1; 236066#factFINAL assume true; 236064#factEXIT >#66#return; 236063#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 236061#factFINAL assume true; 236056#factEXIT >#66#return; 236048#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 236045#factFINAL assume true; 236039#factEXIT >#74#return; 235928#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 236170#factENTRY ~n := #in~n; 236181#L25 assume ~n <= 0;#res := 1; 236180#factFINAL assume true; 236167#factEXIT >#76#return; 235931#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 235933#factENTRY ~n := #in~n; 236130#L25 assume !(~n <= 0); 236052#L26 call #t~ret0 := fact(~n - 1);< 236055#factENTRY ~n := #in~n; 236086#L25 assume !(~n <= 0); 236051#L26 call #t~ret0 := fact(~n - 1);< 236084#factENTRY ~n := #in~n; 236105#L25 assume ~n <= 0;#res := 1; 236104#factFINAL assume true; 236103#factEXIT >#66#return; 236102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 236101#factFINAL assume true; 236099#factEXIT >#66#return; 236053#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 236108#factFINAL assume true; 235930#factEXIT >#78#return; 235932#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 235919#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 235920#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 235945#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 235944#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 235679#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 235682#factENTRY ~n := #in~n; 235851#L25 assume !(~n <= 0); 235852#L26 call #t~ret0 := fact(~n - 1);< 235940#factENTRY ~n := #in~n; 235939#L25 assume !(~n <= 0); 235936#L26 call #t~ret0 := fact(~n - 1);< 235938#factENTRY ~n := #in~n; 235939#L25 assume !(~n <= 0); 235936#L26 call #t~ret0 := fact(~n - 1);< 235938#factENTRY ~n := #in~n; 236161#L25 assume ~n <= 0;#res := 1; 236159#factFINAL assume true; 236157#factEXIT >#66#return; 236155#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 236153#factFINAL assume true; 236150#factEXIT >#66#return; 236151#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 236162#factFINAL assume true; 236149#factEXIT >#66#return; 235816#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 235817#factFINAL assume true; 235678#factEXIT >#74#return; 235667#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 235677#factENTRY ~n := #in~n; 235688#L25 assume ~n <= 0;#res := 1; 235687#factFINAL assume true; 235665#factEXIT >#76#return; 235576#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 235577#factENTRY ~n := #in~n; 235779#L25 assume !(~n <= 0); 235693#L26 call #t~ret0 := fact(~n - 1);< 235698#factENTRY ~n := #in~n; 235778#L25 assume !(~n <= 0); 235695#L26 call #t~ret0 := fact(~n - 1);< 235773#factENTRY ~n := #in~n; 235808#L25 assume ~n <= 0;#res := 1; 235807#factFINAL assume true; 235806#factEXIT >#66#return; 235805#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 235804#factFINAL assume true; 235803#factEXIT >#66#return; 235696#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 235810#factFINAL assume true; 235686#factEXIT >#78#return; 235569#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 235567#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 235566#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 235564#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 235562#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 235558#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 235551#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 235546#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 235538#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 235540#factENTRY ~n := #in~n; 235556#L25 assume ~n <= 0;#res := 1; 235557#factFINAL assume true; 235597#factEXIT >#68#return; 235593#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 235595#factENTRY ~n := #in~n; 235598#L25 assume ~n <= 0;#res := 1; 235596#factFINAL assume true; 235592#factEXIT >#70#return; 235483#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 235485#factENTRY ~n := #in~n; 235506#L25 assume !(~n <= 0); 235426#L26 call #t~ret0 := fact(~n - 1);< 235451#factENTRY ~n := #in~n; 235453#L25 assume ~n <= 0;#res := 1; 235449#factFINAL assume true; 235420#factEXIT >#66#return; 235440#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 235499#factFINAL assume true; 235482#factEXIT >#72#return; 235479#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 235476#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 235472#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 235469#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 235466#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 235462#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 235464#factENTRY ~n := #in~n; 235474#L25 assume !(~n <= 0); 235428#L26 call #t~ret0 := fact(~n - 1);< 235447#factENTRY ~n := #in~n; 235453#L25 assume ~n <= 0;#res := 1; 235449#factFINAL assume true; 235420#factEXIT >#66#return; 235442#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 235465#factFINAL assume true; 235461#factEXIT >#68#return; 235405#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 235863#factENTRY ~n := #in~n; 235866#L25 assume !(~n <= 0); 235427#L26 call #t~ret0 := fact(~n - 1);< 235451#factENTRY ~n := #in~n; 235453#L25 assume ~n <= 0;#res := 1; 235449#factFINAL assume true; 235420#factEXIT >#66#return; 235441#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 235888#factFINAL assume true; 235885#factEXIT >#70#return; 235881#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 235882#factENTRY ~n := #in~n; 235886#L25 assume ~n <= 0;#res := 1; 235883#factFINAL assume true; 235880#factEXIT >#72#return; 235879#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 235878#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 235877#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 235876#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 235875#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 235450#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 235872#factENTRY ~n := #in~n; 235873#L25 assume !(~n <= 0); 235423#L26 call #t~ret0 := fact(~n - 1);< 235451#factENTRY ~n := #in~n; 235453#L25 assume ~n <= 0;#res := 1; 235449#factFINAL assume true; 235420#factEXIT >#66#return; 235437#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 236239#factFINAL assume true; 236237#factEXIT >#74#return; 236234#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 236235#factENTRY ~n := #in~n; 236238#L25 assume ~n <= 0;#res := 1; 236236#factFINAL assume true; 236233#factEXIT >#76#return; 236228#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 236231#factENTRY ~n := #in~n; 236229#L25 assume !(~n <= 0); 235641#L26 call #t~ret0 := fact(~n - 1);< 235654#factENTRY ~n := #in~n; 235839#L25 assume ~n <= 0;#res := 1; 235836#factFINAL assume true; 235819#factEXIT >#66#return; 235830#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 236247#factFINAL assume true; 236245#factEXIT >#78#return; 236246#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 236488#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 235348#L42-2 [2022-11-21 14:01:20,539 INFO L750 eck$LassoCheckResult]: Loop: 235348#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 236347#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 236288#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 235260#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 235261#factENTRY ~n := #in~n; 236385#L25 assume !(~n <= 0); 236378#L26 call #t~ret0 := fact(~n - 1);< 236384#factENTRY ~n := #in~n; 236401#L25 assume !(~n <= 0); 236380#L26 call #t~ret0 := fact(~n - 1);< 236403#factENTRY ~n := #in~n; 236401#L25 assume !(~n <= 0); 236380#L26 call #t~ret0 := fact(~n - 1);< 236403#factENTRY ~n := #in~n; 236401#L25 assume !(~n <= 0); 236380#L26 call #t~ret0 := fact(~n - 1);< 236403#factENTRY ~n := #in~n; 236401#L25 assume !(~n <= 0); 236380#L26 call #t~ret0 := fact(~n - 1);< 236403#factENTRY ~n := #in~n; 236401#L25 assume !(~n <= 0); 236380#L26 call #t~ret0 := fact(~n - 1);< 236403#factENTRY ~n := #in~n; 236401#L25 assume !(~n <= 0); 236380#L26 call #t~ret0 := fact(~n - 1);< 236403#factENTRY ~n := #in~n; 236401#L25 assume !(~n <= 0); 236380#L26 call #t~ret0 := fact(~n - 1);< 236403#factENTRY ~n := #in~n; 236404#L25 assume ~n <= 0;#res := 1; 236643#factFINAL assume true; 236472#factEXIT >#66#return; 236467#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 236464#factFINAL assume true; 236459#factEXIT >#66#return; 236457#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 236453#factFINAL assume true; 236447#factEXIT >#66#return; 236444#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 236440#factFINAL assume true; 236429#factEXIT >#66#return; 236427#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 236424#factFINAL assume true; 236421#factEXIT >#66#return; 236420#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 236417#factFINAL assume true; 236416#factEXIT >#66#return; 236414#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 236413#factFINAL assume true; 236410#factEXIT >#66#return; 236409#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 236407#factFINAL assume true; 236405#factEXIT >#66#return; 236406#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 236366#factFINAL assume true; 236361#factEXIT >#74#return; 235376#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 235261#factENTRY ~n := #in~n; 236385#L25 assume !(~n <= 0); 236378#L26 call #t~ret0 := fact(~n - 1);< 236384#factENTRY ~n := #in~n; 236401#L25 assume !(~n <= 0); 236380#L26 call #t~ret0 := fact(~n - 1);< 236403#factENTRY ~n := #in~n; 236401#L25 assume !(~n <= 0); 236380#L26 call #t~ret0 := fact(~n - 1);< 236403#factENTRY ~n := #in~n; 236401#L25 assume !(~n <= 0); 236380#L26 call #t~ret0 := fact(~n - 1);< 236403#factENTRY ~n := #in~n; 236401#L25 assume !(~n <= 0); 236380#L26 call #t~ret0 := fact(~n - 1);< 236403#factENTRY ~n := #in~n; 236401#L25 assume !(~n <= 0); 236380#L26 call #t~ret0 := fact(~n - 1);< 236403#factENTRY ~n := #in~n; 236401#L25 assume !(~n <= 0); 236380#L26 call #t~ret0 := fact(~n - 1);< 236403#factENTRY ~n := #in~n; 236401#L25 assume !(~n <= 0); 236380#L26 call #t~ret0 := fact(~n - 1);< 236403#factENTRY ~n := #in~n; 236401#L25 assume !(~n <= 0); 236380#L26 call #t~ret0 := fact(~n - 1);< 236403#factENTRY ~n := #in~n; 236404#L25 assume ~n <= 0;#res := 1; 236643#factFINAL assume true; 236472#factEXIT >#66#return; 236467#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 236464#factFINAL assume true; 236459#factEXIT >#66#return; 236457#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 236453#factFINAL assume true; 236447#factEXIT >#66#return; 236444#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 236440#factFINAL assume true; 236429#factEXIT >#66#return; 236427#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 236424#factFINAL assume true; 236421#factEXIT >#66#return; 236420#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 236417#factFINAL assume true; 236416#factEXIT >#66#return; 236414#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 236413#factFINAL assume true; 236410#factEXIT >#66#return; 236409#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 236407#factFINAL assume true; 236405#factEXIT >#66#return; 236383#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 236402#factFINAL assume true; 236374#factEXIT >#66#return; 236372#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 236371#factFINAL assume true; 236370#factEXIT >#76#return; 235380#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 235381#factENTRY ~n := #in~n; 236710#L25 assume !(~n <= 0); 236430#L26 call #t~ret0 := fact(~n - 1);< 236442#factENTRY ~n := #in~n; 236456#L25 assume !(~n <= 0); 236448#L26 call #t~ret0 := fact(~n - 1);< 236452#factENTRY ~n := #in~n; 236404#L25 assume ~n <= 0;#res := 1; 236643#factFINAL assume true; 236472#factEXIT >#66#return; 236467#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 236464#factFINAL assume true; 236459#factEXIT >#66#return; 236436#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 236891#factFINAL assume true; 236684#factEXIT >#78#return; 235336#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 235337#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 235348#L42-2 [2022-11-21 14:01:20,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:20,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1980596753, now seen corresponding path program 21 times [2022-11-21 14:01:20,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:20,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297982151] [2022-11-21 14:01:20,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:20,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:20,553 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 14:01:20,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [8232158] [2022-11-21 14:01:20,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 14:01:20,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:01:20,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:01:20,556 INFO L229 MonitoredProcess]: Starting monitored process 219 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:01:20,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (219)] Waiting until timeout for monitored process [2022-11-21 14:01:20,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-21 14:01:20,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 14:01:20,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-21 14:01:20,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:21,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3014 backedges. 716 proven. 5 refuted. 0 times theorem prover too weak. 2293 trivial. 0 not checked. [2022-11-21 14:01:21,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:01:21,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3014 backedges. 278 proven. 26 refuted. 0 times theorem prover too weak. 2710 trivial. 0 not checked. [2022-11-21 14:01:21,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:21,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297982151] [2022-11-21 14:01:21,399 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 14:01:21,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8232158] [2022-11-21 14:01:21,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8232158] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 14:01:21,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:01:21,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2022-11-21 14:01:21,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688391442] [2022-11-21 14:01:21,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:01:21,401 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 14:01:21,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:21,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1300569452, now seen corresponding path program 11 times [2022-11-21 14:01:21,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:21,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915542595] [2022-11-21 14:01:21,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:21,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:21,424 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 14:01:21,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [228834624] [2022-11-21 14:01:21,424 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 14:01:21,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:01:21,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:01:21,426 INFO L229 MonitoredProcess]: Starting monitored process 220 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:01:21,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (220)] Waiting until timeout for monitored process [2022-11-21 14:01:21,832 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2022-11-21 14:01:21,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 14:01:21,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-21 14:01:21,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:22,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 155 proven. 732 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2022-11-21 14:01:22,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:01:27,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 155 proven. 850 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2022-11-21 14:01:27,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:27,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915542595] [2022-11-21 14:01:27,418 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 14:01:27,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228834624] [2022-11-21 14:01:27,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228834624] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 14:01:27,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:01:27,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 36] total 39 [2022-11-21 14:01:27,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861560221] [2022-11-21 14:01:27,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:01:27,419 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 14:01:27,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:27,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-21 14:01:27,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1259, Unknown=0, NotChecked=0, Total=1482 [2022-11-21 14:01:27,420 INFO L87 Difference]: Start difference. First operand 4545 states and 8155 transitions. cyclomatic complexity: 3648 Second operand has 39 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 36 states have internal predecessors, (79), 21 states have call successors, (22), 1 states have call predecessors, (22), 17 states have return successors, (35), 20 states have call predecessors, (35), 21 states have call successors, (35) [2022-11-21 14:01:29,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:29,313 INFO L93 Difference]: Finished difference Result 6931 states and 11758 transitions. [2022-11-21 14:01:29,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6931 states and 11758 transitions. [2022-11-21 14:01:29,358 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 97 [2022-11-21 14:01:29,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6931 states to 6689 states and 11446 transitions. [2022-11-21 14:01:29,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 918 [2022-11-21 14:01:29,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 918 [2022-11-21 14:01:29,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6689 states and 11446 transitions. [2022-11-21 14:01:29,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 14:01:29,435 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6689 states and 11446 transitions. [2022-11-21 14:01:29,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6689 states and 11446 transitions. [2022-11-21 14:01:29,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6689 to 4482. [2022-11-21 14:01:29,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4482 states, 2785 states have (on average 1.066427289048474) internal successors, (2970), 2762 states have internal predecessors, (2970), 1028 states have call successors, (1104), 451 states have call predecessors, (1104), 669 states have return successors, (3890), 1268 states have call predecessors, (3890), 1028 states have call successors, (3890) [2022-11-21 14:01:29,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4482 states to 4482 states and 7964 transitions. [2022-11-21 14:01:29,622 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4482 states and 7964 transitions. [2022-11-21 14:01:29,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-21 14:01:29,624 INFO L428 stractBuchiCegarLoop]: Abstraction has 4482 states and 7964 transitions. [2022-11-21 14:01:29,624 INFO L335 stractBuchiCegarLoop]: ======== Iteration 36 ============ [2022-11-21 14:01:29,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4482 states and 7964 transitions. [2022-11-21 14:01:29,641 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 65 [2022-11-21 14:01:29,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 14:01:29,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 14:01:29,643 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [38, 38, 21, 17, 17, 17, 17, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 14:01:29,643 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 21, 18, 18, 18, 18, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:01:29,644 INFO L748 eck$LassoCheckResult]: Stem: 249153#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 249123#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; 249124#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 249152#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; 249141#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 249142#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 249519#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 249515#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 249516#factENTRY ~n := #in~n; 249520#L25 assume ~n <= 0;#res := 1; 249518#factFINAL assume true; 249514#factEXIT >#68#return; 249510#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 249511#factENTRY ~n := #in~n; 249517#L25 assume ~n <= 0;#res := 1; 249513#factFINAL assume true; 249509#factEXIT >#70#return; 249506#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 249507#factENTRY ~n := #in~n; 249512#L25 assume ~n <= 0;#res := 1; 249508#factFINAL assume true; 249505#factEXIT >#72#return; 249504#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 249501#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 249497#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 249496#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 249495#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 249483#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 249484#factENTRY ~n := #in~n; 249494#L25 assume !(~n <= 0); 249492#L26 call #t~ret0 := fact(~n - 1);< 249493#factENTRY ~n := #in~n; 249503#L25 assume ~n <= 0;#res := 1; 249500#factFINAL assume true; 249491#factEXIT >#66#return; 249490#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 249489#factFINAL assume true; 249482#factEXIT >#74#return; 249478#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 249479#factENTRY ~n := #in~n; 249488#L25 assume ~n <= 0;#res := 1; 249481#factFINAL assume true; 249477#factEXIT >#76#return; 249474#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 249475#factENTRY ~n := #in~n; 249499#L25 assume !(~n <= 0); 249486#L26 call #t~ret0 := fact(~n - 1);< 249487#factENTRY ~n := #in~n; 249502#L25 assume ~n <= 0;#res := 1; 249498#factFINAL assume true; 249485#factEXIT >#66#return; 249480#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 249476#factFINAL assume true; 249473#factEXIT >#78#return; 249470#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 249472#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 249551#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 249552#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 249545#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 249523#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 249767#factENTRY ~n := #in~n; 249787#L25 assume !(~n <= 0); 249774#L26 call #t~ret0 := fact(~n - 1);< 249779#factENTRY ~n := #in~n; 249789#L25 assume !(~n <= 0); 249776#L26 call #t~ret0 := fact(~n - 1);< 249785#factENTRY ~n := #in~n; 249789#L25 assume !(~n <= 0); 249776#L26 call #t~ret0 := fact(~n - 1);< 249785#factENTRY ~n := #in~n; 249844#L25 assume ~n <= 0;#res := 1; 249842#factFINAL assume true; 249840#factEXIT >#66#return; 249838#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 249835#factFINAL assume true; 249831#factEXIT >#66#return; 249827#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 249825#factFINAL assume true; 249822#factEXIT >#66#return; 249784#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 249882#factFINAL assume true; 249690#factEXIT >#74#return; 249628#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 249796#factENTRY ~n := #in~n; 249800#L25 assume ~n <= 0;#res := 1; 249799#factFINAL assume true; 249794#factEXIT >#76#return; 249762#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 249791#factENTRY ~n := #in~n; 249788#L25 assume !(~n <= 0); 249775#L26 call #t~ret0 := fact(~n - 1);< 249779#factENTRY ~n := #in~n; 249789#L25 assume !(~n <= 0); 249776#L26 call #t~ret0 := fact(~n - 1);< 249785#factENTRY ~n := #in~n; 249844#L25 assume ~n <= 0;#res := 1; 249842#factFINAL assume true; 249840#factEXIT >#66#return; 249838#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 249835#factFINAL assume true; 249831#factEXIT >#66#return; 249777#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 249942#factFINAL assume true; 249859#factEXIT >#78#return; 249692#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 249680#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 249681#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 249674#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 249522#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 249456#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 249458#factENTRY ~n := #in~n; 249718#L25 assume !(~n <= 0); 249712#L26 call #t~ret0 := fact(~n - 1);< 249887#factENTRY ~n := #in~n; 249886#L25 assume !(~n <= 0); 249713#L26 call #t~ret0 := fact(~n - 1);< 249885#factENTRY ~n := #in~n; 249886#L25 assume !(~n <= 0); 249713#L26 call #t~ret0 := fact(~n - 1);< 249885#factENTRY ~n := #in~n; 249927#L25 assume ~n <= 0;#res := 1; 249925#factFINAL assume true; 249923#factEXIT >#66#return; 249921#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 249919#factFINAL assume true; 249917#factEXIT >#66#return; 249915#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 249883#factFINAL assume true; 249884#factEXIT >#66#return; 249709#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 249707#factFINAL assume true; 249454#factEXIT >#74#return; 249448#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 249451#factENTRY ~n := #in~n; 249467#L25 assume ~n <= 0;#res := 1; 249447#factFINAL assume true; 249450#factEXIT >#76#return; 249434#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 249437#factENTRY ~n := #in~n; 249571#L25 assume !(~n <= 0); 249556#L26 call #t~ret0 := fact(~n - 1);< 249559#factENTRY ~n := #in~n; 249570#L25 assume !(~n <= 0); 249555#L26 call #t~ret0 := fact(~n - 1);< 249598#factENTRY ~n := #in~n; 249618#L25 assume ~n <= 0;#res := 1; 249617#factFINAL assume true; 249616#factEXIT >#66#return; 249615#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 249614#factFINAL assume true; 249613#factEXIT >#66#return; 249558#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 249945#factFINAL assume true; 249433#factEXIT >#78#return; 249432#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 249431#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 249428#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 249426#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 249424#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 249381#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 249372#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 249333#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 249327#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 249328#factENTRY ~n := #in~n; 249337#L25 assume ~n <= 0;#res := 1; 249338#factFINAL assume true; 249366#factEXIT >#68#return; 249363#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 249364#factENTRY ~n := #in~n; 249367#L25 assume ~n <= 0;#res := 1; 249365#factFINAL assume true; 249361#factEXIT >#70#return; 249284#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 249286#factENTRY ~n := #in~n; 249348#L25 assume !(~n <= 0); 249213#L26 call #t~ret0 := fact(~n - 1);< 249238#factENTRY ~n := #in~n; 249241#L25 assume ~n <= 0;#res := 1; 249239#factFINAL assume true; 249211#factEXIT >#66#return; 249228#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 249311#factFINAL assume true; 249283#factEXIT >#72#return; 249282#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 249280#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 249279#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 249262#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 249258#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 249251#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 249253#factENTRY ~n := #in~n; 249278#L25 assume !(~n <= 0); 249217#L26 call #t~ret0 := fact(~n - 1);< 249242#factENTRY ~n := #in~n; 249241#L25 assume ~n <= 0;#res := 1; 249239#factFINAL assume true; 249211#factEXIT >#66#return; 249231#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 249254#factFINAL assume true; 249250#factEXIT >#68#return; 249196#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 249200#factENTRY ~n := #in~n; 249568#L25 assume !(~n <= 0); 249224#L26 call #t~ret0 := fact(~n - 1);< 249238#factENTRY ~n := #in~n; 249241#L25 assume ~n <= 0;#res := 1; 249239#factFINAL assume true; 249211#factEXIT >#66#return; 249235#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 249594#factFINAL assume true; 249590#factEXIT >#70#return; 249587#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 249588#factENTRY ~n := #in~n; 249591#L25 assume ~n <= 0;#res := 1; 249589#factFINAL assume true; 249586#factEXIT >#72#return; 249585#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 249584#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 249583#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 249582#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 249581#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 249240#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 249580#factENTRY ~n := #in~n; 249595#L25 assume !(~n <= 0); 249216#L26 call #t~ret0 := fact(~n - 1);< 249238#factENTRY ~n := #in~n; 249241#L25 assume ~n <= 0;#res := 1; 249239#factFINAL assume true; 249211#factEXIT >#66#return; 249230#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 250035#factFINAL assume true; 250033#factEXIT >#74#return; 250030#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 250031#factENTRY ~n := #in~n; 250034#L25 assume ~n <= 0;#res := 1; 250032#factFINAL assume true; 250029#factEXIT >#76#return; 250024#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 250028#factENTRY ~n := #in~n; 250026#L25 assume !(~n <= 0); 249399#L26 call #t~ret0 := fact(~n - 1);< 249414#factENTRY ~n := #in~n; 249417#L25 assume ~n <= 0;#res := 1; 249415#factFINAL assume true; 249390#factEXIT >#66#return; 249411#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 250643#factFINAL assume true; 250636#factEXIT >#78#return; 250120#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 250657#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 249139#L42-2 [2022-11-21 14:01:29,644 INFO L750 eck$LassoCheckResult]: Loop: 249139#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 249178#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 249179#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 249065#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 249066#factENTRY ~n := #in~n; 250577#L25 assume !(~n <= 0); 250235#L26 call #t~ret0 := fact(~n - 1);< 250241#factENTRY ~n := #in~n; 250248#L25 assume !(~n <= 0); 250233#L26 call #t~ret0 := fact(~n - 1);< 250245#factENTRY ~n := #in~n; 250248#L25 assume !(~n <= 0); 250233#L26 call #t~ret0 := fact(~n - 1);< 250245#factENTRY ~n := #in~n; 250248#L25 assume !(~n <= 0); 250233#L26 call #t~ret0 := fact(~n - 1);< 250245#factENTRY ~n := #in~n; 250248#L25 assume !(~n <= 0); 250233#L26 call #t~ret0 := fact(~n - 1);< 250245#factENTRY ~n := #in~n; 250248#L25 assume !(~n <= 0); 250233#L26 call #t~ret0 := fact(~n - 1);< 250245#factENTRY ~n := #in~n; 250248#L25 assume !(~n <= 0); 250233#L26 call #t~ret0 := fact(~n - 1);< 250245#factENTRY ~n := #in~n; 250248#L25 assume !(~n <= 0); 250233#L26 call #t~ret0 := fact(~n - 1);< 250245#factENTRY ~n := #in~n; 250251#L25 assume ~n <= 0;#res := 1; 250380#factFINAL assume true; 250375#factEXIT >#66#return; 250374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 250371#factFINAL assume true; 250349#factEXIT >#66#return; 250343#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 250339#factFINAL assume true; 250327#factEXIT >#66#return; 250313#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 250308#factFINAL assume true; 250294#factEXIT >#66#return; 250285#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 250279#factFINAL assume true; 250274#factEXIT >#66#return; 250264#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 250262#factFINAL assume true; 250259#factEXIT >#66#return; 250258#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 250253#factFINAL assume true; 250249#factEXIT >#66#return; 250247#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 250243#factFINAL assume true; 250231#factEXIT >#66#return; 250229#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 250224#factFINAL assume true; 250225#factEXIT >#74#return; 249169#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 249066#factENTRY ~n := #in~n; 250577#L25 assume !(~n <= 0); 250235#L26 call #t~ret0 := fact(~n - 1);< 250241#factENTRY ~n := #in~n; 250248#L25 assume !(~n <= 0); 250233#L26 call #t~ret0 := fact(~n - 1);< 250245#factENTRY ~n := #in~n; 250251#L25 assume ~n <= 0;#res := 1; 250380#factFINAL assume true; 250375#factEXIT >#66#return; 250374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 250371#factFINAL assume true; 250349#factEXIT >#66#return; 250261#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 250650#factFINAL assume true; 250270#factEXIT >#76#return; 250221#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 250226#factENTRY ~n := #in~n; 250246#L25 assume !(~n <= 0); 250235#L26 call #t~ret0 := fact(~n - 1);< 250241#factENTRY ~n := #in~n; 250248#L25 assume !(~n <= 0); 250233#L26 call #t~ret0 := fact(~n - 1);< 250245#factENTRY ~n := #in~n; 250248#L25 assume !(~n <= 0); 250233#L26 call #t~ret0 := fact(~n - 1);< 250245#factENTRY ~n := #in~n; 250248#L25 assume !(~n <= 0); 250233#L26 call #t~ret0 := fact(~n - 1);< 250245#factENTRY ~n := #in~n; 250248#L25 assume !(~n <= 0); 250233#L26 call #t~ret0 := fact(~n - 1);< 250245#factENTRY ~n := #in~n; 250248#L25 assume !(~n <= 0); 250233#L26 call #t~ret0 := fact(~n - 1);< 250245#factENTRY ~n := #in~n; 250248#L25 assume !(~n <= 0); 250233#L26 call #t~ret0 := fact(~n - 1);< 250245#factENTRY ~n := #in~n; 250248#L25 assume !(~n <= 0); 250233#L26 call #t~ret0 := fact(~n - 1);< 250245#factENTRY ~n := #in~n; 250251#L25 assume ~n <= 0;#res := 1; 250380#factFINAL assume true; 250375#factEXIT >#66#return; 250374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 250371#factFINAL assume true; 250349#factEXIT >#66#return; 250343#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 250339#factFINAL assume true; 250327#factEXIT >#66#return; 250313#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 250308#factFINAL assume true; 250294#factEXIT >#66#return; 250285#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 250279#factFINAL assume true; 250274#factEXIT >#66#return; 250264#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 250262#factFINAL assume true; 250259#factEXIT >#66#return; 250258#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 250253#factFINAL assume true; 250249#factEXIT >#66#return; 250247#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 250243#factFINAL assume true; 250231#factEXIT >#66#return; 250229#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 250224#factFINAL assume true; 250225#factEXIT >#78#return; 249125#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 249126#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 249139#L42-2 [2022-11-21 14:01:29,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:29,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1536731465, now seen corresponding path program 22 times [2022-11-21 14:01:29,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:29,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947947607] [2022-11-21 14:01:29,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:29,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:29,659 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 14:01:29,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [924602863] [2022-11-21 14:01:29,660 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 14:01:29,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:01:29,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:01:29,666 INFO L229 MonitoredProcess]: Starting monitored process 221 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:01:29,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (221)] Waiting until timeout for monitored process [2022-11-21 14:01:30,081 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 14:01:30,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 14:01:30,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-21 14:01:30,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:30,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3194 backedges. 1529 proven. 13 refuted. 0 times theorem prover too weak. 1652 trivial. 0 not checked. [2022-11-21 14:01:30,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:01:30,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3194 backedges. 161 proven. 323 refuted. 0 times theorem prover too weak. 2710 trivial. 0 not checked. [2022-11-21 14:01:30,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:30,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947947607] [2022-11-21 14:01:30,659 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 14:01:30,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924602863] [2022-11-21 14:01:30,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924602863] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 14:01:30,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:01:30,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 13 [2022-11-21 14:01:30,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37784031] [2022-11-21 14:01:30,660 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:01:30,661 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 14:01:30,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:30,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1664780660, now seen corresponding path program 12 times [2022-11-21 14:01:30,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:30,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506666827] [2022-11-21 14:01:30,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:30,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:30,673 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 14:01:30,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [234023685] [2022-11-21 14:01:30,673 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-21 14:01:30,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:01:30,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:01:30,678 INFO L229 MonitoredProcess]: Starting monitored process 222 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:01:30,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (222)] Waiting until timeout for monitored process [2022-11-21 14:01:31,064 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2022-11-21 14:01:31,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 14:01:31,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-21 14:01:31,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:31,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 190 proven. 612 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2022-11-21 14:01:31,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:01:37,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 190 proven. 732 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-11-21 14:01:37,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:37,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506666827] [2022-11-21 14:01:37,405 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 14:01:37,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234023685] [2022-11-21 14:01:37,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234023685] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 14:01:37,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:01:37,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 38] total 41 [2022-11-21 14:01:37,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667534039] [2022-11-21 14:01:37,405 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:01:37,406 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 14:01:37,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:37,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-21 14:01:37,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1397, Unknown=0, NotChecked=0, Total=1640 [2022-11-21 14:01:37,407 INFO L87 Difference]: Start difference. First operand 4482 states and 7964 transitions. cyclomatic complexity: 3520 Second operand has 41 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 38 states have internal predecessors, (83), 22 states have call successors, (23), 1 states have call predecessors, (23), 18 states have return successors, (37), 21 states have call predecessors, (37), 22 states have call successors, (37) [2022-11-21 14:01:40,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:40,564 INFO L93 Difference]: Finished difference Result 7915 states and 13581 transitions. [2022-11-21 14:01:40,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7915 states and 13581 transitions. [2022-11-21 14:01:40,609 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 143 [2022-11-21 14:01:40,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7915 states to 7819 states and 13359 transitions. [2022-11-21 14:01:40,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1048 [2022-11-21 14:01:40,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1084 [2022-11-21 14:01:40,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7819 states and 13359 transitions. [2022-11-21 14:01:40,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 14:01:40,712 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7819 states and 13359 transitions. [2022-11-21 14:01:40,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7819 states and 13359 transitions. [2022-11-21 14:01:40,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7819 to 4831. [2022-11-21 14:01:40,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4831 states, 2973 states have (on average 1.0713084426505213) internal successors, (3185), 2962 states have internal predecessors, (3185), 1144 states have call successors, (1220), 518 states have call predecessors, (1220), 714 states have return successors, (4477), 1350 states have call predecessors, (4477), 1144 states have call successors, (4477) [2022-11-21 14:01:40,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4831 states to 4831 states and 8882 transitions. [2022-11-21 14:01:40,923 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4831 states and 8882 transitions. [2022-11-21 14:01:40,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-21 14:01:40,924 INFO L428 stractBuchiCegarLoop]: Abstraction has 4831 states and 8882 transitions. [2022-11-21 14:01:40,924 INFO L335 stractBuchiCegarLoop]: ======== Iteration 37 ============ [2022-11-21 14:01:40,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4831 states and 8882 transitions. [2022-11-21 14:01:40,944 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 70 [2022-11-21 14:01:40,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 14:01:40,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 14:01:40,946 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [38, 38, 21, 17, 17, 17, 17, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 14:01:40,946 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 12, 12, 12, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:01:40,946 INFO L748 eck$LassoCheckResult]: Stem: 263873#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 263850#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; 263851#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 263872#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; 263861#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 263862#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 264321#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 264317#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 264318#factENTRY ~n := #in~n; 264322#L25 assume ~n <= 0;#res := 1; 264320#factFINAL assume true; 264316#factEXIT >#68#return; 264311#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 264312#factENTRY ~n := #in~n; 264319#L25 assume ~n <= 0;#res := 1; 264315#factFINAL assume true; 264310#factEXIT >#70#return; 264305#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 264306#factENTRY ~n := #in~n; 264314#L25 assume ~n <= 0;#res := 1; 264309#factFINAL assume true; 264304#factEXIT >#72#return; 264296#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 264294#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 264292#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 264289#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 264283#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 264275#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 264276#factENTRY ~n := #in~n; 264308#L25 assume !(~n <= 0); 264302#L26 call #t~ret0 := fact(~n - 1);< 264303#factENTRY ~n := #in~n; 264313#L25 assume ~n <= 0;#res := 1; 264307#factFINAL assume true; 264301#factEXIT >#66#return; 264295#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264282#factFINAL assume true; 264274#factEXIT >#74#return; 264269#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 264270#factENTRY ~n := #in~n; 264281#L25 assume ~n <= 0;#res := 1; 264273#factFINAL assume true; 264268#factEXIT >#76#return; 264259#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 264260#factENTRY ~n := #in~n; 264291#L25 assume !(~n <= 0); 264279#L26 call #t~ret0 := fact(~n - 1);< 264280#factENTRY ~n := #in~n; 264288#L25 assume ~n <= 0;#res := 1; 264286#factFINAL assume true; 264278#factEXIT >#66#return; 264272#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264267#factFINAL assume true; 264258#factEXIT >#78#return; 264253#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 264254#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 264335#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 264323#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 264324#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 264337#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 264565#factENTRY ~n := #in~n; 264591#L25 assume !(~n <= 0); 264585#L26 call #t~ret0 := fact(~n - 1);< 264589#factENTRY ~n := #in~n; 264594#L25 assume !(~n <= 0); 264586#L26 call #t~ret0 := fact(~n - 1);< 264619#factENTRY ~n := #in~n; 264594#L25 assume !(~n <= 0); 264586#L26 call #t~ret0 := fact(~n - 1);< 264619#factENTRY ~n := #in~n; 264638#L25 assume ~n <= 0;#res := 1; 264637#factFINAL assume true; 264636#factEXIT >#66#return; 264635#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264634#factFINAL assume true; 264632#factEXIT >#66#return; 264631#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264630#factFINAL assume true; 264629#factEXIT >#66#return; 264618#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264557#factFINAL assume true; 264381#factEXIT >#74#return; 264384#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 264600#factENTRY ~n := #in~n; 264606#L25 assume ~n <= 0;#res := 1; 264604#factFINAL assume true; 264597#factEXIT >#76#return; 264593#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 264595#factENTRY ~n := #in~n; 264596#L25 assume !(~n <= 0); 264584#L26 call #t~ret0 := fact(~n - 1);< 264589#factENTRY ~n := #in~n; 264594#L25 assume !(~n <= 0); 264586#L26 call #t~ret0 := fact(~n - 1);< 264619#factENTRY ~n := #in~n; 264638#L25 assume ~n <= 0;#res := 1; 264637#factFINAL assume true; 264636#factEXIT >#66#return; 264635#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264634#factFINAL assume true; 264632#factEXIT >#66#return; 264588#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264678#factFINAL assume true; 264646#factEXIT >#78#return; 264383#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 264644#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 264643#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 264642#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 264336#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 264231#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 264233#factENTRY ~n := #in~n; 264445#L25 assume !(~n <= 0); 264440#L26 call #t~ret0 := fact(~n - 1);< 264452#factENTRY ~n := #in~n; 264451#L25 assume !(~n <= 0); 264441#L26 call #t~ret0 := fact(~n - 1);< 264450#factENTRY ~n := #in~n; 264451#L25 assume !(~n <= 0); 264441#L26 call #t~ret0 := fact(~n - 1);< 264450#factENTRY ~n := #in~n; 264495#L25 assume ~n <= 0;#res := 1; 264494#factFINAL assume true; 264493#factEXIT >#66#return; 264491#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264489#factFINAL assume true; 264487#factEXIT >#66#return; 264482#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264483#factFINAL assume true; 264485#factEXIT >#66#return; 264434#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264431#factFINAL assume true; 264229#factEXIT >#74#return; 264227#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 264241#factENTRY ~n := #in~n; 264225#L25 assume ~n <= 0;#res := 1; 264228#factFINAL assume true; 264240#factEXIT >#76#return; 264213#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 264215#factENTRY ~n := #in~n; 264340#L25 assume !(~n <= 0); 264330#L26 call #t~ret0 := fact(~n - 1);< 264333#factENTRY ~n := #in~n; 264339#L25 assume !(~n <= 0); 264329#L26 call #t~ret0 := fact(~n - 1);< 264343#factENTRY ~n := #in~n; 264363#L25 assume ~n <= 0;#res := 1; 264362#factFINAL assume true; 264361#factEXIT >#66#return; 264360#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264359#factFINAL assume true; 264358#factEXIT >#66#return; 264331#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264654#factFINAL assume true; 264211#factEXIT >#78#return; 264210#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 264209#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 264181#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 264178#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 264176#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 264171#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 264168#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 264120#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 264111#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 264113#factENTRY ~n := #in~n; 264121#L25 assume ~n <= 0;#res := 1; 264119#factFINAL assume true; 264118#factEXIT >#68#return; 264064#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 264066#factENTRY ~n := #in~n; 264068#L25 assume ~n <= 0;#res := 1; 264067#factFINAL assume true; 264063#factEXIT >#70#return; 263991#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 263993#factENTRY ~n := #in~n; 264013#L25 assume !(~n <= 0); 263951#L26 call #t~ret0 := fact(~n - 1);< 263966#factENTRY ~n := #in~n; 263967#L25 assume ~n <= 0;#res := 1; 263964#factFINAL assume true; 263936#factEXIT >#66#return; 263962#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264012#factFINAL assume true; 263990#factEXIT >#72#return; 263988#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 263986#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 263984#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 263980#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 263976#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 263973#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 263974#factENTRY ~n := #in~n; 264011#L25 assume !(~n <= 0); 263938#L26 call #t~ret0 := fact(~n - 1);< 263963#factENTRY ~n := #in~n; 263967#L25 assume ~n <= 0;#res := 1; 263964#factFINAL assume true; 263936#factEXIT >#66#return; 263953#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 263975#factFINAL assume true; 263971#factEXIT >#68#return; 263920#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 263924#factENTRY ~n := #in~n; 264147#L25 assume !(~n <= 0); 263941#L26 call #t~ret0 := fact(~n - 1);< 263966#factENTRY ~n := #in~n; 263967#L25 assume ~n <= 0;#res := 1; 263964#factFINAL assume true; 263936#factEXIT >#66#return; 263955#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264165#factFINAL assume true; 264162#factEXIT >#70#return; 264158#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 264159#factENTRY ~n := #in~n; 264163#L25 assume ~n <= 0;#res := 1; 264160#factFINAL assume true; 264157#factEXIT >#72#return; 264156#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 264155#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 264154#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 264153#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 264152#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 263965#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 264150#factENTRY ~n := #in~n; 264151#L25 assume !(~n <= 0); 263945#L26 call #t~ret0 := fact(~n - 1);< 263966#factENTRY ~n := #in~n; 263967#L25 assume ~n <= 0;#res := 1; 263964#factFINAL assume true; 263936#factEXIT >#66#return; 263958#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264753#factFINAL assume true; 264751#factEXIT >#74#return; 264748#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 264749#factENTRY ~n := #in~n; 264752#L25 assume ~n <= 0;#res := 1; 264750#factFINAL assume true; 264747#factEXIT >#76#return; 264704#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 264746#factENTRY ~n := #in~n; 264744#L25 assume !(~n <= 0); 264090#L26 call #t~ret0 := fact(~n - 1);< 264098#factENTRY ~n := #in~n; 264102#L25 assume ~n <= 0;#res := 1; 264099#factFINAL assume true; 264073#factEXIT >#66#return; 264096#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 265408#factFINAL assume true; 265407#factEXIT >#78#return; 264815#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 265406#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 263859#L42-2 [2022-11-21 14:01:40,947 INFO L750 eck$LassoCheckResult]: Loop: 263859#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 263903#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 263904#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 263820#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 263821#factENTRY ~n := #in~n; 264906#L25 assume !(~n <= 0); 264894#L26 call #t~ret0 := fact(~n - 1);< 264898#factENTRY ~n := #in~n; 264917#L25 assume !(~n <= 0); 264893#L26 call #t~ret0 := fact(~n - 1);< 264909#factENTRY ~n := #in~n; 264917#L25 assume !(~n <= 0); 264893#L26 call #t~ret0 := fact(~n - 1);< 264909#factENTRY ~n := #in~n; 264917#L25 assume !(~n <= 0); 264893#L26 call #t~ret0 := fact(~n - 1);< 264909#factENTRY ~n := #in~n; 264917#L25 assume !(~n <= 0); 264893#L26 call #t~ret0 := fact(~n - 1);< 264909#factENTRY ~n := #in~n; 264917#L25 assume !(~n <= 0); 264893#L26 call #t~ret0 := fact(~n - 1);< 264909#factENTRY ~n := #in~n; 264917#L25 assume !(~n <= 0); 264893#L26 call #t~ret0 := fact(~n - 1);< 264909#factENTRY ~n := #in~n; 264917#L25 assume !(~n <= 0); 264893#L26 call #t~ret0 := fact(~n - 1);< 264909#factENTRY ~n := #in~n; 263846#L25 assume ~n <= 0;#res := 1; 265043#factFINAL assume true; 265028#factEXIT >#66#return; 265000#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264992#factFINAL assume true; 264976#factEXIT >#66#return; 264979#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 265025#factFINAL assume true; 264996#factEXIT >#66#return; 264990#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264985#factFINAL assume true; 264950#factEXIT >#66#return; 264948#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264945#factFINAL assume true; 264940#factEXIT >#66#return; 264938#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264933#factFINAL assume true; 264928#factEXIT >#66#return; 264927#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264924#factFINAL assume true; 264919#factEXIT >#66#return; 264916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264907#factFINAL assume true; 264888#factEXIT >#66#return; 264884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264879#factFINAL assume true; 264878#factEXIT >#74#return; 263894#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 263821#factENTRY ~n := #in~n; 264906#L25 assume !(~n <= 0); 264894#L26 call #t~ret0 := fact(~n - 1);< 264898#factENTRY ~n := #in~n; 264917#L25 assume !(~n <= 0); 264893#L26 call #t~ret0 := fact(~n - 1);< 264909#factENTRY ~n := #in~n; 263846#L25 assume ~n <= 0;#res := 1; 265043#factFINAL assume true; 265028#factEXIT >#66#return; 265000#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264992#factFINAL assume true; 264976#factEXIT >#66#return; 264931#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 265402#factFINAL assume true; 265222#factEXIT >#76#return; 264882#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 265368#factENTRY ~n := #in~n; 264982#L25 assume !(~n <= 0); 264920#L26 call #t~ret0 := fact(~n - 1);< 264926#factENTRY ~n := #in~n; 264935#L25 assume !(~n <= 0); 264929#L26 call #t~ret0 := fact(~n - 1);< 264932#factENTRY ~n := #in~n; 263846#L25 assume ~n <= 0;#res := 1; 265043#factFINAL assume true; 265028#factEXIT >#66#return; 265000#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264992#factFINAL assume true; 264976#factEXIT >#66#return; 264931#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 265402#factFINAL assume true; 265222#factEXIT >#78#return; 263852#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 263853#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 263859#L42-2 [2022-11-21 14:01:40,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:40,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1536731465, now seen corresponding path program 23 times [2022-11-21 14:01:40,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:40,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12875170] [2022-11-21 14:01:40,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:40,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:40,962 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 14:01:40,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1985394303] [2022-11-21 14:01:40,963 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 14:01:40,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:01:40,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:01:40,970 INFO L229 MonitoredProcess]: Starting monitored process 223 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:01:40,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (223)] Waiting until timeout for monitored process [2022-11-21 14:01:41,449 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-11-21 14:01:41,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 14:01:41,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-21 14:01:41,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:41,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3194 backedges. 1528 proven. 58 refuted. 0 times theorem prover too weak. 1608 trivial. 0 not checked. [2022-11-21 14:01:41,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:01:42,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3194 backedges. 160 proven. 549 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2022-11-21 14:01:42,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:42,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12875170] [2022-11-21 14:01:42,288 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 14:01:42,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985394303] [2022-11-21 14:01:42,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985394303] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 14:01:42,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:01:42,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 19 [2022-11-21 14:01:42,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100724593] [2022-11-21 14:01:42,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:01:42,290 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 14:01:42,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:42,291 INFO L85 PathProgramCache]: Analyzing trace with hash -328523980, now seen corresponding path program 13 times [2022-11-21 14:01:42,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:42,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863603245] [2022-11-21 14:01:42,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:42,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:42,302 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 14:01:42,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1310933977] [2022-11-21 14:01:42,303 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-21 14:01:42,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:01:42,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:01:42,307 INFO L229 MonitoredProcess]: Starting monitored process 224 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:01:42,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (224)] Waiting until timeout for monitored process [2022-11-21 14:01:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:42,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-21 14:01:42,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:42,998 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 125 proven. 244 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-11-21 14:01:42,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:01:45,992 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 122 proven. 309 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-11-21 14:01:45,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:45,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863603245] [2022-11-21 14:01:45,992 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 14:01:45,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310933977] [2022-11-21 14:01:45,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310933977] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 14:01:45,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:01:45,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25] total 30 [2022-11-21 14:01:45,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603737641] [2022-11-21 14:01:45,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:01:45,993 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 14:01:45,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:45,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-21 14:01:45,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=719, Unknown=0, NotChecked=0, Total=870 [2022-11-21 14:01:45,994 INFO L87 Difference]: Start difference. First operand 4831 states and 8882 transitions. cyclomatic complexity: 4089 Second operand has 30 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 17 states have call successors, (17), 1 states have call predecessors, (17), 12 states have return successors, (25), 15 states have call predecessors, (25), 17 states have call successors, (25) [2022-11-21 14:01:47,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:47,904 INFO L93 Difference]: Finished difference Result 8889 states and 15518 transitions. [2022-11-21 14:01:47,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8889 states and 15518 transitions. [2022-11-21 14:01:47,961 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 192 [2022-11-21 14:01:48,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8889 states to 8500 states and 14825 transitions. [2022-11-21 14:01:48,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1201 [2022-11-21 14:01:48,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1201 [2022-11-21 14:01:48,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8500 states and 14825 transitions. [2022-11-21 14:01:48,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 14:01:48,168 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8500 states and 14825 transitions. [2022-11-21 14:01:48,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8500 states and 14825 transitions. [2022-11-21 14:01:48,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8500 to 6001. [2022-11-21 14:01:48,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6001 states, 3635 states have (on average 1.058321870701513) internal successors, (3847), 3590 states have internal predecessors, (3847), 1591 states have call successors, (1679), 807 states have call predecessors, (1679), 775 states have return successors, (5936), 1603 states have call predecessors, (5936), 1591 states have call successors, (5936) [2022-11-21 14:01:48,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6001 states to 6001 states and 11462 transitions. [2022-11-21 14:01:48,371 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6001 states and 11462 transitions. [2022-11-21 14:01:48,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-21 14:01:48,372 INFO L428 stractBuchiCegarLoop]: Abstraction has 6001 states and 11462 transitions. [2022-11-21 14:01:48,372 INFO L335 stractBuchiCegarLoop]: ======== Iteration 38 ============ [2022-11-21 14:01:48,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6001 states and 11462 transitions. [2022-11-21 14:01:48,398 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 90 [2022-11-21 14:01:48,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 14:01:48,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 14:01:48,399 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [40, 40, 21, 19, 19, 19, 19, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 14:01:48,400 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [19, 19, 16, 16, 16, 16, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:01:48,400 INFO L748 eck$LassoCheckResult]: Stem: 279785#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 279756#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; 279757#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 279784#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; 279772#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 279773#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 280211#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 280206#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 280207#factENTRY ~n := #in~n; 280212#L25 assume ~n <= 0;#res := 1; 280210#factFINAL assume true; 280205#factEXIT >#68#return; 280200#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 280201#factENTRY ~n := #in~n; 280209#L25 assume ~n <= 0;#res := 1; 280204#factFINAL assume true; 280199#factEXIT >#70#return; 280194#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 280195#factENTRY ~n := #in~n; 280215#L25 assume ~n <= 0;#res := 1; 280213#factFINAL assume true; 280193#factEXIT >#72#return; 280191#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 280189#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 280188#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 280187#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 280185#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 280182#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 280183#factENTRY ~n := #in~n; 280203#L25 assume !(~n <= 0); 280197#L26 call #t~ret0 := fact(~n - 1);< 280198#factENTRY ~n := #in~n; 280208#L25 assume ~n <= 0;#res := 1; 280202#factFINAL assume true; 280196#factEXIT >#66#return; 280192#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 280190#factFINAL assume true; 280181#factEXIT >#74#return; 280179#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 280180#factENTRY ~n := #in~n; 280186#L25 assume ~n <= 0;#res := 1; 280184#factFINAL assume true; 280178#factEXIT >#76#return; 280176#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 280177#factENTRY ~n := #in~n; 280220#L25 assume !(~n <= 0); 280218#L26 call #t~ret0 := fact(~n - 1);< 280219#factENTRY ~n := #in~n; 280222#L25 assume ~n <= 0;#res := 1; 280221#factFINAL assume true; 280217#factEXIT >#66#return; 280216#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 280214#factFINAL assume true; 280175#factEXIT >#78#return; 280172#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 280173#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 280254#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 280255#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 280247#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 280248#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 280459#factENTRY ~n := #in~n; 280514#L25 assume !(~n <= 0); 280495#L26 call #t~ret0 := fact(~n - 1);< 280505#factENTRY ~n := #in~n; 280539#L25 assume !(~n <= 0); 280492#L26 call #t~ret0 := fact(~n - 1);< 280536#factENTRY ~n := #in~n; 280539#L25 assume !(~n <= 0); 280492#L26 call #t~ret0 := fact(~n - 1);< 280536#factENTRY ~n := #in~n; 280545#L25 assume ~n <= 0;#res := 1; 280544#factFINAL assume true; 280535#factEXIT >#66#return; 280533#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 280530#factFINAL assume true; 280527#factEXIT >#66#return; 280526#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 280524#factFINAL assume true; 280503#factEXIT >#66#return; 280481#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 280455#factFINAL assume true; 280456#factEXIT >#74#return; 280379#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 280376#factENTRY ~n := #in~n; 280540#L25 assume ~n <= 0;#res := 1; 280538#factFINAL assume true; 280537#factEXIT >#76#return; 280531#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 280534#factENTRY ~n := #in~n; 280532#L25 assume !(~n <= 0); 280497#L26 call #t~ret0 := fact(~n - 1);< 280505#factENTRY ~n := #in~n; 280539#L25 assume !(~n <= 0); 280492#L26 call #t~ret0 := fact(~n - 1);< 280536#factENTRY ~n := #in~n; 280539#L25 assume !(~n <= 0); 280492#L26 call #t~ret0 := fact(~n - 1);< 280536#factENTRY ~n := #in~n; 280545#L25 assume ~n <= 0;#res := 1; 280544#factFINAL assume true; 280535#factEXIT >#66#return; 280533#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 280530#factFINAL assume true; 280527#factEXIT >#66#return; 280526#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 280524#factFINAL assume true; 280503#factEXIT >#66#return; 280500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 280637#factFINAL assume true; 280630#factEXIT >#78#return; 280366#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 280363#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 280359#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 280354#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 280249#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 280140#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 280288#factENTRY ~n := #in~n; 280332#L25 assume !(~n <= 0); 280329#L26 call #t~ret0 := fact(~n - 1);< 280331#factENTRY ~n := #in~n; 280337#L25 assume !(~n <= 0); 280330#L26 call #t~ret0 := fact(~n - 1);< 280336#factENTRY ~n := #in~n; 280337#L25 assume !(~n <= 0); 280330#L26 call #t~ret0 := fact(~n - 1);< 280336#factENTRY ~n := #in~n; 280352#L25 assume ~n <= 0;#res := 1; 280351#factFINAL assume true; 280350#factEXIT >#66#return; 280349#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 280348#factFINAL assume true; 280347#factEXIT >#66#return; 280346#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 280345#factFINAL assume true; 280338#factEXIT >#66#return; 280333#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 280327#factFINAL assume true; 280139#factEXIT >#74#return; 280124#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 280131#factENTRY ~n := #in~n; 280169#L25 assume ~n <= 0;#res := 1; 280167#factFINAL assume true; 280123#factEXIT >#76#return; 280121#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 280122#factENTRY ~n := #in~n; 280272#L25 assume !(~n <= 0); 280159#L26 call #t~ret0 := fact(~n - 1);< 280165#factENTRY ~n := #in~n; 280317#L25 assume !(~n <= 0); 280162#L26 call #t~ret0 := fact(~n - 1);< 280285#factENTRY ~n := #in~n; 280317#L25 assume !(~n <= 0); 280162#L26 call #t~ret0 := fact(~n - 1);< 280285#factENTRY ~n := #in~n; 280315#L25 assume ~n <= 0;#res := 1; 280313#factFINAL assume true; 280284#factEXIT >#66#return; 280282#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 280280#factFINAL assume true; 280277#factEXIT >#66#return; 280276#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 280275#factFINAL assume true; 280274#factEXIT >#66#return; 280164#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 280636#factFINAL assume true; 280356#factEXIT >#78#return; 280116#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 280115#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 280112#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 280102#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 280101#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 280097#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 280095#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 279949#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 279928#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 279930#factENTRY ~n := #in~n; 279947#L25 assume ~n <= 0;#res := 1; 279948#factFINAL assume true; 280000#factEXIT >#68#return; 279995#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 279997#factENTRY ~n := #in~n; 279999#L25 assume ~n <= 0;#res := 1; 279998#factFINAL assume true; 279994#factEXIT >#70#return; 279897#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 279993#factENTRY ~n := #in~n; 279906#L25 assume !(~n <= 0); 279843#L26 call #t~ret0 := fact(~n - 1);< 279857#factENTRY ~n := #in~n; 279864#L25 assume ~n <= 0;#res := 1; 279859#factFINAL assume true; 279831#factEXIT >#66#return; 279854#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 279905#factFINAL assume true; 279896#factEXIT >#72#return; 279895#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 279894#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 279892#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 279890#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 279888#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 279878#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 279937#factENTRY ~n := #in~n; 279938#L25 assume !(~n <= 0); 279833#L26 call #t~ret0 := fact(~n - 1);< 279861#factENTRY ~n := #in~n; 279864#L25 assume ~n <= 0;#res := 1; 279859#factFINAL assume true; 279831#factEXIT >#66#return; 279847#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 279889#factFINAL assume true; 279877#factEXIT >#68#return; 279871#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 279873#factENTRY ~n := #in~n; 279893#L25 assume !(~n <= 0); 279845#L26 call #t~ret0 := fact(~n - 1);< 279857#factENTRY ~n := #in~n; 279864#L25 assume ~n <= 0;#res := 1; 279859#factFINAL assume true; 279831#factEXIT >#66#return; 279856#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 279875#factFINAL assume true; 279876#factEXIT >#70#return; 279867#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 279868#factENTRY ~n := #in~n; 279874#L25 assume ~n <= 0;#res := 1; 279869#factFINAL assume true; 279866#factEXIT >#72#return; 279865#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 279863#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 279858#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 279830#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 279828#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 279825#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 279826#factENTRY ~n := #in~n; 279862#L25 assume !(~n <= 0); 279836#L26 call #t~ret0 := fact(~n - 1);< 279857#factENTRY ~n := #in~n; 279864#L25 assume ~n <= 0;#res := 1; 279859#factFINAL assume true; 279831#factEXIT >#66#return; 279829#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 279827#factFINAL assume true; 279824#factEXIT >#74#return; 279804#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 279805#factENTRY ~n := #in~n; 281612#L25 assume ~n <= 0;#res := 1; 281610#factFINAL assume true; 281608#factEXIT >#76#return; 279809#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 279810#factENTRY ~n := #in~n; 281603#L25 assume !(~n <= 0); 281340#L26 call #t~ret0 := fact(~n - 1);< 281357#factENTRY ~n := #in~n; 281361#L25 assume ~n <= 0;#res := 1; 281358#factFINAL assume true; 281330#factEXIT >#66#return; 281354#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 281709#factFINAL assume true; 281708#factEXIT >#78#return; 281502#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 281706#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 279770#L42-2 [2022-11-21 14:01:48,401 INFO L750 eck$LassoCheckResult]: Loop: 279770#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 281704#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 280661#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 280653#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 280660#factENTRY ~n := #in~n; 280727#L25 assume !(~n <= 0); 280666#L26 call #t~ret0 := fact(~n - 1);< 280708#factENTRY ~n := #in~n; 280806#L25 assume !(~n <= 0); 280667#L26 call #t~ret0 := fact(~n - 1);< 280774#factENTRY ~n := #in~n; 280806#L25 assume !(~n <= 0); 280667#L26 call #t~ret0 := fact(~n - 1);< 280774#factENTRY ~n := #in~n; 280806#L25 assume !(~n <= 0); 280667#L26 call #t~ret0 := fact(~n - 1);< 280774#factENTRY ~n := #in~n; 280806#L25 assume !(~n <= 0); 280667#L26 call #t~ret0 := fact(~n - 1);< 280774#factENTRY ~n := #in~n; 280806#L25 assume !(~n <= 0); 280667#L26 call #t~ret0 := fact(~n - 1);< 280774#factENTRY ~n := #in~n; 280806#L25 assume !(~n <= 0); 280667#L26 call #t~ret0 := fact(~n - 1);< 280774#factENTRY ~n := #in~n; 280806#L25 assume !(~n <= 0); 280667#L26 call #t~ret0 := fact(~n - 1);< 280774#factENTRY ~n := #in~n; 280846#L25 assume ~n <= 0;#res := 1; 280805#factFINAL assume true; 280772#factEXIT >#66#return; 280771#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 280765#factFINAL assume true; 280749#factEXIT >#66#return; 280761#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 281201#factFINAL assume true; 281129#factEXIT >#66#return; 281116#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 281083#factFINAL assume true; 281049#factEXIT >#66#return; 281041#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 281026#factFINAL assume true; 280717#factEXIT >#66#return; 280709#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 280706#factFINAL assume true; 280699#factEXIT >#66#return; 280698#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 280695#factFINAL assume true; 280689#factEXIT >#66#return; 280688#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 280683#factFINAL assume true; 280665#factEXIT >#66#return; 280663#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 280662#factFINAL assume true; 280650#factEXIT >#74#return; 280652#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 280660#factENTRY ~n := #in~n; 280727#L25 assume !(~n <= 0); 280666#L26 call #t~ret0 := fact(~n - 1);< 280708#factENTRY ~n := #in~n; 280806#L25 assume !(~n <= 0); 280667#L26 call #t~ret0 := fact(~n - 1);< 280774#factENTRY ~n := #in~n; 280806#L25 assume !(~n <= 0); 280667#L26 call #t~ret0 := fact(~n - 1);< 280774#factENTRY ~n := #in~n; 280806#L25 assume !(~n <= 0); 280667#L26 call #t~ret0 := fact(~n - 1);< 280774#factENTRY ~n := #in~n; 280806#L25 assume !(~n <= 0); 280667#L26 call #t~ret0 := fact(~n - 1);< 280774#factENTRY ~n := #in~n; 280806#L25 assume !(~n <= 0); 280667#L26 call #t~ret0 := fact(~n - 1);< 280774#factENTRY ~n := #in~n; 280846#L25 assume ~n <= 0;#res := 1; 280805#factFINAL assume true; 280772#factEXIT >#66#return; 280771#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 280765#factFINAL assume true; 280749#factEXIT >#66#return; 280761#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 281201#factFINAL assume true; 281129#factEXIT >#66#return; 281116#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 281083#factFINAL assume true; 281049#factEXIT >#66#return; 281041#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 281026#factFINAL assume true; 280717#factEXIT >#66#return; 280709#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 280706#factFINAL assume true; 280699#factEXIT >#66#return; 280703#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 281720#factFINAL assume true; 281712#factEXIT >#76#return; 280712#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 280744#factENTRY ~n := #in~n; 280770#L25 assume !(~n <= 0); 280690#L26 call #t~ret0 := fact(~n - 1);< 280764#factENTRY ~n := #in~n; 280808#L25 assume !(~n <= 0); 280700#L26 call #t~ret0 := fact(~n - 1);< 280777#factENTRY ~n := #in~n; 280846#L25 assume ~n <= 0;#res := 1; 280805#factFINAL assume true; 280772#factEXIT >#66#return; 280771#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 280765#factFINAL assume true; 280749#factEXIT >#66#return; 280747#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 280743#factFINAL assume true; 280741#factEXIT >#78#return; 279758#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 279759#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 279770#L42-2 [2022-11-21 14:01:48,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:48,403 INFO L85 PathProgramCache]: Analyzing trace with hash -179065863, now seen corresponding path program 24 times [2022-11-21 14:01:48,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:48,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799061371] [2022-11-21 14:01:48,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:48,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:48,419 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 14:01:48,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1839384482] [2022-11-21 14:01:48,419 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-21 14:01:48,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:01:48,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:01:48,426 INFO L229 MonitoredProcess]: Starting monitored process 225 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:01:48,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (225)] Waiting until timeout for monitored process [2022-11-21 14:01:48,980 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-11-21 14:01:48,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 14:01:48,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-21 14:01:48,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:49,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3572 backedges. 782 proven. 5 refuted. 0 times theorem prover too weak. 2785 trivial. 0 not checked. [2022-11-21 14:01:49,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:01:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3572 backedges. 302 proven. 26 refuted. 0 times theorem prover too weak. 3244 trivial. 0 not checked. [2022-11-21 14:01:49,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:49,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799061371] [2022-11-21 14:01:49,578 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 14:01:49,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839384482] [2022-11-21 14:01:49,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839384482] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 14:01:49,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:01:49,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2022-11-21 14:01:49,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585944669] [2022-11-21 14:01:49,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:01:49,580 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 14:01:49,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:49,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1689015116, now seen corresponding path program 14 times [2022-11-21 14:01:49,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:49,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673612356] [2022-11-21 14:01:49,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:49,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:49,592 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 14:01:49,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1902464125] [2022-11-21 14:01:49,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 14:01:49,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:01:49,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:01:49,598 INFO L229 MonitoredProcess]: Starting monitored process 226 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:01:49,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf684bd-1037-4c71-9f52-e0eca7cd80d5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (226)] Waiting until timeout for monitored process [2022-11-21 14:01:50,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 14:01:50,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-21 14:01:50,191 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 14:01:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 14:01:50,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 14:02:26,786 WARN L233 SmtUtils]: Spent 34.38s on a formula simplification. DAG size of input: 110 DAG size of output: 106 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-21 14:02:39,591 WARN L233 SmtUtils]: Spent 12.02s 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-21 14:02:51,608 WARN L233 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 14:03:37,601 WARN L233 SmtUtils]: Spent 45.92s on a formula simplification that was a NOOP. DAG size: 100 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-21 14:03:37,606 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 14:03:37,606 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 14:03:37,606 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 14:03:37,606 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 14:03:37,606 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-21 14:03:37,606 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 14:03:37,607 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 14:03:37,607 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 14:03:37,607 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration38_Loop [2022-11-21 14:03:37,607 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 14:03:37,607 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 14:03:37,612 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-21 14:03:37,614 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-21 14:03:37,617 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-21 14:03:37,619 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-21 14:03:37,621 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-21 14:03:37,623 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true