./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-numeric/Binomial_true-termination_false-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-numeric/Binomial_true-termination_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer --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 7271d13f0b7b365fd7ecc81e9b65f9e103181ef3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 02:56:04,485 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 02:56:04,486 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 02:56:04,493 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 02:56:04,493 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 02:56:04,494 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 02:56:04,495 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 02:56:04,496 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 02:56:04,497 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 02:56:04,498 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 02:56:04,499 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 02:56:04,499 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 02:56:04,500 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 02:56:04,500 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 02:56:04,501 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 02:56:04,502 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 02:56:04,502 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 02:56:04,504 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 02:56:04,505 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 02:56:04,506 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 02:56:04,507 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 02:56:04,508 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 02:56:04,510 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 02:56:04,510 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 02:56:04,510 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 02:56:04,511 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 02:56:04,511 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 02:56:04,512 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 02:56:04,512 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 02:56:04,513 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 02:56:04,513 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 02:56:04,514 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 02:56:04,514 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 02:56:04,514 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 02:56:04,515 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 02:56:04,515 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 02:56:04,515 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 02:56:04,524 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 02:56:04,524 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 02:56:04,525 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 02:56:04,525 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 02:56:04,526 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 02:56:04,526 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 02:56:04,526 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 02:56:04,526 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 02:56:04,526 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 02:56:04,526 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 02:56:04,526 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 02:56:04,527 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 02:56:04,527 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 02:56:04,527 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 02:56:04,527 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 02:56:04,527 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 02:56:04,527 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 02:56:04,527 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 02:56:04,528 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 02:56:04,528 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 02:56:04,528 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 02:56:04,528 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 02:56:04,528 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 02:56:04,528 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 02:56:04,528 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 02:56:04,528 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 02:56:04,529 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 02:56:04,529 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 02:56:04,529 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer 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 -> 7271d13f0b7b365fd7ecc81e9b65f9e103181ef3 [2018-11-10 02:56:04,553 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 02:56:04,562 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 02:56:04,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 02:56:04,566 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 02:56:04,566 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 02:56:04,567 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/../../sv-benchmarks/c/termination-numeric/Binomial_true-termination_false-no-overflow.c [2018-11-10 02:56:04,614 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/data/e32c890a5/b38864ccf996468a88737b5f9e2e9781/FLAG8ebe1282c [2018-11-10 02:56:04,925 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 02:56:04,925 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/sv-benchmarks/c/termination-numeric/Binomial_true-termination_false-no-overflow.c [2018-11-10 02:56:04,929 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/data/e32c890a5/b38864ccf996468a88737b5f9e2e9781/FLAG8ebe1282c [2018-11-10 02:56:04,938 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/data/e32c890a5/b38864ccf996468a88737b5f9e2e9781 [2018-11-10 02:56:04,941 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 02:56:04,942 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 02:56:04,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 02:56:04,943 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 02:56:04,946 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 02:56:04,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:56:04" (1/1) ... [2018-11-10 02:56:04,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bdb9a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:04, skipping insertion in model container [2018-11-10 02:56:04,950 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:56:04" (1/1) ... [2018-11-10 02:56:04,959 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 02:56:04,976 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 02:56:05,089 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:56:05,092 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 02:56:05,103 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:56:05,112 INFO L193 MainTranslator]: Completed translation [2018-11-10 02:56:05,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:05 WrapperNode [2018-11-10 02:56:05,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 02:56:05,113 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 02:56:05,113 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 02:56:05,113 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 02:56:05,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:05" (1/1) ... [2018-11-10 02:56:05,126 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:05" (1/1) ... [2018-11-10 02:56:05,139 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 02:56:05,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 02:56:05,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 02:56:05,139 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 02:56:05,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:05" (1/1) ... [2018-11-10 02:56:05,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:05" (1/1) ... [2018-11-10 02:56:05,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:05" (1/1) ... [2018-11-10 02:56:05,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:05" (1/1) ... [2018-11-10 02:56:05,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:05" (1/1) ... [2018-11-10 02:56:05,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:05" (1/1) ... [2018-11-10 02:56:05,153 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:05" (1/1) ... [2018-11-10 02:56:05,155 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 02:56:05,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 02:56:05,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 02:56:05,156 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 02:56:05,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:56:05,238 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2018-11-10 02:56:05,238 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2018-11-10 02:56:05,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 02:56:05,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 02:56:05,361 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 02:56:05,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:56:05 BoogieIcfgContainer [2018-11-10 02:56:05,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 02:56:05,362 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 02:56:05,362 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 02:56:05,365 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 02:56:05,366 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:56:05,366 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 02:56:04" (1/3) ... [2018-11-10 02:56:05,367 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8383cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 02:56:05, skipping insertion in model container [2018-11-10 02:56:05,367 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:56:05,368 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:05" (2/3) ... [2018-11-10 02:56:05,368 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8383cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 02:56:05, skipping insertion in model container [2018-11-10 02:56:05,368 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:56:05,368 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:56:05" (3/3) ... [2018-11-10 02:56:05,370 INFO L375 chiAutomizerObserver]: Analyzing ICFG Binomial_true-termination_false-no-overflow.c [2018-11-10 02:56:05,417 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 02:56:05,417 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 02:56:05,417 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 02:56:05,418 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 02:56:05,418 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 02:56:05,418 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 02:56:05,418 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 02:56:05,418 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 02:56:05,418 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 02:56:05,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-11-10 02:56:05,445 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 02:56:05,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:56:05,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:56:05,449 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 02:56:05,450 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 02:56:05,450 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 02:56:05,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-11-10 02:56:05,452 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 02:56:05,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:56:05,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:56:05,452 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 02:56:05,452 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 02:56:05,457 INFO L793 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 30#L35true assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 3#L38true assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 15#L41-4true [2018-11-10 02:56:05,457 INFO L795 eck$LassoCheckResult]: Loop: 15#L41-4true assume true; 20#L41-1true assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 4#L42-4true assume !true; 17#L41-3true main_#t~post7 := main_~n~0;main_~n~0 := main_#t~post7 + 1;havoc main_#t~post7; 15#L41-4true [2018-11-10 02:56:05,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:56:05,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 1 times [2018-11-10 02:56:05,463 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:56:05,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:56:05,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:05,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:56:05,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:56:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:56:05,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:56:05,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1668264, now seen corresponding path program 1 times [2018-11-10 02:56:05,534 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:56:05,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:56:05,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:05,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:56:05,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:56:05,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:56:05,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:56:05,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 02:56:05,560 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:56:05,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 02:56:05,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 02:56:05,577 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-10 02:56:05,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:56:05,586 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2018-11-10 02:56:05,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 02:56:05,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 41 transitions. [2018-11-10 02:56:05,589 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 02:56:05,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 36 transitions. [2018-11-10 02:56:05,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 02:56:05,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-10 02:56:05,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2018-11-10 02:56:05,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:56:05,597 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-11-10 02:56:05,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2018-11-10 02:56:05,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-10 02:56:05,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-10 02:56:05,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2018-11-10 02:56:05,624 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-11-10 02:56:05,624 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-11-10 02:56:05,624 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 02:56:05,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2018-11-10 02:56:05,625 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 02:56:05,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:56:05,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:56:05,626 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 02:56:05,626 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 02:56:05,626 INFO L793 eck$LassoCheckResult]: Stem: 94#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 86#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 87#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 68#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 69#L41-4 [2018-11-10 02:56:05,626 INFO L795 eck$LassoCheckResult]: Loop: 69#L41-4 assume true; 91#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 70#L42-4 assume true; 71#L42-1 assume !(main_~k~0 <= main_~x~0); 84#L41-3 main_#t~post7 := main_~n~0;main_~n~0 := main_#t~post7 + 1;havoc main_#t~post7; 69#L41-4 [2018-11-10 02:56:05,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:56:05,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 2 times [2018-11-10 02:56:05,627 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:56:05,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:56:05,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:05,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:56:05,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:56:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:56:05,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:56:05,635 INFO L82 PathProgramCache]: Analyzing trace with hash 51690484, now seen corresponding path program 1 times [2018-11-10 02:56:05,635 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:56:05,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:56:05,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:05,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:56:05,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:56:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:56:05,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:56:05,643 INFO L82 PathProgramCache]: Analyzing trace with hash -499715475, now seen corresponding path program 1 times [2018-11-10 02:56:05,643 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:56:05,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:56:05,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:05,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:56:05,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:56:05,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:56:05,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:56:05,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 02:56:05,717 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:56:05,718 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:56:05,718 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:56:05,718 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:56:05,718 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:56:05,718 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:56:05,719 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:56:05,719 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:56:05,719 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration2_Loop [2018-11-10 02:56:05,719 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:56:05,719 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:56:05,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:56:05,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:56:05,821 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:56:05,821 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:56:05,826 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:56:05,826 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:56:05,833 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:56:05,833 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7=0} Honda state: {ULTIMATE.start_main_#t~post7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:56:05,852 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:56:05,852 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:56:05,871 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:56:05,871 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:56:06,081 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 02:56:06,082 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:56:06,082 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:56:06,082 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:56:06,082 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:56:06,082 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:56:06,082 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:56:06,082 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:56:06,082 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:56:06,082 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration2_Loop [2018-11-10 02:56:06,082 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:56:06,082 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:56:06,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:56:06,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:56:06,118 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:56:06,121 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:56:06,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:56:06,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:56:06,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:56:06,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:56:06,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:56:06,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:56:06,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:56:06,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:56:06,127 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:56:06,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:56:06,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:56:06,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:56:06,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:56:06,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:56:06,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:56:06,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:56:06,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:56:06,135 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:56:06,142 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 02:56:06,143 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 02:56:06,144 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:56:06,144 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 02:56:06,145 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:56:06,145 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-11-10 02:56:06,146 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 02:56:06,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:56:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:56:06,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:56:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:56:06,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:56:06,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:56:06,209 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 02:56:06,210 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 36 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-10 02:56:06,260 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 36 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 43 states and 57 transitions. Complement of second has 9 states. [2018-11-10 02:56:06,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 02:56:06,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 02:56:06,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-10 02:56:06,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 5 letters. [2018-11-10 02:56:06,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:56:06,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 9 letters. Loop has 5 letters. [2018-11-10 02:56:06,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:56:06,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 10 letters. [2018-11-10 02:56:06,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:56:06,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-10 02:56:06,266 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 02:56:06,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 39 states and 53 transitions. [2018-11-10 02:56:06,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-10 02:56:06,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-11-10 02:56:06,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 53 transitions. [2018-11-10 02:56:06,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:56:06,268 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2018-11-10 02:56:06,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 53 transitions. [2018-11-10 02:56:06,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-10 02:56:06,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 02:56:06,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2018-11-10 02:56:06,271 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2018-11-10 02:56:06,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 02:56:06,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:56:06,272 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand 4 states. [2018-11-10 02:56:06,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:56:06,328 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2018-11-10 02:56:06,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:56:06,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2018-11-10 02:56:06,330 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 02:56:06,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 33 states and 42 transitions. [2018-11-10 02:56:06,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-10 02:56:06,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-10 02:56:06,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2018-11-10 02:56:06,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:56:06,332 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2018-11-10 02:56:06,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2018-11-10 02:56:06,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-11-10 02:56:06,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 02:56:06,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2018-11-10 02:56:06,335 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-11-10 02:56:06,335 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-11-10 02:56:06,336 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 02:56:06,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. [2018-11-10 02:56:06,336 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 02:56:06,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:56:06,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:56:06,337 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 02:56:06,337 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:56:06,337 INFO L793 eck$LassoCheckResult]: Stem: 297#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 288#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 289#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 272#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 273#L41-4 [2018-11-10 02:56:06,337 INFO L795 eck$LassoCheckResult]: Loop: 273#L41-4 assume true; 293#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 270#L42-4 assume true; 271#L42-1 assume !!(main_~k~0 <= main_~x~0); 287#L43 assume !(main_~k~0 <= main_~n~0);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~k~0, main_~n~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 277#L30-5 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 295#factENTRY ~n := #in~n; 290#L25 assume ~n <= 0;#res := 1; 291#factFINAL assume true; 274#factEXIT >#76#return; 280#L30-6 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 295#factENTRY ~n := #in~n; 290#L25 assume ~n <= 0;#res := 1; 291#factFINAL assume true; 274#factEXIT >#78#return; 275#L30-7 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 295#factENTRY ~n := #in~n; 290#L25 assume ~n <= 0;#res := 1; 291#factFINAL assume true; 274#factEXIT >#80#return; 282#L30-8 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 296#L30-9 main_#t~ret10 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10; 285#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 286#L42-4 assume true; 298#L42-1 assume !(main_~k~0 <= main_~x~0); 294#L41-3 main_#t~post7 := main_~n~0;main_~n~0 := main_#t~post7 + 1;havoc main_#t~post7; 273#L41-4 [2018-11-10 02:56:06,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:56:06,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 3 times [2018-11-10 02:56:06,338 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:56:06,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:56:06,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:06,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:56:06,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:56:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:56:06,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:56:06,343 INFO L82 PathProgramCache]: Analyzing trace with hash -758591884, now seen corresponding path program 1 times [2018-11-10 02:56:06,343 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:56:06,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:56:06,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:06,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:56:06,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:06,351 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:56:06,351 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:56:06,351 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:56:06,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:56:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:56:06,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:56:06,420 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 02:56:06,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:56:06,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 02:56:06,440 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:56:06,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 02:56:06,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 02:56:06,440 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-10 02:56:06,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:56:06,504 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2018-11-10 02:56:06,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 02:56:06,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 56 transitions. [2018-11-10 02:56:06,507 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2018-11-10 02:56:06,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 56 transitions. [2018-11-10 02:56:06,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-10 02:56:06,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-10 02:56:06,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 56 transitions. [2018-11-10 02:56:06,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:56:06,510 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 56 transitions. [2018-11-10 02:56:06,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 56 transitions. [2018-11-10 02:56:06,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2018-11-10 02:56:06,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-10 02:56:06,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2018-11-10 02:56:06,515 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2018-11-10 02:56:06,515 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2018-11-10 02:56:06,515 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 02:56:06,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2018-11-10 02:56:06,516 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 02:56:06,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:56:06,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:56:06,517 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 02:56:06,518 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:56:06,518 INFO L793 eck$LassoCheckResult]: Stem: 450#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 441#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 442#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 424#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 425#L41-4 [2018-11-10 02:56:06,518 INFO L795 eck$LassoCheckResult]: Loop: 425#L41-4 assume true; 446#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 426#L42-4 assume true; 427#L42-1 assume !!(main_~k~0 <= main_~x~0); 440#L43 assume !(main_~k~0 <= main_~n~0);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~k~0, main_~n~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 433#L30-5 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 448#factENTRY ~n := #in~n; 443#L25 assume !(~n <= 0); 435#L26 call #t~ret0 := fact(~n - 1);< 448#factENTRY ~n := #in~n; 443#L25 assume ~n <= 0;#res := 1; 444#factFINAL assume true; 428#factEXIT >#68#return; 437#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 452#factFINAL assume true; 453#factEXIT >#76#return; 430#L30-6 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 448#factENTRY ~n := #in~n; 443#L25 assume !(~n <= 0); 435#L26 call #t~ret0 := fact(~n - 1);< 448#factENTRY ~n := #in~n; 443#L25 assume ~n <= 0;#res := 1; 444#factFINAL assume true; 428#factEXIT >#68#return; 437#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 452#factFINAL assume true; 453#factEXIT >#78#return; 432#L30-7 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 448#factENTRY ~n := #in~n; 443#L25 assume !(~n <= 0); 435#L26 call #t~ret0 := fact(~n - 1);< 448#factENTRY ~n := #in~n; 443#L25 assume ~n <= 0;#res := 1; 444#factFINAL assume true; 428#factEXIT >#68#return; 437#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 452#factFINAL assume true; 453#factEXIT >#80#return; 451#L30-8 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 449#L30-9 main_#t~ret10 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10; 438#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 439#L42-4 assume true; 454#L42-1 assume !(main_~k~0 <= main_~x~0); 447#L41-3 main_#t~post7 := main_~n~0;main_~n~0 := main_#t~post7 + 1;havoc main_#t~post7; 425#L41-4 [2018-11-10 02:56:06,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:56:06,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 4 times [2018-11-10 02:56:06,518 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:56:06,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:56:06,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:06,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:56:06,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:56:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:56:06,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:56:06,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1528661064, now seen corresponding path program 1 times [2018-11-10 02:56:06,526 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:56:06,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:56:06,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:06,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:56:06,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:06,532 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:56:06,532 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:56:06,532 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:56:06,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:56:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:56:06,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:56:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 40 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-10 02:56:06,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:56:06,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-10 02:56:06,614 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:56:06,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 02:56:06,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 02:56:06,614 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. cyclomatic complexity: 16 Second operand 6 states. [2018-11-10 02:56:06,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:56:06,759 INFO L93 Difference]: Finished difference Result 53 states and 81 transitions. [2018-11-10 02:56:06,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 02:56:06,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 81 transitions. [2018-11-10 02:56:06,763 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-10 02:56:06,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 81 transitions. [2018-11-10 02:56:06,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2018-11-10 02:56:06,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2018-11-10 02:56:06,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 81 transitions. [2018-11-10 02:56:06,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:56:06,766 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 81 transitions. [2018-11-10 02:56:06,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 81 transitions. [2018-11-10 02:56:06,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2018-11-10 02:56:06,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 02:56:06,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2018-11-10 02:56:06,771 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2018-11-10 02:56:06,772 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2018-11-10 02:56:06,772 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 02:56:06,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 49 transitions. [2018-11-10 02:56:06,772 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2018-11-10 02:56:06,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:56:06,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:56:06,774 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 02:56:06,774 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:56:06,774 INFO L793 eck$LassoCheckResult]: Stem: 680#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 669#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 670#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 651#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 652#L41-4 [2018-11-10 02:56:06,774 INFO L795 eck$LassoCheckResult]: Loop: 652#L41-4 assume true; 676#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 653#L42-4 assume true; 654#L42-1 assume !!(main_~k~0 <= main_~x~0); 668#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 662#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 678#factENTRY ~n := #in~n; 671#L25 assume !(~n <= 0); 657#L26 call #t~ret0 := fact(~n - 1);< 678#factENTRY ~n := #in~n; 671#L25 assume ~n <= 0;#res := 1; 672#factFINAL assume true; 655#factEXIT >#68#return; 664#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 673#factFINAL assume true; 674#factEXIT >#70#return; 658#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 678#factENTRY ~n := #in~n; 671#L25 assume !(~n <= 0); 657#L26 call #t~ret0 := fact(~n - 1);< 678#factENTRY ~n := #in~n; 671#L25 assume ~n <= 0;#res := 1; 672#factFINAL assume true; 655#factEXIT >#68#return; 664#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 673#factFINAL assume true; 674#factEXIT >#72#return; 660#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 678#factENTRY ~n := #in~n; 671#L25 assume !(~n <= 0); 657#L26 call #t~ret0 := fact(~n - 1);< 678#factENTRY ~n := #in~n; 671#L25 assume ~n <= 0;#res := 1; 672#factFINAL assume true; 655#factEXIT >#68#return; 664#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 673#factFINAL assume true; 674#factEXIT >#74#return; 665#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 675#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 666#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 667#L42-4 assume true; 682#L42-1 assume !(main_~k~0 <= main_~x~0); 677#L41-3 main_#t~post7 := main_~n~0;main_~n~0 := main_#t~post7 + 1;havoc main_#t~post7; 652#L41-4 [2018-11-10 02:56:06,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:56:06,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 5 times [2018-11-10 02:56:06,775 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:56:06,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:56:06,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:06,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:56:06,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:56:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:56:06,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:56:06,780 INFO L82 PathProgramCache]: Analyzing trace with hash -834388812, now seen corresponding path program 1 times [2018-11-10 02:56:06,781 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:56:06,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:56:06,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:06,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:56:06,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:06,786 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:56:06,786 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:56:06,787 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:56:06,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:56:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:56:06,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:56:06,862 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 48 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 02:56:06,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:56:06,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-10 02:56:06,882 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:56:06,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 02:56:06,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 02:56:06,883 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. cyclomatic complexity: 18 Second operand 6 states. [2018-11-10 02:56:07,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:56:07,011 INFO L93 Difference]: Finished difference Result 52 states and 78 transitions. [2018-11-10 02:56:07,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 02:56:07,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 78 transitions. [2018-11-10 02:56:07,012 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 43 [2018-11-10 02:56:07,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 78 transitions. [2018-11-10 02:56:07,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-11-10 02:56:07,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-11-10 02:56:07,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 78 transitions. [2018-11-10 02:56:07,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:56:07,017 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 78 transitions. [2018-11-10 02:56:07,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 78 transitions. [2018-11-10 02:56:07,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2018-11-10 02:56:07,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 02:56:07,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 56 transitions. [2018-11-10 02:56:07,021 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 56 transitions. [2018-11-10 02:56:07,021 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 56 transitions. [2018-11-10 02:56:07,021 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 02:56:07,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 56 transitions. [2018-11-10 02:56:07,022 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-11-10 02:56:07,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:56:07,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:56:07,023 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 02:56:07,023 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:56:07,024 INFO L793 eck$LassoCheckResult]: Stem: 910#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 899#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 900#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 878#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 879#L41-4 [2018-11-10 02:56:07,024 INFO L795 eck$LassoCheckResult]: Loop: 879#L41-4 assume true; 906#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 880#L42-4 assume true; 881#L42-1 assume !!(main_~k~0 <= main_~x~0); 898#L43 assume !(main_~k~0 <= main_~n~0);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~k~0, main_~n~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 883#L30-5 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 908#factENTRY ~n := #in~n; 901#L25 assume ~n <= 0;#res := 1; 902#factFINAL assume true; 882#factEXIT >#76#return; 890#L30-6 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 908#factENTRY ~n := #in~n; 901#L25 assume ~n <= 0;#res := 1; 902#factFINAL assume true; 882#factEXIT >#78#return; 887#L30-7 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 908#factENTRY ~n := #in~n; 901#L25 assume !(~n <= 0); 889#L26 call #t~ret0 := fact(~n - 1);< 908#factENTRY ~n := #in~n; 901#L25 assume ~n <= 0;#res := 1; 902#factFINAL assume true; 882#factEXIT >#68#return; 895#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903#factFINAL assume true; 904#factEXIT >#80#return; 911#L30-8 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 909#L30-9 main_#t~ret10 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10; 896#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 897#L42-4 assume true; 912#L42-1 assume !(main_~k~0 <= main_~x~0); 907#L41-3 main_#t~post7 := main_~n~0;main_~n~0 := main_#t~post7 + 1;havoc main_#t~post7; 879#L41-4 [2018-11-10 02:56:07,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:56:07,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 6 times [2018-11-10 02:56:07,024 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:56:07,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:56:07,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:07,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:56:07,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:56:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:56:07,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:56:07,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1875853064, now seen corresponding path program 2 times [2018-11-10 02:56:07,030 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:56:07,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:56:07,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:07,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:56:07,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:07,038 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:56:07,038 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:56:07,038 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:56:07,045 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 02:56:07,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 02:56:07,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-10 02:56:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:56:07,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:56:07,096 INFO L82 PathProgramCache]: Analyzing trace with hash 908674783, now seen corresponding path program 1 times [2018-11-10 02:56:07,096 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:56:07,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:56:07,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:07,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:56:07,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:56:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:56:07,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-11-10 02:56:07,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:56:07,112 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:56:07,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:56:07,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:56:07,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:56:07,169 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 02:56:07,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:56:07,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 02:56:07,414 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2018-11-10 02:56:11,140 WARN L179 SmtUtils]: Spent 3.71 s on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2018-11-10 02:56:11,144 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:56:11,144 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:56:11,144 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:56:11,144 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:56:11,144 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:56:11,144 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:56:11,144 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:56:11,144 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:56:11,144 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration6_Loop [2018-11-10 02:56:11,144 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:56:11,145 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:56:11,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:56:11,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:56:11,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:56:11,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:56:11,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:56:11,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:56:11,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:56:47,335 WARN L179 SmtUtils]: Spent 36.17 s on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2018-11-10 02:57:11,409 WARN L179 SmtUtils]: Spent 24.07 s on a formula simplification that was a NOOP. DAG size: 41 [2018-11-10 02:57:11,413 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:57:11,413 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:11,417 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:11,417 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:11,438 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:57:11,438 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:11,449 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 02:57:11,465 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:57:11,465 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:57:11,465 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:57:11,465 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:57:11,465 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:57:11,465 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:11,465 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:57:11,465 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:57:11,465 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration6_Loop [2018-11-10 02:57:11,466 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:57:11,466 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:57:11,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:11,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:11,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:11,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:11,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:11,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:11,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:25,329 WARN L179 SmtUtils]: Spent 13.83 s on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2018-11-10 02:57:49,432 WARN L179 SmtUtils]: Spent 24.10 s on a formula simplification that was a NOOP. DAG size: 41 [2018-11-10 02:57:49,435 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:57:49,435 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:57:49,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:49,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:49,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,441 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:49,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:49,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,445 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:49,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:49,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,447 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:49,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:49,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,450 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:49,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:49,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,462 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:49,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:49,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,466 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:49,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:49,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,468 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,468 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 02:57:49,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,469 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:57:49,470 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:57:49,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,470 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,471 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:57:49,472 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:57:49,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,473 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,474 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:57:49,475 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:57:49,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,476 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,477 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:57:49,477 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:57:49,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,478 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,479 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:57:49,480 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:57:49,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,492 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,493 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:57:49,494 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:57:49,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,495 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,496 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:57:49,496 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:57:49,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,497 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,497 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 02:57:49,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,498 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:57:49,499 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:57:49,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,499 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,501 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:57:49,501 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:57:49,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,502 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,503 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:57:49,503 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:57:49,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,504 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,505 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:57:49,506 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:57:49,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,506 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,508 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:57:49,509 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:57:49,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,520 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,521 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:57:49,522 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:57:49,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,523 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,524 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:57:49,524 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:57:49,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,525 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,525 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 02:57:49,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,526 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:57:49,527 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:57:49,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,528 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,529 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:57:49,529 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:57:49,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,530 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,532 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:57:49,532 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:57:49,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,533 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,534 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:57:49,535 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:57:49,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,535 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,537 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:57:49,538 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:57:49,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,549 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,551 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:57:49,551 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:57:49,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,552 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:49,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,553 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:57:49,553 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:57:49,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,554 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,554 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 02:57:49,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,555 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,555 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:57:49,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,556 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:57:49,556 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:57:49,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,557 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,558 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,558 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:57:49,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,558 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:57:49,559 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:57:49,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,560 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,560 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,560 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:57:49,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,561 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:57:49,561 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:57:49,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,562 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,563 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,563 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:57:49,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,564 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:57:49,564 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:57:49,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,565 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,566 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,566 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:57:49,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,566 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:57:49,569 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:57:49,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,594 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,595 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,595 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:57:49,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,595 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:57:49,596 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:57:49,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,597 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,598 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,598 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:57:49,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,599 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:57:49,599 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:57:49,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,600 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,600 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 02:57:49,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,601 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,601 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:57:49,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,602 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:57:49,602 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:57:49,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,604 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,605 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,605 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:57:49,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,605 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:57:49,606 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:57:49,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,607 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,608 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,608 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:57:49,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,608 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:57:49,609 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:57:49,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,611 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,611 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,612 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:57:49,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,612 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:57:49,613 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:57:49,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,614 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,615 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,615 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:57:49,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,616 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:57:49,618 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:57:49,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,664 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,665 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,665 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:57:49,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,666 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:57:49,667 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:57:49,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,668 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,669 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,669 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:57:49,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,669 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:57:49,670 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:57:49,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,671 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,671 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 02:57:49,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,672 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,672 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:57:49,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,673 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:57:49,674 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:57:49,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,675 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,675 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,676 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:57:49,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,676 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:57:49,677 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:57:49,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,678 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,679 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,679 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:57:49,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,679 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:57:49,680 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:57:49,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,681 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,682 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,682 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:57:49,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,682 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:57:49,683 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:57:49,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,684 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,685 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,685 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:57:49,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,685 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:57:49,689 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:57:49,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,757 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,758 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,761 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:57:49,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,761 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:57:49,762 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:57:49,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,763 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,764 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,764 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:57:49,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,764 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:57:49,765 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:57:49,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,766 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,766 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 02:57:49,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,774 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,774 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:57:49,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,774 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:57:49,775 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:57:49,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,777 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,777 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,777 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:57:49,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,778 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:57:49,778 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:57:49,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,780 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,781 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,781 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:57:49,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,781 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:57:49,782 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:57:49,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,784 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,784 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,785 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:57:49,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,785 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:57:49,785 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:57:49,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,787 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,788 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,788 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:57:49,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,788 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:57:49,789 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:57:49,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,800 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,801 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,801 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:57:49,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,802 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:57:49,802 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:57:49,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,804 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,805 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,805 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:57:49,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,805 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:57:49,806 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:57:49,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,808 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,808 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 02:57:49,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,809 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,809 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:57:49,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,809 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:57:49,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:57:49,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,813 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,814 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,814 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:57:49,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,814 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:57:49,815 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:57:49,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,817 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,818 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,818 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:57:49,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,819 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:57:49,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:57:49,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,822 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,823 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,823 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:57:49,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,823 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:57:49,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:57:49,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,826 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,827 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,827 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:57:49,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,828 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:57:49,830 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:57:49,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,857 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,857 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,858 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:57:49,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,858 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:57:49,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:57:49,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,861 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:49,862 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:57:49,862 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:57:49,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:49,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:49,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:49,862 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:57:49,863 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:57:49,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:49,866 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:49,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 02:57:49,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:57:49,866 INFO L87 Difference]: Start difference. First operand 36 states and 56 transitions. cyclomatic complexity: 22 Second operand 4 states. [2018-11-10 02:57:49,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:57:49,917 INFO L93 Difference]: Finished difference Result 38 states and 57 transitions. [2018-11-10 02:57:49,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:57:49,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 57 transitions. [2018-11-10 02:57:49,919 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2018-11-10 02:57:49,920 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 57 transitions. [2018-11-10 02:57:49,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-10 02:57:49,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-10 02:57:49,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 57 transitions. [2018-11-10 02:57:49,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:57:49,921 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 57 transitions. [2018-11-10 02:57:49,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 57 transitions. [2018-11-10 02:57:49,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-11-10 02:57:49,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-10 02:57:49,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 51 transitions. [2018-11-10 02:57:49,958 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 51 transitions. [2018-11-10 02:57:49,959 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 51 transitions. [2018-11-10 02:57:49,959 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 02:57:49,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 51 transitions. [2018-11-10 02:57:49,960 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-10 02:57:49,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:57:49,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:57:49,961 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 02:57:49,961 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:57:49,961 INFO L793 eck$LassoCheckResult]: Stem: 1094#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1085#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 1086#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 1066#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 1067#L41-4 [2018-11-10 02:57:49,961 INFO L795 eck$LassoCheckResult]: Loop: 1067#L41-4 assume true; 1090#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 1068#L42-4 assume true; 1069#L42-1 assume !!(main_~k~0 <= main_~x~0); 1084#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 1078#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 1092#factENTRY ~n := #in~n; 1087#L25 assume !(~n <= 0); 1072#L26 call #t~ret0 := fact(~n - 1);< 1092#factENTRY ~n := #in~n; 1087#L25 assume ~n <= 0;#res := 1; 1088#factFINAL assume true; 1070#factEXIT >#68#return; 1080#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1096#factFINAL assume true; 1099#factEXIT >#70#return; 1075#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 1092#factENTRY ~n := #in~n; 1087#L25 assume ~n <= 0;#res := 1; 1088#factFINAL assume true; 1070#factEXIT >#72#return; 1076#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 1092#factENTRY ~n := #in~n; 1087#L25 assume !(~n <= 0); 1072#L26 call #t~ret0 := fact(~n - 1);< 1092#factENTRY ~n := #in~n; 1087#L25 assume ~n <= 0;#res := 1; 1088#factFINAL assume true; 1070#factEXIT >#68#return; 1080#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1096#factFINAL assume true; 1099#factEXIT >#74#return; 1081#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 1089#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 1082#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 1083#L42-4 assume true; 1098#L42-1 assume !(main_~k~0 <= main_~x~0); 1091#L41-3 main_#t~post7 := main_~n~0;main_~n~0 := main_#t~post7 + 1;havoc main_#t~post7; 1067#L41-4 [2018-11-10 02:57:49,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:49,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 7 times [2018-11-10 02:57:49,962 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:49,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:49,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:49,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:49,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:49,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:49,970 INFO L82 PathProgramCache]: Analyzing trace with hash 746561016, now seen corresponding path program 2 times [2018-11-10 02:57:49,970 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:49,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:49,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:49,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:49,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:49,973 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:57:49,973 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:57:49,973 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:57:49,994 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 02:57:50,007 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 02:57:50,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 02:57:50,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:50,057 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 02:57:50,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:57:50,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-10 02:57:50,084 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:57:50,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 02:57:50,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-10 02:57:50,084 INFO L87 Difference]: Start difference. First operand 34 states and 51 transitions. cyclomatic complexity: 19 Second operand 8 states. [2018-11-10 02:57:50,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:57:50,368 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2018-11-10 02:57:50,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 02:57:50,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 91 transitions. [2018-11-10 02:57:50,370 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 48 [2018-11-10 02:57:50,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 91 transitions. [2018-11-10 02:57:50,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2018-11-10 02:57:50,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2018-11-10 02:57:50,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 91 transitions. [2018-11-10 02:57:50,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:57:50,372 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 91 transitions. [2018-11-10 02:57:50,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 91 transitions. [2018-11-10 02:57:50,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2018-11-10 02:57:50,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 02:57:50,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2018-11-10 02:57:50,379 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 61 transitions. [2018-11-10 02:57:50,379 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 61 transitions. [2018-11-10 02:57:50,379 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 02:57:50,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 61 transitions. [2018-11-10 02:57:50,380 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2018-11-10 02:57:50,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:57:50,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:57:50,380 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 02:57:50,380 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:57:50,380 INFO L793 eck$LassoCheckResult]: Stem: 1320#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1308#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 1309#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 1285#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 1286#L41-4 [2018-11-10 02:57:50,380 INFO L795 eck$LassoCheckResult]: Loop: 1286#L41-4 assume true; 1315#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 1318#L42-4 assume true; 1306#L42-1 assume !!(main_~k~0 <= main_~x~0); 1307#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 1296#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 1317#factENTRY ~n := #in~n; 1310#L25 assume ~n <= 0;#res := 1; 1311#factFINAL assume true; 1312#factEXIT >#70#return; 1300#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 1317#factENTRY ~n := #in~n; 1310#L25 assume ~n <= 0;#res := 1; 1311#factFINAL assume true; 1312#factEXIT >#72#return; 1299#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 1317#factENTRY ~n := #in~n; 1310#L25 assume ~n <= 0;#res := 1; 1311#factFINAL assume true; 1312#factEXIT >#74#return; 1304#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 1313#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 1314#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 1324#L42-4 assume true; 1322#L42-1 assume !(main_~k~0 <= main_~x~0); 1316#L41-3 main_#t~post7 := main_~n~0;main_~n~0 := main_#t~post7 + 1;havoc main_#t~post7; 1286#L41-4 [2018-11-10 02:57:50,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:50,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 8 times [2018-11-10 02:57:50,381 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:50,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:50,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:50,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:57:50,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:50,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:50,389 INFO L82 PathProgramCache]: Analyzing trace with hash 781966320, now seen corresponding path program 1 times [2018-11-10 02:57:50,389 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:50,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:50,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:50,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:57:50,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:50,394 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:57:50,394 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:57:50,394 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:57:50,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:50,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:50,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1129093911, now seen corresponding path program 1 times [2018-11-10 02:57:50,447 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:50,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:50,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:50,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:50,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:50,450 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:57:50,451 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:57:50,451 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:57:50,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:50,673 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:57:50,673 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:57:50,673 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:57:50,673 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:57:50,673 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:57:50,673 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:50,673 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:57:50,673 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:57:50,673 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration8_Loop [2018-11-10 02:57:50,674 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:57:50,674 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:57:50,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:50,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:50,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:50,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:50,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:50,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:50,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:50,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:50,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:50,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:50,761 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:57:50,762 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:50,768 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:50,768 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:50,770 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:57:50,771 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:50,797 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:50,797 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:50,803 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:57:50,803 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:50,825 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:50,825 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:50,851 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:57:50,851 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#res=1} Honda state: {ULTIMATE.start_binomialCoefficient_#res=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:50,856 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:50,856 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:50,858 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:57:50,858 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7=0} Honda state: {ULTIMATE.start_main_#t~post7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:50,878 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:50,878 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:50,904 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:57:50,904 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:51,190 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 02:57:51,191 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:57:51,191 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:57:51,192 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:57:51,192 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:57:51,192 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:57:51,192 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:51,192 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:57:51,192 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:57:51,192 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration8_Loop [2018-11-10 02:57:51,192 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:57:51,192 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:57:51,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:51,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:51,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:51,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:51,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:51,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:51,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:51,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:51,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:51,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:51,287 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:57:51,287 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:57:51,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:51,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:51,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:51,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:51,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:51,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:51,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:51,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:51,290 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:51,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:51,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:51,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:51,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:51,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:51,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:51,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:51,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:51,292 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:51,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:51,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:51,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:51,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:51,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:51,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:51,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:51,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:51,294 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:51,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:51,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:51,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:51,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:51,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:51,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:51,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:51,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:51,296 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:51,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:51,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:51,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:51,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:51,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:51,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:51,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:51,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:51,299 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:57:51,301 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 02:57:51,301 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 02:57:51,301 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:57:51,301 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 02:57:51,301 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:57:51,301 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 1 Supporting invariants [] [2018-11-10 02:57:51,302 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 02:57:51,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:51,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:51,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:51,420 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 02:57:51,421 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 02:57:51,421 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 61 transitions. cyclomatic complexity: 22 Second operand 8 states. [2018-11-10 02:57:51,639 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 61 transitions. cyclomatic complexity: 22. Second operand 8 states. Result 143 states and 214 transitions. Complement of second has 26 states. [2018-11-10 02:57:51,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 02:57:51,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 02:57:51,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2018-11-10 02:57:51,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 75 transitions. Stem has 4 letters. Loop has 26 letters. [2018-11-10 02:57:51,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:51,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 75 transitions. Stem has 30 letters. Loop has 26 letters. [2018-11-10 02:57:51,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:51,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 75 transitions. Stem has 4 letters. Loop has 52 letters. [2018-11-10 02:57:51,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:51,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 214 transitions. [2018-11-10 02:57:51,647 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 45 [2018-11-10 02:57:51,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 142 states and 213 transitions. [2018-11-10 02:57:51,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2018-11-10 02:57:51,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2018-11-10 02:57:51,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 213 transitions. [2018-11-10 02:57:51,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:57:51,651 INFO L705 BuchiCegarLoop]: Abstraction has 142 states and 213 transitions. [2018-11-10 02:57:51,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 213 transitions. [2018-11-10 02:57:51,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 137. [2018-11-10 02:57:51,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-10 02:57:51,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 204 transitions. [2018-11-10 02:57:51,665 INFO L728 BuchiCegarLoop]: Abstraction has 137 states and 204 transitions. [2018-11-10 02:57:51,665 INFO L608 BuchiCegarLoop]: Abstraction has 137 states and 204 transitions. [2018-11-10 02:57:51,665 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 02:57:51,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 204 transitions. [2018-11-10 02:57:51,667 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 45 [2018-11-10 02:57:51,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:57:51,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:57:51,668 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 02:57:51,668 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [11, 11, 6, 5, 5, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:57:51,668 INFO L793 eck$LassoCheckResult]: Stem: 1676#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1638#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 1639#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 1616#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 1617#L41-4 assume true; 1658#L41-1 [2018-11-10 02:57:51,669 INFO L795 eck$LassoCheckResult]: Loop: 1658#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 1612#L42-4 assume true; 1613#L42-1 assume !!(main_~k~0 <= main_~x~0); 1635#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 1640#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 1667#factENTRY ~n := #in~n; 1727#L25 assume !(~n <= 0); 1621#L26 call #t~ret0 := fact(~n - 1);< 1675#factENTRY ~n := #in~n; 1644#L25 assume ~n <= 0;#res := 1; 1642#factFINAL assume true; 1618#factEXIT >#68#return; 1622#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1708#factFINAL assume true; 1702#factEXIT >#70#return; 1669#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 1667#factENTRY ~n := #in~n; 1727#L25 assume ~n <= 0;#res := 1; 1726#factFINAL assume true; 1725#factEXIT >#72#return; 1666#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 1667#factENTRY ~n := #in~n; 1727#L25 assume !(~n <= 0); 1621#L26 call #t~ret0 := fact(~n - 1);< 1675#factENTRY ~n := #in~n; 1644#L25 assume ~n <= 0;#res := 1; 1642#factFINAL assume true; 1618#factEXIT >#68#return; 1622#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1708#factFINAL assume true; 1702#factEXIT >#74#return; 1661#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 1655#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 1632#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 1633#L42-4 assume true; 1701#L42-1 assume !!(main_~k~0 <= main_~x~0); 1688#L43 assume !(main_~k~0 <= main_~n~0);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~k~0, main_~n~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 1699#L30-5 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 1667#factENTRY ~n := #in~n; 1727#L25 assume !(~n <= 0); 1621#L26 call #t~ret0 := fact(~n - 1);< 1675#factENTRY ~n := #in~n; 1644#L25 assume ~n <= 0;#res := 1; 1642#factFINAL assume true; 1618#factEXIT >#68#return; 1622#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1708#factFINAL assume true; 1702#factEXIT >#76#return; 1683#L30-6 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 1667#factENTRY ~n := #in~n; 1727#L25 assume !(~n <= 0); 1621#L26 call #t~ret0 := fact(~n - 1);< 1675#factENTRY ~n := #in~n; 1644#L25 assume ~n <= 0;#res := 1; 1642#factFINAL assume true; 1618#factEXIT >#68#return; 1622#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1708#factFINAL assume true; 1702#factEXIT >#78#return; 1681#L30-7 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 1667#factENTRY ~n := #in~n; 1727#L25 assume !(~n <= 0); 1621#L26 call #t~ret0 := fact(~n - 1);< 1675#factENTRY ~n := #in~n; 1644#L25 assume ~n <= 0;#res := 1; 1642#factFINAL assume true; 1618#factEXIT >#68#return; 1622#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1708#factFINAL assume true; 1702#factEXIT >#80#return; 1677#L30-8 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 1678#L30-9 main_#t~ret10 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10; 1690#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 1689#L42-4 assume true; 1687#L42-1 assume !(main_~k~0 <= main_~x~0); 1663#L41-3 main_#t~post7 := main_~n~0;main_~n~0 := main_#t~post7 + 1;havoc main_#t~post7; 1657#L41-4 assume true; 1658#L41-1 [2018-11-10 02:57:51,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:51,669 INFO L82 PathProgramCache]: Analyzing trace with hash 36330288, now seen corresponding path program 1 times [2018-11-10 02:57:51,669 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:51,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:51,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:51,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:51,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:51,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:51,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1090998746, now seen corresponding path program 1 times [2018-11-10 02:57:51,673 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:51,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:51,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:51,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:51,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:51,676 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:57:51,676 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:57:51,676 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:57:51,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:51,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:51,763 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 139 proven. 15 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 02:57:51,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:57:51,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-10 02:57:51,791 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:57:51,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 02:57:51,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-10 02:57:51,792 INFO L87 Difference]: Start difference. First operand 137 states and 204 transitions. cyclomatic complexity: 72 Second operand 8 states. [2018-11-10 02:57:51,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:57:51,960 INFO L93 Difference]: Finished difference Result 173 states and 268 transitions. [2018-11-10 02:57:51,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 02:57:51,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 173 states and 268 transitions. [2018-11-10 02:57:51,964 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 52 [2018-11-10 02:57:51,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 173 states to 173 states and 268 transitions. [2018-11-10 02:57:51,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2018-11-10 02:57:51,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2018-11-10 02:57:51,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 173 states and 268 transitions. [2018-11-10 02:57:51,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:57:51,968 INFO L705 BuchiCegarLoop]: Abstraction has 173 states and 268 transitions. [2018-11-10 02:57:51,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 268 transitions. [2018-11-10 02:57:51,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 139. [2018-11-10 02:57:51,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-10 02:57:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 206 transitions. [2018-11-10 02:57:51,978 INFO L728 BuchiCegarLoop]: Abstraction has 139 states and 206 transitions. [2018-11-10 02:57:51,978 INFO L608 BuchiCegarLoop]: Abstraction has 139 states and 206 transitions. [2018-11-10 02:57:51,978 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 02:57:51,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 206 transitions. [2018-11-10 02:57:51,980 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 46 [2018-11-10 02:57:51,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:57:51,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:57:51,981 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 02:57:51,981 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-10 02:57:51,981 INFO L793 eck$LassoCheckResult]: Stem: 2245#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2189#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 2190#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 2169#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 2170#L41-4 assume true; 2229#L41-1 [2018-11-10 02:57:51,981 INFO L795 eck$LassoCheckResult]: Loop: 2229#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 2239#L42-4 assume true; 2287#L42-1 assume !!(main_~k~0 <= main_~x~0); 2281#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 2194#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 2237#factENTRY ~n := #in~n; 2286#L25 assume !(~n <= 0); 2173#L26 call #t~ret0 := fact(~n - 1);< 2243#factENTRY ~n := #in~n; 2212#L25 assume ~n <= 0;#res := 1; 2213#factFINAL assume true; 2171#factEXIT >#68#return; 2177#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2193#factFINAL assume true; 2202#factEXIT >#70#return; 2200#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 2237#factENTRY ~n := #in~n; 2286#L25 assume ~n <= 0;#res := 1; 2285#factFINAL assume true; 2280#factEXIT >#72#return; 2201#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 2237#factENTRY ~n := #in~n; 2286#L25 assume ~n <= 0;#res := 1; 2285#factFINAL assume true; 2280#factEXIT >#74#return; 2260#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 2289#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 2185#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 2165#L42-4 assume true; 2166#L42-1 assume !!(main_~k~0 <= main_~x~0); 2187#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 2191#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 2237#factENTRY ~n := #in~n; 2286#L25 assume !(~n <= 0); 2173#L26 call #t~ret0 := fact(~n - 1);< 2243#factENTRY ~n := #in~n; 2212#L25 assume ~n <= 0;#res := 1; 2213#factFINAL assume true; 2171#factEXIT >#68#return; 2177#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2193#factFINAL assume true; 2202#factEXIT >#70#return; 2196#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 2237#factENTRY ~n := #in~n; 2286#L25 assume ~n <= 0;#res := 1; 2285#factFINAL assume true; 2280#factEXIT >#72#return; 2197#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 2237#factENTRY ~n := #in~n; 2286#L25 assume ~n <= 0;#res := 1; 2285#factFINAL assume true; 2280#factEXIT >#74#return; 2257#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 2256#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 2255#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 2254#L42-4 assume true; 2252#L42-1 assume !(main_~k~0 <= main_~x~0); 2234#L41-3 main_#t~post7 := main_~n~0;main_~n~0 := main_#t~post7 + 1;havoc main_#t~post7; 2228#L41-4 assume true; 2229#L41-1 [2018-11-10 02:57:51,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:51,981 INFO L82 PathProgramCache]: Analyzing trace with hash 36330288, now seen corresponding path program 2 times [2018-11-10 02:57:51,981 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:51,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:51,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:51,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:51,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:51,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:51,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1360175974, now seen corresponding path program 3 times [2018-11-10 02:57:51,985 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:51,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:51,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:51,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:57:51,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:51,988 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:57:51,988 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:57:51,988 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:57:52,000 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 02:57:52,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 02:57:52,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 02:57:52,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:52,062 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 02:57:52,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:57:52,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 02:57:52,080 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:57:52,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 02:57:52,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 02:57:52,080 INFO L87 Difference]: Start difference. First operand 139 states and 206 transitions. cyclomatic complexity: 72 Second operand 7 states. [2018-11-10 02:57:52,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:57:52,171 INFO L93 Difference]: Finished difference Result 191 states and 264 transitions. [2018-11-10 02:57:52,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 02:57:52,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 264 transitions. [2018-11-10 02:57:52,174 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 60 [2018-11-10 02:57:52,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 179 states and 252 transitions. [2018-11-10 02:57:52,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2018-11-10 02:57:52,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2018-11-10 02:57:52,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 252 transitions. [2018-11-10 02:57:52,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:57:52,177 INFO L705 BuchiCegarLoop]: Abstraction has 179 states and 252 transitions. [2018-11-10 02:57:52,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 252 transitions. [2018-11-10 02:57:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 163. [2018-11-10 02:57:52,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-10 02:57:52,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 231 transitions. [2018-11-10 02:57:52,189 INFO L728 BuchiCegarLoop]: Abstraction has 163 states and 231 transitions. [2018-11-10 02:57:52,189 INFO L608 BuchiCegarLoop]: Abstraction has 163 states and 231 transitions. [2018-11-10 02:57:52,189 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 02:57:52,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 231 transitions. [2018-11-10 02:57:52,191 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 56 [2018-11-10 02:57:52,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:57:52,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:57:52,191 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 02:57:52,192 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 9, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-10 02:57:52,192 INFO L793 eck$LassoCheckResult]: Stem: 2755#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2714#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 2715#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 2690#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 2691#L41-4 assume true; 2737#L41-1 [2018-11-10 02:57:52,192 INFO L795 eck$LassoCheckResult]: Loop: 2737#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 2750#L42-4 assume true; 2792#L42-1 assume !!(main_~k~0 <= main_~x~0); 2791#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 2776#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 2746#factENTRY ~n := #in~n; 2790#L25 assume !(~n <= 0); 2694#L26 call #t~ret0 := fact(~n - 1);< 2754#factENTRY ~n := #in~n; 2731#L25 assume ~n <= 0;#res := 1; 2720#factFINAL assume true; 2692#factEXIT >#68#return; 2698#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2774#factFINAL assume true; 2779#factEXIT >#70#return; 2775#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 2746#factENTRY ~n := #in~n; 2790#L25 assume ~n <= 0;#res := 1; 2789#factFINAL assume true; 2786#factEXIT >#72#return; 2777#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 2746#factENTRY ~n := #in~n; 2790#L25 assume !(~n <= 0); 2694#L26 call #t~ret0 := fact(~n - 1);< 2754#factENTRY ~n := #in~n; 2731#L25 assume ~n <= 0;#res := 1; 2720#factFINAL assume true; 2692#factEXIT >#68#return; 2698#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2774#factFINAL assume true; 2779#factEXIT >#74#return; 2782#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 2781#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 2780#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 2773#L42-4 assume true; 2772#L42-1 assume !!(main_~k~0 <= main_~x~0); 2716#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 2717#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 2746#factENTRY ~n := #in~n; 2790#L25 assume !(~n <= 0); 2694#L26 call #t~ret0 := fact(~n - 1);< 2754#factENTRY ~n := #in~n; 2731#L25 assume ~n <= 0;#res := 1; 2720#factFINAL assume true; 2692#factEXIT >#68#return; 2698#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2774#factFINAL assume true; 2779#factEXIT >#70#return; 2778#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 2746#factENTRY ~n := #in~n; 2790#L25 assume ~n <= 0;#res := 1; 2789#factFINAL assume true; 2786#factEXIT >#72#return; 2745#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 2746#factENTRY ~n := #in~n; 2790#L25 assume ~n <= 0;#res := 1; 2789#factFINAL assume true; 2786#factEXIT >#74#return; 2787#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 2733#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 2706#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 2686#L42-4 assume true; 2687#L42-1 assume !(main_~k~0 <= main_~x~0); 2709#L41-3 main_#t~post7 := main_~n~0;main_~n~0 := main_#t~post7 + 1;havoc main_#t~post7; 2736#L41-4 assume true; 2737#L41-1 [2018-11-10 02:57:52,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:52,192 INFO L82 PathProgramCache]: Analyzing trace with hash 36330288, now seen corresponding path program 3 times [2018-11-10 02:57:52,192 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:52,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:52,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:52,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:57:52,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:52,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:52,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1708854242, now seen corresponding path program 4 times [2018-11-10 02:57:52,196 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:52,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:52,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:52,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:57:52,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:52,199 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:57:52,199 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:57:52,199 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:57:52,219 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 02:57:52,236 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 02:57:52,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 02:57:52,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:52,292 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 64 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-10 02:57:52,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:57:52,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-10 02:57:52,310 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:57:52,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 02:57:52,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 02:57:52,310 INFO L87 Difference]: Start difference. First operand 163 states and 231 transitions. cyclomatic complexity: 74 Second operand 7 states. [2018-11-10 02:57:52,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:57:52,414 INFO L93 Difference]: Finished difference Result 219 states and 298 transitions. [2018-11-10 02:57:52,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 02:57:52,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 219 states and 298 transitions. [2018-11-10 02:57:52,417 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 66 [2018-11-10 02:57:52,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 219 states to 219 states and 298 transitions. [2018-11-10 02:57:52,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 110 [2018-11-10 02:57:52,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2018-11-10 02:57:52,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 219 states and 298 transitions. [2018-11-10 02:57:52,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:57:52,422 INFO L705 BuchiCegarLoop]: Abstraction has 219 states and 298 transitions. [2018-11-10 02:57:52,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states and 298 transitions. [2018-11-10 02:57:52,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 163. [2018-11-10 02:57:52,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-10 02:57:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 227 transitions. [2018-11-10 02:57:52,431 INFO L728 BuchiCegarLoop]: Abstraction has 163 states and 227 transitions. [2018-11-10 02:57:52,431 INFO L608 BuchiCegarLoop]: Abstraction has 163 states and 227 transitions. [2018-11-10 02:57:52,431 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 02:57:52,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 227 transitions. [2018-11-10 02:57:52,432 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 56 [2018-11-10 02:57:52,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:57:52,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:57:52,433 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 02:57:52,433 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [11, 11, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-10 02:57:52,433 INFO L793 eck$LassoCheckResult]: Stem: 3344#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3302#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 3303#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 3280#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 3281#L41-4 assume true; 3325#L41-1 [2018-11-10 02:57:52,433 INFO L795 eck$LassoCheckResult]: Loop: 3325#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 3338#L42-4 assume true; 3408#L42-1 assume !!(main_~k~0 <= main_~x~0); 3304#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 3305#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 3332#factENTRY ~n := #in~n; 3420#L25 assume !(~n <= 0); 3283#L26 call #t~ret0 := fact(~n - 1);< 3353#factENTRY ~n := #in~n; 3384#L25 assume ~n <= 0;#res := 1; 3350#factFINAL assume true; 3282#factEXIT >#68#return; 3286#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3367#factFINAL assume true; 3372#factEXIT >#70#return; 3369#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 3332#factENTRY ~n := #in~n; 3420#L25 assume ~n <= 0;#res := 1; 3419#factFINAL assume true; 3417#factEXIT >#72#return; 3370#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 3332#factENTRY ~n := #in~n; 3420#L25 assume !(~n <= 0); 3283#L26 call #t~ret0 := fact(~n - 1);< 3353#factENTRY ~n := #in~n; 3384#L25 assume ~n <= 0;#res := 1; 3350#factFINAL assume true; 3282#factEXIT >#68#return; 3286#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3367#factFINAL assume true; 3372#factEXIT >#74#return; 3415#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 3414#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 3413#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 3411#L42-4 assume true; 3410#L42-1 assume !!(main_~k~0 <= main_~x~0); 3405#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 3368#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 3332#factENTRY ~n := #in~n; 3420#L25 assume !(~n <= 0); 3283#L26 call #t~ret0 := fact(~n - 1);< 3353#factENTRY ~n := #in~n; 3384#L25 assume ~n <= 0;#res := 1; 3350#factFINAL assume true; 3282#factEXIT >#68#return; 3286#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3367#factFINAL assume true; 3372#factEXIT >#70#return; 3371#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 3332#factENTRY ~n := #in~n; 3420#L25 assume !(~n <= 0); 3283#L26 call #t~ret0 := fact(~n - 1);< 3353#factENTRY ~n := #in~n; 3384#L25 assume ~n <= 0;#res := 1; 3350#factFINAL assume true; 3282#factEXIT >#68#return; 3286#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3367#factFINAL assume true; 3372#factEXIT >#72#return; 3331#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 3332#factENTRY ~n := #in~n; 3420#L25 assume !(~n <= 0); 3283#L26 call #t~ret0 := fact(~n - 1);< 3353#factENTRY ~n := #in~n; 3384#L25 assume ~n <= 0;#res := 1; 3350#factFINAL assume true; 3282#factEXIT >#68#return; 3286#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3367#factFINAL assume true; 3372#factEXIT >#74#return; 3416#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 3425#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 3424#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 3423#L42-4 assume true; 3422#L42-1 assume !(main_~k~0 <= main_~x~0); 3330#L41-3 main_#t~post7 := main_~n~0;main_~n~0 := main_#t~post7 + 1;havoc main_#t~post7; 3324#L41-4 assume true; 3325#L41-1 [2018-11-10 02:57:52,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:52,434 INFO L82 PathProgramCache]: Analyzing trace with hash 36330288, now seen corresponding path program 4 times [2018-11-10 02:57:52,434 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:52,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:52,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:52,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:57:52,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:52,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:52,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1138602078, now seen corresponding path program 5 times [2018-11-10 02:57:52,442 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:52,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:52,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:52,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:57:52,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:52,445 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:57:52,445 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:57:52,445 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:57:52,457 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 02:57:52,484 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-10 02:57:52,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 02:57:52,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:52,583 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 55 proven. 72 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-10 02:57:52,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:57:52,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-10 02:57:52,600 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:57:52,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 02:57:52,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-10 02:57:52,601 INFO L87 Difference]: Start difference. First operand 163 states and 227 transitions. cyclomatic complexity: 70 Second operand 11 states. [2018-11-10 02:57:52,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:57:52,958 INFO L93 Difference]: Finished difference Result 351 states and 521 transitions. [2018-11-10 02:57:52,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 02:57:52,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 351 states and 521 transitions. [2018-11-10 02:57:52,962 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 102 [2018-11-10 02:57:52,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 351 states to 347 states and 509 transitions. [2018-11-10 02:57:52,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 173 [2018-11-10 02:57:52,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 173 [2018-11-10 02:57:52,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 347 states and 509 transitions. [2018-11-10 02:57:52,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:57:52,966 INFO L705 BuchiCegarLoop]: Abstraction has 347 states and 509 transitions. [2018-11-10 02:57:52,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states and 509 transitions. [2018-11-10 02:57:52,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 241. [2018-11-10 02:57:52,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-10 02:57:52,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 365 transitions. [2018-11-10 02:57:52,977 INFO L728 BuchiCegarLoop]: Abstraction has 241 states and 365 transitions. [2018-11-10 02:57:52,977 INFO L608 BuchiCegarLoop]: Abstraction has 241 states and 365 transitions. [2018-11-10 02:57:52,977 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 02:57:52,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 241 states and 365 transitions. [2018-11-10 02:57:52,978 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 60 [2018-11-10 02:57:52,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:57:52,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:57:52,982 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:57:52,982 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 02:57:52,983 INFO L793 eck$LassoCheckResult]: Stem: 4130#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4091#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 4092#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 4051#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 4052#L41-4 assume true; 4145#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 4281#L42-4 assume true; 4279#L42-1 assume !!(main_~k~0 <= main_~x~0); 4271#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 4135#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 4123#factENTRY ~n := #in~n; 4252#L25 assume ~n <= 0;#res := 1; 4229#factFINAL assume true; 4239#factEXIT >#70#return; 4217#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 4250#factENTRY ~n := #in~n; 4240#L25 assume !(~n <= 0); 4058#L26 call #t~ret0 := fact(~n - 1);< 4262#factENTRY [2018-11-10 02:57:52,983 INFO L795 eck$LassoCheckResult]: Loop: 4262#factENTRY ~n := #in~n; 4228#L25 assume !(~n <= 0); 4059#L26 call #t~ret0 := fact(~n - 1);< 4262#factENTRY [2018-11-10 02:57:52,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:52,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1675379976, now seen corresponding path program 1 times [2018-11-10 02:57:52,983 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:52,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:52,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:52,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:57:52,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:53,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:57:53,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:57:53,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 02:57:53,005 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:57:53,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:53,005 INFO L82 PathProgramCache]: Analyzing trace with hash 29982, now seen corresponding path program 1 times [2018-11-10 02:57:53,005 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:53,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:53,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:53,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:53,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:53,024 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:57:53,025 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:57:53,025 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:57:53,025 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:57:53,025 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:57:53,025 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:53,025 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:57:53,025 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:57:53,025 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration13_Loop [2018-11-10 02:57:53,025 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:57:53,025 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:57:53,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:53,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:53,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:53,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:53,052 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:57:53,052 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:53,060 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:53,060 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:53,062 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:57:53,062 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#res=0} Honda state: {fact_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:53,092 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:53,093 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:53,094 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:57:53,094 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_~n=0} Honda state: {fact_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:53,113 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:53,113 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:53,134 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:57:53,135 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:53,153 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 02:57:53,154 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:57:53,155 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:57:53,155 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:57:53,155 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:57:53,155 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:57:53,155 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:53,155 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:57:53,155 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:57:53,155 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration13_Loop [2018-11-10 02:57:53,155 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:57:53,155 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:57:53,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:53,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:53,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:53,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:53,176 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:57:53,176 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:57:53,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:53,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:53,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:53,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:53,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:53,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:53,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:53,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:53,177 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:53,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:53,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:53,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:53,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:53,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:53,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:53,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:53,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:53,178 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:53,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:53,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:53,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:53,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:53,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:53,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:53,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:53,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:53,180 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:57:53,181 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 02:57:53,181 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 02:57:53,182 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:57:53,182 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 02:57:53,182 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:57:53,182 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2018-11-10 02:57:53,182 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 02:57:53,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:53,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:53,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:53,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:57:53,246 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 02:57:53,246 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 241 states and 365 transitions. cyclomatic complexity: 129 Second operand 5 states. [2018-11-10 02:57:53,340 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 241 states and 365 transitions. cyclomatic complexity: 129. Second operand 5 states. Result 343 states and 517 transitions. Complement of second has 13 states. [2018-11-10 02:57:53,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:57:53,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 02:57:53,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-10 02:57:53,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-10 02:57:53,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:53,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 21 letters. Loop has 3 letters. [2018-11-10 02:57:53,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:53,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 18 letters. Loop has 6 letters. [2018-11-10 02:57:53,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:53,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 343 states and 517 transitions. [2018-11-10 02:57:53,347 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 60 [2018-11-10 02:57:53,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 343 states to 329 states and 501 transitions. [2018-11-10 02:57:53,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 157 [2018-11-10 02:57:53,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2018-11-10 02:57:53,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 329 states and 501 transitions. [2018-11-10 02:57:53,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:57:53,352 INFO L705 BuchiCegarLoop]: Abstraction has 329 states and 501 transitions. [2018-11-10 02:57:53,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states and 501 transitions. [2018-11-10 02:57:53,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 323. [2018-11-10 02:57:53,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-11-10 02:57:53,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 491 transitions. [2018-11-10 02:57:53,363 INFO L728 BuchiCegarLoop]: Abstraction has 323 states and 491 transitions. [2018-11-10 02:57:53,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 02:57:53,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 02:57:53,364 INFO L87 Difference]: Start difference. First operand 323 states and 491 transitions. Second operand 6 states. [2018-11-10 02:57:53,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:57:53,411 INFO L93 Difference]: Finished difference Result 369 states and 533 transitions. [2018-11-10 02:57:53,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 02:57:53,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 369 states and 533 transitions. [2018-11-10 02:57:53,415 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 60 [2018-11-10 02:57:53,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 369 states to 369 states and 533 transitions. [2018-11-10 02:57:53,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 181 [2018-11-10 02:57:53,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 181 [2018-11-10 02:57:53,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 369 states and 533 transitions. [2018-11-10 02:57:53,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:57:53,418 INFO L705 BuchiCegarLoop]: Abstraction has 369 states and 533 transitions. [2018-11-10 02:57:53,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states and 533 transitions. [2018-11-10 02:57:53,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 347. [2018-11-10 02:57:53,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-11-10 02:57:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 509 transitions. [2018-11-10 02:57:53,426 INFO L728 BuchiCegarLoop]: Abstraction has 347 states and 509 transitions. [2018-11-10 02:57:53,426 INFO L608 BuchiCegarLoop]: Abstraction has 347 states and 509 transitions. [2018-11-10 02:57:53,426 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 02:57:53,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 347 states and 509 transitions. [2018-11-10 02:57:53,428 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 60 [2018-11-10 02:57:53,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:57:53,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:57:53,430 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:57:53,430 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [14, 14, 8, 8, 8, 8, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-10 02:57:53,430 INFO L793 eck$LassoCheckResult]: Stem: 5495#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5452#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 5453#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 5436#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 5437#L41-4 assume true; 5693#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 5691#L42-4 assume true; 5689#L42-1 assume !!(main_~k~0 <= main_~x~0); 5454#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 5455#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 5567#factENTRY ~n := #in~n; 5632#L25 assume !(~n <= 0); 5570#L26 call #t~ret0 := fact(~n - 1);< 5574#factENTRY ~n := #in~n; 5595#L25 assume ~n <= 0;#res := 1; 5669#factFINAL assume true; 5569#factEXIT >#68#return; 5568#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5566#factFINAL assume true; 5565#factEXIT >#70#return; 5440#L30-1 [2018-11-10 02:57:53,430 INFO L795 eck$LassoCheckResult]: Loop: 5440#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 5481#factENTRY ~n := #in~n; 5458#L25 assume ~n <= 0;#res := 1; 5459#factFINAL assume true; 5438#factEXIT >#72#return; 5442#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 5560#factENTRY ~n := #in~n; 5612#L25 assume !(~n <= 0); 5585#L26 call #t~ret0 := fact(~n - 1);< 5603#factENTRY ~n := #in~n; 5605#L25 assume !(~n <= 0); 5584#L26 call #t~ret0 := fact(~n - 1);< 5603#factENTRY ~n := #in~n; 5605#L25 assume !(~n <= 0); 5584#L26 call #t~ret0 := fact(~n - 1);< 5603#factENTRY ~n := #in~n; 5605#L25 assume ~n <= 0;#res := 1; 5606#factFINAL assume true; 5600#factEXIT >#68#return; 5588#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5592#factFINAL assume true; 5583#factEXIT >#68#return; 5588#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5592#factFINAL assume true; 5583#factEXIT >#68#return; 5580#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5575#factFINAL assume true; 5545#factEXIT >#74#return; 5558#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 5679#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 5678#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 5591#L42-4 assume true; 5590#L42-1 assume !!(main_~k~0 <= main_~x~0); 5582#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 5562#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 5578#factENTRY ~n := #in~n; 5611#L25 assume !(~n <= 0); 5601#L26 call #t~ret0 := fact(~n - 1);< 5525#factENTRY ~n := #in~n; 5624#L25 assume ~n <= 0;#res := 1; 5606#factFINAL assume true; 5600#factEXIT >#68#return; 5568#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5566#factFINAL assume true; 5565#factEXIT >#70#return; 5549#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 5560#factENTRY ~n := #in~n; 5612#L25 assume !(~n <= 0); 5585#L26 call #t~ret0 := fact(~n - 1);< 5603#factENTRY ~n := #in~n; 5605#L25 assume !(~n <= 0); 5584#L26 call #t~ret0 := fact(~n - 1);< 5603#factENTRY ~n := #in~n; 5605#L25 assume !(~n <= 0); 5584#L26 call #t~ret0 := fact(~n - 1);< 5603#factENTRY ~n := #in~n; 5605#L25 assume ~n <= 0;#res := 1; 5606#factFINAL assume true; 5600#factEXIT >#68#return; 5588#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5592#factFINAL assume true; 5583#factEXIT >#68#return; 5588#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5592#factFINAL assume true; 5583#factEXIT >#68#return; 5580#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5575#factFINAL assume true; 5545#factEXIT >#72#return; 5556#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 5579#factENTRY ~n := #in~n; 5581#L25 assume ~n <= 0;#res := 1; 5577#factFINAL assume true; 5561#factEXIT >#74#return; 5563#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 5609#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 5543#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 5540#L42-4 assume true; 5529#L42-1 assume !(main_~k~0 <= main_~x~0); 5474#L41-3 main_#t~post7 := main_~n~0;main_~n~0 := main_#t~post7 + 1;havoc main_#t~post7; 5468#L41-4 assume true; 5469#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 5432#L42-4 assume true; 5433#L42-1 assume !!(main_~k~0 <= main_~x~0); 5450#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 5554#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 5560#factENTRY ~n := #in~n; 5612#L25 assume !(~n <= 0); 5585#L26 call #t~ret0 := fact(~n - 1);< 5603#factENTRY ~n := #in~n; 5605#L25 assume ~n <= 0;#res := 1; 5606#factFINAL assume true; 5600#factEXIT >#68#return; 5568#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5566#factFINAL assume true; 5565#factEXIT >#70#return; 5440#L30-1 [2018-11-10 02:57:53,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:53,430 INFO L82 PathProgramCache]: Analyzing trace with hash -529846092, now seen corresponding path program 1 times [2018-11-10 02:57:53,430 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:53,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:53,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:53,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:53,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:53,433 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:57:53,433 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:57:53,433 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:57:53,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:53,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:53,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 02:57:53,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:57:53,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-10 02:57:53,489 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:57:53,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:53,490 INFO L82 PathProgramCache]: Analyzing trace with hash -458006204, now seen corresponding path program 6 times [2018-11-10 02:57:53,490 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:53,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:53,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:53,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:53,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:53,493 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:57:53,493 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:57:53,493 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:57:53,508 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 02:57:53,533 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-10 02:57:53,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 02:57:53,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:53,615 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 127 proven. 19 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2018-11-10 02:57:53,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:57:53,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-10 02:57:53,633 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:57:53,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 02:57:53,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 02:57:53,633 INFO L87 Difference]: Start difference. First operand 347 states and 509 transitions. cyclomatic complexity: 170 Second operand 6 states. [2018-11-10 02:57:53,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:57:53,765 INFO L93 Difference]: Finished difference Result 440 states and 654 transitions. [2018-11-10 02:57:53,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 02:57:53,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 440 states and 654 transitions. [2018-11-10 02:57:53,770 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 70 [2018-11-10 02:57:53,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 440 states to 436 states and 646 transitions. [2018-11-10 02:57:53,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 213 [2018-11-10 02:57:53,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 213 [2018-11-10 02:57:53,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 436 states and 646 transitions. [2018-11-10 02:57:53,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:57:53,776 INFO L705 BuchiCegarLoop]: Abstraction has 436 states and 646 transitions. [2018-11-10 02:57:53,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states and 646 transitions. [2018-11-10 02:57:53,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 361. [2018-11-10 02:57:53,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-11-10 02:57:53,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 530 transitions. [2018-11-10 02:57:53,788 INFO L728 BuchiCegarLoop]: Abstraction has 361 states and 530 transitions. [2018-11-10 02:57:53,788 INFO L608 BuchiCegarLoop]: Abstraction has 361 states and 530 transitions. [2018-11-10 02:57:53,788 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 02:57:53,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 361 states and 530 transitions. [2018-11-10 02:57:53,790 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 60 [2018-11-10 02:57:53,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:57:53,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:57:53,791 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:57:53,791 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:57:53,791 INFO L793 eck$LassoCheckResult]: Stem: 6660#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6610#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 6611#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 6585#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 6586#L41-4 assume true; 6804#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 6803#L42-4 assume true; 6801#L42-1 assume !!(main_~k~0 <= main_~x~0); 6612#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 6613#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 6650#factENTRY ~n := #in~n; 6795#L25 assume ~n <= 0;#res := 1; 6726#factFINAL assume true; 6791#factEXIT >#70#return; 6642#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 6643#factENTRY ~n := #in~n; 6798#L25 assume ~n <= 0;#res := 1; 6797#factFINAL assume true; 6788#factEXIT >#72#return; 6592#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 6749#factENTRY ~n := #in~n; 6745#L25 assume !(~n <= 0); 6719#L26 call #t~ret0 := fact(~n - 1);< 6741#factENTRY ~n := #in~n; 6743#L25 assume ~n <= 0;#res := 1; 6764#factFINAL assume true; 6737#factEXIT >#68#return; 6738#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6802#factFINAL assume true; 6773#factEXIT >#74#return; 6775#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 6782#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 6781#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 6780#L42-4 assume true; 6779#L42-1 assume !!(main_~k~0 <= main_~x~0); 6778#L43 assume !(main_~k~0 <= main_~n~0);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~k~0, main_~n~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 6622#L30-5 [2018-11-10 02:57:53,791 INFO L795 eck$LassoCheckResult]: Loop: 6622#L30-5 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 6663#factENTRY ~n := #in~n; 6758#L25 assume ~n <= 0;#res := 1; 6618#factFINAL assume true; 6629#factEXIT >#76#return; 6624#L30-6 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 6663#factENTRY ~n := #in~n; 6758#L25 assume ~n <= 0;#res := 1; 6618#factFINAL assume true; 6629#factEXIT >#78#return; 6627#L30-7 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 6663#factENTRY ~n := #in~n; 6758#L25 assume !(~n <= 0); 6718#L26 call #t~ret0 := fact(~n - 1);< 6723#factENTRY ~n := #in~n; 6756#L25 assume ~n <= 0;#res := 1; 6757#factFINAL assume true; 6739#factEXIT >#68#return; 6738#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6802#factFINAL assume true; 6773#factEXIT >#80#return; 6661#L30-8 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 6658#L30-9 main_#t~ret10 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10; 6605#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 6581#L42-4 assume true; 6582#L42-1 assume !!(main_~k~0 <= main_~x~0); 6607#L43 assume !(main_~k~0 <= main_~n~0);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~k~0, main_~n~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 6622#L30-5 [2018-11-10 02:57:53,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:53,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1467266291, now seen corresponding path program 1 times [2018-11-10 02:57:53,792 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:53,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:53,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:53,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:57:53,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:53,795 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:57:53,795 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:57:53,795 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:57:53,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:53,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 02:57:53,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:57:53,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-10 02:57:53,904 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:57:53,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:53,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1876628369, now seen corresponding path program 1 times [2018-11-10 02:57:53,904 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:53,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:53,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:53,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:53,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:53,907 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:57:53,907 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:57:53,907 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:57:53,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:54,132 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2018-11-10 02:57:54,198 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:57:54,198 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:57:54,198 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:57:54,198 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:57:54,198 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:57:54,198 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:54,198 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:57:54,198 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:57:54,198 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration15_Loop [2018-11-10 02:57:54,198 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:57:54,198 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:57:54,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:54,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:54,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:54,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:54,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:54,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:54,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:54,259 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:57:54,259 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:54,261 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:54,261 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:54,280 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:57:54,280 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:55,667 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 02:57:55,669 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:57:55,669 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:57:55,669 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:57:55,669 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:57:55,669 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:57:55,669 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:55,669 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:57:55,669 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:57:55,669 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration15_Loop [2018-11-10 02:57:55,670 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:57:55,670 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:57:55,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:55,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:55,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:55,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:55,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:55,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:55,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:55,729 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:57:55,729 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:57:55,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:55,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:55,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:55,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:55,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:55,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:55,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:55,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:55,731 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:55,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:55,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:55,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:55,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:55,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:55,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:55,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:55,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:55,733 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:55,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:55,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:55,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:55,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:55,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:55,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:55,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:55,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:55,734 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:55,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:55,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:55,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:55,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:55,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:55,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:55,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:55,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:55,738 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:57:55,741 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 02:57:55,741 INFO L444 ModelExtractionUtils]: 5 out of 9 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 02:57:55,741 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:57:55,741 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 02:57:55,741 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:57:55,741 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-10 02:57:55,742 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 02:57:55,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:55,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:55,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:55,878 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 02:57:55,878 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-10 02:57:55,878 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 361 states and 530 transitions. cyclomatic complexity: 177 Second operand 7 states. [2018-11-10 02:57:55,970 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 361 states and 530 transitions. cyclomatic complexity: 177. Second operand 7 states. Result 968 states and 1363 transitions. Complement of second has 15 states. [2018-11-10 02:57:55,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 02:57:55,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 02:57:55,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-11-10 02:57:55,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 36 letters. Loop has 27 letters. [2018-11-10 02:57:55,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:55,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 63 letters. Loop has 27 letters. [2018-11-10 02:57:55,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:55,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 36 letters. Loop has 54 letters. [2018-11-10 02:57:55,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:55,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 968 states and 1363 transitions. [2018-11-10 02:57:55,984 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 106 [2018-11-10 02:57:55,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 968 states to 945 states and 1332 transitions. [2018-11-10 02:57:55,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 359 [2018-11-10 02:57:55,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 364 [2018-11-10 02:57:55,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 945 states and 1332 transitions. [2018-11-10 02:57:55,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:57:55,994 INFO L705 BuchiCegarLoop]: Abstraction has 945 states and 1332 transitions. [2018-11-10 02:57:55,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states and 1332 transitions. [2018-11-10 02:57:56,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 937. [2018-11-10 02:57:56,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2018-11-10 02:57:56,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1323 transitions. [2018-11-10 02:57:56,022 INFO L728 BuchiCegarLoop]: Abstraction has 937 states and 1323 transitions. [2018-11-10 02:57:56,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 02:57:56,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 02:57:56,022 INFO L87 Difference]: Start difference. First operand 937 states and 1323 transitions. Second operand 7 states. [2018-11-10 02:57:56,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:57:56,192 INFO L93 Difference]: Finished difference Result 987 states and 1424 transitions. [2018-11-10 02:57:56,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 02:57:56,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 987 states and 1424 transitions. [2018-11-10 02:57:56,202 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 106 [2018-11-10 02:57:56,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 987 states to 987 states and 1424 transitions. [2018-11-10 02:57:56,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 369 [2018-11-10 02:57:56,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 369 [2018-11-10 02:57:56,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 987 states and 1424 transitions. [2018-11-10 02:57:56,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:57:56,213 INFO L705 BuchiCegarLoop]: Abstraction has 987 states and 1424 transitions. [2018-11-10 02:57:56,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states and 1424 transitions. [2018-11-10 02:57:56,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 923. [2018-11-10 02:57:56,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-11-10 02:57:56,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1300 transitions. [2018-11-10 02:57:56,239 INFO L728 BuchiCegarLoop]: Abstraction has 923 states and 1300 transitions. [2018-11-10 02:57:56,240 INFO L608 BuchiCegarLoop]: Abstraction has 923 states and 1300 transitions. [2018-11-10 02:57:56,240 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-10 02:57:56,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 923 states and 1300 transitions. [2018-11-10 02:57:56,247 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 106 [2018-11-10 02:57:56,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:57:56,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:57:56,249 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 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] [2018-11-10 02:57:56,250 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 02:57:56,250 INFO L793 eck$LassoCheckResult]: Stem: 10242#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 10192#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 10193#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 10174#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 10175#L41-4 assume true; 10430#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 10429#L42-4 assume true; 10428#L42-1 assume !!(main_~k~0 <= main_~x~0); 10427#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 10417#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 10418#factENTRY ~n := #in~n; 10426#L25 assume ~n <= 0;#res := 1; 10424#factFINAL assume true; 10415#factEXIT >#70#return; 10413#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 10414#factENTRY ~n := #in~n; 10422#L25 assume ~n <= 0;#res := 1; 10421#factFINAL assume true; 10411#factEXIT >#72#return; 10407#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 10409#factENTRY ~n := #in~n; 10419#L25 assume ~n <= 0;#res := 1; 10410#factFINAL assume true; 10406#factEXIT >#74#return; 10400#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 10369#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 10365#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 10360#L42-4 assume true; 10357#L42-1 assume !!(main_~k~0 <= main_~x~0); 10354#L43 assume !(main_~k~0 <= main_~n~0);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~k~0, main_~n~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 10206#L30-5 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 10348#factENTRY ~n := #in~n; 10691#L25 assume !(~n <= 0); 10199#L26 call #t~ret0 := fact(~n - 1);< 10679#factENTRY ~n := #in~n; 10198#L25 assume ~n <= 0;#res := 1; 10200#factFINAL assume true; 10828#factEXIT >#68#return; 10247#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10205#factFINAL assume true; 10207#factEXIT >#76#return; 10182#L30-6 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 10246#factENTRY ~n := #in~n; 10750#L25 assume !(~n <= 0); 10662#L26 call #t~ret0 := fact(~n - 1);< 10670#factENTRY [2018-11-10 02:57:56,250 INFO L795 eck$LassoCheckResult]: Loop: 10670#factENTRY ~n := #in~n; 10683#L25 assume !(~n <= 0); 10666#L26 call #t~ret0 := fact(~n - 1);< 10670#factENTRY [2018-11-10 02:57:56,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:56,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1071030368, now seen corresponding path program 1 times [2018-11-10 02:57:56,250 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:56,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:56,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:56,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:56,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:56,253 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:57:56,253 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:57:56,253 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2018-11-10 02:57:56,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:57:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:56,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:56,306 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-10 02:57:56,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:57:56,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 02:57:56,323 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:57:56,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:56,323 INFO L82 PathProgramCache]: Analyzing trace with hash 29982, now seen corresponding path program 2 times [2018-11-10 02:57:56,323 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:56,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:56,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:56,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:56,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:56,344 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:57:56,344 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:57:56,344 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:57:56,344 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:57:56,344 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:57:56,344 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:56,344 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:57:56,344 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:57:56,344 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration16_Loop [2018-11-10 02:57:56,344 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:57:56,344 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:57:56,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:56,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:56,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:56,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:56,373 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:57:56,373 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:56,381 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:56,382 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:56,387 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:57:56,387 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_~n=0} Honda state: {fact_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:56,405 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:56,405 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:56,408 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:57:56,408 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#res=0} Honda state: {fact_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:56,436 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:56,436 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:56,457 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:57:56,457 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:56,477 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 02:57:56,478 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:57:56,479 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:57:56,479 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:57:56,479 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:57:56,479 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:57:56,479 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:56,479 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:57:56,479 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:57:56,479 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration16_Loop [2018-11-10 02:57:56,479 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:57:56,479 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:57:56,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:56,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:56,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:56,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:56,498 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:57:56,498 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:57:56,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:56,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:56,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:56,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:56,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:56,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:56,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:56,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:56,500 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:56,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:56,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:56,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:56,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:56,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:56,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:56,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:56,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:56,501 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:56,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:56,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:56,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:56,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:56,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:56,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:56,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:56,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:56,503 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:57:56,503 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 02:57:56,504 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 02:57:56,504 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:57:56,504 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 02:57:56,504 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:57:56,504 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2018-11-10 02:57:56,504 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 02:57:56,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:56,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:56,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:56,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:57:56,572 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 02:57:56,572 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 923 states and 1300 transitions. cyclomatic complexity: 401 Second operand 5 states. [2018-11-10 02:57:56,631 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 923 states and 1300 transitions. cyclomatic complexity: 401. Second operand 5 states. Result 995 states and 1384 transitions. Complement of second has 13 states. [2018-11-10 02:57:56,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:57:56,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 02:57:56,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-10 02:57:56,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 45 letters. Loop has 3 letters. [2018-11-10 02:57:56,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:56,636 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:57:56,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:56,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:56,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:56,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:57:56,737 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 02:57:56,737 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 923 states and 1300 transitions. cyclomatic complexity: 401 Second operand 5 states. [2018-11-10 02:57:56,834 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 923 states and 1300 transitions. cyclomatic complexity: 401. Second operand 5 states. Result 995 states and 1384 transitions. Complement of second has 13 states. [2018-11-10 02:57:56,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:57:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 02:57:56,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-10 02:57:56,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 45 letters. Loop has 3 letters. [2018-11-10 02:57:56,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:56,837 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:57:56,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:56,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:56,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:56,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:57:56,949 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 02:57:56,949 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 923 states and 1300 transitions. cyclomatic complexity: 401 Second operand 5 states. [2018-11-10 02:57:57,055 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 923 states and 1300 transitions. cyclomatic complexity: 401. Second operand 5 states. Result 1145 states and 1554 transitions. Complement of second has 16 states. [2018-11-10 02:57:57,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:57:57,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 02:57:57,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2018-11-10 02:57:57,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 45 letters. Loop has 3 letters. [2018-11-10 02:57:57,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:57,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 48 letters. Loop has 3 letters. [2018-11-10 02:57:57,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:57,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 45 letters. Loop has 6 letters. [2018-11-10 02:57:57,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:57,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1145 states and 1554 transitions. [2018-11-10 02:57:57,068 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 97 [2018-11-10 02:57:57,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1145 states to 823 states and 1153 transitions. [2018-11-10 02:57:57,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 245 [2018-11-10 02:57:57,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 255 [2018-11-10 02:57:57,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 823 states and 1153 transitions. [2018-11-10 02:57:57,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:57:57,078 INFO L705 BuchiCegarLoop]: Abstraction has 823 states and 1153 transitions. [2018-11-10 02:57:57,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states and 1153 transitions. [2018-11-10 02:57:57,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 771. [2018-11-10 02:57:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2018-11-10 02:57:57,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1069 transitions. [2018-11-10 02:57:57,096 INFO L728 BuchiCegarLoop]: Abstraction has 771 states and 1069 transitions. [2018-11-10 02:57:57,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 02:57:57,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 02:57:57,097 INFO L87 Difference]: Start difference. First operand 771 states and 1069 transitions. Second operand 6 states. [2018-11-10 02:57:57,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:57:57,169 INFO L93 Difference]: Finished difference Result 841 states and 1165 transitions. [2018-11-10 02:57:57,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 02:57:57,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 841 states and 1165 transitions. [2018-11-10 02:57:57,176 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 97 [2018-11-10 02:57:57,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 841 states to 841 states and 1165 transitions. [2018-11-10 02:57:57,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 258 [2018-11-10 02:57:57,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 258 [2018-11-10 02:57:57,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 841 states and 1165 transitions. [2018-11-10 02:57:57,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:57:57,184 INFO L705 BuchiCegarLoop]: Abstraction has 841 states and 1165 transitions. [2018-11-10 02:57:57,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states and 1165 transitions. [2018-11-10 02:57:57,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 812. [2018-11-10 02:57:57,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2018-11-10 02:57:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1128 transitions. [2018-11-10 02:57:57,203 INFO L728 BuchiCegarLoop]: Abstraction has 812 states and 1128 transitions. [2018-11-10 02:57:57,203 INFO L608 BuchiCegarLoop]: Abstraction has 812 states and 1128 transitions. [2018-11-10 02:57:57,203 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-10 02:57:57,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 812 states and 1128 transitions. [2018-11-10 02:57:57,228 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 97 [2018-11-10 02:57:57,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:57:57,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:57:57,229 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:57:57,229 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [12, 12, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-10 02:57:57,229 INFO L793 eck$LassoCheckResult]: Stem: 16568#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 16520#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 16521#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 16499#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 16500#L41-4 assume true; 16542#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 16908#L42-4 assume true; 16907#L42-1 assume !!(main_~k~0 <= main_~x~0); 16905#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 16897#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 16901#factENTRY ~n := #in~n; 16903#L25 assume ~n <= 0;#res := 1; 16902#factFINAL assume true; 16896#factEXIT >#70#return; 16890#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 16891#factENTRY ~n := #in~n; 16906#L25 assume ~n <= 0;#res := 1; 16900#factFINAL assume true; 16889#factEXIT >#72#return; 16882#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 16884#factENTRY ~n := #in~n; 16892#L25 assume ~n <= 0;#res := 1; 16885#factFINAL assume true; 16880#factEXIT >#74#return; 16878#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 16879#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 16866#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 16867#L42-4 assume true; 16859#L42-1 assume !(main_~k~0 <= main_~x~0); 16856#L41-3 main_#t~post7 := main_~n~0;main_~n~0 := main_#t~post7 + 1;havoc main_#t~post7; 16852#L41-4 assume true; 16555#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 16495#L42-4 assume true; 16496#L42-1 assume !!(main_~k~0 <= main_~x~0); 16518#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 16564#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 16563#factENTRY ~n := #in~n; 16565#L25 assume !(~n <= 0); 16802#L26 call #t~ret0 := fact(~n - 1);< 16811#factENTRY ~n := #in~n; 16817#L25 assume ~n <= 0;#res := 1; 16841#factFINAL assume true; 16803#factEXIT >#68#return; 16804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 16831#factFINAL assume true; 16830#factEXIT >#70#return; 16827#L30-1 [2018-11-10 02:57:57,229 INFO L795 eck$LassoCheckResult]: Loop: 16827#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 16828#factENTRY ~n := #in~n; 16833#L25 assume ~n <= 0;#res := 1; 16829#factFINAL assume true; 16826#factEXIT >#72#return; 16502#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 16552#factENTRY ~n := #in~n; 16842#L25 assume !(~n <= 0); 16809#L26 call #t~ret0 := fact(~n - 1);< 16840#factENTRY ~n := #in~n; 16814#L25 assume !(~n <= 0); 16806#L26 call #t~ret0 := fact(~n - 1);< 16810#factENTRY ~n := #in~n; 16816#L25 assume ~n <= 0;#res := 1; 16812#factFINAL assume true; 16805#factEXIT >#68#return; 16807#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 16813#factFINAL assume true; 16808#factEXIT >#68#return; 16575#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 16576#factFINAL assume true; 16823#factEXIT >#74#return; 16822#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 16796#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 16797#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 16821#L42-4 assume true; 16820#L42-1 assume !!(main_~k~0 <= main_~x~0); 16819#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 16509#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 16818#factENTRY ~n := #in~n; 16815#L25 assume !(~n <= 0); 16584#L26 call #t~ret0 := fact(~n - 1);< 16585#factENTRY ~n := #in~n; 16843#L25 assume ~n <= 0;#res := 1; 16838#factFINAL assume true; 16839#factEXIT >#68#return; 16804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 16831#factFINAL assume true; 16830#factEXIT >#70#return; 16504#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 16552#factENTRY ~n := #in~n; 16842#L25 assume !(~n <= 0); 16809#L26 call #t~ret0 := fact(~n - 1);< 16840#factENTRY ~n := #in~n; 16814#L25 assume !(~n <= 0); 16806#L26 call #t~ret0 := fact(~n - 1);< 16810#factENTRY ~n := #in~n; 16816#L25 assume ~n <= 0;#res := 1; 16812#factFINAL assume true; 16805#factEXIT >#68#return; 16807#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 16813#factFINAL assume true; 16808#factEXIT >#68#return; 16575#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 16576#factFINAL assume true; 16823#factEXIT >#72#return; 16505#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 16549#factENTRY ~n := #in~n; 16533#L25 assume ~n <= 0;#res := 1; 16525#factFINAL assume true; 16501#factEXIT >#74#return; 16511#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 16538#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 16539#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 16791#L42-4 assume true; 16792#L42-1 assume !(main_~k~0 <= main_~x~0); 16546#L41-3 main_#t~post7 := main_~n~0;main_~n~0 := main_#t~post7 + 1;havoc main_#t~post7; 16547#L41-4 assume true; 16846#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 16845#L42-4 assume true; 16844#L42-1 assume !!(main_~k~0 <= main_~x~0); 16522#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 16506#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 16552#factENTRY ~n := #in~n; 16842#L25 assume !(~n <= 0); 16809#L26 call #t~ret0 := fact(~n - 1);< 16840#factENTRY ~n := #in~n; 16843#L25 assume ~n <= 0;#res := 1; 16838#factFINAL assume true; 16839#factEXIT >#68#return; 16804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 16831#factFINAL assume true; 16830#factEXIT >#70#return; 16827#L30-1 [2018-11-10 02:57:57,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:57,230 INFO L82 PathProgramCache]: Analyzing trace with hash 4434915, now seen corresponding path program 1 times [2018-11-10 02:57:57,230 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:57,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:57,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:57,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:57:57,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:57,233 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:57:57,233 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:57:57,233 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:57:57,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:57,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:57,340 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 02:57:57,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:57:57,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-10 02:57:57,358 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:57:57,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:57,358 INFO L82 PathProgramCache]: Analyzing trace with hash 2064490764, now seen corresponding path program 7 times [2018-11-10 02:57:57,358 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:57,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:57,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:57,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:57,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:57,361 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:57:57,361 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:57:57,361 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:57:57,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:57,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:57,449 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 196 proven. 27 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-10 02:57:57,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:57:57,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-10 02:57:57,469 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:57:57,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 02:57:57,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 02:57:57,470 INFO L87 Difference]: Start difference. First operand 812 states and 1128 transitions. cyclomatic complexity: 334 Second operand 7 states. [2018-11-10 02:57:57,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:57:57,534 INFO L93 Difference]: Finished difference Result 500 states and 697 transitions. [2018-11-10 02:57:57,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 02:57:57,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 500 states and 697 transitions. [2018-11-10 02:57:57,538 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 68 [2018-11-10 02:57:57,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 500 states to 468 states and 662 transitions. [2018-11-10 02:57:57,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2018-11-10 02:57:57,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2018-11-10 02:57:57,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 468 states and 662 transitions. [2018-11-10 02:57:57,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:57:57,542 INFO L705 BuchiCegarLoop]: Abstraction has 468 states and 662 transitions. [2018-11-10 02:57:57,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states and 662 transitions. [2018-11-10 02:57:57,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 395. [2018-11-10 02:57:57,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-11-10 02:57:57,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 533 transitions. [2018-11-10 02:57:57,551 INFO L728 BuchiCegarLoop]: Abstraction has 395 states and 533 transitions. [2018-11-10 02:57:57,552 INFO L608 BuchiCegarLoop]: Abstraction has 395 states and 533 transitions. [2018-11-10 02:57:57,552 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-10 02:57:57,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 395 states and 533 transitions. [2018-11-10 02:57:57,554 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2018-11-10 02:57:57,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:57:57,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:57:57,556 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 6, 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, 1, 1, 1, 1, 1] [2018-11-10 02:57:57,556 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [10, 10, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-10 02:57:57,556 INFO L793 eck$LassoCheckResult]: Stem: 18270#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 18228#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 18229#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 18210#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 18211#L41-4 assume true; 18241#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 18258#L42-4 assume true; 18506#L42-1 assume !!(main_~k~0 <= main_~x~0); 18505#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 18261#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 18262#factENTRY ~n := #in~n; 18515#L25 assume ~n <= 0;#res := 1; 18512#factFINAL assume true; 18511#factEXIT >#70#return; 18254#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 18255#factENTRY ~n := #in~n; 18546#L25 assume ~n <= 0;#res := 1; 18545#factFINAL assume true; 18504#factEXIT >#72#return; 18251#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 18252#factENTRY ~n := #in~n; 18519#L25 assume ~n <= 0;#res := 1; 18518#factFINAL assume true; 18517#factEXIT >#74#return; 18245#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 18239#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 18240#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 18509#L42-4 assume true; 18510#L42-1 assume !!(main_~k~0 <= main_~x~0); 18232#L43 assume !(main_~k~0 <= main_~n~0);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~k~0, main_~n~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 18222#L30-5 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 18287#factENTRY ~n := #in~n; 18552#L25 assume ~n <= 0;#res := 1; 18591#factFINAL assume true; 18601#factEXIT >#76#return; 18598#L30-6 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 18599#factENTRY ~n := #in~n; 18602#L25 assume ~n <= 0;#res := 1; 18600#factFINAL assume true; 18597#factEXIT >#78#return; 18333#L30-7 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 18596#factENTRY ~n := #in~n; 18595#L25 assume !(~n <= 0); 18536#L26 call #t~ret0 := fact(~n - 1);< 18537#factENTRY ~n := #in~n; 18594#L25 assume ~n <= 0;#res := 1; 18547#factFINAL assume true; 18549#factEXIT >#68#return; 18533#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 18520#factFINAL assume true; 18330#factEXIT >#80#return; 18328#L30-8 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 18329#L30-9 main_#t~ret10 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10; 18460#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 18305#L42-4 assume true; 18301#L42-1 assume !(main_~k~0 <= main_~x~0); 18248#L41-3 main_#t~post7 := main_~n~0;main_~n~0 := main_#t~post7 + 1;havoc main_#t~post7; 18249#L41-4 assume true; 18256#L41-1 [2018-11-10 02:57:57,556 INFO L795 eck$LassoCheckResult]: Loop: 18256#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 18257#L42-4 assume true; 18434#L42-1 assume !!(main_~k~0 <= main_~x~0); 18432#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 18319#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 18250#factENTRY ~n := #in~n; 18382#L25 assume !(~n <= 0); 18365#L26 call #t~ret0 := fact(~n - 1);< 18375#factENTRY ~n := #in~n; 18386#L25 assume ~n <= 0;#res := 1; 18436#factFINAL assume true; 18362#factEXIT >#68#return; 18360#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 18356#factFINAL assume true; 18338#factEXIT >#70#return; 18217#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 18253#factENTRY ~n := #in~n; 18233#L25 assume ~n <= 0;#res := 1; 18234#factFINAL assume true; 18216#factEXIT >#72#return; 18220#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 18250#factENTRY ~n := #in~n; 18382#L25 assume !(~n <= 0); 18365#L26 call #t~ret0 := fact(~n - 1);< 18375#factENTRY ~n := #in~n; 18386#L25 assume ~n <= 0;#res := 1; 18436#factFINAL assume true; 18362#factEXIT >#68#return; 18360#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 18356#factFINAL assume true; 18338#factEXIT >#74#return; 18341#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 18503#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 18502#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 18501#L42-4 assume true; 18500#L42-1 assume !!(main_~k~0 <= main_~x~0); 18499#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 18259#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 18260#factENTRY ~n := #in~n; 18381#L25 assume !(~n <= 0); 18364#L26 call #t~ret0 := fact(~n - 1);< 18290#factENTRY ~n := #in~n; 18386#L25 assume ~n <= 0;#res := 1; 18436#factFINAL assume true; 18362#factEXIT >#68#return; 18360#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 18356#factFINAL assume true; 18338#factEXIT >#70#return; 18318#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 18250#factENTRY ~n := #in~n; 18382#L25 assume !(~n <= 0); 18365#L26 call #t~ret0 := fact(~n - 1);< 18375#factENTRY ~n := #in~n; 18386#L25 assume ~n <= 0;#res := 1; 18436#factFINAL assume true; 18362#factEXIT >#68#return; 18360#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 18356#factFINAL assume true; 18338#factEXIT >#72#return; 18264#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 18263#factENTRY ~n := #in~n; 18265#L25 assume ~n <= 0;#res := 1; 18316#factFINAL assume true; 18323#factEXIT >#74#return; 18369#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 18336#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 18306#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 18302#L42-4 assume true; 18296#L42-1 assume !(main_~k~0 <= main_~x~0); 18246#L41-3 main_#t~post7 := main_~n~0;main_~n~0 := main_#t~post7 + 1;havoc main_#t~post7; 18247#L41-4 assume true; 18256#L41-1 [2018-11-10 02:57:57,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:57,556 INFO L82 PathProgramCache]: Analyzing trace with hash 194443971, now seen corresponding path program 1 times [2018-11-10 02:57:57,556 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:57,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:57,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:57,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:57,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:57,560 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:57:57,560 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:57:57,560 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2018-11-10 02:57:57,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:57:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:57,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:57,646 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-10 02:57:57,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:57:57,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 02:57:57,663 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:57:57,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:57,663 INFO L82 PathProgramCache]: Analyzing trace with hash 577080418, now seen corresponding path program 8 times [2018-11-10 02:57:57,663 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:57,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:57,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:57,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:57,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:57,665 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:57:57,666 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:57:57,666 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:57:57,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 02:57:57,693 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 02:57:57,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-10 02:57:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:58,231 WARN L179 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 120 [2018-11-10 02:57:58,446 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:57:58,446 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:57:58,446 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:57:58,446 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:57:58,446 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:57:58,446 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:58,446 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:57:58,447 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:57:58,447 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration18_Loop [2018-11-10 02:57:58,447 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:57:58,447 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:57:58,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:58,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:58,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:58,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:58,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:58,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:58,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:58,593 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:57:58,593 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:58,599 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:58,599 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:58,601 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:57:58,601 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7=0} Honda state: {ULTIMATE.start_main_#t~post7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:58,618 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:58,618 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:58,620 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:57:58,620 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:58,638 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:58,638 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:58,640 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:57:58,640 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:58,659 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:58,659 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:58,661 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:57:58,662 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret9=0} Honda state: {ULTIMATE.start_main_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:58,680 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:58,680 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:58,682 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:57:58,682 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:58,702 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:58,702 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:58,704 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:57:58,704 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8=0} Honda state: {ULTIMATE.start_main_#t~post8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:58,723 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:58,723 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:58,744 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:57:58,744 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:58,750 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 02:57:58,767 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:57:58,767 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:57:58,767 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:57:58,767 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:57:58,767 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:57:58,767 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:58,767 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:57:58,767 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:57:58,767 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration18_Loop [2018-11-10 02:57:58,767 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:57:58,767 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:57:58,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:58,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:58,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:58,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:58,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:58,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:58,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:58,899 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:57:58,899 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:57:58,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:58,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:58,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:58,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:58,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:58,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:58,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:58,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:58,900 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:58,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:58,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:58,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:58,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:58,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:58,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:58,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:58,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:58,902 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:58,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:58,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:58,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:58,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:58,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:58,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:58,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:58,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:58,903 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:58,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:58,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:58,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:58,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:58,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:58,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:58,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:58,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:58,904 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:58,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:58,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:58,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:58,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:58,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:58,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:58,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:58,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:58,906 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:58,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:58,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:58,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:58,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:58,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:58,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:58,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:58,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:58,907 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:58,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:58,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:58,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:58,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:58,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:58,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:58,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:58,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:58,912 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:57:58,916 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 02:57:58,916 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 02:57:58,916 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:57:58,917 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 02:57:58,918 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:57:58,918 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~n~0) = 3*ULTIMATE.start_main_~x~0 - 2*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-11-10 02:57:58,918 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 02:57:58,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:59,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:59,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-11-10 02:57:59,128 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2018-11-10 02:57:59,129 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 395 states and 533 transitions. cyclomatic complexity: 146 Second operand 10 states. [2018-11-10 02:57:59,366 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 395 states and 533 transitions. cyclomatic complexity: 146. Second operand 10 states. Result 1127 states and 1461 transitions. Complement of second has 42 states. [2018-11-10 02:57:59,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2018-11-10 02:57:59,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 02:57:59,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 87 transitions. [2018-11-10 02:57:59,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 87 transitions. Stem has 58 letters. Loop has 71 letters. [2018-11-10 02:57:59,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:59,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 87 transitions. Stem has 129 letters. Loop has 71 letters. [2018-11-10 02:57:59,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:59,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 87 transitions. Stem has 58 letters. Loop has 142 letters. [2018-11-10 02:57:59,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:59,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1127 states and 1461 transitions. [2018-11-10 02:57:59,377 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 39 [2018-11-10 02:57:59,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1127 states to 893 states and 1141 transitions. [2018-11-10 02:57:59,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 208 [2018-11-10 02:57:59,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 209 [2018-11-10 02:57:59,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 893 states and 1141 transitions. [2018-11-10 02:57:59,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:57:59,382 INFO L705 BuchiCegarLoop]: Abstraction has 893 states and 1141 transitions. [2018-11-10 02:57:59,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states and 1141 transitions. [2018-11-10 02:57:59,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 798. [2018-11-10 02:57:59,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2018-11-10 02:57:59,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1022 transitions. [2018-11-10 02:57:59,395 INFO L728 BuchiCegarLoop]: Abstraction has 798 states and 1022 transitions. [2018-11-10 02:57:59,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 02:57:59,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 02:57:59,396 INFO L87 Difference]: Start difference. First operand 798 states and 1022 transitions. Second operand 7 states. [2018-11-10 02:57:59,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:57:59,490 INFO L93 Difference]: Finished difference Result 756 states and 940 transitions. [2018-11-10 02:57:59,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 02:57:59,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 756 states and 940 transitions. [2018-11-10 02:57:59,494 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-11-10 02:57:59,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 756 states to 737 states and 920 transitions. [2018-11-10 02:57:59,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 149 [2018-11-10 02:57:59,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2018-11-10 02:57:59,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 737 states and 920 transitions. [2018-11-10 02:57:59,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:57:59,498 INFO L705 BuchiCegarLoop]: Abstraction has 737 states and 920 transitions. [2018-11-10 02:57:59,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states and 920 transitions. [2018-11-10 02:57:59,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 721. [2018-11-10 02:57:59,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-11-10 02:57:59,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 904 transitions. [2018-11-10 02:57:59,510 INFO L728 BuchiCegarLoop]: Abstraction has 721 states and 904 transitions. [2018-11-10 02:57:59,510 INFO L608 BuchiCegarLoop]: Abstraction has 721 states and 904 transitions. [2018-11-10 02:57:59,510 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-10 02:57:59,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 721 states and 904 transitions. [2018-11-10 02:57:59,513 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-11-10 02:57:59,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:57:59,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:57:59,515 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [12, 12, 9, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:57:59,515 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:57:59,515 INFO L793 eck$LassoCheckResult]: Stem: 21991#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 21946#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 21947#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 21932#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 21933#L41-4 assume true; 21963#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 22297#L42-4 assume true; 22486#L42-1 assume !!(main_~k~0 <= main_~x~0); 22484#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 22480#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 22481#factENTRY ~n := #in~n; 22485#L25 assume ~n <= 0;#res := 1; 22483#factFINAL assume true; 22479#factEXIT >#70#return; 22466#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 22467#factENTRY ~n := #in~n; 22482#L25 assume ~n <= 0;#res := 1; 22478#factFINAL assume true; 22465#factEXIT >#72#return; 22461#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 22462#factENTRY ~n := #in~n; 22476#L25 assume ~n <= 0;#res := 1; 22474#factFINAL assume true; 22460#factEXIT >#74#return; 22459#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 22458#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 22450#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 22447#L42-4 assume true; 22445#L42-1 assume !!(main_~k~0 <= main_~x~0); 22444#L43 assume !(main_~k~0 <= main_~n~0);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~k~0, main_~n~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 22441#L30-5 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 22442#factENTRY ~n := #in~n; 22618#L25 assume !(~n <= 0); 22613#L26 call #t~ret0 := fact(~n - 1);< 22617#factENTRY ~n := #in~n; 22622#L25 assume ~n <= 0;#res := 1; 22620#factFINAL assume true; 22612#factEXIT >#68#return; 22610#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22607#factFINAL assume true; 22602#factEXIT >#76#return; 22595#L30-6 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 22600#factENTRY ~n := #in~n; 22608#L25 assume ~n <= 0;#res := 1; 22606#factFINAL assume true; 22599#factEXIT >#78#return; 21985#L30-7 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 21983#factENTRY ~n := #in~n; 21986#L25 assume !(~n <= 0); 22604#L26 call #t~ret0 := fact(~n - 1);< 22605#factENTRY ~n := #in~n; 22623#L25 assume !(~n <= 0); 22615#L26 call #t~ret0 := fact(~n - 1);< 22625#factENTRY ~n := #in~n; 22627#L25 assume ~n <= 0;#res := 1; 22628#factFINAL assume true; 22626#factEXIT >#68#return; 22616#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22624#factFINAL assume true; 22614#factEXIT >#68#return; 22601#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22598#factFINAL assume true; 22594#factEXIT >#80#return; 22596#L30-8 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 22648#L30-9 main_#t~ret10 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10; 22647#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 22646#L42-4 assume true; 22184#L42-1 assume !(main_~k~0 <= main_~x~0); 21968#L41-3 main_#t~post7 := main_~n~0;main_~n~0 := main_#t~post7 + 1;havoc main_#t~post7; 21969#L41-4 assume true; 22044#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 22358#L42-4 assume true; 22383#L42-1 assume !!(main_~k~0 <= main_~x~0); 22382#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 22380#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 22381#factENTRY ~n := #in~n; 22396#L25 assume ~n <= 0;#res := 1; 22395#factFINAL assume true; 22392#factEXIT >#70#return; 22389#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 22390#factENTRY ~n := #in~n; 22394#L25 assume ~n <= 0;#res := 1; 22391#factFINAL assume true; 22388#factEXIT >#72#return; 21935#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 22387#factENTRY ~n := #in~n; 22415#L25 assume ~n <= 0;#res := 1; 22416#factFINAL assume true; 21934#factEXIT >#74#return; 21937#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 21967#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 21988#L42-3 [2018-11-10 02:57:59,515 INFO L795 eck$LassoCheckResult]: Loop: 21988#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 22361#L42-4 assume true; 22359#L42-1 assume !!(main_~k~0 <= main_~x~0); 22043#L43 assume !(main_~k~0 <= main_~n~0);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~k~0, main_~n~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 22007#L30-5 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 21996#factENTRY ~n := #in~n; 22015#L25 assume !(~n <= 0); 22016#L26 call #t~ret0 := fact(~n - 1);< 22029#factENTRY ~n := #in~n; 22038#L25 assume ~n <= 0;#res := 1; 22035#factFINAL assume true; 22019#factEXIT >#68#return; 22017#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22013#factFINAL assume true; 22008#factEXIT >#76#return; 22002#L30-6 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 21996#factENTRY ~n := #in~n; 22015#L25 assume ~n <= 0;#res := 1; 22012#factFINAL assume true; 22010#factEXIT >#78#return; 21995#L30-7 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 21996#factENTRY ~n := #in~n; 22015#L25 assume !(~n <= 0); 22016#L26 call #t~ret0 := fact(~n - 1);< 22029#factENTRY ~n := #in~n; 22038#L25 assume ~n <= 0;#res := 1; 22035#factFINAL assume true; 22019#factEXIT >#68#return; 22017#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22013#factFINAL assume true; 22008#factEXIT >#80#return; 21992#L30-8 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 21987#L30-9 main_#t~ret10 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10; 21988#L42-3 [2018-11-10 02:57:59,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:59,515 INFO L82 PathProgramCache]: Analyzing trace with hash -154227325, now seen corresponding path program 2 times [2018-11-10 02:57:59,515 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:59,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:59,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:59,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:57:59,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:59,524 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:57:59,524 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:57:59,524 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:57:59,536 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 02:57:59,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 02:57:59,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 02:57:59,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:59,645 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 173 proven. 6 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-10 02:57:59,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:57:59,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-10 02:57:59,662 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:57:59,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:59,663 INFO L82 PathProgramCache]: Analyzing trace with hash -189042451, now seen corresponding path program 2 times [2018-11-10 02:57:59,663 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:59,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:59,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:59,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:57:59,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:59,665 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:57:59,665 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:57:59,665 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:57:59,676 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 02:57:59,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 02:57:59,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-10 02:57:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:59,970 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:57:59,970 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:57:59,970 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:57:59,970 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:57:59,970 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:57:59,970 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:59,970 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:57:59,970 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:57:59,970 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration19_Loop [2018-11-10 02:57:59,970 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:57:59,970 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:57:59,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:59,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:59,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:59,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:59,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:59,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:00,188 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2018-11-10 02:58:00,216 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:58:00,217 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:00,218 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:58:00,218 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:58:00,220 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:58:00,221 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:00,238 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:58:00,238 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:58:00,240 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:58:00,240 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:00,259 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:58:00,259 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:58:00,261 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:58:00,261 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:00,279 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:58:00,279 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:58:00,281 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:58:00,281 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8=0} Honda state: {ULTIMATE.start_main_#t~post8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:00,300 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:58:00,300 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:58:00,302 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:58:00,302 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret10=0} Honda state: {ULTIMATE.start_main_#t~ret10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:00,321 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:58:00,321 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:00,342 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:58:00,342 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:58:00,348 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 02:58:00,375 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:58:00,375 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:58:00,375 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:58:00,376 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:58:00,376 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:58:00,376 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:00,376 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:58:00,376 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:58:00,376 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration19_Loop [2018-11-10 02:58:00,376 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:58:00,376 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:58:00,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:00,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:00,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:00,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:00,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:00,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:00,520 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:58:00,520 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:58:00,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:58:00,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:58:00,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:58:00,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:58:00,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:58:00,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:58:00,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:58:00,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:58:00,523 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:58:00,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:58:00,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:58:00,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:58:00,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:58:00,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:58:00,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:58:00,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:58:00,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:58:00,524 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:58:00,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:58:00,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:58:00,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:58:00,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:58:00,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:58:00,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:58:00,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:58:00,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:58:00,526 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:58:00,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:58:00,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:58:00,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:58:00,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:58:00,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:58:00,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:58:00,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:58:00,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:58:00,527 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:58:00,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:58:00,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:58:00,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:58:00,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:58:00,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:58:00,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:58:00,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:58:00,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:58:00,528 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:58:00,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:58:00,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:58:00,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:58:00,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:58:00,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:58:00,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:58:00,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:58:00,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:58:00,532 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:58:00,534 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 02:58:00,534 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 02:58:00,534 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:58:00,534 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 02:58:00,534 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:58:00,534 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0) = -2*ULTIMATE.start_main_~k~0 + 1 Supporting invariants [] [2018-11-10 02:58:00,535 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 02:58:00,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:58:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:00,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:00,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:00,771 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 02:58:00,771 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2018-11-10 02:58:00,771 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 721 states and 904 transitions. cyclomatic complexity: 198 Second operand 10 states. [2018-11-10 02:58:00,938 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 721 states and 904 transitions. cyclomatic complexity: 198. Second operand 10 states. Result 1123 states and 1380 transitions. Complement of second has 38 states. [2018-11-10 02:58:00,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-10 02:58:00,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 02:58:00,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 58 transitions. [2018-11-10 02:58:00,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 58 transitions. Stem has 91 letters. Loop has 33 letters. [2018-11-10 02:58:00,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:58:00,941 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:58:00,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:58:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:01,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:01,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:01,132 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 02:58:01,132 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2018-11-10 02:58:01,133 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 721 states and 904 transitions. cyclomatic complexity: 198 Second operand 10 states. [2018-11-10 02:58:01,291 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 721 states and 904 transitions. cyclomatic complexity: 198. Second operand 10 states. Result 1123 states and 1384 transitions. Complement of second has 34 states. [2018-11-10 02:58:01,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-10 02:58:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 02:58:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2018-11-10 02:58:01,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 57 transitions. Stem has 91 letters. Loop has 33 letters. [2018-11-10 02:58:01,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:58:01,294 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:58:01,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:58:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:01,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:01,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:01,547 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 02:58:01,547 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2018-11-10 02:58:01,547 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 721 states and 904 transitions. cyclomatic complexity: 198 Second operand 10 states. [2018-11-10 02:58:01,815 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 721 states and 904 transitions. cyclomatic complexity: 198. Second operand 10 states. Result 2013 states and 2457 transitions. Complement of second has 46 states. [2018-11-10 02:58:01,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-10 02:58:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 02:58:01,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2018-11-10 02:58:01,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 97 transitions. Stem has 91 letters. Loop has 33 letters. [2018-11-10 02:58:01,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:58:01,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 97 transitions. Stem has 124 letters. Loop has 33 letters. [2018-11-10 02:58:01,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:58:01,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 97 transitions. Stem has 91 letters. Loop has 66 letters. [2018-11-10 02:58:01,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:58:01,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2013 states and 2457 transitions. [2018-11-10 02:58:01,834 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 02:58:01,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2013 states to 1702 states and 2076 transitions. [2018-11-10 02:58:01,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 182 [2018-11-10 02:58:01,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 189 [2018-11-10 02:58:01,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1702 states and 2076 transitions. [2018-11-10 02:58:01,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:58:01,846 INFO L705 BuchiCegarLoop]: Abstraction has 1702 states and 2076 transitions. [2018-11-10 02:58:01,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states and 2076 transitions. [2018-11-10 02:58:01,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1447. [2018-11-10 02:58:01,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1447 states. [2018-11-10 02:58:01,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1755 transitions. [2018-11-10 02:58:01,876 INFO L728 BuchiCegarLoop]: Abstraction has 1447 states and 1755 transitions. [2018-11-10 02:58:01,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 02:58:01,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-10 02:58:01,876 INFO L87 Difference]: Start difference. First operand 1447 states and 1755 transitions. Second operand 9 states. [2018-11-10 02:58:02,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:58:02,134 INFO L93 Difference]: Finished difference Result 1793 states and 2263 transitions. [2018-11-10 02:58:02,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 02:58:02,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1793 states and 2263 transitions. [2018-11-10 02:58:02,146 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 02:58:02,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1793 states to 1739 states and 2194 transitions. [2018-11-10 02:58:02,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 189 [2018-11-10 02:58:02,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 189 [2018-11-10 02:58:02,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1739 states and 2194 transitions. [2018-11-10 02:58:02,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:58:02,157 INFO L705 BuchiCegarLoop]: Abstraction has 1739 states and 2194 transitions. [2018-11-10 02:58:02,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states and 2194 transitions. [2018-11-10 02:58:02,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1468. [2018-11-10 02:58:02,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1468 states. [2018-11-10 02:58:02,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 1793 transitions. [2018-11-10 02:58:02,190 INFO L728 BuchiCegarLoop]: Abstraction has 1468 states and 1793 transitions. [2018-11-10 02:58:02,190 INFO L608 BuchiCegarLoop]: Abstraction has 1468 states and 1793 transitions. [2018-11-10 02:58:02,190 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-10 02:58:02,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1468 states and 1793 transitions. [2018-11-10 02:58:02,195 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 02:58:02,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:58:02,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:58:02,196 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [16, 16, 12, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:58:02,196 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:58:02,197 INFO L793 eck$LassoCheckResult]: Stem: 31798#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 31756#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 31757#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 31737#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 31738#L41-4 assume true; 31773#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 32617#L42-4 assume true; 32924#L42-1 assume !!(main_~k~0 <= main_~x~0); 32864#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 32865#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 32876#factENTRY ~n := #in~n; 32877#L25 assume ~n <= 0;#res := 1; 32871#factFINAL assume true; 32872#factEXIT >#70#return; 32868#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 32873#factENTRY ~n := #in~n; 32870#L25 assume ~n <= 0;#res := 1; 32867#factFINAL assume true; 32869#factEXIT >#72#return; 31783#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 31784#factENTRY ~n := #in~n; 32914#L25 assume ~n <= 0;#res := 1; 32915#factFINAL assume true; 32900#factEXIT >#74#return; 32901#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 31771#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 31772#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 31741#L42-4 assume true; 31742#L42-1 assume !!(main_~k~0 <= main_~x~0); 31755#L43 assume !(main_~k~0 <= main_~n~0);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~k~0, main_~n~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 31759#L30-5 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 33094#factENTRY ~n := #in~n; 33092#L25 assume !(~n <= 0); 33093#L26 call #t~ret0 := fact(~n - 1);< 33098#factENTRY ~n := #in~n; 33097#L25 assume ~n <= 0;#res := 1; 33095#factFINAL assume true; 33096#factEXIT >#68#return; 33177#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 33176#factFINAL assume true; 33039#factEXIT >#76#return; 32939#L30-6 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 32946#factENTRY ~n := #in~n; 33057#L25 assume ~n <= 0;#res := 1; 33056#factFINAL assume true; 32938#factEXIT >#78#return; 32910#L30-7 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 32911#factENTRY ~n := #in~n; 33066#L25 assume !(~n <= 0); 33052#L26 call #t~ret0 := fact(~n - 1);< 33055#factENTRY ~n := #in~n; 33065#L25 assume ~n <= 0;#res := 1; 33064#factFINAL assume true; 33062#factEXIT >#68#return; 33063#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 33201#factFINAL assume true; 33184#factEXIT >#80#return; 32906#L30-8 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 32907#L30-9 main_#t~ret10 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10; 32990#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 32988#L42-4 assume true; 32275#L42-1 assume !(main_~k~0 <= main_~x~0); 31779#L41-3 main_#t~post7 := main_~n~0;main_~n~0 := main_#t~post7 + 1;havoc main_#t~post7; 31780#L41-4 assume true; 31933#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 31930#L42-4 assume true; 31928#L42-1 assume !!(main_~k~0 <= main_~x~0); 31923#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 31919#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 31920#factENTRY ~n := #in~n; 31924#L25 assume ~n <= 0;#res := 1; 31922#factFINAL assume true; 31918#factEXIT >#70#return; 31915#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 31916#factENTRY ~n := #in~n; 31921#L25 assume ~n <= 0;#res := 1; 31917#factFINAL assume true; 31914#factEXIT >#72#return; 31911#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 31913#factENTRY ~n := #in~n; 31950#L25 assume ~n <= 0;#res := 1; 31945#factFINAL assume true; 31941#factEXIT >#74#return; 31908#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 31909#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 31895#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 31896#L42-4 assume true; 31892#L42-1 assume !!(main_~k~0 <= main_~x~0); 31891#L43 assume !(main_~k~0 <= main_~n~0);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~k~0, main_~n~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 31858#L30-5 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 31860#factENTRY ~n := #in~n; 31877#L25 assume !(~n <= 0); 31868#L26 call #t~ret0 := fact(~n - 1);< 31876#factENTRY ~n := #in~n; 31890#L25 assume ~n <= 0;#res := 1; 31887#factFINAL assume true; 31865#factEXIT >#68#return; 31862#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31861#factFINAL assume true; 31854#factEXIT >#76#return; 31835#L30-6 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 31839#factENTRY ~n := #in~n; 31841#L25 assume ~n <= 0;#res := 1; 31840#factFINAL assume true; 31834#factEXIT >#78#return; 31801#L30-7 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 31802#factENTRY ~n := #in~n; 32170#L25 assume !(~n <= 0); 31826#L26 call #t~ret0 := fact(~n - 1);< 31831#factENTRY ~n := #in~n; 31848#L25 assume ~n <= 0;#res := 1; 31853#factFINAL assume true; 31850#factEXIT >#68#return; 31852#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 33195#factFINAL assume true; 33190#factEXIT >#80#return; 31799#L30-8 [2018-11-10 02:58:02,197 INFO L795 eck$LassoCheckResult]: Loop: 31799#L30-8 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 31796#L30-9 main_#t~ret10 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10; 31751#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 31739#L42-4 assume true; 31740#L42-1 assume !!(main_~k~0 <= main_~x~0); 31754#L43 assume !(main_~k~0 <= main_~n~0);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~k~0, main_~n~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 31811#L30-5 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 31808#factENTRY ~n := #in~n; 31832#L25 assume !(~n <= 0); 31827#L26 call #t~ret0 := fact(~n - 1);< 31831#factENTRY ~n := #in~n; 31846#L25 assume !(~n <= 0); 31824#L26 call #t~ret0 := fact(~n - 1);< 31845#factENTRY ~n := #in~n; 31847#L25 assume ~n <= 0;#res := 1; 31905#factFINAL assume true; 31904#factEXIT >#68#return; 31828#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31844#factFINAL assume true; 31823#factEXIT >#68#return; 31821#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31820#factFINAL assume true; 31818#factEXIT >#76#return; 31807#L30-6 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 31808#factENTRY ~n := #in~n; 31832#L25 assume !(~n <= 0); 31827#L26 call #t~ret0 := fact(~n - 1);< 31831#factENTRY ~n := #in~n; 31848#L25 assume ~n <= 0;#res := 1; 31853#factFINAL assume true; 31850#factEXIT >#68#return; 31849#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31842#factFINAL assume true; 31843#factEXIT >#78#return; 31819#L30-7 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 31808#factENTRY ~n := #in~n; 31832#L25 assume !(~n <= 0); 31827#L26 call #t~ret0 := fact(~n - 1);< 31831#factENTRY ~n := #in~n; 31848#L25 assume ~n <= 0;#res := 1; 31853#factFINAL assume true; 31850#factEXIT >#68#return; 31849#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31842#factFINAL assume true; 31843#factEXIT >#80#return; 31799#L30-8 [2018-11-10 02:58:02,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:58:02,197 INFO L82 PathProgramCache]: Analyzing trace with hash -525597755, now seen corresponding path program 3 times [2018-11-10 02:58:02,197 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:58:02,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:58:02,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:58:02,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:58:02,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:58:02,201 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:58:02,201 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:58:02,201 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:58:02,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 02:58:02,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 02:58:02,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 02:58:02,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:02,264 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 256 proven. 3 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-11-10 02:58:02,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:58:02,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-10 02:58:02,291 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:58:02,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:58:02,292 INFO L82 PathProgramCache]: Analyzing trace with hash 640873057, now seen corresponding path program 3 times [2018-11-10 02:58:02,292 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:58:02,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:58:02,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:58:02,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:58:02,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:58:02,293 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:58:02,293 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:58:02,294 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:58:02,307 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 02:58:02,327 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-10 02:58:02,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-10 02:58:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:58:02,766 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:58:02,766 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:58:02,766 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:58:02,766 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:58:02,766 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:58:02,766 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:02,766 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:58:02,766 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:58:02,766 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration20_Loop [2018-11-10 02:58:02,766 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:58:02,766 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:58:02,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,871 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:58:02,871 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:02,873 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:58:02,873 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:58:02,875 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:58:02,875 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#res=0} Honda state: {ULTIMATE.start_binomialCoefficient_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:02,894 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:58:02,894 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:58:02,913 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:58:02,913 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3=1} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:02,915 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:58:02,915 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:02,937 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:58:02,937 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:58:02,942 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 02:58:02,959 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:58:02,959 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:58:02,959 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:58:02,959 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:58:02,959 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:58:02,959 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:02,959 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:58:02,959 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:58:02,959 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration20_Loop [2018-11-10 02:58:02,959 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:58:02,959 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:58:02,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:03,041 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:58:03,041 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:58:03,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:58:03,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:58:03,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:58:03,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:58:03,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:58:03,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:58:03,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:58:03,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:58:03,043 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:58:03,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:58:03,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:58:03,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:58:03,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:58:03,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:58:03,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:58:03,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:58:03,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:58:03,044 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:58:03,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:58:03,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:58:03,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:58:03,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:58:03,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:58:03,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:58:03,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:58:03,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:58:03,045 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:58:03,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:58:03,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:58:03,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:58:03,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:58:03,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:58:03,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:58:03,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:58:03,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:58:03,046 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:58:03,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:58:03,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:58:03,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:58:03,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:58:03,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:58:03,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:58:03,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:58:03,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:58:03,049 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:58:03,051 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 02:58:03,052 INFO L444 ModelExtractionUtils]: 7 out of 11 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 02:58:03,052 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:58:03,052 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 02:58:03,052 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:58:03,052 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0) = -2*ULTIMATE.start_main_~k~0 + 3 Supporting invariants [] [2018-11-10 02:58:03,053 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 02:58:03,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:58:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:03,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:03,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:03,351 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-10 02:58:03,351 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2018-11-10 02:58:03,351 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1468 states and 1793 transitions. cyclomatic complexity: 354 Second operand 12 states. [2018-11-10 02:58:03,586 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1468 states and 1793 transitions. cyclomatic complexity: 354. Second operand 12 states. Result 2350 states and 2833 transitions. Complement of second has 45 states. [2018-11-10 02:58:03,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2018-11-10 02:58:03,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 02:58:03,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 76 transitions. [2018-11-10 02:58:03,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 76 transitions. Stem has 116 letters. Loop has 45 letters. [2018-11-10 02:58:03,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:58:03,588 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:58:03,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:58:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:03,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:03,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:03,791 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-10 02:58:03,791 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2018-11-10 02:58:03,791 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1468 states and 1793 transitions. cyclomatic complexity: 354 Second operand 12 states. [2018-11-10 02:58:04,002 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1468 states and 1793 transitions. cyclomatic complexity: 354. Second operand 12 states. Result 2348 states and 2795 transitions. Complement of second has 43 states. [2018-11-10 02:58:04,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2018-11-10 02:58:04,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 02:58:04,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2018-11-10 02:58:04,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 75 transitions. Stem has 116 letters. Loop has 45 letters. [2018-11-10 02:58:04,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:58:04,004 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:58:04,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:58:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:04,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:04,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:04,236 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-10 02:58:04,236 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2018-11-10 02:58:04,236 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1468 states and 1793 transitions. cyclomatic complexity: 354 Second operand 12 states. [2018-11-10 02:58:04,449 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1468 states and 1793 transitions. cyclomatic complexity: 354. Second operand 12 states. Result 4378 states and 5440 transitions. Complement of second has 57 states. [2018-11-10 02:58:04,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2018-11-10 02:58:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 02:58:04,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 87 transitions. [2018-11-10 02:58:04,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 87 transitions. Stem has 116 letters. Loop has 45 letters. [2018-11-10 02:58:04,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:58:04,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 87 transitions. Stem has 161 letters. Loop has 45 letters. [2018-11-10 02:58:04,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:58:04,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 87 transitions. Stem has 116 letters. Loop has 90 letters. [2018-11-10 02:58:04,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:58:04,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4378 states and 5440 transitions. [2018-11-10 02:58:04,473 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 02:58:04,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4378 states to 3361 states and 4176 transitions. [2018-11-10 02:58:04,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 238 [2018-11-10 02:58:04,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 241 [2018-11-10 02:58:04,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3361 states and 4176 transitions. [2018-11-10 02:58:04,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:58:04,495 INFO L705 BuchiCegarLoop]: Abstraction has 3361 states and 4176 transitions. [2018-11-10 02:58:04,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3361 states and 4176 transitions. [2018-11-10 02:58:04,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3361 to 2524. [2018-11-10 02:58:04,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2524 states. [2018-11-10 02:58:04,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2524 states to 2524 states and 3154 transitions. [2018-11-10 02:58:04,558 INFO L728 BuchiCegarLoop]: Abstraction has 2524 states and 3154 transitions. [2018-11-10 02:58:04,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 02:58:04,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 02:58:04,558 INFO L87 Difference]: Start difference. First operand 2524 states and 3154 transitions. Second operand 6 states. [2018-11-10 02:58:04,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:58:04,686 INFO L93 Difference]: Finished difference Result 2225 states and 2785 transitions. [2018-11-10 02:58:04,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 02:58:04,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2225 states and 2785 transitions. [2018-11-10 02:58:04,694 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 02:58:04,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2225 states to 2169 states and 2723 transitions. [2018-11-10 02:58:04,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 207 [2018-11-10 02:58:04,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 249 [2018-11-10 02:58:04,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2169 states and 2723 transitions. [2018-11-10 02:58:04,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:58:04,705 INFO L705 BuchiCegarLoop]: Abstraction has 2169 states and 2723 transitions. [2018-11-10 02:58:04,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2169 states and 2723 transitions. [2018-11-10 02:58:04,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2169 to 2100. [2018-11-10 02:58:04,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2018-11-10 02:58:04,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2600 transitions. [2018-11-10 02:58:04,739 INFO L728 BuchiCegarLoop]: Abstraction has 2100 states and 2600 transitions. [2018-11-10 02:58:04,739 INFO L608 BuchiCegarLoop]: Abstraction has 2100 states and 2600 transitions. [2018-11-10 02:58:04,739 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-10 02:58:04,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2100 states and 2600 transitions. [2018-11-10 02:58:04,744 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 02:58:04,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:58:04,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:58:04,746 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [14, 14, 9, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:58:04,746 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 9, 6, 6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:58:04,746 INFO L793 eck$LassoCheckResult]: Stem: 49109#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 49073#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 49074#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 49051#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 49052#L41-4 assume true; 49249#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 49248#L42-4 assume true; 49247#L42-1 assume !!(main_~k~0 <= main_~x~0); 49245#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 49241#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 49242#factENTRY ~n := #in~n; 49246#L25 assume ~n <= 0;#res := 1; 49244#factFINAL assume true; 49240#factEXIT >#70#return; 49236#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 49237#factENTRY ~n := #in~n; 49243#L25 assume ~n <= 0;#res := 1; 49239#factFINAL assume true; 49235#factEXIT >#72#return; 49231#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 49232#factENTRY ~n := #in~n; 49238#L25 assume ~n <= 0;#res := 1; 49234#factFINAL assume true; 49230#factEXIT >#74#return; 49228#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 49227#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 49225#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 49223#L42-4 assume true; 49220#L42-1 assume !!(main_~k~0 <= main_~x~0); 49216#L43 assume !(main_~k~0 <= main_~n~0);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~k~0, main_~n~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 49168#L30-5 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 49169#factENTRY ~n := #in~n; 49219#L25 assume !(~n <= 0); 49214#L26 call #t~ret0 := fact(~n - 1);< 49215#factENTRY ~n := #in~n; 49222#L25 assume ~n <= 0;#res := 1; 49218#factFINAL assume true; 49213#factEXIT >#68#return; 49212#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49211#factFINAL assume true; 49167#factEXIT >#76#return; 49163#L30-6 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 49164#factENTRY ~n := #in~n; 49204#L25 assume ~n <= 0;#res := 1; 49203#factFINAL assume true; 49162#factEXIT >#78#return; 49144#L30-7 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 49150#factENTRY ~n := #in~n; 49172#L25 assume !(~n <= 0); 49158#L26 call #t~ret0 := fact(~n - 1);< 49159#factENTRY ~n := #in~n; 49183#L25 assume ~n <= 0;#res := 1; 49182#factFINAL assume true; 49157#factEXIT >#68#return; 49156#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49154#factFINAL assume true; 49143#factEXIT >#80#return; 49110#L30-8 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 49111#L30-9 main_#t~ret10 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10; 49140#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 49139#L42-4 assume true; 49138#L42-1 assume !(main_~k~0 <= main_~x~0); 49092#L41-3 main_#t~post7 := main_~n~0;main_~n~0 := main_#t~post7 + 1;havoc main_#t~post7; 49086#L41-4 assume true; 49087#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 49261#L42-4 assume true; 49312#L42-1 assume !!(main_~k~0 <= main_~x~0); 49310#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 49286#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 49287#factENTRY ~n := #in~n; 49308#L25 assume !(~n <= 0); 49292#L26 call #t~ret0 := fact(~n - 1);< 49297#factENTRY ~n := #in~n; 49422#L25 assume !(~n <= 0); 49304#L26 call #t~ret0 := fact(~n - 1);< 49348#factENTRY ~n := #in~n; 49449#L25 assume ~n <= 0;#res := 1; 49451#factFINAL assume true; 49426#factEXIT >#68#return; 49305#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49347#factFINAL assume true; 49303#factEXIT >#68#return; 49301#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49300#factFINAL assume true; 49285#factEXIT >#70#return; 49279#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 49280#factENTRY ~n := #in~n; 49298#L25 assume ~n <= 0;#res := 1; 49290#factFINAL assume true; 49277#factEXIT >#72#return; 49270#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 49272#factENTRY ~n := #in~n; 49319#L25 assume !(~n <= 0); 49294#L26 call #t~ret0 := fact(~n - 1);< 49297#factENTRY ~n := #in~n; 49421#L25 assume ~n <= 0;#res := 1; 49345#factFINAL assume true; 49291#factEXIT >#68#return; 49289#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49276#factFINAL assume true; 49268#factEXIT >#74#return; 49265#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 49262#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 49259#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 49257#L42-4 assume true; 49256#L42-1 assume !!(main_~k~0 <= main_~x~0); 49075#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 49076#L30 [2018-11-10 02:58:04,746 INFO L795 eck$LassoCheckResult]: Loop: 49076#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 49097#factENTRY ~n := #in~n; 49497#L25 assume !(~n <= 0); 49489#L26 call #t~ret0 := fact(~n - 1);< 49494#factENTRY ~n := #in~n; 49499#L25 assume !(~n <= 0); 49487#L26 call #t~ret0 := fact(~n - 1);< 49496#factENTRY ~n := #in~n; 49502#L25 assume ~n <= 0;#res := 1; 49503#factFINAL assume true; 49500#factEXIT >#68#return; 49493#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49495#factFINAL assume true; 49485#factEXIT >#68#return; 49484#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49483#factFINAL assume true; 49480#factEXIT >#70#return; 49096#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 49097#factENTRY ~n := #in~n; 49497#L25 assume !(~n <= 0); 49489#L26 call #t~ret0 := fact(~n - 1);< 49494#factENTRY ~n := #in~n; 49499#L25 assume !(~n <= 0); 49487#L26 call #t~ret0 := fact(~n - 1);< 49496#factENTRY ~n := #in~n; 49502#L25 assume ~n <= 0;#res := 1; 49503#factFINAL assume true; 49500#factEXIT >#68#return; 49493#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49495#factFINAL assume true; 49485#factEXIT >#68#return; 49484#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49483#factFINAL assume true; 49480#factEXIT >#72#return; 49481#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 49097#factENTRY ~n := #in~n; 49497#L25 assume !(~n <= 0); 49489#L26 call #t~ret0 := fact(~n - 1);< 49494#factENTRY ~n := #in~n; 49499#L25 assume !(~n <= 0); 49487#L26 call #t~ret0 := fact(~n - 1);< 49496#factENTRY ~n := #in~n; 49502#L25 assume ~n <= 0;#res := 1; 49503#factFINAL assume true; 49500#factEXIT >#68#return; 49493#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49495#factFINAL assume true; 49485#factEXIT >#68#return; 49484#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49483#factFINAL assume true; 49480#factEXIT >#74#return; 49482#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 49546#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 49356#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 49352#L42-4 assume true; 49350#L42-1 assume !!(main_~k~0 <= main_~x~0); 49322#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 49076#L30 [2018-11-10 02:58:04,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:58:04,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1004597226, now seen corresponding path program 4 times [2018-11-10 02:58:04,747 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:58:04,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:58:04,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:58:04,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:58:04,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:58:04,750 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:58:04,751 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:58:04,751 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2018-11-10 02:58:04,764 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:58:04,789 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 02:58:04,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 02:58:04,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:04,833 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 14 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-11-10 02:58:04,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:58:04,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-10 02:58:04,851 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:58:04,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:58:04,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1718069673, now seen corresponding path program 1 times [2018-11-10 02:58:04,851 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:58:04,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:58:04,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:58:04,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:58:04,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:58:04,853 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:58:04,853 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:58:04,853 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:58:04,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:58:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:04,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 15 proven. 103 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-10 02:58:04,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:58:04,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-10 02:58:04,972 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:58:04,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 02:58:04,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-10 02:58:04,973 INFO L87 Difference]: Start difference. First operand 2100 states and 2600 transitions. cyclomatic complexity: 541 Second operand 11 states. [2018-11-10 02:58:05,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:58:05,251 INFO L93 Difference]: Finished difference Result 3069 states and 3883 transitions. [2018-11-10 02:58:05,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 02:58:05,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3069 states and 3883 transitions. [2018-11-10 02:58:05,268 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2018-11-10 02:58:05,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3069 states to 2937 states and 3711 transitions. [2018-11-10 02:58:05,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 364 [2018-11-10 02:58:05,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 364 [2018-11-10 02:58:05,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2937 states and 3711 transitions. [2018-11-10 02:58:05,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:58:05,288 INFO L705 BuchiCegarLoop]: Abstraction has 2937 states and 3711 transitions. [2018-11-10 02:58:05,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states and 3711 transitions. [2018-11-10 02:58:05,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 2192. [2018-11-10 02:58:05,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2018-11-10 02:58:05,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 2766 transitions. [2018-11-10 02:58:05,341 INFO L728 BuchiCegarLoop]: Abstraction has 2192 states and 2766 transitions. [2018-11-10 02:58:05,341 INFO L608 BuchiCegarLoop]: Abstraction has 2192 states and 2766 transitions. [2018-11-10 02:58:05,341 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-10 02:58:05,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2192 states and 2766 transitions. [2018-11-10 02:58:05,346 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-11-10 02:58:05,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:58:05,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:58:05,348 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [14, 14, 9, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:58:05,348 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:58:05,348 INFO L793 eck$LassoCheckResult]: Stem: 54804#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 54754#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 54755#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 54742#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 54743#L41-4 assume true; 54905#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 54904#L42-4 assume true; 54903#L42-1 assume !!(main_~k~0 <= main_~x~0); 54901#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 54897#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 54898#factENTRY ~n := #in~n; 54902#L25 assume ~n <= 0;#res := 1; 54900#factFINAL assume true; 54896#factEXIT >#70#return; 54893#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 54894#factENTRY ~n := #in~n; 54899#L25 assume ~n <= 0;#res := 1; 54895#factFINAL assume true; 54892#factEXIT >#72#return; 54890#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 54891#factENTRY ~n := #in~n; 54908#L25 assume ~n <= 0;#res := 1; 54907#factFINAL assume true; 54889#factEXIT >#74#return; 54887#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 54883#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 54881#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 54879#L42-4 assume true; 54878#L42-1 assume !!(main_~k~0 <= main_~x~0); 54877#L43 assume !(main_~k~0 <= main_~n~0);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~k~0, main_~n~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 54874#L30-5 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 54875#factENTRY ~n := #in~n; 54888#L25 assume !(~n <= 0); 54885#L26 call #t~ret0 := fact(~n - 1);< 54886#factENTRY ~n := #in~n; 54911#L25 assume ~n <= 0;#res := 1; 54909#factFINAL assume true; 54884#factEXIT >#68#return; 54882#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54880#factFINAL assume true; 54873#factEXIT >#76#return; 54851#L30-6 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 54852#factENTRY ~n := #in~n; 54872#L25 assume ~n <= 0;#res := 1; 54871#factFINAL assume true; 54850#factEXIT >#78#return; 54839#L30-7 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 54845#factENTRY ~n := #in~n; 54920#L25 assume !(~n <= 0); 54861#L26 call #t~ret0 := fact(~n - 1);< 54862#factENTRY ~n := #in~n; 54918#L25 assume ~n <= 0;#res := 1; 54913#factFINAL assume true; 54860#factEXIT >#68#return; 54858#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54848#factFINAL assume true; 54838#factEXIT >#80#return; 54836#L30-8 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 54834#L30-9 main_#t~ret10 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10; 54832#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 54830#L42-4 assume true; 54828#L42-1 assume !(main_~k~0 <= main_~x~0); 54779#L41-3 main_#t~post7 := main_~n~0;main_~n~0 := main_#t~post7 + 1;havoc main_#t~post7; 54773#L41-4 assume true; 54774#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 55526#L42-4 assume true; 55207#L42-1 assume !!(main_~k~0 <= main_~x~0); 54953#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 54793#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 54794#factENTRY ~n := #in~n; 55454#L25 assume !(~n <= 0); 55455#L26 call #t~ret0 := fact(~n - 1);< 54824#factENTRY ~n := #in~n; 55475#L25 assume !(~n <= 0); 54745#L26 call #t~ret0 := fact(~n - 1);< 55542#factENTRY ~n := #in~n; 54766#L25 assume ~n <= 0;#res := 1; 54767#factFINAL assume true; 54744#factEXIT >#68#return; 54746#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55541#factFINAL assume true; 55539#factEXIT >#68#return; 55540#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55546#factFINAL assume true; 55544#factEXIT >#70#return; 54785#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 54786#factENTRY ~n := #in~n; 55466#L25 assume ~n <= 0;#res := 1; 55464#factFINAL assume true; 55462#factEXIT >#72#return; 54823#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 55461#factENTRY ~n := #in~n; 55525#L25 assume !(~n <= 0); 54821#L26 call #t~ret0 := fact(~n - 1);< 54824#factENTRY ~n := #in~n; 55474#L25 assume ~n <= 0;#res := 1; 55473#factFINAL assume true; 55469#factEXIT >#68#return; 55471#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55551#factFINAL assume true; 55459#factEXIT >#74#return; 55460#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 55420#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 55411#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 55410#L42-4 assume true; 55409#L42-1 assume !!(main_~k~0 <= main_~x~0); 54756#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 54757#L30 [2018-11-10 02:58:05,348 INFO L795 eck$LassoCheckResult]: Loop: 54757#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 54933#factENTRY ~n := #in~n; 54970#L25 assume !(~n <= 0); 54962#L26 call #t~ret0 := fact(~n - 1);< 54966#factENTRY ~n := #in~n; 54981#L25 assume !(~n <= 0); 54973#L26 call #t~ret0 := fact(~n - 1);< 54980#factENTRY ~n := #in~n; 54984#L25 assume ~n <= 0;#res := 1; 54985#factFINAL assume true; 54983#factEXIT >#68#return; 54982#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54979#factFINAL assume true; 54972#factEXIT >#68#return; 54967#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54956#factFINAL assume true; 54947#factEXIT >#70#return; 54930#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 54933#factENTRY ~n := #in~n; 54970#L25 assume !(~n <= 0); 54962#L26 call #t~ret0 := fact(~n - 1);< 54966#factENTRY ~n := #in~n; 54978#L25 assume ~n <= 0;#res := 1; 54969#factFINAL assume true; 54958#factEXIT >#68#return; 54955#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54952#factFINAL assume true; 54929#factEXIT >#72#return; 54931#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 54933#factENTRY ~n := #in~n; 54970#L25 assume !(~n <= 0); 54962#L26 call #t~ret0 := fact(~n - 1);< 54966#factENTRY ~n := #in~n; 54978#L25 assume ~n <= 0;#res := 1; 54969#factFINAL assume true; 54958#factEXIT >#68#return; 54955#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54952#factFINAL assume true; 54929#factEXIT >#74#return; 54926#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) != 0 then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) + 1) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 54923#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 54837#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := main_#t~post8 + 1;havoc main_#t~post8; 54835#L42-4 assume true; 54833#L42-1 assume !!(main_~k~0 <= main_~x~0); 54831#L43 assume main_~k~0 <= main_~n~0;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 54757#L30 [2018-11-10 02:58:05,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:58:05,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1004597226, now seen corresponding path program 5 times [2018-11-10 02:58:05,349 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:58:05,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:58:05,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:58:05,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:58:05,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:58:05,352 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:58:05,352 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:58:05,352 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2018-11-10 02:58:05,366 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:58:05,399 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-10 02:58:05,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 02:58:05,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:05,586 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 243 proven. 54 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-11-10 02:58:05,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:58:05,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-11-10 02:58:05,612 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:58:05,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:58:05,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1716526569, now seen corresponding path program 2 times [2018-11-10 02:58:05,613 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:58:05,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:58:05,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:58:05,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:58:05,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:58:05,614 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:58:05,615 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:58:05,615 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2018-11-10 02:58:05,623 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:58:05,644 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 02:58:05,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-10 02:58:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:58:06,110 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2018-11-10 02:58:06,163 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:58:06,163 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:58:06,163 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:58:06,163 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:58:06,163 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:58:06,163 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:06,163 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:58:06,163 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:58:06,164 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration22_Loop [2018-11-10 02:58:06,164 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:58:06,164 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:58:06,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:06,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:06,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:06,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:06,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:06,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:06,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:06,223 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:58:06,223 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:06,226 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:58:06,226 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:58:06,229 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:58:06,229 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:06,246 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:58:06,246 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:58:06,249 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:58:06,250 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret9=0} Honda state: {ULTIMATE.start_main_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:06,268 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:58:06,268 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:58:06,270 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:58:06,270 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#res=0} Honda state: {ULTIMATE.start_binomialCoefficient_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:06,288 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:58:06,288 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:58:06,290 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:58:06,290 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:06,310 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:58:06,310 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:58:06,312 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:58:06,312 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8=0} Honda state: {ULTIMATE.start_main_#t~post8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:06,331 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:58:06,331 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:58:06,333 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:58:06,334 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:06,353 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:58:06,353 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82573143-f680-452a-8ab1-76cfa47fd1c3/bin-2019/uautomizer/z3 Starting monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:06,374 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:58:06,374 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:58:07,151 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 02:58:07,153 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:58:07,153 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:58:07,153 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:58:07,153 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:58:07,153 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:58:07,153 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:07,153 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:58:07,153 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:58:07,153 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration22_Loop [2018-11-10 02:58:07,153 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:58:07,153 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:58:07,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:07,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:07,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:07,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:07,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:07,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:07,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:07,213 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:58:07,213 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:58:07,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:58:07,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:58:07,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:58:07,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:58:07,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:58:07,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:58:07,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:58:07,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:58:07,215 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:58:07,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:58:07,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:58:07,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:58:07,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:58:07,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:58:07,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:58:07,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:58:07,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:58:07,216 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:58:07,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:58:07,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:58:07,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:58:07,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:58:07,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:58:07,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:58:07,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:58:07,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:58:07,217 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:58:07,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:58:07,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:58:07,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:58:07,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:58:07,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:58:07,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:58:07,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:58:07,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:58:07,218 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:58:07,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:58:07,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:58:07,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:58:07,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:58:07,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:58:07,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:58:07,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:58:07,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:58:07,221 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:58:07,222 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 02:58:07,222 INFO L444 ModelExtractionUtils]: 5 out of 9 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 02:58:07,223 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:58:07,223 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 02:58:07,223 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:58:07,223 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-10 02:58:07,223 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 02:58:07,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:58:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:07,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:07,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:07,447 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-10 02:58:07,447 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-10 02:58:07,448 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2192 states and 2766 transitions. cyclomatic complexity: 615 Second operand 7 states. [2018-11-10 02:58:07,519 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2192 states and 2766 transitions. cyclomatic complexity: 615. Second operand 7 states. Result 2865 states and 3529 transitions. Complement of second has 13 states. [2018-11-10 02:58:07,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 02:58:07,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 02:58:07,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2018-11-10 02:58:07,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 107 letters. Loop has 45 letters. [2018-11-10 02:58:07,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:58:07,520 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:58:07,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:58:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:07,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:07,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:07,683 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-10 02:58:07,683 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-10 02:58:07,683 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2192 states and 2766 transitions. cyclomatic complexity: 615 Second operand 7 states. [2018-11-10 02:58:07,734 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2192 states and 2766 transitions. cyclomatic complexity: 615. Second operand 7 states. Result 2873 states and 3537 transitions. Complement of second has 17 states. [2018-11-10 02:58:07,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 02:58:07,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 02:58:07,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2018-11-10 02:58:07,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 40 transitions. Stem has 107 letters. Loop has 45 letters. [2018-11-10 02:58:07,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:58:07,735 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:58:07,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:58:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:07,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:07,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:07,871 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-10 02:58:07,871 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-10 02:58:07,871 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2192 states and 2766 transitions. cyclomatic complexity: 615 Second operand 7 states. [2018-11-10 02:58:07,997 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2192 states and 2766 transitions. cyclomatic complexity: 615. Second operand 7 states. Result 4530 states and 5680 transitions. Complement of second has 18 states. [2018-11-10 02:58:07,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 02:58:07,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 02:58:07,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2018-11-10 02:58:07,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 70 transitions. Stem has 107 letters. Loop has 45 letters. [2018-11-10 02:58:07,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:58:07,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 70 transitions. Stem has 152 letters. Loop has 45 letters. [2018-11-10 02:58:07,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:58:07,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 70 transitions. Stem has 107 letters. Loop has 90 letters. [2018-11-10 02:58:07,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:58:08,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4530 states and 5680 transitions. [2018-11-10 02:58:08,052 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 02:58:08,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4530 states to 0 states and 0 transitions. [2018-11-10 02:58:08,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 02:58:08,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 02:58:08,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 02:58:08,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:58:08,053 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:58:08,053 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:58:08,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 02:58:08,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-11-10 02:58:08,053 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 13 states. [2018-11-10 02:58:08,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:58:08,053 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-10 02:58:08,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 02:58:08,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-10 02:58:08,054 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 02:58:08,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 02:58:08,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 02:58:08,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 02:58:08,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 02:58:08,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:58:08,054 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:58:08,054 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:58:08,054 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:58:08,054 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-10 02:58:08,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 02:58:08,055 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 02:58:08,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 02:58:08,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 02:58:08 BoogieIcfgContainer [2018-11-10 02:58:08,061 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 02:58:08,062 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 02:58:08,062 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 02:58:08,062 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 02:58:08,062 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:56:05" (3/4) ... [2018-11-10 02:58:08,066 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 02:58:08,066 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 02:58:08,066 INFO L168 Benchmark]: Toolchain (without parser) took 123125.05 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 293.1 MB). Free memory was 961.9 MB in the beginning and 1.3 GB in the end (delta: -304.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:58:08,067 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:58:08,067 INFO L168 Benchmark]: CACSL2BoogieTranslator took 170.01 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 02:58:08,068 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.83 ms. Allocated memory is still 1.0 GB. Free memory is still 951.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:58:08,068 INFO L168 Benchmark]: Boogie Preprocessor took 16.21 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 02:58:08,068 INFO L168 Benchmark]: RCFGBuilder took 206.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2018-11-10 02:58:08,068 INFO L168 Benchmark]: BuchiAutomizer took 122699.00 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 155.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -141.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-10 02:58:08,069 INFO L168 Benchmark]: Witness Printer took 4.26 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:58:08,071 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 170.01 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.83 ms. Allocated memory is still 1.0 GB. Free memory is still 951.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.21 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 206.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 122699.00 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 155.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -141.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.26 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 30 terminating modules (21 trivial, 5 deterministic, 4 nondeterministic). One deterministic module has affine ranking function -1 * n and consists of 5 locations. One deterministic module has affine ranking function -2 * n + 1 and consists of 8 locations. One deterministic module has affine ranking function \old(n) and consists of 5 locations. One deterministic module has affine ranking function -1 * k + x and consists of 6 locations. One deterministic module has affine ranking function 3 * x + -2 * n and consists of 10 locations. One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. One nondeterministic module has affine ranking function -2 * k + 1 and consists of 10 locations. One nondeterministic module has affine ranking function -2 * k + 3 and consists of 11 locations. One nondeterministic module has affine ranking function -1 * k + x and consists of 6 locations. 21 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 122.6s and 23 iterations. TraceHistogramMax:16. Analysis of lassos took 113.6s. Construction of modules took 3.1s. Büchi inclusion checks took 4.7s. Highest rank in rank-based complementation 3. Minimization of det autom 9. Minimization of nondet autom 21. Automata minimization 0.5s AutomataMinimizationTime, 28 MinimizatonAttempts, 2906 StatesRemovedByMinimization, 27 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 2192 states and ocurred in iteration 21. Nontrivial modules had stage [5, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 366/477 HoareTripleCheckerStatistics: 1268 SDtfs, 1243 SDslu, 2545 SDs, 0 SdLazy, 4330 SolverSat, 826 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time LassoAnalysisResults: nont0 unkn0 SFLI9 SFLT1 conc1 concLT1 SILN0 SILU0 SILI3 SILT7 lasso0 LassoPreprocessingBenchmarks: Lassos: inital32 mio100 ax100 hnf98 lsp93 ukn100 mio100 lsp100 div142 bol100 ite100 ukn100 eq156 hnf92 smp83 dnf99 smp100 tf106 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 4ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 28 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 10 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 3.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...