./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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-5842f4b [2018-11-18 13:19:50,978 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:19:50,979 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:19:50,988 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:19:50,988 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:19:50,988 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:19:50,989 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:19:50,990 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:19:50,991 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:19:50,992 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:19:50,992 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:19:50,993 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:19:50,993 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:19:50,994 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:19:50,995 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:19:50,995 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:19:50,996 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:19:50,998 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:19:50,999 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:19:51,000 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:19:51,001 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:19:51,002 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:19:51,004 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:19:51,004 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:19:51,004 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:19:51,005 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:19:51,006 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:19:51,006 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:19:51,007 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:19:51,007 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:19:51,008 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:19:51,008 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:19:51,009 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:19:51,009 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:19:51,010 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:19:51,010 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:19:51,010 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 13:19:51,021 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:19:51,021 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:19:51,022 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 13:19:51,022 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 13:19:51,022 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 13:19:51,022 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 13:19:51,023 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 13:19:51,023 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 13:19:51,023 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 13:19:51,023 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 13:19:51,023 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 13:19:51,023 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:19:51,023 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 13:19:51,023 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:19:51,024 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:19:51,024 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 13:19:51,024 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 13:19:51,024 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 13:19:51,024 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:19:51,024 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 13:19:51,024 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:19:51,025 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 13:19:51,025 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:19:51,025 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:19:51,025 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 13:19:51,025 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:19:51,025 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 13:19:51,025 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 13:19:51,026 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 13:19:51,026 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:19:51,047 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:19:51,055 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:19:51,057 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:19:51,058 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:19:51,058 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:19:51,058 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/bin-2019/uautomizer/../../sv-benchmarks/c/termination-numeric/Binomial_true-termination_false-no-overflow.c [2018-11-18 13:19:51,095 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/bin-2019/uautomizer/data/64cb42c18/6b9dec01f01b4508b59029c326f53e8b/FLAG307143376 [2018-11-18 13:19:51,411 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:19:51,412 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/sv-benchmarks/c/termination-numeric/Binomial_true-termination_false-no-overflow.c [2018-11-18 13:19:51,416 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/bin-2019/uautomizer/data/64cb42c18/6b9dec01f01b4508b59029c326f53e8b/FLAG307143376 [2018-11-18 13:19:51,853 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/bin-2019/uautomizer/data/64cb42c18/6b9dec01f01b4508b59029c326f53e8b [2018-11-18 13:19:51,856 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:19:51,857 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:19:51,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:19:51,857 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:19:51,860 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:19:51,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:19:51" (1/1) ... [2018-11-18 13:19:51,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@795587e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:19:51, skipping insertion in model container [2018-11-18 13:19:51,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:19:51" (1/1) ... [2018-11-18 13:19:51,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:19:51,880 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:19:51,984 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:19:51,986 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:19:51,997 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:19:52,005 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:19:52,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:19:52 WrapperNode [2018-11-18 13:19:52,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:19:52,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:19:52,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:19:52,006 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:19:52,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:19:52" (1/1) ... [2018-11-18 13:19:52,014 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:19:52" (1/1) ... [2018-11-18 13:19:52,027 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:19:52,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:19:52,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:19:52,027 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:19:52,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:19:52" (1/1) ... [2018-11-18 13:19:52,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:19:52" (1/1) ... [2018-11-18 13:19:52,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:19:52" (1/1) ... [2018-11-18 13:19:52,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:19:52" (1/1) ... [2018-11-18 13:19:52,036 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:19:52" (1/1) ... [2018-11-18 13:19:52,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:19:52" (1/1) ... [2018-11-18 13:19:52,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:19:52" (1/1) ... [2018-11-18 13:19:52,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:19:52,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:19:52,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:19:52,043 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:19:52,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:19:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:19:52,125 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2018-11-18 13:19:52,125 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2018-11-18 13:19:52,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:19:52,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:19:52,246 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:19:52,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:19:52 BoogieIcfgContainer [2018-11-18 13:19:52,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:19:52,247 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 13:19:52,247 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 13:19:52,251 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 13:19:52,252 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:19:52,252 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 01:19:51" (1/3) ... [2018-11-18 13:19:52,253 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4142fa55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:19:52, skipping insertion in model container [2018-11-18 13:19:52,253 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:19:52,253 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:19:52" (2/3) ... [2018-11-18 13:19:52,253 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4142fa55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:19:52, skipping insertion in model container [2018-11-18 13:19:52,253 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:19:52,254 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:19:52" (3/3) ... [2018-11-18 13:19:52,255 INFO L375 chiAutomizerObserver]: Analyzing ICFG Binomial_true-termination_false-no-overflow.c [2018-11-18 13:19:52,304 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 13:19:52,305 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 13:19:52,305 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 13:19:52,305 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 13:19:52,305 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:19:52,305 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:19:52,305 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 13:19:52,305 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:19:52,305 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 13:19:52,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-11-18 13:19:52,343 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-18 13:19:52,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:19:52,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:19:52,349 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 13:19:52,349 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 13:19:52,349 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 13:19:52,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-11-18 13:19:52,351 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-18 13:19:52,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:19:52,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:19:52,352 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 13:19:52,352 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 13:19:52,359 INFO L794 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-18 13:19:52,359 INFO L796 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 := 1 + main_#t~post7;havoc main_#t~post7; 15#L41-4true [2018-11-18 13:19:52,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:52,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 1 times [2018-11-18 13:19:52,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:19:52,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:19:52,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:52,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:52,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:19:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:19:52,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:52,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1668264, now seen corresponding path program 1 times [2018-11-18 13:19:52,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:19:52,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:19:52,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:52,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:52,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:52,469 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-18 13:19:52,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:19:52,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:19:52,473 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:19:52,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 13:19:52,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 13:19:52,483 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-18 13:19:52,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:19:52,490 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2018-11-18 13:19:52,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 13:19:52,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 41 transitions. [2018-11-18 13:19:52,493 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-18 13:19:52,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 36 transitions. [2018-11-18 13:19:52,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-18 13:19:52,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-18 13:19:52,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2018-11-18 13:19:52,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:19:52,501 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-11-18 13:19:52,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2018-11-18 13:19:52,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-18 13:19:52,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 13:19:52,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2018-11-18 13:19:52,522 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-11-18 13:19:52,522 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-11-18 13:19:52,522 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 13:19:52,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2018-11-18 13:19:52,523 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-18 13:19:52,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:19:52,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:19:52,523 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 13:19:52,524 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 13:19:52,524 INFO L794 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-18 13:19:52,524 INFO L796 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 := 1 + main_#t~post7;havoc main_#t~post7; 69#L41-4 [2018-11-18 13:19:52,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:52,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 2 times [2018-11-18 13:19:52,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:19:52,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:19:52,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:52,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:52,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:19:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:19:52,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:52,532 INFO L82 PathProgramCache]: Analyzing trace with hash 51690484, now seen corresponding path program 1 times [2018-11-18 13:19:52,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:19:52,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:19:52,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:52,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:19:52,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:19:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:19:52,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:52,539 INFO L82 PathProgramCache]: Analyzing trace with hash -499715475, now seen corresponding path program 1 times [2018-11-18 13:19:52,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:19:52,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:19:52,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:52,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:52,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:52,585 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-18 13:19:52,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:19:52,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:19:52,613 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:19:52,614 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:19:52,614 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:19:52,614 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:19:52,614 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:19:52,614 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:19:52,615 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:19:52,615 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:19:52,615 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration2_Loop [2018-11-18 13:19:52,615 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:19:52,615 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:19:52,629 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-18 13:19:52,634 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-18 13:19:52,692 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:19:52,693 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:19:52,706 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:19:52,706 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:19:52,716 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:19:52,716 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:19:52,731 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:19:52,732 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:19:52,749 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:19:52,749 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:19:52,879 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 13:19:52,881 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:19:52,881 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:19:52,881 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:19:52,881 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:19:52,881 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:19:52,881 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:19:52,881 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:19:52,881 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:19:52,881 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration2_Loop [2018-11-18 13:19:52,882 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:19:52,882 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:19:52,882 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-18 13:19:52,887 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-18 13:19:52,917 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:19:52,920 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:19:52,921 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-18 13:19:52,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:19:52,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:19:52,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:19:52,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:19:52,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:19:52,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:19:52,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:19:52,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:19:52,927 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-18 13:19:52,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:19:52,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:19:52,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:19:52,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:19:52,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:19:52,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:19:52,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:19:52,935 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:19:52,942 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 13:19:52,942 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 13:19:52,944 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:19:52,944 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:19:52,944 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:19:52,944 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-11-18 13:19:52,945 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:19:52,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:52,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:19:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:52,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:19:53,038 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-18 13:19:53,040 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-18 13:19:53,040 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 36 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-18 13:19:53,090 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-18 13:19:53,091 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-18 13:19:53,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 13:19:53,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-18 13:19:53,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 5 letters. [2018-11-18 13:19:53,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:19:53,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 9 letters. Loop has 5 letters. [2018-11-18 13:19:53,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:19:53,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 10 letters. [2018-11-18 13:19:53,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:19:53,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-18 13:19:53,096 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-18 13:19:53,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 39 states and 53 transitions. [2018-11-18 13:19:53,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-18 13:19:53,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-11-18 13:19:53,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 53 transitions. [2018-11-18 13:19:53,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:19:53,100 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2018-11-18 13:19:53,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 53 transitions. [2018-11-18 13:19:53,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-18 13:19:53,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 13:19:53,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2018-11-18 13:19:53,103 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2018-11-18 13:19:53,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:19:53,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:19:53,104 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand 4 states. [2018-11-18 13:19:53,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:19:53,164 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2018-11-18 13:19:53,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:19:53,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2018-11-18 13:19:53,165 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-18 13:19:53,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 33 states and 42 transitions. [2018-11-18 13:19:53,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-18 13:19:53,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-18 13:19:53,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2018-11-18 13:19:53,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:19:53,167 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2018-11-18 13:19:53,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2018-11-18 13:19:53,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-11-18 13:19:53,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 13:19:53,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2018-11-18 13:19:53,170 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-11-18 13:19:53,170 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-11-18 13:19:53,170 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 13:19:53,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. [2018-11-18 13:19:53,171 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-18 13:19:53,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:19:53,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:19:53,171 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 13:19:53,172 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-18 13:19:53,172 INFO L794 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-18 13:19:53,172 INFO L796 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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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 := 1 + main_#t~post7;havoc main_#t~post7; 273#L41-4 [2018-11-18 13:19:53,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:53,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 3 times [2018-11-18 13:19:53,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:19:53,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:19:53,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:53,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:53,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:19:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:19:53,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:53,177 INFO L82 PathProgramCache]: Analyzing trace with hash -758591884, now seen corresponding path program 1 times [2018-11-18 13:19:53,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:19:53,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:19:53,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:53,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:19:53,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:53,185 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 13:19:53,185 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 13:19:53,185 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:19:53,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:53,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:19:53,230 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-18 13:19:53,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:19:53,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:19:53,247 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:19:53,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:19:53,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:19:53,247 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-18 13:19:53,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:19:53,323 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2018-11-18 13:19:53,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:19:53,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 56 transitions. [2018-11-18 13:19:53,324 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2018-11-18 13:19:53,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 56 transitions. [2018-11-18 13:19:53,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-18 13:19:53,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-18 13:19:53,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 56 transitions. [2018-11-18 13:19:53,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:19:53,326 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 56 transitions. [2018-11-18 13:19:53,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 56 transitions. [2018-11-18 13:19:53,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2018-11-18 13:19:53,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 13:19:53,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2018-11-18 13:19:53,330 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2018-11-18 13:19:53,330 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2018-11-18 13:19:53,330 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 13:19:53,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2018-11-18 13:19:53,331 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-18 13:19:53,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:19:53,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:19:53,332 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 13:19:53,332 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-18 13:19:53,332 INFO L794 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-18 13:19:53,332 INFO L796 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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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 := 1 + main_#t~post7;havoc main_#t~post7; 425#L41-4 [2018-11-18 13:19:53,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:53,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 4 times [2018-11-18 13:19:53,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:19:53,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:19:53,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:53,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:53,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:19:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:19:53,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:53,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1528661064, now seen corresponding path program 1 times [2018-11-18 13:19:53,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:19:53,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:19:53,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:53,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:19:53,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:53,343 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 13:19:53,343 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 13:19:53,343 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:19:53,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:53,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:19:53,411 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-18 13:19:53,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:19:53,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-18 13:19:53,437 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:19:53,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:19:53,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:19:53,437 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. cyclomatic complexity: 16 Second operand 6 states. [2018-11-18 13:19:53,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:19:53,629 INFO L93 Difference]: Finished difference Result 53 states and 81 transitions. [2018-11-18 13:19:53,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 13:19:53,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 81 transitions. [2018-11-18 13:19:53,632 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-18 13:19:53,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 81 transitions. [2018-11-18 13:19:53,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2018-11-18 13:19:53,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2018-11-18 13:19:53,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 81 transitions. [2018-11-18 13:19:53,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:19:53,635 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 81 transitions. [2018-11-18 13:19:53,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 81 transitions. [2018-11-18 13:19:53,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2018-11-18 13:19:53,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 13:19:53,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2018-11-18 13:19:53,641 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2018-11-18 13:19:53,641 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2018-11-18 13:19:53,641 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 13:19:53,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 49 transitions. [2018-11-18 13:19:53,642 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2018-11-18 13:19:53,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:19:53,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:19:53,643 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 13:19:53,643 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-18 13:19:53,644 INFO L794 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-18 13:19:53,644 INFO L796 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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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 := 1 + main_#t~post7;havoc main_#t~post7; 652#L41-4 [2018-11-18 13:19:53,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:53,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 5 times [2018-11-18 13:19:53,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:19:53,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:19:53,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:53,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:53,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:19:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:19:53,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:53,650 INFO L82 PathProgramCache]: Analyzing trace with hash -834388812, now seen corresponding path program 1 times [2018-11-18 13:19:53,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:19:53,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:19:53,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:53,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:19:53,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:53,655 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 13:19:53,655 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 13:19:53,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:19:53,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:53,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:19:53,709 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-18 13:19:53,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:19:53,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-18 13:19:53,731 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:19:53,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:19:53,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:19:53,731 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. cyclomatic complexity: 18 Second operand 6 states. [2018-11-18 13:19:53,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:19:53,858 INFO L93 Difference]: Finished difference Result 52 states and 78 transitions. [2018-11-18 13:19:53,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 13:19:53,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 78 transitions. [2018-11-18 13:19:53,859 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 43 [2018-11-18 13:19:53,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 78 transitions. [2018-11-18 13:19:53,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-11-18 13:19:53,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-11-18 13:19:53,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 78 transitions. [2018-11-18 13:19:53,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:19:53,862 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 78 transitions. [2018-11-18 13:19:53,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 78 transitions. [2018-11-18 13:19:53,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2018-11-18 13:19:53,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 13:19:53,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 56 transitions. [2018-11-18 13:19:53,866 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 56 transitions. [2018-11-18 13:19:53,867 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 56 transitions. [2018-11-18 13:19:53,867 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 13:19:53,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 56 transitions. [2018-11-18 13:19:53,867 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-11-18 13:19:53,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:19:53,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:19:53,868 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 13:19:53,868 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-18 13:19:53,868 INFO L794 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-18 13:19:53,869 INFO L796 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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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 := 1 + main_#t~post7;havoc main_#t~post7; 879#L41-4 [2018-11-18 13:19:53,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:53,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 6 times [2018-11-18 13:19:53,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:19:53,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:19:53,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:53,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:53,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:19:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:19:53,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:53,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1875853064, now seen corresponding path program 2 times [2018-11-18 13:19:53,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:19:53,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:19:53,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:53,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:19:53,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:53,882 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 13:19:53,882 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 13:19:53,883 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:19:53,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 13:19:53,901 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 13:19:53,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-18 13:19:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:19:53,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:53,929 INFO L82 PathProgramCache]: Analyzing trace with hash 908674783, now seen corresponding path program 1 times [2018-11-18 13:19:53,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:19:53,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:19:53,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:53,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:19:53,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:53,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-11-18 13:19:53,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:19:53,943 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:19:53,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:53,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:19:54,006 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-18 13:19:54,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:19:54,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:19:54,230 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2018-11-18 13:19:54,293 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:19:54,293 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:19:54,294 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:19:54,294 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:19:54,294 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:19:54,294 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:19:54,294 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:19:54,294 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:19:54,294 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration6_Loop [2018-11-18 13:19:54,294 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:19:54,294 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:19:54,296 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-18 13:19:54,311 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-18 13:19:54,313 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-18 13:19:54,314 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-18 13:19:54,315 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-18 13:19:54,316 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-18 13:19:54,317 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-18 13:20:07,608 WARN L180 SmtUtils]: Spent 13.29 s on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2018-11-18 13:20:07,642 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:20:07,642 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:07,646 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:07,646 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:07,666 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:20:07,666 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:07,680 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 13:20:07,695 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:20:07,695 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:20:07,695 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:20:07,695 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:20:07,696 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:20:07,696 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:20:07,696 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:20:07,696 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:20:07,696 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration6_Loop [2018-11-18 13:20:07,696 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:20:07,696 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:20:07,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-18 13:20:07,698 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-18 13:20:07,700 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-18 13:20:07,701 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-18 13:20:07,703 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-18 13:20:07,718 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-18 13:20:07,719 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-18 13:20:31,990 WARN L180 SmtUtils]: Spent 24.27 s on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2018-11-18 13:20:44,044 WARN L180 SmtUtils]: Spent 12.05 s on a formula simplification that was a NOOP. DAG size: 41 [2018-11-18 13:20:44,046 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:20:44,046 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:20:44,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-18 13:20:44,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:44,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:44,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,049 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-18 13:20:44,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:44,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:44,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,051 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-18 13:20:44,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:44,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:44,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,055 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-18 13:20:44,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:44,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:44,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,057 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-18 13:20:44,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:44,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:44,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,069 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-18 13:20:44,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:44,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:44,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,071 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-18 13:20:44,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:44,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:44,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,075 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 13:20:44,076 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-18 13:20:44,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,076 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:20:44,076 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:20:44,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,077 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-18 13:20:44,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,078 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:20:44,079 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:20:44,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,080 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-18 13:20:44,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,081 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:20:44,081 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:20:44,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,083 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-18 13:20:44,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,084 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:20:44,084 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:20:44,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,085 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-18 13:20:44,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,086 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:20:44,088 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:20:44,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,097 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-18 13:20:44,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,098 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:20:44,098 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:20:44,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,100 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-18 13:20:44,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,100 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:20:44,101 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:20:44,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,102 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 13:20:44,102 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-18 13:20:44,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,103 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:20:44,103 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:20:44,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,104 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-18 13:20:44,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,105 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:20:44,106 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:20:44,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,106 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-18 13:20:44,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,107 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:20:44,108 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:20:44,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,109 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-18 13:20:44,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,110 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:20:44,110 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:20:44,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,111 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-18 13:20:44,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,112 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:20:44,113 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:20:44,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,124 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-18 13:20:44,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,125 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:20:44,125 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:20:44,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,126 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-18 13:20:44,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,127 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:20:44,127 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:20:44,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,128 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 13:20:44,128 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-18 13:20:44,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,129 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:20:44,129 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:20:44,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,130 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-18 13:20:44,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,131 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:20:44,131 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:20:44,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,132 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-18 13:20:44,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,132 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:20:44,132 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:20:44,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,134 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-18 13:20:44,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,134 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:20:44,135 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:20:44,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,136 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-18 13:20:44,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,137 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:20:44,138 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:20:44,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,148 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-18 13:20:44,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,149 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:20:44,149 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:20:44,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,150 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-18 13:20:44,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:44,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,151 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:20:44,151 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:20:44,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,152 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 13:20:44,152 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-18 13:20:44,153 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,153 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:20:44,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,154 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:20:44,154 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:20:44,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,155 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-18 13:20:44,155 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,156 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:20:44,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,156 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:20:44,156 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:20:44,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,157 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-18 13:20:44,158 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,158 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:20:44,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,158 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:20:44,159 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:20:44,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,160 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-18 13:20:44,160 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,160 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:20:44,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,160 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:20:44,161 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:20:44,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,162 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-18 13:20:44,162 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,162 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:20:44,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,163 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:20:44,164 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:20:44,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,190 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-18 13:20:44,190 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,190 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:20:44,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,191 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:20:44,191 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:20:44,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,192 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-18 13:20:44,192 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,193 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:20:44,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,193 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:20:44,193 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:20:44,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,194 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 13:20:44,194 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-18 13:20:44,194 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,194 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:20:44,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,195 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:20:44,195 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:20:44,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,196 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-18 13:20:44,196 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,197 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:20:44,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,197 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:20:44,197 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:20:44,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,199 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-18 13:20:44,199 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,199 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:20:44,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,200 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:20:44,200 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:20:44,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,202 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-18 13:20:44,202 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,202 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:20:44,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,203 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:20:44,203 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:20:44,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,205 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-18 13:20:44,205 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,205 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:20:44,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,206 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:20:44,208 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:20:44,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,253 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-18 13:20:44,254 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,254 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:20:44,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,254 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:20:44,255 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:20:44,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,257 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-18 13:20:44,257 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,257 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:20:44,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,258 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:20:44,258 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:20:44,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,259 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 13:20:44,260 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-18 13:20:44,260 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,260 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:20:44,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,261 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:20:44,262 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:20:44,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,263 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-18 13:20:44,263 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,263 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:20:44,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,264 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:20:44,265 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:20:44,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,266 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-18 13:20:44,266 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,266 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:20:44,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,267 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:20:44,267 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:20:44,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,269 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-18 13:20:44,269 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,269 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:20:44,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,270 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:20:44,270 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:20:44,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,271 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-18 13:20:44,272 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,272 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:20:44,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,273 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:20:44,276 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:20:44,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,339 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-18 13:20:44,339 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,339 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:20:44,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,340 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:20:44,341 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:20:44,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,344 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-18 13:20:44,345 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,345 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:20:44,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,346 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:20:44,346 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:20:44,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,347 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 13:20:44,347 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-18 13:20:44,348 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,348 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:20:44,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,348 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:20:44,349 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:20:44,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,351 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-18 13:20:44,351 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,351 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:20:44,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,352 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:20:44,352 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:20:44,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,354 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-18 13:20:44,354 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,354 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:20:44,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,354 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:20:44,355 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:20:44,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,356 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-18 13:20:44,357 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,357 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:20:44,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,357 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:20:44,358 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:20:44,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,360 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-18 13:20:44,360 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,360 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:20:44,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,361 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:20:44,362 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:20:44,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,374 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-18 13:20:44,375 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,375 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:20:44,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,375 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:20:44,376 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:20:44,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,378 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-18 13:20:44,378 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,378 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:20:44,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,378 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:20:44,379 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:20:44,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,380 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 13:20:44,381 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-18 13:20:44,381 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,381 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:20:44,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,381 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:20:44,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:20:44,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,385 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-18 13:20:44,385 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,386 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:20:44,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,386 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:20:44,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:20:44,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,390 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-18 13:20:44,390 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,390 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:20:44,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,391 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:20:44,392 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:20:44,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,394 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-18 13:20:44,395 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,395 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:20:44,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,395 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:20:44,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:20:44,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,398 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-18 13:20:44,399 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,399 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:20:44,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,399 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:20:44,402 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:20:44,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,424 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-18 13:20:44,424 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,424 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:20:44,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,424 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:20:44,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:20:44,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,428 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-18 13:20:44,428 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:20:44,428 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:20:44,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:44,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:44,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:44,429 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:20:44,429 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:20:44,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:44,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:44,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:20:44,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:20:44,432 INFO L87 Difference]: Start difference. First operand 36 states and 56 transitions. cyclomatic complexity: 22 Second operand 4 states. [2018-11-18 13:20:44,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:20:44,532 INFO L93 Difference]: Finished difference Result 38 states and 57 transitions. [2018-11-18 13:20:44,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:20:44,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 57 transitions. [2018-11-18 13:20:44,533 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2018-11-18 13:20:44,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 57 transitions. [2018-11-18 13:20:44,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-18 13:20:44,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-18 13:20:44,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 57 transitions. [2018-11-18 13:20:44,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:20:44,535 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 57 transitions. [2018-11-18 13:20:44,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 57 transitions. [2018-11-18 13:20:44,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-11-18 13:20:44,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 13:20:44,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 51 transitions. [2018-11-18 13:20:44,540 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 51 transitions. [2018-11-18 13:20:44,540 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 51 transitions. [2018-11-18 13:20:44,540 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 13:20:44,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 51 transitions. [2018-11-18 13:20:44,541 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-18 13:20:44,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:20:44,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:20:44,542 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 13:20:44,542 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-18 13:20:44,542 INFO L794 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-18 13:20:44,542 INFO L796 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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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 := 1 + main_#t~post7;havoc main_#t~post7; 1067#L41-4 [2018-11-18 13:20:44,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:44,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 7 times [2018-11-18 13:20:44,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:44,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:44,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:44,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:20:44,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:20:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:20:44,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:44,546 INFO L82 PathProgramCache]: Analyzing trace with hash 746561016, now seen corresponding path program 2 times [2018-11-18 13:20:44,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:44,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:44,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:44,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:20:44,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:44,549 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 13:20:44,549 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 13:20:44,549 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:44,571 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 13:20:44,582 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 13:20:44,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:20:44,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:44,661 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-18 13:20:44,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:20:44,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-18 13:20:44,688 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:20:44,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 13:20:44,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-18 13:20:44,688 INFO L87 Difference]: Start difference. First operand 34 states and 51 transitions. cyclomatic complexity: 19 Second operand 8 states. [2018-11-18 13:20:44,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:20:44,928 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2018-11-18 13:20:44,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 13:20:44,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 91 transitions. [2018-11-18 13:20:44,930 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 48 [2018-11-18 13:20:44,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 91 transitions. [2018-11-18 13:20:44,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2018-11-18 13:20:44,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2018-11-18 13:20:44,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 91 transitions. [2018-11-18 13:20:44,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:20:44,933 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 91 transitions. [2018-11-18 13:20:44,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 91 transitions. [2018-11-18 13:20:44,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2018-11-18 13:20:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 13:20:44,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2018-11-18 13:20:44,937 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 61 transitions. [2018-11-18 13:20:44,937 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 61 transitions. [2018-11-18 13:20:44,937 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 13:20:44,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 61 transitions. [2018-11-18 13:20:44,937 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2018-11-18 13:20:44,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:20:44,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:20:44,938 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 13:20:44,938 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-18 13:20:44,938 INFO L794 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-18 13:20:44,938 INFO L796 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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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 := 1 + main_#t~post7;havoc main_#t~post7; 1286#L41-4 [2018-11-18 13:20:44,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:44,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 8 times [2018-11-18 13:20:44,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:44,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:44,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:44,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:20:44,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:20:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:20:44,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:44,943 INFO L82 PathProgramCache]: Analyzing trace with hash 781966320, now seen corresponding path program 1 times [2018-11-18 13:20:44,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:44,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:44,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:44,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:20:44,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:44,945 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 13:20:44,945 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 13:20:44,946 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:44,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:20:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:20:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:20:45,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:45,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1129093911, now seen corresponding path program 1 times [2018-11-18 13:20:45,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:45,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:45,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:45,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:20:45,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:45,004 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 13:20:45,004 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 13:20:45,004 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:45,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:20:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:20:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:20:45,217 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:20:45,217 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:20:45,217 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:20:45,217 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:20:45,217 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:20:45,217 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:20:45,217 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:20:45,218 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:20:45,218 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration8_Loop [2018-11-18 13:20:45,218 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:20:45,218 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:20:45,219 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-18 13:20:45,222 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-18 13:20:45,223 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-18 13:20:45,225 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-18 13:20:45,227 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-18 13:20:45,233 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-18 13:20:45,236 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-18 13:20:45,239 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-18 13:20:45,240 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-18 13:20:45,244 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-18 13:20:45,297 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:20:45,298 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:45,309 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:45,310 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:45,312 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:20:45,312 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:45,337 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:45,338 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:45,340 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:20:45,340 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:45,370 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:45,370 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:45,372 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:20:45,372 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:45,401 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:45,402 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:45,404 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:20:45,404 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:45,434 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:45,434 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:45,466 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:20:45,466 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:45,611 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 13:20:45,613 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:20:45,613 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:20:45,613 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:20:45,613 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:20:45,613 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:20:45,613 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:20:45,613 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:20:45,613 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:20:45,613 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration8_Loop [2018-11-18 13:20:45,614 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:20:45,614 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:20:45,615 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-18 13:20:45,624 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-18 13:20:45,626 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-18 13:20:45,628 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-18 13:20:45,630 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-18 13:20:45,637 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-18 13:20:45,649 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-18 13:20:45,651 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-18 13:20:45,652 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-18 13:20:45,653 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-18 13:20:45,718 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:20:45,718 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:20:45,718 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-18 13:20:45,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:45,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:45,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:45,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:45,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:45,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:45,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:45,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:45,721 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-18 13:20:45,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:45,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:45,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:45,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:45,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:45,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:45,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:45,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:45,722 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-18 13:20:45,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:45,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:45,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:45,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:45,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:45,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:45,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:45,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:45,724 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-18 13:20:45,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:45,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:45,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:45,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:45,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:45,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:45,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:45,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:45,726 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-18 13:20:45,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:45,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:45,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:45,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:45,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:45,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:45,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:45,728 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:20:45,729 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:20:45,729 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 13:20:45,729 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:20:45,729 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:20:45,730 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:20:45,730 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 1 Supporting invariants [] [2018-11-18 13:20:45,730 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:20:45,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:45,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:45,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:45,826 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-18 13:20:45,826 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-18 13:20:45,826 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 61 transitions. cyclomatic complexity: 22 Second operand 8 states. [2018-11-18 13:20:46,022 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-18 13:20:46,023 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-18 13:20:46,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 13:20:46,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2018-11-18 13:20:46,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 75 transitions. Stem has 4 letters. Loop has 26 letters. [2018-11-18 13:20:46,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:46,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 75 transitions. Stem has 30 letters. Loop has 26 letters. [2018-11-18 13:20:46,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:46,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 75 transitions. Stem has 4 letters. Loop has 52 letters. [2018-11-18 13:20:46,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:46,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 214 transitions. [2018-11-18 13:20:46,029 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 45 [2018-11-18 13:20:46,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 142 states and 213 transitions. [2018-11-18 13:20:46,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2018-11-18 13:20:46,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2018-11-18 13:20:46,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 213 transitions. [2018-11-18 13:20:46,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:20:46,033 INFO L705 BuchiCegarLoop]: Abstraction has 142 states and 213 transitions. [2018-11-18 13:20:46,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 213 transitions. [2018-11-18 13:20:46,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 137. [2018-11-18 13:20:46,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-18 13:20:46,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 204 transitions. [2018-11-18 13:20:46,043 INFO L728 BuchiCegarLoop]: Abstraction has 137 states and 204 transitions. [2018-11-18 13:20:46,043 INFO L608 BuchiCegarLoop]: Abstraction has 137 states and 204 transitions. [2018-11-18 13:20:46,044 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 13:20:46,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 204 transitions. [2018-11-18 13:20:46,045 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 45 [2018-11-18 13:20:46,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:20:46,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:20:46,046 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 13:20:46,046 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-18 13:20:46,046 INFO L794 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-18 13:20:46,047 INFO L796 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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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 := 1 + main_#t~post7;havoc main_#t~post7; 1657#L41-4 assume true; 1658#L41-1 [2018-11-18 13:20:46,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:46,047 INFO L82 PathProgramCache]: Analyzing trace with hash 36330288, now seen corresponding path program 1 times [2018-11-18 13:20:46,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:46,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:46,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:46,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:20:46,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:20:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:20:46,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:46,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1090998746, now seen corresponding path program 1 times [2018-11-18 13:20:46,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:46,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:46,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:46,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:20:46,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:46,054 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 13:20:46,054 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 13:20:46,054 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:46,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:20:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:46,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:46,171 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-18 13:20:46,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:20:46,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-18 13:20:46,194 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:20:46,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 13:20:46,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-18 13:20:46,194 INFO L87 Difference]: Start difference. First operand 137 states and 204 transitions. cyclomatic complexity: 72 Second operand 8 states. [2018-11-18 13:20:46,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:20:46,355 INFO L93 Difference]: Finished difference Result 173 states and 268 transitions. [2018-11-18 13:20:46,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 13:20:46,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 173 states and 268 transitions. [2018-11-18 13:20:46,358 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 52 [2018-11-18 13:20:46,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 173 states to 173 states and 268 transitions. [2018-11-18 13:20:46,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2018-11-18 13:20:46,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2018-11-18 13:20:46,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 173 states and 268 transitions. [2018-11-18 13:20:46,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:20:46,361 INFO L705 BuchiCegarLoop]: Abstraction has 173 states and 268 transitions. [2018-11-18 13:20:46,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 268 transitions. [2018-11-18 13:20:46,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 139. [2018-11-18 13:20:46,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-18 13:20:46,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 206 transitions. [2018-11-18 13:20:46,369 INFO L728 BuchiCegarLoop]: Abstraction has 139 states and 206 transitions. [2018-11-18 13:20:46,369 INFO L608 BuchiCegarLoop]: Abstraction has 139 states and 206 transitions. [2018-11-18 13:20:46,369 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 13:20:46,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 206 transitions. [2018-11-18 13:20:46,371 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 46 [2018-11-18 13:20:46,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:20:46,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:20:46,372 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 13:20:46,372 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-18 13:20:46,372 INFO L794 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-18 13:20:46,372 INFO L796 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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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 := 1 + main_#t~post7;havoc main_#t~post7; 2228#L41-4 assume true; 2229#L41-1 [2018-11-18 13:20:46,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:46,373 INFO L82 PathProgramCache]: Analyzing trace with hash 36330288, now seen corresponding path program 2 times [2018-11-18 13:20:46,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:46,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:46,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:46,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:20:46,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:20:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:20:46,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:46,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1360175974, now seen corresponding path program 3 times [2018-11-18 13:20:46,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:46,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:46,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:46,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:20:46,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:46,379 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 13:20:46,379 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 13:20:46,379 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:46,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 13:20:46,410 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 13:20:46,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:20:46,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:46,471 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-18 13:20:46,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:20:46,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 13:20:46,486 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:20:46,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 13:20:46,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:20:46,487 INFO L87 Difference]: Start difference. First operand 139 states and 206 transitions. cyclomatic complexity: 72 Second operand 7 states. [2018-11-18 13:20:46,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:20:46,576 INFO L93 Difference]: Finished difference Result 191 states and 264 transitions. [2018-11-18 13:20:46,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 13:20:46,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 264 transitions. [2018-11-18 13:20:46,579 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 60 [2018-11-18 13:20:46,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 179 states and 252 transitions. [2018-11-18 13:20:46,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2018-11-18 13:20:46,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2018-11-18 13:20:46,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 252 transitions. [2018-11-18 13:20:46,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:20:46,581 INFO L705 BuchiCegarLoop]: Abstraction has 179 states and 252 transitions. [2018-11-18 13:20:46,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 252 transitions. [2018-11-18 13:20:46,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 163. [2018-11-18 13:20:46,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-18 13:20:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 231 transitions. [2018-11-18 13:20:46,590 INFO L728 BuchiCegarLoop]: Abstraction has 163 states and 231 transitions. [2018-11-18 13:20:46,590 INFO L608 BuchiCegarLoop]: Abstraction has 163 states and 231 transitions. [2018-11-18 13:20:46,590 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 13:20:46,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 231 transitions. [2018-11-18 13:20:46,591 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 56 [2018-11-18 13:20:46,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:20:46,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:20:46,592 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 13:20:46,592 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-18 13:20:46,592 INFO L794 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-18 13:20:46,593 INFO L796 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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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 := 1 + main_#t~post7;havoc main_#t~post7; 2736#L41-4 assume true; 2737#L41-1 [2018-11-18 13:20:46,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:46,593 INFO L82 PathProgramCache]: Analyzing trace with hash 36330288, now seen corresponding path program 3 times [2018-11-18 13:20:46,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:46,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:46,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:46,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:20:46,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:20:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:20:46,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:46,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1708854242, now seen corresponding path program 4 times [2018-11-18 13:20:46,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:46,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:46,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:46,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:20:46,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:46,599 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 13:20:46,599 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 13:20:46,600 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:46,615 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 13:20:46,629 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 13:20:46,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:20:46,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:46,696 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-18 13:20:46,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:20:46,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-18 13:20:46,712 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:20:46,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 13:20:46,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:20:46,712 INFO L87 Difference]: Start difference. First operand 163 states and 231 transitions. cyclomatic complexity: 74 Second operand 7 states. [2018-11-18 13:20:46,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:20:46,807 INFO L93 Difference]: Finished difference Result 219 states and 298 transitions. [2018-11-18 13:20:46,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 13:20:46,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 219 states and 298 transitions. [2018-11-18 13:20:46,809 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 66 [2018-11-18 13:20:46,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 219 states to 219 states and 298 transitions. [2018-11-18 13:20:46,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 110 [2018-11-18 13:20:46,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2018-11-18 13:20:46,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 219 states and 298 transitions. [2018-11-18 13:20:46,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:20:46,812 INFO L705 BuchiCegarLoop]: Abstraction has 219 states and 298 transitions. [2018-11-18 13:20:46,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states and 298 transitions. [2018-11-18 13:20:46,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 163. [2018-11-18 13:20:46,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-18 13:20:46,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 227 transitions. [2018-11-18 13:20:46,825 INFO L728 BuchiCegarLoop]: Abstraction has 163 states and 227 transitions. [2018-11-18 13:20:46,825 INFO L608 BuchiCegarLoop]: Abstraction has 163 states and 227 transitions. [2018-11-18 13:20:46,825 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 13:20:46,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 227 transitions. [2018-11-18 13:20:46,826 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 56 [2018-11-18 13:20:46,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:20:46,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:20:46,828 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 13:20:46,829 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-18 13:20:46,829 INFO L794 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-18 13:20:46,829 INFO L796 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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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 := 1 + main_#t~post7;havoc main_#t~post7; 3324#L41-4 assume true; 3325#L41-1 [2018-11-18 13:20:46,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:46,829 INFO L82 PathProgramCache]: Analyzing trace with hash 36330288, now seen corresponding path program 4 times [2018-11-18 13:20:46,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:46,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:46,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:46,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:20:46,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:20:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:20:46,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:46,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1138602078, now seen corresponding path program 5 times [2018-11-18 13:20:46,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:46,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:46,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:46,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:20:46,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:46,836 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 13:20:46,836 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 13:20:46,836 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:46,855 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 13:20:46,878 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-18 13:20:46,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:20:46,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:46,953 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-18 13:20:46,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:20:46,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-18 13:20:46,969 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:20:46,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 13:20:46,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-18 13:20:46,969 INFO L87 Difference]: Start difference. First operand 163 states and 227 transitions. cyclomatic complexity: 70 Second operand 11 states. [2018-11-18 13:20:47,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:20:47,304 INFO L93 Difference]: Finished difference Result 351 states and 521 transitions. [2018-11-18 13:20:47,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 13:20:47,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 351 states and 521 transitions. [2018-11-18 13:20:47,307 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 102 [2018-11-18 13:20:47,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 351 states to 347 states and 509 transitions. [2018-11-18 13:20:47,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 173 [2018-11-18 13:20:47,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 173 [2018-11-18 13:20:47,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 347 states and 509 transitions. [2018-11-18 13:20:47,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:20:47,310 INFO L705 BuchiCegarLoop]: Abstraction has 347 states and 509 transitions. [2018-11-18 13:20:47,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states and 509 transitions. [2018-11-18 13:20:47,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 241. [2018-11-18 13:20:47,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-18 13:20:47,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 365 transitions. [2018-11-18 13:20:47,319 INFO L728 BuchiCegarLoop]: Abstraction has 241 states and 365 transitions. [2018-11-18 13:20:47,319 INFO L608 BuchiCegarLoop]: Abstraction has 241 states and 365 transitions. [2018-11-18 13:20:47,319 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-18 13:20:47,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 241 states and 365 transitions. [2018-11-18 13:20:47,320 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 60 [2018-11-18 13:20:47,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:20:47,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:20:47,321 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-18 13:20:47,321 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 13:20:47,321 INFO L794 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-18 13:20:47,321 INFO L796 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-18 13:20:47,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:47,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1675379976, now seen corresponding path program 1 times [2018-11-18 13:20:47,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:47,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:47,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:47,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:20:47,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:47,345 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-18 13:20:47,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:20:47,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 13:20:47,345 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:20:47,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:47,346 INFO L82 PathProgramCache]: Analyzing trace with hash 29982, now seen corresponding path program 1 times [2018-11-18 13:20:47,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:47,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:47,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:47,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:20:47,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:20:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:20:47,377 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:20:47,377 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:20:47,377 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:20:47,378 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:20:47,378 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:20:47,378 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:20:47,378 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:20:47,378 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:20:47,378 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration13_Loop [2018-11-18 13:20:47,378 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:20:47,378 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:20:47,378 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-18 13:20:47,379 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-18 13:20:47,380 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-18 13:20:47,383 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-18 13:20:47,392 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:20:47,392 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:47,394 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:47,394 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:47,395 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:20:47,396 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:47,411 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:47,411 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:47,413 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:20:47,413 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:47,428 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:47,429 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:47,446 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:20:47,447 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:47,462 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 13:20:47,464 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:20:47,464 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:20:47,464 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:20:47,464 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:20:47,464 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:20:47,464 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:20:47,464 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:20:47,464 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:20:47,464 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration13_Loop [2018-11-18 13:20:47,464 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:20:47,464 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:20:47,465 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-18 13:20:47,466 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-18 13:20:47,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-18 13:20:47,470 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-18 13:20:47,494 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:20:47,494 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:20:47,494 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-18 13:20:47,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:47,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:47,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:47,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:47,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:47,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:47,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:47,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:47,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-18 13:20:47,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:47,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:47,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:47,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:47,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:47,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:47,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:47,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:47,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-18 13:20:47,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:47,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:47,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:47,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:47,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:47,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:47,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:47,499 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:20:47,499 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:20:47,500 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 13:20:47,500 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:20:47,500 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:20:47,500 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:20:47,500 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2018-11-18 13:20:47,500 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:20:47,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:47,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:47,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:47,586 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-18 13:20:47,587 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-18 13:20:47,587 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 241 states and 365 transitions. cyclomatic complexity: 129 Second operand 5 states. [2018-11-18 13:20:47,665 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-18 13:20:47,665 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-18 13:20:47,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 13:20:47,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-18 13:20:47,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-18 13:20:47,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:47,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 21 letters. Loop has 3 letters. [2018-11-18 13:20:47,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:47,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 18 letters. Loop has 6 letters. [2018-11-18 13:20:47,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:47,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 343 states and 517 transitions. [2018-11-18 13:20:47,670 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 60 [2018-11-18 13:20:47,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 343 states to 329 states and 501 transitions. [2018-11-18 13:20:47,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 157 [2018-11-18 13:20:47,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2018-11-18 13:20:47,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 329 states and 501 transitions. [2018-11-18 13:20:47,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:20:47,675 INFO L705 BuchiCegarLoop]: Abstraction has 329 states and 501 transitions. [2018-11-18 13:20:47,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states and 501 transitions. [2018-11-18 13:20:47,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 323. [2018-11-18 13:20:47,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-11-18 13:20:47,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 491 transitions. [2018-11-18 13:20:47,685 INFO L728 BuchiCegarLoop]: Abstraction has 323 states and 491 transitions. [2018-11-18 13:20:47,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:20:47,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:20:47,685 INFO L87 Difference]: Start difference. First operand 323 states and 491 transitions. Second operand 6 states. [2018-11-18 13:20:47,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:20:47,746 INFO L93 Difference]: Finished difference Result 369 states and 533 transitions. [2018-11-18 13:20:47,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 13:20:47,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 369 states and 533 transitions. [2018-11-18 13:20:47,750 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 60 [2018-11-18 13:20:47,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 369 states to 369 states and 533 transitions. [2018-11-18 13:20:47,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 181 [2018-11-18 13:20:47,753 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 181 [2018-11-18 13:20:47,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 369 states and 533 transitions. [2018-11-18 13:20:47,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:20:47,753 INFO L705 BuchiCegarLoop]: Abstraction has 369 states and 533 transitions. [2018-11-18 13:20:47,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states and 533 transitions. [2018-11-18 13:20:47,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 347. [2018-11-18 13:20:47,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-11-18 13:20:47,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 509 transitions. [2018-11-18 13:20:47,762 INFO L728 BuchiCegarLoop]: Abstraction has 347 states and 509 transitions. [2018-11-18 13:20:47,762 INFO L608 BuchiCegarLoop]: Abstraction has 347 states and 509 transitions. [2018-11-18 13:20:47,762 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-18 13:20:47,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 347 states and 509 transitions. [2018-11-18 13:20:47,764 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 60 [2018-11-18 13:20:47,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:20:47,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:20:47,765 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-18 13:20:47,765 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-18 13:20:47,765 INFO L794 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-18 13:20:47,766 INFO L796 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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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 := 1 + main_#t~post7;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-18 13:20:47,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:47,766 INFO L82 PathProgramCache]: Analyzing trace with hash -529846092, now seen corresponding path program 1 times [2018-11-18 13:20:47,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:47,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:47,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:47,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:20:47,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:47,768 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 13:20:47,768 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 13:20:47,768 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:47,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:20:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:47,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:47,831 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-18 13:20:47,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:20:47,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-18 13:20:47,848 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:20:47,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:47,848 INFO L82 PathProgramCache]: Analyzing trace with hash -458006204, now seen corresponding path program 6 times [2018-11-18 13:20:47,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:47,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:47,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:47,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:20:47,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:47,851 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 13:20:47,851 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 13:20:47,851 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:47,867 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 13:20:47,898 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-18 13:20:47,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:20:47,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:47,981 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-18 13:20:47,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:20:47,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-18 13:20:47,996 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:20:47,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:20:47,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:20:47,997 INFO L87 Difference]: Start difference. First operand 347 states and 509 transitions. cyclomatic complexity: 170 Second operand 6 states. [2018-11-18 13:20:48,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:20:48,087 INFO L93 Difference]: Finished difference Result 440 states and 654 transitions. [2018-11-18 13:20:48,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 13:20:48,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 440 states and 654 transitions. [2018-11-18 13:20:48,091 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 70 [2018-11-18 13:20:48,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 440 states to 436 states and 646 transitions. [2018-11-18 13:20:48,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 213 [2018-11-18 13:20:48,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 213 [2018-11-18 13:20:48,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 436 states and 646 transitions. [2018-11-18 13:20:48,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:20:48,097 INFO L705 BuchiCegarLoop]: Abstraction has 436 states and 646 transitions. [2018-11-18 13:20:48,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states and 646 transitions. [2018-11-18 13:20:48,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 361. [2018-11-18 13:20:48,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-11-18 13:20:48,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 530 transitions. [2018-11-18 13:20:48,107 INFO L728 BuchiCegarLoop]: Abstraction has 361 states and 530 transitions. [2018-11-18 13:20:48,107 INFO L608 BuchiCegarLoop]: Abstraction has 361 states and 530 transitions. [2018-11-18 13:20:48,107 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-18 13:20:48,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 361 states and 530 transitions. [2018-11-18 13:20:48,109 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 60 [2018-11-18 13:20:48,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:20:48,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:20:48,110 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-18 13:20:48,110 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-18 13:20:48,111 INFO L794 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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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-18 13:20:48,111 INFO L796 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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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-18 13:20:48,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:48,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1467266291, now seen corresponding path program 1 times [2018-11-18 13:20:48,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:48,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:48,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:48,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:20:48,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:48,114 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 13:20:48,114 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 13:20:48,114 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:48,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:20:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:48,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:48,171 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-18 13:20:48,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:20:48,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-18 13:20:48,187 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:20:48,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:48,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1876628369, now seen corresponding path program 1 times [2018-11-18 13:20:48,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:48,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:48,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:48,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:20:48,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:48,192 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 13:20:48,192 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 13:20:48,192 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:48,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:20:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:20:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:20:48,401 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:20:48,401 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:20:48,401 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:20:48,402 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:20:48,402 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:20:48,402 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:20:48,402 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:20:48,402 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:20:48,402 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration15_Loop [2018-11-18 13:20:48,402 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:20:48,402 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:20:48,403 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-18 13:20:48,415 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-18 13:20:48,416 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-18 13:20:48,417 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-18 13:20:48,418 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-18 13:20:48,420 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-18 13:20:48,421 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-18 13:20:48,458 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:20:48,458 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:48,459 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:48,460 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:48,477 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:20:48,477 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:49,058 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 13:20:49,060 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:20:49,060 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:20:49,060 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:20:49,060 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:20:49,060 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:20:49,060 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:20:49,060 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:20:49,061 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:20:49,061 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration15_Loop [2018-11-18 13:20:49,061 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:20:49,061 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:20:49,062 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-18 13:20:49,065 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-18 13:20:49,066 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-18 13:20:49,076 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-18 13:20:49,087 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-18 13:20:49,088 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-18 13:20:49,090 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-18 13:20:49,125 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:20:49,125 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:20:49,126 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-18 13:20:49,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:49,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:49,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:49,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:49,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:49,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:49,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:49,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:49,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-18 13:20:49,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:49,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:49,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:49,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:49,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:49,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:49,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:49,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:49,128 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-18 13:20:49,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:49,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:49,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:49,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:49,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:49,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:49,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:49,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:49,129 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-18 13:20:49,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:49,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:49,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:49,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:49,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:49,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:49,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:49,132 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:20:49,135 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 13:20:49,135 INFO L444 ModelExtractionUtils]: 5 out of 9 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 13:20:49,136 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:20:49,136 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:20:49,136 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:20:49,136 INFO L520 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-18 13:20:49,136 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:20:49,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:49,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:49,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:49,255 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-18 13:20:49,256 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-18 13:20:49,256 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 361 states and 530 transitions. cyclomatic complexity: 177 Second operand 7 states. [2018-11-18 13:20:49,334 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-18 13:20:49,334 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-18 13:20:49,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 13:20:49,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-11-18 13:20:49,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 36 letters. Loop has 27 letters. [2018-11-18 13:20:49,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:49,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 63 letters. Loop has 27 letters. [2018-11-18 13:20:49,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:49,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 36 letters. Loop has 54 letters. [2018-11-18 13:20:49,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:49,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 968 states and 1363 transitions. [2018-11-18 13:20:49,348 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 106 [2018-11-18 13:20:49,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 968 states to 945 states and 1332 transitions. [2018-11-18 13:20:49,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 359 [2018-11-18 13:20:49,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 364 [2018-11-18 13:20:49,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 945 states and 1332 transitions. [2018-11-18 13:20:49,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:20:49,358 INFO L705 BuchiCegarLoop]: Abstraction has 945 states and 1332 transitions. [2018-11-18 13:20:49,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states and 1332 transitions. [2018-11-18 13:20:49,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 937. [2018-11-18 13:20:49,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2018-11-18 13:20:49,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1323 transitions. [2018-11-18 13:20:49,388 INFO L728 BuchiCegarLoop]: Abstraction has 937 states and 1323 transitions. [2018-11-18 13:20:49,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 13:20:49,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:20:49,389 INFO L87 Difference]: Start difference. First operand 937 states and 1323 transitions. Second operand 7 states. [2018-11-18 13:20:49,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:20:49,598 INFO L93 Difference]: Finished difference Result 987 states and 1424 transitions. [2018-11-18 13:20:49,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 13:20:49,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 987 states and 1424 transitions. [2018-11-18 13:20:49,609 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 106 [2018-11-18 13:20:49,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 987 states to 987 states and 1424 transitions. [2018-11-18 13:20:49,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 369 [2018-11-18 13:20:49,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 369 [2018-11-18 13:20:49,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 987 states and 1424 transitions. [2018-11-18 13:20:49,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:20:49,619 INFO L705 BuchiCegarLoop]: Abstraction has 987 states and 1424 transitions. [2018-11-18 13:20:49,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states and 1424 transitions. [2018-11-18 13:20:49,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 923. [2018-11-18 13:20:49,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-11-18 13:20:49,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1300 transitions. [2018-11-18 13:20:49,645 INFO L728 BuchiCegarLoop]: Abstraction has 923 states and 1300 transitions. [2018-11-18 13:20:49,645 INFO L608 BuchiCegarLoop]: Abstraction has 923 states and 1300 transitions. [2018-11-18 13:20:49,645 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-18 13:20:49,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 923 states and 1300 transitions. [2018-11-18 13:20:49,650 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 106 [2018-11-18 13:20:49,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:20:49,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:20:49,652 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-18 13:20:49,652 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 13:20:49,653 INFO L794 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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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-18 13:20:49,653 INFO L796 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-18 13:20:49,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:49,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1071030368, now seen corresponding path program 1 times [2018-11-18 13:20:49,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:49,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:49,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:49,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:20:49,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:49,656 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 13:20:49,656 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 13:20:49,656 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 13:20:49,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:20:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:49,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:49,704 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-18 13:20:49,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:20:49,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 13:20:49,728 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:20:49,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:49,728 INFO L82 PathProgramCache]: Analyzing trace with hash 29982, now seen corresponding path program 2 times [2018-11-18 13:20:49,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:49,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:49,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:49,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:20:49,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:20:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:20:49,759 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:20:49,759 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:20:49,759 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:20:49,759 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:20:49,759 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:20:49,759 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:20:49,760 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:20:49,760 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:20:49,760 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration16_Loop [2018-11-18 13:20:49,760 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:20:49,760 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:20:49,760 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-18 13:20:49,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-18 13:20:49,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-18 13:20:49,775 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-18 13:20:49,796 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:20:49,796 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:49,799 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:49,799 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:49,805 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:20:49,805 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:49,833 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:49,833 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:49,845 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:20:49,845 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:49,870 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:49,870 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:49,898 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:20:49,898 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:49,924 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 13:20:49,928 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:20:49,929 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:20:49,929 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:20:49,929 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:20:49,929 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:20:49,929 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:20:49,929 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:20:49,929 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:20:49,929 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration16_Loop [2018-11-18 13:20:49,929 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:20:49,929 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:20:49,930 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-18 13:20:49,935 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-18 13:20:49,940 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-18 13:20:49,949 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-18 13:20:49,960 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:20:49,961 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:20:49,961 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-18 13:20:49,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:49,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:49,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:49,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:49,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:49,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:49,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:49,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:49,966 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-18 13:20:49,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:49,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:49,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:49,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:49,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:49,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:49,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:49,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:49,967 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-18 13:20:49,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:49,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:49,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:49,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:49,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:49,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:49,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:49,969 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:20:49,970 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:20:49,970 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 13:20:49,970 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:20:49,970 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:20:49,970 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:20:49,970 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2018-11-18 13:20:49,970 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:20:49,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:50,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:50,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:50,054 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-18 13:20:50,054 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-18 13:20:50,054 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 923 states and 1300 transitions. cyclomatic complexity: 401 Second operand 5 states. [2018-11-18 13:20:50,115 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-18 13:20:50,116 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-18 13:20:50,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 13:20:50,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-18 13:20:50,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 45 letters. Loop has 3 letters. [2018-11-18 13:20:50,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:50,117 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 13:20:50,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:50,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:50,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:50,186 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-18 13:20:50,186 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-18 13:20:50,186 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 923 states and 1300 transitions. cyclomatic complexity: 401 Second operand 5 states. [2018-11-18 13:20:50,249 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-18 13:20:50,250 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-18 13:20:50,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 13:20:50,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-18 13:20:50,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 45 letters. Loop has 3 letters. [2018-11-18 13:20:50,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:50,251 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 13:20:50,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:50,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:50,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:50,327 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-18 13:20:50,327 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-18 13:20:50,327 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 923 states and 1300 transitions. cyclomatic complexity: 401 Second operand 5 states. [2018-11-18 13:20:50,401 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-18 13:20:50,402 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-18 13:20:50,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 13:20:50,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2018-11-18 13:20:50,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 45 letters. Loop has 3 letters. [2018-11-18 13:20:50,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:50,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 48 letters. Loop has 3 letters. [2018-11-18 13:20:50,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:50,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 45 letters. Loop has 6 letters. [2018-11-18 13:20:50,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:50,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1145 states and 1554 transitions. [2018-11-18 13:20:50,412 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 97 [2018-11-18 13:20:50,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1145 states to 823 states and 1153 transitions. [2018-11-18 13:20:50,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 245 [2018-11-18 13:20:50,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 255 [2018-11-18 13:20:50,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 823 states and 1153 transitions. [2018-11-18 13:20:50,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:20:50,418 INFO L705 BuchiCegarLoop]: Abstraction has 823 states and 1153 transitions. [2018-11-18 13:20:50,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states and 1153 transitions. [2018-11-18 13:20:50,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 771. [2018-11-18 13:20:50,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2018-11-18 13:20:50,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1069 transitions. [2018-11-18 13:20:50,430 INFO L728 BuchiCegarLoop]: Abstraction has 771 states and 1069 transitions. [2018-11-18 13:20:50,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:20:50,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:20:50,430 INFO L87 Difference]: Start difference. First operand 771 states and 1069 transitions. Second operand 6 states. [2018-11-18 13:20:50,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:20:50,494 INFO L93 Difference]: Finished difference Result 841 states and 1165 transitions. [2018-11-18 13:20:50,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 13:20:50,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 841 states and 1165 transitions. [2018-11-18 13:20:50,500 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 97 [2018-11-18 13:20:50,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 841 states to 841 states and 1165 transitions. [2018-11-18 13:20:50,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 258 [2018-11-18 13:20:50,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 258 [2018-11-18 13:20:50,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 841 states and 1165 transitions. [2018-11-18 13:20:50,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:20:50,505 INFO L705 BuchiCegarLoop]: Abstraction has 841 states and 1165 transitions. [2018-11-18 13:20:50,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states and 1165 transitions. [2018-11-18 13:20:50,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 812. [2018-11-18 13:20:50,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2018-11-18 13:20:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1128 transitions. [2018-11-18 13:20:50,517 INFO L728 BuchiCegarLoop]: Abstraction has 812 states and 1128 transitions. [2018-11-18 13:20:50,517 INFO L608 BuchiCegarLoop]: Abstraction has 812 states and 1128 transitions. [2018-11-18 13:20:50,517 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-18 13:20:50,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 812 states and 1128 transitions. [2018-11-18 13:20:50,521 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 97 [2018-11-18 13:20:50,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:20:50,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:20:50,522 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-18 13:20:50,522 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-18 13:20:50,522 INFO L794 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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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 := 1 + main_#t~post7;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-18 13:20:50,522 INFO L796 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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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; 16510#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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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 := 1 + main_#t~post7;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-18 13:20:50,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:50,522 INFO L82 PathProgramCache]: Analyzing trace with hash 4434915, now seen corresponding path program 1 times [2018-11-18 13:20:50,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:50,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:50,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:50,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:20:50,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:50,525 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 13:20:50,526 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 13:20:50,526 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:50,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:20:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:50,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:50,587 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-18 13:20:50,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:20:50,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-18 13:20:50,611 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:20:50,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:50,611 INFO L82 PathProgramCache]: Analyzing trace with hash 2064490764, now seen corresponding path program 7 times [2018-11-18 13:20:50,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:50,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:50,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:50,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:20:50,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:50,614 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 13:20:50,614 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 13:20:50,614 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:50,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:20:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:50,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:50,710 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-18 13:20:50,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:20:50,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-18 13:20:50,725 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:20:50,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 13:20:50,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:20:50,726 INFO L87 Difference]: Start difference. First operand 812 states and 1128 transitions. cyclomatic complexity: 334 Second operand 7 states. [2018-11-18 13:20:50,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:20:50,795 INFO L93 Difference]: Finished difference Result 500 states and 697 transitions. [2018-11-18 13:20:50,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 13:20:50,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 500 states and 697 transitions. [2018-11-18 13:20:50,799 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 68 [2018-11-18 13:20:50,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 500 states to 468 states and 662 transitions. [2018-11-18 13:20:50,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2018-11-18 13:20:50,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2018-11-18 13:20:50,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 468 states and 662 transitions. [2018-11-18 13:20:50,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:20:50,804 INFO L705 BuchiCegarLoop]: Abstraction has 468 states and 662 transitions. [2018-11-18 13:20:50,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states and 662 transitions. [2018-11-18 13:20:50,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 395. [2018-11-18 13:20:50,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-11-18 13:20:50,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 533 transitions. [2018-11-18 13:20:50,814 INFO L728 BuchiCegarLoop]: Abstraction has 395 states and 533 transitions. [2018-11-18 13:20:50,814 INFO L608 BuchiCegarLoop]: Abstraction has 395 states and 533 transitions. [2018-11-18 13:20:50,815 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-18 13:20:50,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 395 states and 533 transitions. [2018-11-18 13:20:50,816 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2018-11-18 13:20:50,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:20:50,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:20:50,817 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-18 13:20:50,817 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-18 13:20:50,818 INFO L794 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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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 := 1 + main_#t~post7;havoc main_#t~post7; 18249#L41-4 assume true; 18256#L41-1 [2018-11-18 13:20:50,818 INFO L796 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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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 := 1 + main_#t~post7;havoc main_#t~post7; 18247#L41-4 assume true; 18256#L41-1 [2018-11-18 13:20:50,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:50,818 INFO L82 PathProgramCache]: Analyzing trace with hash 194443971, now seen corresponding path program 1 times [2018-11-18 13:20:50,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:50,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:50,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:50,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:20:50,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:50,821 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 13:20:50,821 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 13:20:50,821 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/bin-2019/uautomizer/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 13:20:50,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:20:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:50,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:50,923 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-18 13:20:50,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:20:50,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 13:20:50,948 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:20:50,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:50,948 INFO L82 PathProgramCache]: Analyzing trace with hash 577080418, now seen corresponding path program 8 times [2018-11-18 13:20:50,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:50,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:50,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:50,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:20:50,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:50,951 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 13:20:50,951 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 13:20:50,951 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:50,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 13:20:50,984 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 13:20:50,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-18 13:20:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:20:51,622 WARN L180 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 120 [2018-11-18 13:20:51,834 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:20:51,834 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:20:51,834 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:20:51,834 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:20:51,834 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:20:51,834 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:20:51,835 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:20:51,835 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:20:51,835 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration18_Loop [2018-11-18 13:20:51,835 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:20:51,835 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:20:51,836 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-18 13:20:51,847 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-18 13:20:51,848 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-18 13:20:51,850 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-18 13:20:51,851 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-18 13:20:51,860 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-18 13:20:51,861 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-18 13:20:51,979 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:20:51,979 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:51,991 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:51,992 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:51,994 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:20:51,994 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:52,009 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:52,009 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:52,011 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:20:52,011 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:52,027 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:52,027 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:52,029 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:20:52,029 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:52,044 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:52,044 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:52,047 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:20:52,047 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:52,062 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:52,062 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:52,064 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:20:52,064 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:52,080 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:52,080 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:52,082 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:20:52,082 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:52,097 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:52,097 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:52,114 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:20:52,114 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:52,121 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 13:20:52,134 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:20:52,134 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:20:52,134 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:20:52,135 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:20:52,135 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:20:52,135 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:20:52,135 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:20:52,135 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:20:52,135 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration18_Loop [2018-11-18 13:20:52,135 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:20:52,135 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:20:52,136 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-18 13:20:52,137 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-18 13:20:52,138 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-18 13:20:52,139 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-18 13:20:52,140 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-18 13:20:52,140 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-18 13:20:52,141 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-18 13:20:52,240 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:20:52,240 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:20:52,240 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-18 13:20:52,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:52,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:52,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:52,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:52,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:52,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:52,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:52,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:52,242 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-18 13:20:52,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:52,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:52,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:52,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:52,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:52,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:52,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:52,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:52,243 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-18 13:20:52,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:52,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:52,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:52,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:52,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:52,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:52,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:52,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:52,244 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-18 13:20:52,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:52,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:52,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:52,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:52,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:52,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:52,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:52,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:52,245 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-18 13:20:52,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:52,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:52,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:52,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:52,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:52,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:52,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:52,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:52,247 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-18 13:20:52,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:52,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:52,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:52,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:52,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:52,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:52,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:52,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:52,248 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-18 13:20:52,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:52,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:52,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:52,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:52,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:52,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:52,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:52,252 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:20:52,255 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 13:20:52,256 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 13:20:52,256 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:20:52,256 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:20:52,256 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:20:52,256 INFO L520 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-18 13:20:52,259 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:20:52,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:52,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:52,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:52,553 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-18 13:20:52,553 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-18 13:20:52,553 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 395 states and 533 transitions. cyclomatic complexity: 146 Second operand 10 states. [2018-11-18 13:20:52,910 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-18 13:20:52,911 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-18 13:20:52,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 13:20:52,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 87 transitions. [2018-11-18 13:20:52,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 87 transitions. Stem has 58 letters. Loop has 71 letters. [2018-11-18 13:20:52,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:52,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 87 transitions. Stem has 129 letters. Loop has 71 letters. [2018-11-18 13:20:52,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:52,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 87 transitions. Stem has 58 letters. Loop has 142 letters. [2018-11-18 13:20:52,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:52,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1127 states and 1461 transitions. [2018-11-18 13:20:52,920 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 39 [2018-11-18 13:20:52,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1127 states to 893 states and 1141 transitions. [2018-11-18 13:20:52,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 208 [2018-11-18 13:20:52,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 209 [2018-11-18 13:20:52,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 893 states and 1141 transitions. [2018-11-18 13:20:52,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:20:52,924 INFO L705 BuchiCegarLoop]: Abstraction has 893 states and 1141 transitions. [2018-11-18 13:20:52,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states and 1141 transitions. [2018-11-18 13:20:52,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 798. [2018-11-18 13:20:52,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2018-11-18 13:20:52,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1022 transitions. [2018-11-18 13:20:52,937 INFO L728 BuchiCegarLoop]: Abstraction has 798 states and 1022 transitions. [2018-11-18 13:20:52,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 13:20:52,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:20:52,937 INFO L87 Difference]: Start difference. First operand 798 states and 1022 transitions. Second operand 7 states. [2018-11-18 13:20:53,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:20:53,031 INFO L93 Difference]: Finished difference Result 756 states and 940 transitions. [2018-11-18 13:20:53,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 13:20:53,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 756 states and 940 transitions. [2018-11-18 13:20:53,036 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-11-18 13:20:53,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 756 states to 737 states and 920 transitions. [2018-11-18 13:20:53,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 149 [2018-11-18 13:20:53,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2018-11-18 13:20:53,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 737 states and 920 transitions. [2018-11-18 13:20:53,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:20:53,039 INFO L705 BuchiCegarLoop]: Abstraction has 737 states and 920 transitions. [2018-11-18 13:20:53,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states and 920 transitions. [2018-11-18 13:20:53,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 721. [2018-11-18 13:20:53,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-11-18 13:20:53,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 904 transitions. [2018-11-18 13:20:53,050 INFO L728 BuchiCegarLoop]: Abstraction has 721 states and 904 transitions. [2018-11-18 13:20:53,050 INFO L608 BuchiCegarLoop]: Abstraction has 721 states and 904 transitions. [2018-11-18 13:20:53,050 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-18 13:20:53,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 721 states and 904 transitions. [2018-11-18 13:20:53,053 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-11-18 13:20:53,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:20:53,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:20:53,054 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-18 13:20:53,054 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-18 13:20:53,054 INFO L794 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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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 := 1 + main_#t~post7;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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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-18 13:20:53,055 INFO L796 eck$LassoCheckResult]: Loop: 21988#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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-18 13:20:53,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:53,055 INFO L82 PathProgramCache]: Analyzing trace with hash -154227325, now seen corresponding path program 2 times [2018-11-18 13:20:53,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:53,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:53,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:53,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:20:53,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:53,059 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 13:20:53,059 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 13:20:53,059 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/bin-2019/uautomizer/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2018-11-18 13:20:53,073 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 13:20:53,091 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 13:20:53,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:20:53,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:53,158 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-18 13:20:53,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:20:53,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-18 13:20:53,174 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:20:53,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:53,174 INFO L82 PathProgramCache]: Analyzing trace with hash -189042451, now seen corresponding path program 2 times [2018-11-18 13:20:53,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:53,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:53,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:53,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:20:53,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:53,176 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 13:20:53,176 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 13:20:53,176 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:53,185 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 13:20:53,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 13:20:53,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-18 13:20:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:20:53,456 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:20:53,456 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:20:53,456 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:20:53,456 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:20:53,456 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:20:53,456 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:20:53,457 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:20:53,457 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:20:53,457 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration19_Loop [2018-11-18 13:20:53,457 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:20:53,457 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:20:53,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-18 13:20:53,466 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-18 13:20:53,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-18 13:20:53,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-18 13:20:53,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-18 13:20:53,474 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-18 13:20:53,587 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:20:53,587 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:53,590 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:53,590 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:53,592 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:20:53,592 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:53,608 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:53,608 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:53,611 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:20:53,611 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:53,626 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:53,626 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:53,628 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:20:53,628 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:53,644 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:53,644 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:53,646 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:20:53,646 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:53,662 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:53,662 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:53,664 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:20:53,664 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:53,679 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:53,679 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:53,697 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:20:53,697 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:53,703 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 13:20:53,716 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:20:53,717 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:20:53,717 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:20:53,717 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:20:53,717 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:20:53,717 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:20:53,717 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:20:53,717 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:20:53,717 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration19_Loop [2018-11-18 13:20:53,717 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:20:53,717 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:20:53,718 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-18 13:20:53,729 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-18 13:20:53,730 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-18 13:20:53,731 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-18 13:20:53,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-18 13:20:53,733 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-18 13:20:53,844 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:20:53,845 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:20:53,845 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-18 13:20:53,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:53,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:53,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:53,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:53,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:53,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:53,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:53,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:53,846 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-18 13:20:53,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:53,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:53,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:53,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:53,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:53,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:53,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:53,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:53,847 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-18 13:20:53,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:53,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:53,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:53,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:53,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:53,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:53,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:53,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:53,848 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-18 13:20:53,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:53,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:53,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:53,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:53,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:53,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:53,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:53,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:53,850 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-18 13:20:53,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:53,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:53,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:53,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:53,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:53,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:53,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:53,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:53,851 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-18 13:20:53,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:53,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:53,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:53,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:53,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:53,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:53,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:53,855 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:20:53,856 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:20:53,856 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 13:20:53,857 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:20:53,857 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:20:53,857 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:20:53,857 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0) = -2*ULTIMATE.start_main_~k~0 + 1 Supporting invariants [] [2018-11-18 13:20:53,857 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:20:53,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:53,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:54,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:54,081 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-18 13:20:54,081 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-18 13:20:54,081 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 721 states and 904 transitions. cyclomatic complexity: 198 Second operand 10 states. [2018-11-18 13:20:54,294 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-18 13:20:54,296 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-18 13:20:54,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 13:20:54,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 58 transitions. [2018-11-18 13:20:54,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 58 transitions. Stem has 91 letters. Loop has 33 letters. [2018-11-18 13:20:54,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:54,297 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 13:20:54,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:54,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:54,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:54,470 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-18 13:20:54,471 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-18 13:20:54,471 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 721 states and 904 transitions. cyclomatic complexity: 198 Second operand 10 states. [2018-11-18 13:20:54,611 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-18 13:20:54,612 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-18 13:20:54,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 13:20:54,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2018-11-18 13:20:54,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 57 transitions. Stem has 91 letters. Loop has 33 letters. [2018-11-18 13:20:54,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:54,613 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 13:20:54,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:54,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:54,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:54,763 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-18 13:20:54,764 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-18 13:20:54,764 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 721 states and 904 transitions. cyclomatic complexity: 198 Second operand 10 states. [2018-11-18 13:20:54,950 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-18 13:20:54,950 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-18 13:20:54,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 13:20:54,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2018-11-18 13:20:54,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 97 transitions. Stem has 91 letters. Loop has 33 letters. [2018-11-18 13:20:54,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:54,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 97 transitions. Stem has 124 letters. Loop has 33 letters. [2018-11-18 13:20:54,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:54,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 97 transitions. Stem has 91 letters. Loop has 66 letters. [2018-11-18 13:20:54,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:54,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2013 states and 2457 transitions. [2018-11-18 13:20:54,965 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-18 13:20:54,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2013 states to 1702 states and 2076 transitions. [2018-11-18 13:20:54,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 182 [2018-11-18 13:20:54,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 189 [2018-11-18 13:20:54,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1702 states and 2076 transitions. [2018-11-18 13:20:54,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:20:54,976 INFO L705 BuchiCegarLoop]: Abstraction has 1702 states and 2076 transitions. [2018-11-18 13:20:54,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states and 2076 transitions. [2018-11-18 13:20:54,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1447. [2018-11-18 13:20:54,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1447 states. [2018-11-18 13:20:55,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1755 transitions. [2018-11-18 13:20:55,003 INFO L728 BuchiCegarLoop]: Abstraction has 1447 states and 1755 transitions. [2018-11-18 13:20:55,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 13:20:55,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 13:20:55,004 INFO L87 Difference]: Start difference. First operand 1447 states and 1755 transitions. Second operand 9 states. [2018-11-18 13:20:55,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:20:55,253 INFO L93 Difference]: Finished difference Result 1793 states and 2263 transitions. [2018-11-18 13:20:55,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 13:20:55,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1793 states and 2263 transitions. [2018-11-18 13:20:55,260 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-18 13:20:55,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1793 states to 1739 states and 2194 transitions. [2018-11-18 13:20:55,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 189 [2018-11-18 13:20:55,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 189 [2018-11-18 13:20:55,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1739 states and 2194 transitions. [2018-11-18 13:20:55,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:20:55,271 INFO L705 BuchiCegarLoop]: Abstraction has 1739 states and 2194 transitions. [2018-11-18 13:20:55,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states and 2194 transitions. [2018-11-18 13:20:55,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1468. [2018-11-18 13:20:55,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1468 states. [2018-11-18 13:20:55,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 1793 transitions. [2018-11-18 13:20:55,306 INFO L728 BuchiCegarLoop]: Abstraction has 1468 states and 1793 transitions. [2018-11-18 13:20:55,307 INFO L608 BuchiCegarLoop]: Abstraction has 1468 states and 1793 transitions. [2018-11-18 13:20:55,307 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-18 13:20:55,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1468 states and 1793 transitions. [2018-11-18 13:20:55,311 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-18 13:20:55,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:20:55,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:20:55,312 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-18 13:20:55,313 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-18 13:20:55,313 INFO L794 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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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 := 1 + main_#t~post7;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 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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-18 13:20:55,313 INFO L796 eck$LassoCheckResult]: Loop: 31799#L30-8 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;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 := 1 + main_#t~post8;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-18 13:20:55,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:55,313 INFO L82 PathProgramCache]: Analyzing trace with hash -525597755, now seen corresponding path program 3 times [2018-11-18 13:20:55,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:55,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:55,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:55,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:20:55,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:55,317 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 13:20:55,317 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 13:20:55,317 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:55,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 13:20:55,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 13:20:55,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:20:55,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:55,398 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-18 13:20:55,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:20:55,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-18 13:20:55,421 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:20:55,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:55,421 INFO L82 PathProgramCache]: Analyzing trace with hash 640873057, now seen corresponding path program 3 times [2018-11-18 13:20:55,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:55,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:55,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:55,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:20:55,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:55,422 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 13:20:55,422 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 13:20:55,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:55,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 13:20:55,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-18 13:20:55,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-18 13:20:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:20:55,751 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:20:55,751 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:20:55,751 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:20:55,751 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:20:55,751 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:20:55,751 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:20:55,751 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:20:55,751 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:20:55,751 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration20_Loop [2018-11-18 13:20:55,751 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:20:55,751 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:20:55,752 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-18 13:20:55,754 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-18 13:20:55,756 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-18 13:20:55,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-18 13:20:55,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-18 13:20:55,824 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:20:55,825 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:55,828 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:55,828 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:55,830 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:20:55,830 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:55,845 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:55,845 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:55,848 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:20:55,849 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:55,865 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:55,865 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:55,883 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:20:55,883 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:55,888 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 13:20:55,902 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:20:55,902 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:20:55,902 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:20:55,902 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:20:55,902 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:20:55,902 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:20:55,902 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:20:55,902 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:20:55,902 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration20_Loop [2018-11-18 13:20:55,903 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:20:55,903 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:20:55,903 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-18 13:20:55,905 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-18 13:20:55,907 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-18 13:20:55,908 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-18 13:20:55,909 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-18 13:20:55,975 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:20:55,975 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:20:55,976 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-18 13:20:55,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:55,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:55,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:55,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:55,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:55,976 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:55,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:55,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:55,977 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-18 13:20:55,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:55,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:55,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:55,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:55,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:55,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:55,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:55,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:55,978 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-18 13:20:55,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:55,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:55,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:55,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:55,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:55,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:55,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:55,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:55,979 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-18 13:20:55,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:55,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:55,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:55,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:55,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:55,980 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:55,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:55,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:55,980 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-18 13:20:55,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:55,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:55,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:55,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:55,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:55,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:55,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:55,983 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:20:55,986 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 13:20:55,986 INFO L444 ModelExtractionUtils]: 7 out of 11 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 13:20:55,987 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:20:55,987 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:20:55,987 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:20:55,987 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0) = -2*ULTIMATE.start_main_~k~0 + 3 Supporting invariants [] [2018-11-18 13:20:55,987 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:20:56,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:56,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:56,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:56,215 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-18 13:20:56,215 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-18 13:20:56,215 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1468 states and 1793 transitions. cyclomatic complexity: 354 Second operand 12 states. [2018-11-18 13:20:56,400 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-18 13:20:56,401 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-18 13:20:56,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 13:20:56,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 76 transitions. [2018-11-18 13:20:56,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 76 transitions. Stem has 116 letters. Loop has 45 letters. [2018-11-18 13:20:56,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:56,402 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 13:20:56,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:56,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:56,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:56,649 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-18 13:20:56,649 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-18 13:20:56,649 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1468 states and 1793 transitions. cyclomatic complexity: 354 Second operand 12 states. [2018-11-18 13:20:56,822 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-18 13:20:56,823 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-18 13:20:56,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 13:20:56,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2018-11-18 13:20:56,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 75 transitions. Stem has 116 letters. Loop has 45 letters. [2018-11-18 13:20:56,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:56,824 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 13:20:56,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:56,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:56,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:57,041 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-18 13:20:57,041 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-18 13:20:57,041 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1468 states and 1793 transitions. cyclomatic complexity: 354 Second operand 12 states. [2018-11-18 13:20:57,229 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-18 13:20:57,229 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-18 13:20:57,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 13:20:57,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 87 transitions. [2018-11-18 13:20:57,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 87 transitions. Stem has 116 letters. Loop has 45 letters. [2018-11-18 13:20:57,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:57,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 87 transitions. Stem has 161 letters. Loop has 45 letters. [2018-11-18 13:20:57,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:57,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 87 transitions. Stem has 116 letters. Loop has 90 letters. [2018-11-18 13:20:57,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:57,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4378 states and 5440 transitions. [2018-11-18 13:20:57,266 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-18 13:20:57,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4378 states to 3361 states and 4176 transitions. [2018-11-18 13:20:57,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 238 [2018-11-18 13:20:57,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 241 [2018-11-18 13:20:57,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3361 states and 4176 transitions. [2018-11-18 13:20:57,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:20:57,288 INFO L705 BuchiCegarLoop]: Abstraction has 3361 states and 4176 transitions. [2018-11-18 13:20:57,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3361 states and 4176 transitions. [2018-11-18 13:20:57,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3361 to 2524. [2018-11-18 13:20:57,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2524 states. [2018-11-18 13:20:57,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2524 states to 2524 states and 3154 transitions. [2018-11-18 13:20:57,346 INFO L728 BuchiCegarLoop]: Abstraction has 2524 states and 3154 transitions. [2018-11-18 13:20:57,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:20:57,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:20:57,346 INFO L87 Difference]: Start difference. First operand 2524 states and 3154 transitions. Second operand 6 states. [2018-11-18 13:20:57,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:20:57,469 INFO L93 Difference]: Finished difference Result 2225 states and 2785 transitions. [2018-11-18 13:20:57,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:20:57,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2225 states and 2785 transitions. [2018-11-18 13:20:57,477 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-18 13:20:57,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2225 states to 2169 states and 2723 transitions. [2018-11-18 13:20:57,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 207 [2018-11-18 13:20:57,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 249 [2018-11-18 13:20:57,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2169 states and 2723 transitions. [2018-11-18 13:20:57,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:20:57,491 INFO L705 BuchiCegarLoop]: Abstraction has 2169 states and 2723 transitions. [2018-11-18 13:20:57,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2169 states and 2723 transitions. [2018-11-18 13:20:57,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2169 to 2100. [2018-11-18 13:20:57,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2018-11-18 13:20:57,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2600 transitions. [2018-11-18 13:20:57,528 INFO L728 BuchiCegarLoop]: Abstraction has 2100 states and 2600 transitions. [2018-11-18 13:20:57,529 INFO L608 BuchiCegarLoop]: Abstraction has 2100 states and 2600 transitions. [2018-11-18 13:20:57,529 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-18 13:20:57,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2100 states and 2600 transitions. [2018-11-18 13:20:57,533 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-18 13:20:57,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:20:57,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:20:57,535 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-18 13:20:57,535 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-18 13:20:57,535 INFO L794 eck$LassoCheckResult]: Stem: 49109#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 49074#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; 49075#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; 49252#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 49251#L42-4 assume true; 49250#L42-1 assume !!(main_~k~0 <= main_~x~0); 49248#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; 49244#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 49245#factENTRY ~n := #in~n; 49249#L25 assume ~n <= 0;#res := 1; 49247#factFINAL assume true; 49243#factEXIT >#70#return; 49239#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 49240#factENTRY ~n := #in~n; 49246#L25 assume ~n <= 0;#res := 1; 49242#factFINAL assume true; 49238#factEXIT >#72#return; 49234#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 49235#factENTRY ~n := #in~n; 49241#L25 assume ~n <= 0;#res := 1; 49237#factFINAL assume true; 49233#factEXIT >#74#return; 49231#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret2; 49230#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 49228#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 49226#L42-4 assume true; 49223#L42-1 assume !!(main_~k~0 <= main_~x~0); 49219#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; 49171#L30-5 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 49172#factENTRY ~n := #in~n; 49222#L25 assume !(~n <= 0); 49217#L26 call #t~ret0 := fact(~n - 1);< 49218#factENTRY ~n := #in~n; 49225#L25 assume ~n <= 0;#res := 1; 49221#factFINAL assume true; 49216#factEXIT >#68#return; 49215#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49214#factFINAL assume true; 49170#factEXIT >#76#return; 49166#L30-6 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 49167#factENTRY ~n := #in~n; 49207#L25 assume ~n <= 0;#res := 1; 49206#factFINAL assume true; 49165#factEXIT >#78#return; 49147#L30-7 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 49153#factENTRY ~n := #in~n; 49175#L25 assume !(~n <= 0); 49161#L26 call #t~ret0 := fact(~n - 1);< 49162#factENTRY ~n := #in~n; 49186#L25 assume ~n <= 0;#res := 1; 49185#factFINAL assume true; 49160#factEXIT >#68#return; 49159#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49157#factFINAL assume true; 49146#factEXIT >#80#return; 49110#L30-8 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret2; 49111#L30-9 main_#t~ret10 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10; 49143#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 49142#L42-4 assume true; 49141#L42-1 assume !(main_~k~0 <= main_~x~0); 49095#L41-3 main_#t~post7 := main_~n~0;main_~n~0 := 1 + main_#t~post7;havoc main_#t~post7; 49088#L41-4 assume true; 49089#L41-1 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 49264#L42-4 assume true; 49315#L42-1 assume !!(main_~k~0 <= main_~x~0); 49313#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; 49289#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 49290#factENTRY ~n := #in~n; 49311#L25 assume !(~n <= 0); 49295#L26 call #t~ret0 := fact(~n - 1);< 49300#factENTRY ~n := #in~n; 49425#L25 assume !(~n <= 0); 49307#L26 call #t~ret0 := fact(~n - 1);< 49351#factENTRY ~n := #in~n; 49452#L25 assume ~n <= 0;#res := 1; 49454#factFINAL assume true; 49429#factEXIT >#68#return; 49308#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49350#factFINAL assume true; 49306#factEXIT >#68#return; 49304#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49303#factFINAL assume true; 49288#factEXIT >#70#return; 49282#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 49283#factENTRY ~n := #in~n; 49301#L25 assume ~n <= 0;#res := 1; 49293#factFINAL assume true; 49280#factEXIT >#72#return; 49273#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 49275#factENTRY ~n := #in~n; 49322#L25 assume !(~n <= 0); 49297#L26 call #t~ret0 := fact(~n - 1);< 49300#factENTRY ~n := #in~n; 49424#L25 assume ~n <= 0;#res := 1; 49348#factFINAL assume true; 49294#factEXIT >#68#return; 49292#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49279#factFINAL assume true; 49271#factEXIT >#74#return; 49268#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret2; 49265#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 49262#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 49260#L42-4 assume true; 49259#L42-1 assume !!(main_~k~0 <= main_~x~0); 49076#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; 49077#L30 [2018-11-18 13:20:57,535 INFO L796 eck$LassoCheckResult]: Loop: 49077#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 49100#factENTRY ~n := #in~n; 49500#L25 assume !(~n <= 0); 49492#L26 call #t~ret0 := fact(~n - 1);< 49497#factENTRY ~n := #in~n; 49502#L25 assume !(~n <= 0); 49490#L26 call #t~ret0 := fact(~n - 1);< 49499#factENTRY ~n := #in~n; 49505#L25 assume ~n <= 0;#res := 1; 49506#factFINAL assume true; 49503#factEXIT >#68#return; 49496#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49498#factFINAL assume true; 49488#factEXIT >#68#return; 49487#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49486#factFINAL assume true; 49483#factEXIT >#70#return; 49099#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 49100#factENTRY ~n := #in~n; 49500#L25 assume !(~n <= 0); 49492#L26 call #t~ret0 := fact(~n - 1);< 49497#factENTRY ~n := #in~n; 49504#L25 assume ~n <= 0;#res := 1; 49525#factFINAL assume true; 49523#factEXIT >#68#return; 49524#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49554#factFINAL assume true; 49553#factEXIT >#72#return; 49484#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 49100#factENTRY ~n := #in~n; 49500#L25 assume !(~n <= 0); 49492#L26 call #t~ret0 := fact(~n - 1);< 49497#factENTRY ~n := #in~n; 49504#L25 assume ~n <= 0;#res := 1; 49525#factFINAL assume true; 49523#factEXIT >#68#return; 49524#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49554#factFINAL assume true; 49553#factEXIT >#74#return; 49485#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret2; 49549#L30-4 main_#t~ret9 := binomialCoefficient_#res;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9; 49359#L42-3 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 49355#L42-4 assume true; 49353#L42-1 assume !!(main_~k~0 <= main_~x~0); 49325#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; 49077#L30 [2018-11-18 13:20:57,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:57,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1004597226, now seen corresponding path program 4 times [2018-11-18 13:20:57,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:57,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:57,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:57,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:20:57,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:57,539 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 13:20:57,539 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 13:20:57,539 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/bin-2019/uautomizer/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 13:20:57,563 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 13:20:57,588 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 13:20:57,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:20:57,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:57,620 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-18 13:20:57,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:20:57,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-18 13:20:57,636 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:20:57,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:57,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1716526569, now seen corresponding path program 1 times [2018-11-18 13:20:57,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:20:57,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:20:57,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:57,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:20:57,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:20:57,638 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 13:20:57,638 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 13:20:57,638 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:57,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:20:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:20:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:20:57,957 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2018-11-18 13:20:58,186 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 25 [2018-11-18 13:20:58,186 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:20:58,186 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:20:58,186 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:20:58,187 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:20:58,187 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:20:58,187 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:20:58,187 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:20:58,187 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:20:58,187 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration21_Loop [2018-11-18 13:20:58,187 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:20:58,187 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:20:58,187 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-18 13:20:58,188 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-18 13:20:58,189 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-18 13:20:58,190 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-18 13:20:58,191 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-18 13:20:58,191 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-18 13:20:58,192 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-18 13:20:58,244 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:20:58,245 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/bin-2019/uautomizer/z3 Starting monitored process 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:20:58,246 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:58,246 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:58,248 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:20:58,249 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/bin-2019/uautomizer/z3 Starting monitored process 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:20:58,263 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:58,264 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:58,265 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:20:58,265 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:58,280 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:58,280 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:58,282 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:20:58,282 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:58,297 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:58,297 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:58,299 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:20:58,299 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:58,314 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:58,314 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:58,316 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:20:58,317 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:58,332 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:58,332 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:58,335 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:20:58,335 INFO L448 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_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:58,350 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:20:58,350 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a4b2d38-30fa-4c2e-88e9-a4a35f6e1b4b/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-18 13:20:58,368 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:20:58,368 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:20:58,791 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 13:20:58,793 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:20:58,793 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:20:58,793 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:20:58,793 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:20:58,793 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:20:58,793 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:20:58,793 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:20:58,793 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:20:58,793 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial_true-termination_false-no-overflow.c_Iteration21_Loop [2018-11-18 13:20:58,793 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:20:58,793 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:20:58,794 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-18 13:20:58,804 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-18 13:20:58,806 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-18 13:20:58,806 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-18 13:20:58,807 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-18 13:20:58,817 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-18 13:20:58,819 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-18 13:20:58,855 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:20:58,855 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:20:58,855 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-18 13:20:58,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:58,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:58,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:58,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:58,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:58,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:58,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:58,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:58,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-18 13:20:58,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:58,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:58,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:58,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:58,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:58,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:58,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:58,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:58,858 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-18 13:20:58,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:58,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:58,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:58,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:58,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:58,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:58,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:58,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:58,860 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-18 13:20:58,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:58,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:58,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:58,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:58,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:58,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:58,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:58,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:20:58,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-18 13:20:58,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:20:58,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:20:58,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:20:58,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:20:58,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:20:58,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:20:58,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:20:58,864 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:20:58,866 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:20:58,866 INFO L444 ModelExtractionUtils]: 5 out of 9 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 13:20:58,866 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:20:58,866 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:20:58,866 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:20:58,867 INFO L520 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-18 13:20:58,867 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:20:58,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:58,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:59,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:59,043 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-18 13:20:59,043 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-18 13:20:59,043 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2100 states and 2600 transitions. cyclomatic complexity: 541 Second operand 7 states. [2018-11-18 13:20:59,089 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2100 states and 2600 transitions. cyclomatic complexity: 541. Second operand 7 states. Result 2773 states and 3363 transitions. Complement of second has 13 states. [2018-11-18 13:20:59,089 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-18 13:20:59,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 13:20:59,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2018-11-18 13:20:59,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 107 letters. Loop has 45 letters. [2018-11-18 13:20:59,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:59,090 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 13:20:59,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:59,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:59,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:59,242 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-18 13:20:59,242 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-18 13:20:59,242 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2100 states and 2600 transitions. cyclomatic complexity: 541 Second operand 7 states. [2018-11-18 13:20:59,319 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2100 states and 2600 transitions. cyclomatic complexity: 541. Second operand 7 states. Result 2781 states and 3371 transitions. Complement of second has 17 states. [2018-11-18 13:20:59,320 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-18 13:20:59,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 13:20:59,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2018-11-18 13:20:59,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 40 transitions. Stem has 107 letters. Loop has 45 letters. [2018-11-18 13:20:59,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:59,321 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 13:20:59,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:59,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:59,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:59,451 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-18 13:20:59,451 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-18 13:20:59,451 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2100 states and 2600 transitions. cyclomatic complexity: 541 Second operand 7 states. [2018-11-18 13:20:59,538 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2100 states and 2600 transitions. cyclomatic complexity: 541. Second operand 7 states. Result 4310 states and 5312 transitions. Complement of second has 18 states. [2018-11-18 13:20:59,539 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-18 13:20:59,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 13:20:59,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2018-11-18 13:20:59,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 70 transitions. Stem has 107 letters. Loop has 45 letters. [2018-11-18 13:20:59,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:59,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 70 transitions. Stem has 152 letters. Loop has 45 letters. [2018-11-18 13:20:59,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:59,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 70 transitions. Stem has 107 letters. Loop has 90 letters. [2018-11-18 13:20:59,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:59,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4310 states and 5312 transitions. [2018-11-18 13:20:59,557 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:20:59,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4310 states to 0 states and 0 transitions. [2018-11-18 13:20:59,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 13:20:59,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 13:20:59,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 13:20:59,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:20:59,558 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:20:59,558 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:20:59,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 13:20:59,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 13:20:59,558 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 8 states. [2018-11-18 13:20:59,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:20:59,559 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 13:20:59,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 13:20:59,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-18 13:20:59,559 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:20:59,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 13:20:59,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 13:20:59,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 13:20:59,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 13:20:59,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:20:59,559 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:20:59,559 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:20:59,559 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:20:59,559 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-18 13:20:59,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 13:20:59,560 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:20:59,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 13:20:59,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 01:20:59 BoogieIcfgContainer [2018-11-18 13:20:59,567 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 13:20:59,567 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:20:59,567 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:20:59,567 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:20:59,568 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:19:52" (3/4) ... [2018-11-18 13:20:59,572 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 13:20:59,572 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:20:59,573 INFO L168 Benchmark]: Toolchain (without parser) took 67716.71 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 354.4 MB). Free memory was 959.1 MB in the beginning and 1.2 GB in the end (delta: -267.1 MB). Peak memory consumption was 87.3 MB. Max. memory is 11.5 GB. [2018-11-18 13:20:59,573 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:20:59,574 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.36 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:20:59,574 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.41 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:20:59,574 INFO L168 Benchmark]: Boogie Preprocessor took 15.11 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:20:59,574 INFO L168 Benchmark]: RCFGBuilder took 204.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -174.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2018-11-18 13:20:59,575 INFO L168 Benchmark]: BuchiAutomizer took 67319.52 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 220.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -117.2 MB). Peak memory consumption was 103.0 MB. Max. memory is 11.5 GB. [2018-11-18 13:20:59,575 INFO L168 Benchmark]: Witness Printer took 5.05 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2018-11-18 13:20:59,578 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 148.36 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 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 21.41 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.11 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 204.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -174.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 67319.52 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 220.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -117.2 MB). Peak memory consumption was 103.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.05 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. 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 29 terminating modules (20 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. 20 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 67.2s and 22 iterations. TraceHistogramMax:16. Analysis of lassos took 59.1s. Construction of modules took 2.9s. Büchi inclusion checks took 4.3s. Highest rank in rank-based complementation 3. Minimization of det autom 9. Minimization of nondet autom 20. Automata minimization 0.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 2161 StatesRemovedByMinimization, 26 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 2100 states and ocurred in iteration 20. Nontrivial modules had stage [5, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 366/477 HoareTripleCheckerStatistics: 1222 SDtfs, 1206 SDslu, 2318 SDs, 0 SdLazy, 3964 SolverSat, 814 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time LassoAnalysisResults: nont0 unkn0 SFLI9 SFLT1 conc1 concLT1 SILN0 SILU0 SILI2 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: 3ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 28 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 10 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...