./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-numeric/Binomial.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-numeric/Binomial.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: UNKNOWN during nested interpolation. I don't know how to continue --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:57:51,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:57:51,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:57:51,294 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:57:51,294 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:57:51,297 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:57:51,299 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:57:51,309 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:57:51,314 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:57:51,318 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:57:51,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:57:51,321 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:57:51,322 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:57:51,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:57:51,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:57:51,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:57:51,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:57:51,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:57:51,334 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:57:51,339 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:57:51,344 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:57:51,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:57:51,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:57:51,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:57:51,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:57:51,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:57:51,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:57:51,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:57:51,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:57:51,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:57:51,361 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:57:51,362 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:57:51,362 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:57:51,364 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:57:51,365 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:57:51,365 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:57:51,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:57:51,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:57:51,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:57:51,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:57:51,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:57:51,370 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 02:57:51,387 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:57:51,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:57:51,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:57:51,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:57:51,390 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:57:51,390 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 02:57:51,390 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 02:57:51,390 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 02:57:51,391 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 02:57:51,391 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 02:57:51,391 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 02:57:51,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:57:51,392 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:57:51,392 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:57:51,392 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:57:51,393 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 02:57:51,393 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 02:57:51,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 02:57:51,394 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:57:51,394 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 02:57:51,394 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:57:51,395 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 02:57:51,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:57:51,395 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:57:51,396 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 02:57:51,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:57:51,396 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:57:51,396 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 02:57:51,397 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 02:57:51,398 INFO L138 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2019-11-28 02:57:51,742 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:57:51,757 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:57:51,763 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:57:51,765 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:57:51,767 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:57:51,769 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Binomial.c [2019-11-28 02:57:51,849 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51abcb670/39613ff191d744569c04f4aee32c6cc2/FLAG2bdf04cb3 [2019-11-28 02:57:52,324 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:57:52,326 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Binomial.c [2019-11-28 02:57:52,334 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51abcb670/39613ff191d744569c04f4aee32c6cc2/FLAG2bdf04cb3 [2019-11-28 02:57:52,704 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51abcb670/39613ff191d744569c04f4aee32c6cc2 [2019-11-28 02:57:52,708 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:57:52,710 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:57:52,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:57:52,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:57:52,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:57:52,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:57:52" (1/1) ... [2019-11-28 02:57:52,720 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762a845e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:52, skipping insertion in model container [2019-11-28 02:57:52,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:57:52" (1/1) ... [2019-11-28 02:57:52,728 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:57:52,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:57:52,939 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:57:52,943 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:57:52,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:57:52,973 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:57:52,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:52 WrapperNode [2019-11-28 02:57:52,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:57:52,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:57:52,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:57:52,975 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:57:52,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:52" (1/1) ... [2019-11-28 02:57:52,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:52" (1/1) ... [2019-11-28 02:57:53,056 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:57:53,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:57:53,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:57:53,057 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:57:53,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:52" (1/1) ... [2019-11-28 02:57:53,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:52" (1/1) ... [2019-11-28 02:57:53,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:52" (1/1) ... [2019-11-28 02:57:53,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:52" (1/1) ... [2019-11-28 02:57:53,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:52" (1/1) ... [2019-11-28 02:57:53,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:52" (1/1) ... [2019-11-28 02:57:53,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:52" (1/1) ... [2019-11-28 02:57:53,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:57:53,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:57:53,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:57:53,079 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:57:53,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 02:57:53,128 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2019-11-28 02:57:53,129 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2019-11-28 02:57:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:57:53,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:57:53,366 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:57:53,367 INFO L297 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-28 02:57:53,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:57:53 BoogieIcfgContainer [2019-11-28 02:57:53,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:57:53,372 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 02:57:53,372 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 02:57:53,376 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 02:57:53,377 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:57:53,378 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 02:57:52" (1/3) ... [2019-11-28 02:57:53,379 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a578cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:57:53, skipping insertion in model container [2019-11-28 02:57:53,379 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:57:53,380 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:52" (2/3) ... [2019-11-28 02:57:53,380 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a578cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:57:53, skipping insertion in model container [2019-11-28 02:57:53,381 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:57:53,381 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:57:53" (3/3) ... [2019-11-28 02:57:53,398 INFO L371 chiAutomizerObserver]: Analyzing ICFG Binomial.c [2019-11-28 02:57:53,484 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 02:57:53,485 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 02:57:53,485 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 02:57:53,485 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:57:53,486 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:57:53,486 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 02:57:53,486 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:57:53,486 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 02:57:53,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-11-28 02:57:53,531 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-11-28 02:57:53,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:57:53,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:57:53,537 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 02:57:53,537 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 02:57:53,537 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 02:57:53,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-11-28 02:57:53,540 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-11-28 02:57:53,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:57:53,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:57:53,541 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 02:57:53,541 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 02:57:53,547 INFO L794 eck$LassoCheckResult]: Stem: 21#ULTIMATE.startENTRYtrue 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; 27#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; 14#L41-3true [2019-11-28 02:57:53,547 INFO L796 eck$LassoCheckResult]: Loop: 14#L41-3true assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 5#L42-3true assume !(main_~k~0 <= main_~x~0); 16#L41-2true main_#t~post7 := main_~n~0;main_~n~0 := 1 + main_#t~post7;havoc main_#t~post7; 14#L41-3true [2019-11-28 02:57:53,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:53,552 INFO L82 PathProgramCache]: Analyzing trace with hash 38893, now seen corresponding path program 1 times [2019-11-28 02:57:53,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:53,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799859358] [2019-11-28 02:57:53,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:53,653 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:53,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:53,655 INFO L82 PathProgramCache]: Analyzing trace with hash 56819, now seen corresponding path program 1 times [2019-11-28 02:57:53,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:53,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233509265] [2019-11-28 02:57:53,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:53,668 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:53,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:53,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1158688391, now seen corresponding path program 1 times [2019-11-28 02:57:53,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:53,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115447752] [2019-11-28 02:57:53,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:53,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:57:53,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115447752] [2019-11-28 02:57:53,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:57:53,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:57:53,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230756795] [2019-11-28 02:57:53,786 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:57:53,787 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:57:53,787 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:57:53,787 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:57:53,787 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:57:53,787 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:53,788 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:57:53,788 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:57:53,788 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2019-11-28 02:57:53,788 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:57:53,788 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:57:53,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:53,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:53,902 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:57:53,903 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:57:53,920 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:57:53,921 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:53,932 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:57:53,932 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:57:53,948 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:57:53,949 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:57:53,976 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:57:53,976 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:54,172 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:57:54,174 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:57:54,175 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:57:54,175 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:57:54,175 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:57:54,175 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:57:54,175 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:54,175 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:57:54,175 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:57:54,176 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2019-11-28 02:57:54,176 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:57:54,176 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:57:54,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:54,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:54,259 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:57:54,265 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:54,272 INFO L120 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 [2019-11-28 02:57:54,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:57:54,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:57:54,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:57:54,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:57:54,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:57:54,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:57:54,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:57:54,282 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:57:54,307 INFO L120 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 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:54,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:57:54,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:57:54,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:57:54,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:57:54,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:57:54,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:57:54,314 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:57:54,319 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:57:54,340 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-28 02:57:54,341 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:54,348 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:57:54,348 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:57:54,349 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:57:54,349 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-11-28 02:57:54,354 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:57:54,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:54,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:57:54,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:57:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:54,407 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:57:54,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:57:54,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:57:54,467 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 [2019-11-28 02:57:54,469 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states. Second operand 4 states. [2019-11-28 02:57:54,599 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states.. Second operand 4 states. Result 72 states and 105 transitions. Complement of second has 11 states. [2019-11-28 02:57:54,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 02:57:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:57:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2019-11-28 02:57:54,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 3 letters. Loop has 3 letters. [2019-11-28 02:57:54,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:57:54,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-28 02:57:54,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:57:54,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 3 letters. Loop has 6 letters. [2019-11-28 02:57:54,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:57:54,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 105 transitions. [2019-11-28 02:57:54,617 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-11-28 02:57:54,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 32 states and 47 transitions. [2019-11-28 02:57:54,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-28 02:57:54,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-28 02:57:54,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 47 transitions. [2019-11-28 02:57:54,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:57:54,636 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-11-28 02:57:54,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 47 transitions. [2019-11-28 02:57:54,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-11-28 02:57:54,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 02:57:54,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2019-11-28 02:57:54,671 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 41 transitions. [2019-11-28 02:57:54,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:57:54,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:57:54,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:57:54,676 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 4 states. [2019-11-28 02:57:54,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:57:54,745 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2019-11-28 02:57:54,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:57:54,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 37 transitions. [2019-11-28 02:57:54,749 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2019-11-28 02:57:54,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 36 transitions. [2019-11-28 02:57:54,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-28 02:57:54,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-28 02:57:54,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2019-11-28 02:57:54,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:57:54,752 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-11-28 02:57:54,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2019-11-28 02:57:54,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-11-28 02:57:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 02:57:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2019-11-28 02:57:54,757 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-28 02:57:54,757 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-28 02:57:54,757 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 02:57:54,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2019-11-28 02:57:54,759 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2019-11-28 02:57:54,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:57:54,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:57:54,760 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 02:57:54,760 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:57:54,761 INFO L794 eck$LassoCheckResult]: Stem: 234#ULTIMATE.startENTRY 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; 235#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 217#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 215#L41-3 [2019-11-28 02:57:54,761 INFO L796 eck$LassoCheckResult]: Loop: 215#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 216#L42-3 assume !!(main_~k~0 <= main_~x~0); 229#L43 assume main_~k~0 <= main_~n~0;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; 225#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 228#factENTRY ~n := #in~n; 232#L25 assume ~n <= 0;#res := 1; 236#factFINAL assume true; 218#factEXIT >#67#return; 222#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 228#factENTRY ~n := #in~n; 232#L25 assume ~n <= 0;#res := 1; 236#factFINAL assume true; 218#factEXIT >#69#return; 224#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 228#factENTRY ~n := #in~n; 232#L25 assume ~n <= 0;#res := 1; 236#factFINAL assume true; 218#factEXIT >#71#return; 214#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~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 212#L30-4 main_#t~ret9 := binomialCoefficient_#res;havoc main_#t~ret9; 213#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 231#L42-3 assume !(main_~k~0 <= main_~x~0); 230#L41-2 main_#t~post7 := main_~n~0;main_~n~0 := 1 + main_#t~post7;havoc main_#t~post7; 215#L41-3 [2019-11-28 02:57:54,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:54,762 INFO L82 PathProgramCache]: Analyzing trace with hash 38893, now seen corresponding path program 2 times [2019-11-28 02:57:54,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:54,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204053970] [2019-11-28 02:57:54,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:54,774 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:54,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:54,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1214025381, now seen corresponding path program 1 times [2019-11-28 02:57:54,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:54,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515141144] [2019-11-28 02:57:54,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:54,788 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 02:57:54,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1476448800] [2019-11-28 02:57:54,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 02:57:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:54,857 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:54,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:54,857 INFO L82 PathProgramCache]: Analyzing trace with hash -2062430919, now seen corresponding path program 1 times [2019-11-28 02:57:54,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:54,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704192787] [2019-11-28 02:57:54,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:54,881 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 02:57:54,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1182418711] [2019-11-28 02:57:54,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:57:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:54,964 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:55,277 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-11-28 02:57:55,389 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:57:55,389 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:57:55,390 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:57:55,390 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:57:55,390 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:57:55,390 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:55,390 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:57:55,390 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:57:55,391 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration2_Loop [2019-11-28 02:57:55,391 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:57:55,391 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:57:55,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:55,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:55,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:55,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:55,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:55,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:55,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:55,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:55,565 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:57:55,565 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:57:55,574 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:57:55,574 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:55,580 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:57:55,580 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 02:57:55,599 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:57:55,599 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:57:55,604 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:57:55,604 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:57:55,626 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:57:55,626 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:55,632 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:57:55,632 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:55,654 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:57:55,654 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:57:55,660 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:57:55,661 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:57:55,693 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:57:55,693 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:55,699 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:57:55,700 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:57:55,716 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:57:55,716 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:55,721 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:57:55,721 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:57:55,738 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:57:55,739 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:55,742 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:57:55,743 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:57:55,761 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:57:55,762 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:57:55,788 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:57:55,789 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:56,423 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:57:56,426 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:57:56,426 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:57:56,427 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:57:56,427 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:57:56,427 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:57:56,427 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:56,427 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:57:56,427 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:57:56,427 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration2_Loop [2019-11-28 02:57:56,427 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:57:56,427 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:57:56,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:56,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:56,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:56,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:56,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:56,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:56,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:56,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:57:56,567 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:57:56,567 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:57:56,587 INFO L120 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 [2019-11-28 02:57:56,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:57:56,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:57:56,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:57:56,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:57:56,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:57:56,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:57:56,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:56,592 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:57:56,608 INFO L120 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 [2019-11-28 02:57:56,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:57:56,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:57:56,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:57:56,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:57:56,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:57:56,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:57:56,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:56,613 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:57:56,629 INFO L120 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 [2019-11-28 02:57:56,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:57:56,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:57:56,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:57:56,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:57:56,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:57:56,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:57:56,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:57:56,636 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:56,675 INFO L120 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 [2019-11-28 02:57:56,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:57:56,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:57:56,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:57:56,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:57:56,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:57:56,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:57:56,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:57:56,681 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:56,696 INFO L120 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 [2019-11-28 02:57:56,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:57:56,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:57:56,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:57:56,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:57:56,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:57:56,699 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:57:56,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:57:56,701 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:57:56,714 INFO L120 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 [2019-11-28 02:57:56,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:57:56,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:57:56,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:57:56,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:57:56,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:57:56,716 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:57:56,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:56,719 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:57:56,727 INFO L120 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 [2019-11-28 02:57:56,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:57:56,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:57:56,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:57:56,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:57:56,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:57:56,732 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:57:56,732 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:56,739 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:57:56,748 INFO L120 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 Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:56,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:57:56,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:57:56,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:57:56,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:57:56,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:57:56,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:57:56,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:57:56,767 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:57:56,773 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-28 02:57:56,774 INFO L444 ModelExtractionUtils]: 5 out of 9 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:57:56,779 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:57:56,779 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:57:56,780 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:57:56,780 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 1 Supporting invariants [] [2019-11-28 02:57:56,784 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:57:56,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:56,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:57:56,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:57:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:56,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 02:57:56,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:57:56,917 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:57:56,918 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 [2019-11-28 02:57:56,918 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 11 Second operand 8 states. [2019-11-28 02:57:57,276 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 11. Second operand 8 states. Result 116 states and 181 transitions. Complement of second has 26 states. [2019-11-28 02:57:57,278 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 [2019-11-28 02:57:57,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 02:57:57,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2019-11-28 02:57:57,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 73 transitions. Stem has 3 letters. Loop has 23 letters. [2019-11-28 02:57:57,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:57:57,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 73 transitions. Stem has 26 letters. Loop has 23 letters. [2019-11-28 02:57:57,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:57:57,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 73 transitions. Stem has 3 letters. Loop has 46 letters. [2019-11-28 02:57:57,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:57:57,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 181 transitions. [2019-11-28 02:57:57,288 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2019-11-28 02:57:57,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 115 states and 180 transitions. [2019-11-28 02:57:57,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2019-11-28 02:57:57,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2019-11-28 02:57:57,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 180 transitions. [2019-11-28 02:57:57,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:57:57,295 INFO L688 BuchiCegarLoop]: Abstraction has 115 states and 180 transitions. [2019-11-28 02:57:57,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 180 transitions. [2019-11-28 02:57:57,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2019-11-28 02:57:57,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-28 02:57:57,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 153 transitions. [2019-11-28 02:57:57,314 INFO L711 BuchiCegarLoop]: Abstraction has 104 states and 153 transitions. [2019-11-28 02:57:57,314 INFO L591 BuchiCegarLoop]: Abstraction has 104 states and 153 transitions. [2019-11-28 02:57:57,314 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 02:57:57,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 153 transitions. [2019-11-28 02:57:57,317 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 [2019-11-28 02:57:57,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:57:57,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:57:57,319 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 02:57:57,319 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:57:57,319 INFO L794 eck$LassoCheckResult]: Stem: 536#ULTIMATE.startENTRY 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; 537#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 490#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 491#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 493#L42-3 [2019-11-28 02:57:57,319 INFO L796 eck$LassoCheckResult]: Loop: 493#L42-3 assume !!(main_~k~0 <= main_~x~0); 514#L43 assume main_~k~0 <= main_~n~0;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; 538#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 567#factENTRY ~n := #in~n; 572#L25 assume !(~n <= 0); 497#L26 call #t~ret0 := fact(~n - 1);< 526#factENTRY ~n := #in~n; 527#L25 assume ~n <= 0;#res := 1; 544#factFINAL assume true; 496#factEXIT >#65#return; 500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 570#factFINAL assume true; 568#factEXIT >#67#return; 563#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 567#factENTRY ~n := #in~n; 572#L25 assume ~n <= 0;#res := 1; 573#factFINAL assume true; 562#factEXIT >#69#return; 565#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 567#factENTRY ~n := #in~n; 572#L25 assume ~n <= 0;#res := 1; 573#factFINAL assume true; 562#factEXIT >#71#return; 561#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~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 559#L30-4 main_#t~ret9 := binomialCoefficient_#res;havoc main_#t~ret9; 557#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 556#L42-3 assume !(main_~k~0 <= main_~x~0); 516#L41-2 main_#t~post7 := main_~n~0;main_~n~0 := 1 + main_#t~post7;havoc main_#t~post7; 492#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 493#L42-3 [2019-11-28 02:57:57,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:57,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 1 times [2019-11-28 02:57:57,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:57,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870660542] [2019-11-28 02:57:57,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:57,331 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:57,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:57,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1320440455, now seen corresponding path program 1 times [2019-11-28 02:57:57,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:57,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868453794] [2019-11-28 02:57:57,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:57,338 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 02:57:57,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [540826202] [2019-11-28 02:57:57,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:57:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:57,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 02:57:57,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:57:57,427 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-28 02:57:57,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868453794] [2019-11-28 02:57:57,431 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 02:57:57,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540826202] [2019-11-28 02:57:57,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:57:57,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-11-28 02:57:57,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590714522] [2019-11-28 02:57:57,433 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:57:57,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:57:57,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:57:57,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:57:57,434 INFO L87 Difference]: Start difference. First operand 104 states and 153 transitions. cyclomatic complexity: 54 Second operand 8 states. [2019-11-28 02:57:57,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:57:57,766 INFO L93 Difference]: Finished difference Result 192 states and 293 transitions. [2019-11-28 02:57:57,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:57:57,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 293 transitions. [2019-11-28 02:57:57,775 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 64 [2019-11-28 02:57:57,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 192 states and 293 transitions. [2019-11-28 02:57:57,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2019-11-28 02:57:57,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2019-11-28 02:57:57,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 293 transitions. [2019-11-28 02:57:57,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:57:57,784 INFO L688 BuchiCegarLoop]: Abstraction has 192 states and 293 transitions. [2019-11-28 02:57:57,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 293 transitions. [2019-11-28 02:57:57,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 128. [2019-11-28 02:57:57,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-28 02:57:57,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 203 transitions. [2019-11-28 02:57:57,805 INFO L711 BuchiCegarLoop]: Abstraction has 128 states and 203 transitions. [2019-11-28 02:57:57,806 INFO L591 BuchiCegarLoop]: Abstraction has 128 states and 203 transitions. [2019-11-28 02:57:57,806 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 02:57:57,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 203 transitions. [2019-11-28 02:57:57,808 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2019-11-28 02:57:57,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:57:57,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:57:57,809 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 02:57:57,810 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:57:57,810 INFO L794 eck$LassoCheckResult]: Stem: 937#ULTIMATE.startENTRY 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; 938#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 892#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 893#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 889#L42-3 [2019-11-28 02:57:57,810 INFO L796 eck$LassoCheckResult]: Loop: 889#L42-3 assume !!(main_~k~0 <= main_~x~0); 939#L43 assume main_~k~0 <= main_~n~0;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; 940#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 981#factENTRY ~n := #in~n; 983#L25 assume !(~n <= 0); 896#L26 call #t~ret0 := fact(~n - 1);< 925#factENTRY ~n := #in~n; 926#L25 assume ~n <= 0;#res := 1; 946#factFINAL assume true; 894#factEXIT >#65#return; 899#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979#factFINAL assume true; 980#factEXIT >#67#return; 973#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 981#factENTRY ~n := #in~n; 983#L25 assume ~n <= 0;#res := 1; 982#factFINAL assume true; 971#factEXIT >#69#return; 977#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 978#factENTRY ~n := #in~n; 985#L25 assume !(~n <= 0); 896#L26 call #t~ret0 := fact(~n - 1);< 925#factENTRY ~n := #in~n; 926#L25 assume ~n <= 0;#res := 1; 946#factFINAL assume true; 894#factEXIT >#65#return; 899#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979#factFINAL assume true; 980#factEXIT >#71#return; 970#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~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 968#L30-4 main_#t~ret9 := binomialCoefficient_#res;havoc main_#t~ret9; 966#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 965#L42-3 assume !(main_~k~0 <= main_~x~0); 915#L41-2 main_#t~post7 := main_~n~0;main_~n~0 := 1 + main_#t~post7;havoc main_#t~post7; 888#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 889#L42-3 [2019-11-28 02:57:57,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:57,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 2 times [2019-11-28 02:57:57,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:57,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011585950] [2019-11-28 02:57:57,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:57,820 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:57,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:57,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1015509379, now seen corresponding path program 2 times [2019-11-28 02:57:57,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:57,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562771219] [2019-11-28 02:57:57,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:57,827 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 02:57:57,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [769551069] [2019-11-28 02:57:57,828 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 02:57:57,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:57:57,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:57:57,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 02:57:57,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:57:58,001 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-28 02:57:58,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562771219] [2019-11-28 02:57:58,001 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 02:57:58,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769551069] [2019-11-28 02:57:58,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:57:58,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-11-28 02:57:58,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318688928] [2019-11-28 02:57:58,003 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:57:58,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:57:58,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:57:58,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:57:58,003 INFO L87 Difference]: Start difference. First operand 128 states and 203 transitions. cyclomatic complexity: 80 Second operand 12 states. [2019-11-28 02:57:58,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:57:58,520 INFO L93 Difference]: Finished difference Result 198 states and 313 transitions. [2019-11-28 02:57:58,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:57:58,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 313 transitions. [2019-11-28 02:57:58,525 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 68 [2019-11-28 02:57:58,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 192 states and 307 transitions. [2019-11-28 02:57:58,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2019-11-28 02:57:58,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2019-11-28 02:57:58,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 307 transitions. [2019-11-28 02:57:58,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:57:58,533 INFO L688 BuchiCegarLoop]: Abstraction has 192 states and 307 transitions. [2019-11-28 02:57:58,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 307 transitions. [2019-11-28 02:57:58,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 156. [2019-11-28 02:57:58,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-28 02:57:58,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 247 transitions. [2019-11-28 02:57:58,560 INFO L711 BuchiCegarLoop]: Abstraction has 156 states and 247 transitions. [2019-11-28 02:57:58,560 INFO L591 BuchiCegarLoop]: Abstraction has 156 states and 247 transitions. [2019-11-28 02:57:58,560 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 02:57:58,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 247 transitions. [2019-11-28 02:57:58,563 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 52 [2019-11-28 02:57:58,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:57:58,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:57:58,564 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 02:57:58,564 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:57:58,565 INFO L794 eck$LassoCheckResult]: Stem: 1391#ULTIMATE.startENTRY 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; 1392#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 1347#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 1348#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 1350#L42-3 [2019-11-28 02:57:58,565 INFO L796 eck$LassoCheckResult]: Loop: 1350#L42-3 assume !!(main_~k~0 <= main_~x~0); 1412#L43 assume main_~k~0 <= main_~n~0;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; 1414#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 1459#factENTRY ~n := #in~n; 1466#L25 assume !(~n <= 0); 1359#L26 call #t~ret0 := fact(~n - 1);< 1385#factENTRY ~n := #in~n; 1386#L25 assume ~n <= 0;#res := 1; 1407#factFINAL assume true; 1357#factEXIT >#65#return; 1363#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1462#factFINAL assume true; 1460#factEXIT >#67#return; 1454#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 1459#factENTRY ~n := #in~n; 1466#L25 assume !(~n <= 0); 1359#L26 call #t~ret0 := fact(~n - 1);< 1385#factENTRY ~n := #in~n; 1386#L25 assume ~n <= 0;#res := 1; 1407#factFINAL assume true; 1357#factEXIT >#65#return; 1363#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1462#factFINAL assume true; 1460#factEXIT >#69#return; 1455#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 1459#factENTRY ~n := #in~n; 1466#L25 assume !(~n <= 0); 1359#L26 call #t~ret0 := fact(~n - 1);< 1385#factENTRY ~n := #in~n; 1386#L25 assume ~n <= 0;#res := 1; 1407#factFINAL assume true; 1357#factEXIT >#65#return; 1363#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1462#factFINAL assume true; 1460#factEXIT >#71#return; 1458#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~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 1495#L30-4 main_#t~ret9 := binomialCoefficient_#res;havoc main_#t~ret9; 1413#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 1411#L42-3 assume !(main_~k~0 <= main_~x~0); 1375#L41-2 main_#t~post7 := main_~n~0;main_~n~0 := 1 + main_#t~post7;havoc main_#t~post7; 1349#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 1350#L42-3 [2019-11-28 02:57:58,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:58,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 3 times [2019-11-28 02:57:58,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:58,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750625386] [2019-11-28 02:57:58,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:58,575 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:58,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:58,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1510379783, now seen corresponding path program 3 times [2019-11-28 02:57:58,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:58,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552583347] [2019-11-28 02:57:58,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:58,582 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 02:57:58,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2137946767] [2019-11-28 02:57:58,583 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 02:57:58,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-28 02:57:58,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:57:58,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:57:58,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:57:58,662 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-28 02:57:58,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552583347] [2019-11-28 02:57:58,663 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 02:57:58,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137946767] [2019-11-28 02:57:58,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:57:58,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:57:58,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616601803] [2019-11-28 02:57:58,665 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:57:58,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:57:58,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:57:58,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:57:58,666 INFO L87 Difference]: Start difference. First operand 156 states and 247 transitions. cyclomatic complexity: 96 Second operand 6 states. [2019-11-28 02:57:58,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:57:58,747 INFO L93 Difference]: Finished difference Result 204 states and 331 transitions. [2019-11-28 02:57:58,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:57:58,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 204 states and 331 transitions. [2019-11-28 02:57:58,752 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 73 [2019-11-28 02:57:58,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 204 states to 198 states and 325 transitions. [2019-11-28 02:57:58,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2019-11-28 02:57:58,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 100 [2019-11-28 02:57:58,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 325 transitions. [2019-11-28 02:57:58,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:57:58,757 INFO L688 BuchiCegarLoop]: Abstraction has 198 states and 325 transitions. [2019-11-28 02:57:58,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 325 transitions. [2019-11-28 02:57:58,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 160. [2019-11-28 02:57:58,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-28 02:57:58,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 251 transitions. [2019-11-28 02:57:58,773 INFO L711 BuchiCegarLoop]: Abstraction has 160 states and 251 transitions. [2019-11-28 02:57:58,773 INFO L591 BuchiCegarLoop]: Abstraction has 160 states and 251 transitions. [2019-11-28 02:57:58,774 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 02:57:58,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 160 states and 251 transitions. [2019-11-28 02:57:58,775 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 53 [2019-11-28 02:57:58,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:57:58,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:57:58,777 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 02:57:58,777 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:57:58,778 INFO L794 eck$LassoCheckResult]: Stem: 1894#ULTIMATE.startENTRY 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; 1895#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 1840#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 1841#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 1843#L42-3 [2019-11-28 02:57:58,778 INFO L796 eck$LassoCheckResult]: Loop: 1843#L42-3 assume !!(main_~k~0 <= main_~x~0); 1926#L43 assume main_~k~0 <= main_~n~0;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; 1934#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 1947#factENTRY ~n := #in~n; 1950#L25 assume !(~n <= 0); 1912#L26 call #t~ret0 := fact(~n - 1);< 1913#factENTRY ~n := #in~n; 1956#L25 assume ~n <= 0;#res := 1; 1954#factFINAL assume true; 1952#factEXIT >#65#return; 1951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1945#factFINAL assume true; 1946#factEXIT >#67#return; 1935#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 1947#factENTRY ~n := #in~n; 1950#L25 assume !(~n <= 0); 1912#L26 call #t~ret0 := fact(~n - 1);< 1913#factENTRY ~n := #in~n; 1956#L25 assume ~n <= 0;#res := 1; 1954#factFINAL assume true; 1952#factEXIT >#65#return; 1951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1945#factFINAL assume true; 1946#factEXIT >#69#return; 1939#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 1947#factENTRY ~n := #in~n; 1950#L25 assume !(~n <= 0); 1912#L26 call #t~ret0 := fact(~n - 1);< 1913#factENTRY ~n := #in~n; 1956#L25 assume ~n <= 0;#res := 1; 1954#factFINAL assume true; 1952#factEXIT >#65#return; 1951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1945#factFINAL assume true; 1946#factEXIT >#71#return; 1942#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~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 1958#L30-4 main_#t~ret9 := binomialCoefficient_#res;havoc main_#t~ret9; 1957#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 1843#L42-3 [2019-11-28 02:57:58,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:58,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 4 times [2019-11-28 02:57:58,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:58,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92298416] [2019-11-28 02:57:58,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:58,789 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:58,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:58,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1831628649, now seen corresponding path program 1 times [2019-11-28 02:57:58,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:58,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756616350] [2019-11-28 02:57:58,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:58,796 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 02:57:58,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [901872870] [2019-11-28 02:57:58,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 02:57:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:58,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 02:57:58,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:57:58,888 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 7 proven. 35 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-28 02:57:58,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756616350] [2019-11-28 02:57:58,889 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 02:57:58,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901872870] [2019-11-28 02:57:58,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:57:58,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-11-28 02:57:58,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457546825] [2019-11-28 02:57:58,891 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:57:58,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:57:58,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:57:58,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:57:58,892 INFO L87 Difference]: Start difference. First operand 160 states and 251 transitions. cyclomatic complexity: 96 Second operand 9 states. [2019-11-28 02:57:59,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:57:59,215 INFO L93 Difference]: Finished difference Result 312 states and 527 transitions. [2019-11-28 02:57:59,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:57:59,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 312 states and 527 transitions. [2019-11-28 02:57:59,222 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 110 [2019-11-28 02:57:59,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 312 states to 312 states and 527 transitions. [2019-11-28 02:57:59,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 152 [2019-11-28 02:57:59,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2019-11-28 02:57:59,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 312 states and 527 transitions. [2019-11-28 02:57:59,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:57:59,230 INFO L688 BuchiCegarLoop]: Abstraction has 312 states and 527 transitions. [2019-11-28 02:57:59,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states and 527 transitions. [2019-11-28 02:57:59,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 200. [2019-11-28 02:57:59,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-28 02:57:59,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 367 transitions. [2019-11-28 02:57:59,250 INFO L711 BuchiCegarLoop]: Abstraction has 200 states and 367 transitions. [2019-11-28 02:57:59,251 INFO L591 BuchiCegarLoop]: Abstraction has 200 states and 367 transitions. [2019-11-28 02:57:59,251 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 02:57:59,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 200 states and 367 transitions. [2019-11-28 02:57:59,253 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 61 [2019-11-28 02:57:59,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:57:59,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:57:59,255 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 02:57:59,255 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:57:59,256 INFO L794 eck$LassoCheckResult]: Stem: 2500#ULTIMATE.startENTRY 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; 2501#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 2445#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 2446#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 2448#L42-3 [2019-11-28 02:57:59,256 INFO L796 eck$LassoCheckResult]: Loop: 2448#L42-3 assume !!(main_~k~0 <= main_~x~0); 2530#L43 assume main_~k~0 <= main_~n~0;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; 2531#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 2556#factENTRY ~n := #in~n; 2562#L25 assume !(~n <= 0); 2563#L26 call #t~ret0 := fact(~n - 1);< 2528#factENTRY ~n := #in~n; 2575#L25 assume !(~n <= 0); 2569#L26 call #t~ret0 := fact(~n - 1);< 2528#factENTRY ~n := #in~n; 2575#L25 assume ~n <= 0;#res := 1; 2573#factFINAL assume true; 2568#factEXIT >#65#return; 2571#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2577#factFINAL assume true; 2572#factEXIT >#65#return; 2567#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2565#factFINAL assume true; 2558#factEXIT >#67#return; 2545#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 2556#factENTRY ~n := #in~n; 2562#L25 assume !(~n <= 0); 2563#L26 call #t~ret0 := fact(~n - 1);< 2528#factENTRY ~n := #in~n; 2575#L25 assume ~n <= 0;#res := 1; 2573#factFINAL assume true; 2568#factEXIT >#65#return; 2566#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2554#factFINAL assume true; 2555#factEXIT >#69#return; 2549#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 2556#factENTRY ~n := #in~n; 2562#L25 assume !(~n <= 0); 2563#L26 call #t~ret0 := fact(~n - 1);< 2528#factENTRY ~n := #in~n; 2575#L25 assume ~n <= 0;#res := 1; 2573#factFINAL assume true; 2568#factEXIT >#65#return; 2566#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2554#factFINAL assume true; 2555#factEXIT >#71#return; 2443#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~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 2439#L30-4 main_#t~ret9 := binomialCoefficient_#res;havoc main_#t~ret9; 2440#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 2448#L42-3 [2019-11-28 02:57:59,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:59,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 5 times [2019-11-28 02:57:59,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:59,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644734459] [2019-11-28 02:57:59,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:59,266 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:59,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:59,267 INFO L82 PathProgramCache]: Analyzing trace with hash 794842995, now seen corresponding path program 2 times [2019-11-28 02:57:59,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:59,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226617012] [2019-11-28 02:57:59,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:59,274 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 02:57:59,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [822243480] [2019-11-28 02:57:59,274 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 02:57:59,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:57:59,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-28 02:57:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:57:59,363 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:57:59,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:57:59,364 INFO L82 PathProgramCache]: Analyzing trace with hash 468385216, now seen corresponding path program 1 times [2019-11-28 02:57:59,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:57:59,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002363553] [2019-11-28 02:57:59,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:57:59,373 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 02:57:59,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [155130495] [2019-11-28 02:57:59,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:57:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:57:59,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:57:59,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:57:59,454 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 61 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-28 02:57:59,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002363553] [2019-11-28 02:57:59,455 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 02:57:59,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155130495] [2019-11-28 02:57:59,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:57:59,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-11-28 02:57:59,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871925148] [2019-11-28 02:58:00,129 WARN L192 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-11-28 02:58:00,301 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 30 [2019-11-28 02:58:00,302 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:00,302 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:00,302 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:00,303 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:00,303 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:00,303 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:00,303 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:00,303 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:00,303 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration7_Loop [2019-11-28 02:58:00,303 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:00,303 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:00,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:00,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:01,831 WARN L192 SmtUtils]: Spent 1.52 s on a formula simplification that was a NOOP. DAG size: 30 [2019-11-28 02:58:01,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:01,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:01,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:01,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:01,982 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-11-28 02:58:02,322 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-28 02:58:02,342 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:02,343 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 02:58:02,349 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:02,350 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:02,352 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:02,352 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:02,363 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:02,363 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:02,381 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:02,381 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:02,396 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:02,398 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:02,398 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:02,398 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:02,398 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:02,399 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:02,399 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:02,399 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:02,399 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:02,399 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration7_Loop [2019-11-28 02:58:02,399 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:02,399 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:02,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:02,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:02,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:02,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:02,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:02,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:02,609 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-11-28 02:58:02,680 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:02,680 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 02:58:02,685 INFO L120 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 [2019-11-28 02:58:02,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:02,686 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:02,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:02,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:02,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:02,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:02,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:58:02,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:02,695 INFO L120 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 Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:02,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:02,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:02,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:02,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:02,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:02,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:02,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:58:02,709 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:02,714 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-28 02:58:02,714 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 02:58:02,719 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:02,719 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:02,719 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:02,719 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~k~0 + 3*ULTIMATE.start_main_~x~0 Supporting invariants [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 02:58:02,722 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:58:02,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:02,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:02,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:02,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-28 02:58:02,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:02,887 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-11-28 02:58:02,887 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-28 02:58:02,888 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 200 states and 367 transitions. cyclomatic complexity: 172 Second operand 8 states. [2019-11-28 02:58:03,186 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 200 states and 367 transitions. cyclomatic complexity: 172. Second operand 8 states. Result 729 states and 1257 transitions. Complement of second has 29 states. [2019-11-28 02:58:03,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2019-11-28 02:58:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 02:58:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2019-11-28 02:58:03,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 54 transitions. Stem has 4 letters. Loop has 44 letters. [2019-11-28 02:58:03,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:03,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 54 transitions. Stem has 48 letters. Loop has 44 letters. [2019-11-28 02:58:03,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:03,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 54 transitions. Stem has 4 letters. Loop has 88 letters. [2019-11-28 02:58:03,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:03,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 729 states and 1257 transitions. [2019-11-28 02:58:03,212 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 109 [2019-11-28 02:58:03,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 729 states to 622 states and 1064 transitions. [2019-11-28 02:58:03,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 193 [2019-11-28 02:58:03,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 196 [2019-11-28 02:58:03,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 622 states and 1064 transitions. [2019-11-28 02:58:03,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:03,230 INFO L688 BuchiCegarLoop]: Abstraction has 622 states and 1064 transitions. [2019-11-28 02:58:03,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states and 1064 transitions. [2019-11-28 02:58:03,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 584. [2019-11-28 02:58:03,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-11-28 02:58:03,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1011 transitions. [2019-11-28 02:58:03,276 INFO L711 BuchiCegarLoop]: Abstraction has 584 states and 1011 transitions. [2019-11-28 02:58:03,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:03,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:58:03,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:58:03,277 INFO L87 Difference]: Start difference. First operand 584 states and 1011 transitions. Second operand 6 states. [2019-11-28 02:58:03,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:03,469 INFO L93 Difference]: Finished difference Result 527 states and 860 transitions. [2019-11-28 02:58:03,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:58:03,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 527 states and 860 transitions. [2019-11-28 02:58:03,478 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 92 [2019-11-28 02:58:03,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 527 states to 527 states and 860 transitions. [2019-11-28 02:58:03,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 169 [2019-11-28 02:58:03,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 169 [2019-11-28 02:58:03,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 527 states and 860 transitions. [2019-11-28 02:58:03,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:03,488 INFO L688 BuchiCegarLoop]: Abstraction has 527 states and 860 transitions. [2019-11-28 02:58:03,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states and 860 transitions. [2019-11-28 02:58:03,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 510. [2019-11-28 02:58:03,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-11-28 02:58:03,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 836 transitions. [2019-11-28 02:58:03,509 INFO L711 BuchiCegarLoop]: Abstraction has 510 states and 836 transitions. [2019-11-28 02:58:03,509 INFO L591 BuchiCegarLoop]: Abstraction has 510 states and 836 transitions. [2019-11-28 02:58:03,509 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 02:58:03,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 510 states and 836 transitions. [2019-11-28 02:58:03,513 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 89 [2019-11-28 02:58:03,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:03,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:03,515 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 02:58:03,515 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:58:03,515 INFO L794 eck$LassoCheckResult]: Stem: 4882#ULTIMATE.startENTRY 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; 4883#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 4836#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 4837#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 4978#L42-3 assume !!(main_~k~0 <= main_~x~0); 4940#L43 [2019-11-28 02:58:03,516 INFO L796 eck$LassoCheckResult]: Loop: 4940#L43 assume !(main_~k~0 <= main_~n~0);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; 5045#L30-5 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 5058#factENTRY ~n := #in~n; 5085#L25 assume !(~n <= 0); 5074#L26 call #t~ret0 := fact(~n - 1);< 5077#factENTRY ~n := #in~n; 5088#L25 assume !(~n <= 0); 5072#L26 call #t~ret0 := fact(~n - 1);< 5077#factENTRY ~n := #in~n; 5088#L25 assume ~n <= 0;#res := 1; 5089#factFINAL assume true; 5070#factEXIT >#65#return; 5075#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5087#factFINAL assume true; 5086#factEXIT >#65#return; 5084#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5066#factFINAL assume true; 5060#factEXIT >#73#return; 5041#L30-6 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 5058#factENTRY ~n := #in~n; 5085#L25 assume ~n <= 0;#res := 1; 5082#factFINAL assume true; 5081#factEXIT >#75#return; 5044#L30-7 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 5065#factENTRY ~n := #in~n; 5083#L25 assume !(~n <= 0); 5074#L26 call #t~ret0 := fact(~n - 1);< 5077#factENTRY ~n := #in~n; 5088#L25 assume ~n <= 0;#res := 1; 5089#factFINAL assume true; 5070#factEXIT >#65#return; 5076#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5064#factFINAL assume true; 5040#factEXIT >#77#return; 4982#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~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 4960#L30-9 main_#t~ret10 := binomialCoefficient_#res;havoc main_#t~ret10; 4961#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 5068#L42-3 assume !!(main_~k~0 <= main_~x~0); 4940#L43 [2019-11-28 02:58:03,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:03,516 INFO L82 PathProgramCache]: Analyzing trace with hash 37377045, now seen corresponding path program 1 times [2019-11-28 02:58:03,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:03,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605326803] [2019-11-28 02:58:03,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:03,526 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:03,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:03,526 INFO L82 PathProgramCache]: Analyzing trace with hash -891671267, now seen corresponding path program 1 times [2019-11-28 02:58:03,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:03,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36655267] [2019-11-28 02:58:03,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:03,536 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 02:58:03,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [883596841] [2019-11-28 02:58:03,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 02:58:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:03,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 02:58:03,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:03,651 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 29 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-28 02:58:03,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36655267] [2019-11-28 02:58:03,652 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 02:58:03,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883596841] [2019-11-28 02:58:03,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:58:03,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-11-28 02:58:03,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290432961] [2019-11-28 02:58:03,653 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:58:03,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:58:03,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:58:03,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:58:03,654 INFO L87 Difference]: Start difference. First operand 510 states and 836 transitions. cyclomatic complexity: 343 Second operand 10 states. [2019-11-28 02:58:04,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:58:04,114 INFO L93 Difference]: Finished difference Result 770 states and 1214 transitions. [2019-11-28 02:58:04,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:58:04,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 770 states and 1214 transitions. [2019-11-28 02:58:04,124 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 148 [2019-11-28 02:58:04,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 770 states to 770 states and 1214 transitions. [2019-11-28 02:58:04,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 248 [2019-11-28 02:58:04,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 248 [2019-11-28 02:58:04,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 770 states and 1214 transitions. [2019-11-28 02:58:04,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:04,136 INFO L688 BuchiCegarLoop]: Abstraction has 770 states and 1214 transitions. [2019-11-28 02:58:04,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states and 1214 transitions. [2019-11-28 02:58:04,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 584. [2019-11-28 02:58:04,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-11-28 02:58:04,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 946 transitions. [2019-11-28 02:58:04,162 INFO L711 BuchiCegarLoop]: Abstraction has 584 states and 946 transitions. [2019-11-28 02:58:04,163 INFO L591 BuchiCegarLoop]: Abstraction has 584 states and 946 transitions. [2019-11-28 02:58:04,163 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 02:58:04,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 584 states and 946 transitions. [2019-11-28 02:58:04,167 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 95 [2019-11-28 02:58:04,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:04,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:04,168 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 02:58:04,168 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:58:04,169 INFO L794 eck$LassoCheckResult]: Stem: 6306#ULTIMATE.startENTRY 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; 6307#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 6258#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 6259#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 6410#L42-3 assume !!(main_~k~0 <= main_~x~0); 6345#L43 [2019-11-28 02:58:04,169 INFO L796 eck$LassoCheckResult]: Loop: 6345#L43 assume !(main_~k~0 <= main_~n~0);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; 6449#L30-5 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 6471#factENTRY ~n := #in~n; 6517#L25 assume !(~n <= 0); 6502#L26 call #t~ret0 := fact(~n - 1);< 6523#factENTRY ~n := #in~n; 6527#L25 assume !(~n <= 0); 6507#L26 call #t~ret0 := fact(~n - 1);< 6523#factENTRY ~n := #in~n; 6527#L25 assume ~n <= 0;#res := 1; 6526#factFINAL assume true; 6521#factEXIT >#65#return; 6508#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6512#factFINAL assume true; 6501#factEXIT >#65#return; 6500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6498#factFINAL assume true; 6492#factEXIT >#73#return; 6472#L30-6 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 6471#factENTRY ~n := #in~n; 6517#L25 assume ~n <= 0;#res := 1; 6515#factFINAL assume true; 6514#factEXIT >#75#return; 6493#L30-7 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 6499#factENTRY ~n := #in~n; 6524#L25 assume !(~n <= 0); 6505#L26 call #t~ret0 := fact(~n - 1);< 6510#factENTRY ~n := #in~n; 6556#L25 assume !(~n <= 0); 6507#L26 call #t~ret0 := fact(~n - 1);< 6523#factENTRY ~n := #in~n; 6527#L25 assume ~n <= 0;#res := 1; 6526#factFINAL assume true; 6521#factEXIT >#65#return; 6508#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6512#factFINAL assume true; 6501#factEXIT >#65#return; 6500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6498#factFINAL assume true; 6492#factEXIT >#77#return; 6496#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~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 6578#L30-9 main_#t~ret10 := binomialCoefficient_#res;havoc main_#t~ret10; 6577#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 6565#L42-3 assume !!(main_~k~0 <= main_~x~0); 6345#L43 [2019-11-28 02:58:04,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:04,169 INFO L82 PathProgramCache]: Analyzing trace with hash 37377045, now seen corresponding path program 2 times [2019-11-28 02:58:04,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:04,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063056294] [2019-11-28 02:58:04,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:04,183 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:04,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:04,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1978386707, now seen corresponding path program 2 times [2019-11-28 02:58:04,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:04,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399567224] [2019-11-28 02:58:04,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:04,198 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 02:58:04,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2034050933] [2019-11-28 02:58:04,199 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 02:58:04,247 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:58:04,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-28 02:58:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:04,275 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:04,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:04,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1569148711, now seen corresponding path program 1 times [2019-11-28 02:58:04,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:04,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192107698] [2019-11-28 02:58:04,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:04,316 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: UNKNOWN during nested interpolation. I don't know how to continue at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:363) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:202) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:928) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkConcatFeasibility(LassoCheck.java:899) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:832) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-28 02:58:04,325 INFO L168 Benchmark]: Toolchain (without parser) took 11613.95 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.7 MB). Free memory was 959.0 MB in the beginning and 885.0 MB in the end (delta: 74.1 MB). Peak memory consumption was 379.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:58:04,328 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:58:04,329 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.56 ms. Allocated memory is still 1.0 GB. Free memory was 959.0 MB in the beginning and 948.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:58:04,329 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -161.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:58:04,330 INFO L168 Benchmark]: Boogie Preprocessor took 21.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:58:04,331 INFO L168 Benchmark]: RCFGBuilder took 292.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-11-28 02:58:04,334 INFO L168 Benchmark]: BuchiAutomizer took 10949.73 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 192.4 MB). Free memory was 1.1 GB in the beginning and 885.0 MB in the end (delta: 198.5 MB). Peak memory consumption was 390.9 MB. Max. memory is 11.5 GB. [2019-11-28 02:58:04,340 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 263.56 ms. Allocated memory is still 1.0 GB. Free memory was 959.0 MB in the beginning and 948.3 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 81.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -161.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 292.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10949.73 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 192.4 MB). Free memory was 1.1 GB in the beginning and 885.0 MB in the end (delta: 198.5 MB). Peak memory consumption was 390.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: UNKNOWN during nested interpolation. I don't know how to continue de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: UNKNOWN during nested interpolation. I don't know how to continue: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:363) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...