./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 678e0110 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-678e011 [2019-11-19 22:20:25,993 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:20:25,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:20:26,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:20:26,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:20:26,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:20:26,021 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:20:26,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:20:26,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:20:26,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:20:26,041 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:20:26,043 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:20:26,043 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:20:26,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:20:26,047 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:20:26,049 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:20:26,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:20:26,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:20:26,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:20:26,059 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:20:26,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:20:26,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:20:26,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:20:26,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:20:26,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:20:26,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:20:26,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:20:26,079 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:20:26,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:20:26,081 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:20:26,081 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:20:26,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:20:26,083 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:20:26,084 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:20:26,085 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:20:26,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:20:26,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:20:26,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:20:26,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:20:26,089 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:20:26,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:20:26,092 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-19 22:20:26,127 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:20:26,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:20:26,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:20:26,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:20:26,129 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:20:26,130 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-19 22:20:26,130 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-19 22:20:26,130 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-19 22:20:26,131 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-19 22:20:26,131 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-19 22:20:26,131 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-19 22:20:26,131 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:20:26,132 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 22:20:26,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:20:26,132 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:20:26,133 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-19 22:20:26,133 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-19 22:20:26,133 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-19 22:20:26,133 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:20:26,134 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-19 22:20:26,134 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:20:26,134 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-19 22:20:26,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:20:26,135 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:20:26,135 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-19 22:20:26,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:20:26,136 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:20:26,136 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-19 22:20:26,137 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-19 22:20:26,138 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-19 22:20:26,452 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:20:26,468 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:20:26,472 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:20:26,473 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:20:26,474 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:20:26,475 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-19 22:20:26,553 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67296f731/e47f9f26fb7842a2a3d51094eb8baa0f/FLAGebc19ed89 [2019-11-19 22:20:27,019 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:20:27,020 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Binomial.c [2019-11-19 22:20:27,027 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67296f731/e47f9f26fb7842a2a3d51094eb8baa0f/FLAGebc19ed89 [2019-11-19 22:20:27,380 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67296f731/e47f9f26fb7842a2a3d51094eb8baa0f [2019-11-19 22:20:27,383 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:20:27,385 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:20:27,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:20:27,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:20:27,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:20:27,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:20:27" (1/1) ... [2019-11-19 22:20:27,394 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13cd239b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:27, skipping insertion in model container [2019-11-19 22:20:27,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:20:27" (1/1) ... [2019-11-19 22:20:27,403 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:20:27,421 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:20:27,610 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:20:27,617 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:20:27,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:20:27,653 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:20:27,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:27 WrapperNode [2019-11-19 22:20:27,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:20:27,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:20:27,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:20:27,655 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:20:27,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:27" (1/1) ... [2019-11-19 22:20:27,671 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:27" (1/1) ... [2019-11-19 22:20:27,750 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:20:27,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:20:27,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:20:27,750 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:20:27,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:27" (1/1) ... [2019-11-19 22:20:27,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:27" (1/1) ... [2019-11-19 22:20:27,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:27" (1/1) ... [2019-11-19 22:20:27,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:27" (1/1) ... [2019-11-19 22:20:27,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:27" (1/1) ... [2019-11-19 22:20:27,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:27" (1/1) ... [2019-11-19 22:20:27,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:27" (1/1) ... [2019-11-19 22:20:27,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:20:27,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:20:27,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:20:27,771 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:20:27,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:27" (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-19 22:20:27,828 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2019-11-19 22:20:27,828 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2019-11-19 22:20:27,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:20:27,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:20:28,084 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:20:28,085 INFO L285 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-19 22:20:28,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:20:28 BoogieIcfgContainer [2019-11-19 22:20:28,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:20:28,087 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-19 22:20:28,088 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-19 22:20:28,092 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-19 22:20:28,094 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:20:28,094 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 10:20:27" (1/3) ... [2019-11-19 22:20:28,099 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6238707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:20:28, skipping insertion in model container [2019-11-19 22:20:28,099 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:20:28,099 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:27" (2/3) ... [2019-11-19 22:20:28,100 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6238707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:20:28, skipping insertion in model container [2019-11-19 22:20:28,100 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:20:28,100 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:20:28" (3/3) ... [2019-11-19 22:20:28,111 INFO L371 chiAutomizerObserver]: Analyzing ICFG Binomial.c [2019-11-19 22:20:28,193 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-19 22:20:28,194 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-19 22:20:28,194 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-19 22:20:28,194 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:20:28,195 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:20:28,195 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-19 22:20:28,195 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:20:28,195 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-19 22:20:28,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-11-19 22:20:28,238 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-11-19 22:20:28,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:20:28,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:20:28,244 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-19 22:20:28,244 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 22:20:28,244 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-19 22:20:28,244 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-11-19 22:20:28,248 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-11-19 22:20:28,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:20:28,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:20:28,248 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-19 22:20:28,248 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 22:20:28,255 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-19 22:20:28,255 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-19 22:20:28,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:28,260 INFO L82 PathProgramCache]: Analyzing trace with hash 38893, now seen corresponding path program 1 times [2019-11-19 22:20:28,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:28,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132026476] [2019-11-19 22:20:28,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:28,363 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:28,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:28,364 INFO L82 PathProgramCache]: Analyzing trace with hash 56819, now seen corresponding path program 1 times [2019-11-19 22:20:28,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:28,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787429179] [2019-11-19 22:20:28,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:28,379 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:28,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:28,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1158688391, now seen corresponding path program 1 times [2019-11-19 22:20:28,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:28,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150814706] [2019-11-19 22:20:28,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:28,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-19 22:20:28,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150814706] [2019-11-19 22:20:28,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:20:28,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 22:20:28,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742107517] [2019-11-19 22:20:28,524 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:20:28,525 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:20:28,526 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:20:28,526 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:20:28,526 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-19 22:20:28,526 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:28,527 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:20:28,527 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:20:28,527 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2019-11-19 22:20:28,527 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:20:28,528 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:20:28,545 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-19 22:20:28,551 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-19 22:20:28,638 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:20:28,639 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-19 22:20:28,656 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:28,656 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-19 22:20:28,667 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-19 22:20:28,667 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-19 22:20:28,681 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:28,681 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-19 22:20:28,696 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-19 22:20:28,696 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-19 22:20:28,916 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-19 22:20:28,918 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:20:28,919 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:20:28,919 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:20:28,919 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:20:28,919 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:20:28,919 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:28,919 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:20:28,919 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:20:28,920 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2019-11-19 22:20:28,920 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:20:28,920 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:20:28,922 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-19 22:20:28,930 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-19 22:20:28,994 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:20:28,998 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) [2019-11-19 22:20:29,005 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-19 22:20:29,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:29,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:20:29,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:29,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:29,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:29,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:20:29,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:29,016 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:29,027 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-19 22:20:29,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:29,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:20:29,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:29,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:29,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:29,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:20:29,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:20:29,040 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:20:29,065 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-19 22:20:29,065 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-19 22:20:29,074 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:20:29,075 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-19 22:20:29,075 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:20:29,076 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-19 22:20:29,082 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-19 22:20:29,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:29,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:29,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:29,144 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:20:29,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:29,188 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-19 22:20:29,205 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-19 22:20:29,207 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states. Second operand 4 states. [2019-11-19 22:20:29,346 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-19 22:20:29,347 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-19 22:20:29,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-19 22:20:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2019-11-19 22:20:29,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 3 letters. Loop has 3 letters. [2019-11-19 22:20:29,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:29,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-19 22:20:29,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:29,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 3 letters. Loop has 6 letters. [2019-11-19 22:20:29,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:29,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 105 transitions. [2019-11-19 22:20:29,363 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-11-19 22:20:29,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 32 states and 47 transitions. [2019-11-19 22:20:29,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-19 22:20:29,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-19 22:20:29,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 47 transitions. [2019-11-19 22:20:29,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:20:29,377 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-11-19 22:20:29,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 47 transitions. [2019-11-19 22:20:29,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-11-19 22:20:29,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-19 22:20:29,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2019-11-19 22:20:29,415 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 41 transitions. [2019-11-19 22:20:29,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:20:29,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:20:29,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:20:29,420 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 4 states. [2019-11-19 22:20:29,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:20:29,496 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2019-11-19 22:20:29,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:20:29,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 37 transitions. [2019-11-19 22:20:29,499 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2019-11-19 22:20:29,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 36 transitions. [2019-11-19 22:20:29,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-19 22:20:29,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-19 22:20:29,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2019-11-19 22:20:29,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:20:29,503 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-11-19 22:20:29,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2019-11-19 22:20:29,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-11-19 22:20:29,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-19 22:20:29,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2019-11-19 22:20:29,508 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-19 22:20:29,508 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-19 22:20:29,508 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-19 22:20:29,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2019-11-19 22:20:29,509 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2019-11-19 22:20:29,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:20:29,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:20:29,511 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-19 22:20:29,511 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-19 22:20:29,511 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-19 22:20:29,512 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~ret2;havoc binomialCoefficient_#t~ret1; 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-19 22:20:29,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:29,512 INFO L82 PathProgramCache]: Analyzing trace with hash 38893, now seen corresponding path program 2 times [2019-11-19 22:20:29,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:29,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014690498] [2019-11-19 22:20:29,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:29,524 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:29,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:29,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1214025381, now seen corresponding path program 1 times [2019-11-19 22:20:29,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:29,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938341781] [2019-11-19 22:20:29,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:29,552 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-19 22:20:29,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1911002091] [2019-11-19 22:20:29,554 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-19 22:20:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:29,655 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:29,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:29,657 INFO L82 PathProgramCache]: Analyzing trace with hash -2062430919, now seen corresponding path program 1 times [2019-11-19 22:20:29,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:29,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486060915] [2019-11-19 22:20:29,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:29,690 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-19 22:20:29,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1192994071] [2019-11-19 22:20:29,691 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-19 22:20:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:29,777 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:30,087 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-11-19 22:20:30,194 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:20:30,194 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:20:30,194 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:20:30,194 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:20:30,195 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-19 22:20:30,195 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:30,195 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:20:30,195 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:20:30,195 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration2_Loop [2019-11-19 22:20:30,196 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:20:30,196 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:20:30,198 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-19 22:20:30,201 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-19 22:20:30,204 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-19 22:20:30,208 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-19 22:20:30,210 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-19 22:20:30,213 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-19 22:20:30,216 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-19 22:20:30,218 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-19 22:20:30,367 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:20:30,368 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:30,380 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:30,380 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-19 22:20:30,385 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-19 22:20:30,385 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-19 22:20:30,406 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:30,407 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-19 22:20:30,412 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-19 22:20:30,412 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-19 22:20:30,433 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:30,434 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-19 22:20:30,440 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-19 22:20:30,440 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) [2019-11-19 22:20:30,461 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:30,461 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:30,467 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-19 22:20:30,467 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-19 22:20:30,497 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:30,497 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-19 22:20:30,504 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-19 22:20:30,504 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-19 22:20:30,521 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:30,522 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-19 22:20:30,526 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-19 22:20:30,527 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-19 22:20:30,542 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:30,542 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-19 22:20:30,546 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-19 22:20:30,546 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-19 22:20:30,565 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:20:30,565 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-19 22:20:30,592 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-19 22:20:30,593 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-19 22:20:31,257 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-19 22:20:31,260 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:20:31,261 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:20:31,261 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:20:31,261 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:20:31,261 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:20:31,261 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:31,261 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:20:31,261 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:20:31,261 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration2_Loop [2019-11-19 22:20:31,261 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:20:31,262 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:20:31,266 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-19 22:20:31,275 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-19 22:20:31,278 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-19 22:20:31,282 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-19 22:20:31,286 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-19 22:20:31,289 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-19 22:20:31,291 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-19 22:20:31,294 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-19 22:20:31,448 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:20:31,448 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-19 22:20:31,455 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-19 22:20:31,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:31,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:20:31,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:31,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:31,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:31,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:20:31,459 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-19 22:20:31,461 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-19 22:20:31,472 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:31,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:31,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:20:31,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:31,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:31,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:31,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:20:31,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:20:31,479 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) [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-11-19 22:20:31,516 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-19 22:20:31,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:31,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:20:31,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:31,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:31,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:31,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:20:31,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:20:31,523 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 21 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 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-19 22:20:31,541 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-19 22:20:31,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:31,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:20:31,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:31,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:31,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:31,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:20:31,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:20:31,547 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) [2019-11-19 22:20:31,563 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-19 22:20:31,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:31,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:20:31,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:31,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:31,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:31,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:20:31,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:31,568 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-19 22:20:31,582 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-19 22:20:31,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:31,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:20:31,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:31,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:31,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:31,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:20:31,585 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-19 22:20:31,587 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) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:31,600 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-19 22:20:31,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:31,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:20:31,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:31,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:31,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:31,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:20:31,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:20:31,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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:31,619 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-19 22:20:31,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:31,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:20:31,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:31,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:31,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:31,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:20:31,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:31,632 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:20:31,638 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-19 22:20:31,638 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) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:31,642 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:20:31,642 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-19 22:20:31,642 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:20:31,642 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-19 22:20:31,645 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-19 22:20:31,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:31,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:20:31,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:31,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-19 22:20:31,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:31,783 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-19 22:20:31,784 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-19 22:20:31,784 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 11 Second operand 8 states. [2019-11-19 22:20:32,141 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-19 22:20:32,144 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-19 22:20:32,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-19 22:20:32,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2019-11-19 22:20:32,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 73 transitions. Stem has 3 letters. Loop has 23 letters. [2019-11-19 22:20:32,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:32,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 73 transitions. Stem has 26 letters. Loop has 23 letters. [2019-11-19 22:20:32,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:32,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 73 transitions. Stem has 3 letters. Loop has 46 letters. [2019-11-19 22:20:32,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:32,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 181 transitions. [2019-11-19 22:20:32,155 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2019-11-19 22:20:32,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 115 states and 180 transitions. [2019-11-19 22:20:32,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2019-11-19 22:20:32,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2019-11-19 22:20:32,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 180 transitions. [2019-11-19 22:20:32,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:20:32,162 INFO L688 BuchiCegarLoop]: Abstraction has 115 states and 180 transitions. [2019-11-19 22:20:32,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 180 transitions. [2019-11-19 22:20:32,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2019-11-19 22:20:32,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-19 22:20:32,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 153 transitions. [2019-11-19 22:20:32,183 INFO L711 BuchiCegarLoop]: Abstraction has 104 states and 153 transitions. [2019-11-19 22:20:32,184 INFO L591 BuchiCegarLoop]: Abstraction has 104 states and 153 transitions. [2019-11-19 22:20:32,184 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-19 22:20:32,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 153 transitions. [2019-11-19 22:20:32,187 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 [2019-11-19 22:20:32,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:20:32,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:20:32,188 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-19 22:20:32,188 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-19 22:20:32,189 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-19 22:20:32,189 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~ret2;havoc binomialCoefficient_#t~ret1; 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-19 22:20:32,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:32,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 1 times [2019-11-19 22:20:32,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:32,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471584979] [2019-11-19 22:20:32,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:32,201 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:32,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:32,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1320440455, now seen corresponding path program 1 times [2019-11-19 22:20:32,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:32,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646110814] [2019-11-19 22:20:32,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:32,208 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-19 22:20:32,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1548159271] [2019-11-19 22:20:32,209 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-19 22:20:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:32,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 22:20:32,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:32,303 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-19 22:20:32,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646110814] [2019-11-19 22:20:32,303 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-19 22:20:32,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548159271] [2019-11-19 22:20:32,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:20:32,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-11-19 22:20:32,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056443864] [2019-11-19 22:20:32,305 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 22:20:32,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:20:32,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:20:32,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:20:32,306 INFO L87 Difference]: Start difference. First operand 104 states and 153 transitions. cyclomatic complexity: 54 Second operand 8 states. [2019-11-19 22:20:32,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:20:32,632 INFO L93 Difference]: Finished difference Result 192 states and 293 transitions. [2019-11-19 22:20:32,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:20:32,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 293 transitions. [2019-11-19 22:20:32,638 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 64 [2019-11-19 22:20:32,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 192 states and 293 transitions. [2019-11-19 22:20:32,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2019-11-19 22:20:32,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2019-11-19 22:20:32,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 293 transitions. [2019-11-19 22:20:32,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:20:32,660 INFO L688 BuchiCegarLoop]: Abstraction has 192 states and 293 transitions. [2019-11-19 22:20:32,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 293 transitions. [2019-11-19 22:20:32,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 128. [2019-11-19 22:20:32,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-19 22:20:32,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 203 transitions. [2019-11-19 22:20:32,705 INFO L711 BuchiCegarLoop]: Abstraction has 128 states and 203 transitions. [2019-11-19 22:20:32,705 INFO L591 BuchiCegarLoop]: Abstraction has 128 states and 203 transitions. [2019-11-19 22:20:32,706 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-19 22:20:32,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 203 transitions. [2019-11-19 22:20:32,708 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2019-11-19 22:20:32,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:20:32,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:20:32,710 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-19 22:20:32,712 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-19 22:20:32,712 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-19 22:20:32,712 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~ret2;havoc binomialCoefficient_#t~ret1; 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-19 22:20:32,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:32,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 2 times [2019-11-19 22:20:32,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:32,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204914747] [2019-11-19 22:20:32,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:32,726 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:32,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:32,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1015509379, now seen corresponding path program 2 times [2019-11-19 22:20:32,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:32,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812257952] [2019-11-19 22:20:32,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:32,732 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-19 22:20:32,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [339991198] [2019-11-19 22:20:32,733 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-19 22:20:32,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:20:32,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:20:32,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-19 22:20:32,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:32,888 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-19 22:20:32,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812257952] [2019-11-19 22:20:32,888 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-19 22:20:32,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339991198] [2019-11-19 22:20:32,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:20:32,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-11-19 22:20:32,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297135598] [2019-11-19 22:20:32,890 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 22:20:32,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:20:32,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 22:20:32,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:20:32,890 INFO L87 Difference]: Start difference. First operand 128 states and 203 transitions. cyclomatic complexity: 80 Second operand 12 states. [2019-11-19 22:20:33,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:20:33,443 INFO L93 Difference]: Finished difference Result 198 states and 313 transitions. [2019-11-19 22:20:33,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 22:20:33,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 313 transitions. [2019-11-19 22:20:33,448 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 68 [2019-11-19 22:20:33,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 192 states and 307 transitions. [2019-11-19 22:20:33,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2019-11-19 22:20:33,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2019-11-19 22:20:33,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 307 transitions. [2019-11-19 22:20:33,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:20:33,457 INFO L688 BuchiCegarLoop]: Abstraction has 192 states and 307 transitions. [2019-11-19 22:20:33,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 307 transitions. [2019-11-19 22:20:33,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 156. [2019-11-19 22:20:33,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-19 22:20:33,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 247 transitions. [2019-11-19 22:20:33,483 INFO L711 BuchiCegarLoop]: Abstraction has 156 states and 247 transitions. [2019-11-19 22:20:33,483 INFO L591 BuchiCegarLoop]: Abstraction has 156 states and 247 transitions. [2019-11-19 22:20:33,483 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-19 22:20:33,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 247 transitions. [2019-11-19 22:20:33,485 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 52 [2019-11-19 22:20:33,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:20:33,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:20:33,489 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-19 22:20:33,489 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-19 22:20:33,490 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-19 22:20:33,490 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~ret2;havoc binomialCoefficient_#t~ret1; 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-19 22:20:33,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:33,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 3 times [2019-11-19 22:20:33,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:33,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445539338] [2019-11-19 22:20:33,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:33,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:33,503 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:33,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:33,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1510379783, now seen corresponding path program 3 times [2019-11-19 22:20:33,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:33,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31729141] [2019-11-19 22:20:33,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:33,510 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-19 22:20:33,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [685140781] [2019-11-19 22:20:33,511 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-19 22:20:33,549 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-19 22:20:33,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:20:33,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:20:33,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:33,578 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-19 22:20:33,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31729141] [2019-11-19 22:20:33,578 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-19 22:20:33,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685140781] [2019-11-19 22:20:33,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:20:33,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:20:33,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553387130] [2019-11-19 22:20:33,580 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 22:20:33,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:20:33,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:20:33,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:20:33,580 INFO L87 Difference]: Start difference. First operand 156 states and 247 transitions. cyclomatic complexity: 96 Second operand 6 states. [2019-11-19 22:20:33,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:20:33,668 INFO L93 Difference]: Finished difference Result 204 states and 331 transitions. [2019-11-19 22:20:33,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:20:33,673 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 204 states and 331 transitions. [2019-11-19 22:20:33,677 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 73 [2019-11-19 22:20:33,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 204 states to 198 states and 325 transitions. [2019-11-19 22:20:33,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2019-11-19 22:20:33,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 100 [2019-11-19 22:20:33,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 325 transitions. [2019-11-19 22:20:33,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:20:33,684 INFO L688 BuchiCegarLoop]: Abstraction has 198 states and 325 transitions. [2019-11-19 22:20:33,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 325 transitions. [2019-11-19 22:20:33,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 160. [2019-11-19 22:20:33,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-19 22:20:33,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 251 transitions. [2019-11-19 22:20:33,699 INFO L711 BuchiCegarLoop]: Abstraction has 160 states and 251 transitions. [2019-11-19 22:20:33,699 INFO L591 BuchiCegarLoop]: Abstraction has 160 states and 251 transitions. [2019-11-19 22:20:33,700 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-19 22:20:33,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 160 states and 251 transitions. [2019-11-19 22:20:33,702 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 53 [2019-11-19 22:20:33,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:20:33,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:20:33,703 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-19 22:20:33,704 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-19 22:20:33,704 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-19 22:20:33,704 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~ret2;havoc binomialCoefficient_#t~ret1; 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-19 22:20:33,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:33,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 4 times [2019-11-19 22:20:33,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:33,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720388730] [2019-11-19 22:20:33,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:33,714 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:33,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:33,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1831628649, now seen corresponding path program 1 times [2019-11-19 22:20:33,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:33,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686152443] [2019-11-19 22:20:33,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:33,721 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-19 22:20:33,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [275495365] [2019-11-19 22:20:33,721 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-19 22:20:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:33,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 22:20:33,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:33,813 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-19 22:20:33,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686152443] [2019-11-19 22:20:33,814 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-19 22:20:33,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275495365] [2019-11-19 22:20:33,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:20:33,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-11-19 22:20:33,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958998579] [2019-11-19 22:20:33,815 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 22:20:33,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:20:33,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:20:33,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:20:33,816 INFO L87 Difference]: Start difference. First operand 160 states and 251 transitions. cyclomatic complexity: 96 Second operand 9 states. [2019-11-19 22:20:34,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:20:34,163 INFO L93 Difference]: Finished difference Result 312 states and 527 transitions. [2019-11-19 22:20:34,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:20:34,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 312 states and 527 transitions. [2019-11-19 22:20:34,170 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 110 [2019-11-19 22:20:34,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 312 states to 312 states and 527 transitions. [2019-11-19 22:20:34,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 152 [2019-11-19 22:20:34,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2019-11-19 22:20:34,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 312 states and 527 transitions. [2019-11-19 22:20:34,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:20:34,178 INFO L688 BuchiCegarLoop]: Abstraction has 312 states and 527 transitions. [2019-11-19 22:20:34,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states and 527 transitions. [2019-11-19 22:20:34,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 200. [2019-11-19 22:20:34,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-19 22:20:34,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 367 transitions. [2019-11-19 22:20:34,203 INFO L711 BuchiCegarLoop]: Abstraction has 200 states and 367 transitions. [2019-11-19 22:20:34,203 INFO L591 BuchiCegarLoop]: Abstraction has 200 states and 367 transitions. [2019-11-19 22:20:34,204 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-19 22:20:34,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 200 states and 367 transitions. [2019-11-19 22:20:34,206 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 61 [2019-11-19 22:20:34,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:20:34,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:20:34,208 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-19 22:20:34,208 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-19 22:20:34,208 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-19 22:20:34,208 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~ret2;havoc binomialCoefficient_#t~ret1; 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-19 22:20:34,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:34,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 5 times [2019-11-19 22:20:34,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:34,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377846604] [2019-11-19 22:20:34,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:34,218 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:34,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:34,219 INFO L82 PathProgramCache]: Analyzing trace with hash 794842995, now seen corresponding path program 2 times [2019-11-19 22:20:34,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:34,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272988394] [2019-11-19 22:20:34,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:34,225 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-19 22:20:34,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [893512987] [2019-11-19 22:20:34,225 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-19 22:20:34,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:20:34,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-19 22:20:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:34,328 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:34,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:34,329 INFO L82 PathProgramCache]: Analyzing trace with hash 468385216, now seen corresponding path program 1 times [2019-11-19 22:20:34,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:34,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884825581] [2019-11-19 22:20:34,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:34,343 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-19 22:20:34,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1312138396] [2019-11-19 22:20:34,343 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-19 22:20:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:34,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:20:34,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:34,471 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-19 22:20:34,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884825581] [2019-11-19 22:20:34,472 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-19 22:20:34,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312138396] [2019-11-19 22:20:34,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:20:34,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-11-19 22:20:34,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91358941] [2019-11-19 22:20:35,137 WARN L191 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-11-19 22:21:04,759 WARN L191 SmtUtils]: Spent 29.61 s on a formula simplification. DAG size of input: 48 DAG size of output: 30 [2019-11-19 22:21:04,760 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:21:04,760 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:21:04,761 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:21:04,761 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:21:04,761 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-19 22:21:04,761 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:04,761 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:21:04,761 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:21:04,761 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration7_Loop [2019-11-19 22:21:04,761 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:21:04,761 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:21:04,762 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-19 22:21:04,769 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-19 22:21:04,803 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-19 22:21:04,805 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-19 22:21:04,808 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-19 22:21:04,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-19 22:21:05,377 WARN L191 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-11-19 22:21:05,463 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:21:05,463 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) [2019-11-19 22:21:05,476 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:21:05,476 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:05,480 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-19 22:21:05,480 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-19 22:21:05,487 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-19 22:21:05,487 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) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:05,500 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-19 22:21:05,500 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-19 22:21:05,514 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-19 22:21:05,516 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:21:05,516 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:21:05,516 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:21:05,516 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:21:05,516 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:21:05,516 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:05,516 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:21:05,517 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:21:05,517 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration7_Loop [2019-11-19 22:21:05,517 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:21:05,517 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:21:05,518 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-19 22:21:05,525 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-19 22:21:05,562 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-19 22:21:05,564 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-19 22:21:05,567 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-19 22:21:05,568 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-19 22:21:05,974 WARN L191 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-11-19 22:21:06,057 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:21:06,057 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-19 22:21:06,063 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-19 22:21:06,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:06,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:06,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:06,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:06,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:06,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:06,067 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:06,073 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-19 22:21:06,081 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-19 22:21:06,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:06,083 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:06,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:06,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:06,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:06,087 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:06,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:06,092 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:21:06,098 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-19 22:21:06,099 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-19 22:21:06,103 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:21:06,103 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-19 22:21:06,103 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:21:06,103 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 [] [2019-11-19 22:21:06,106 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-19 22:21:06,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:06,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:21:06,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:06,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-19 22:21:06,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:06,274 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-19 22:21:06,274 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-19 22:21:06,274 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 200 states and 367 transitions. cyclomatic complexity: 172 Second operand 8 states. [2019-11-19 22:21:06,594 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-19 22:21:06,595 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-19 22:21:06,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-19 22:21:06,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2019-11-19 22:21:06,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 54 transitions. Stem has 4 letters. Loop has 44 letters. [2019-11-19 22:21:06,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:06,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 54 transitions. Stem has 48 letters. Loop has 44 letters. [2019-11-19 22:21:06,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:06,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 54 transitions. Stem has 4 letters. Loop has 88 letters. [2019-11-19 22:21:06,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:06,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 729 states and 1257 transitions. [2019-11-19 22:21:06,613 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 109 [2019-11-19 22:21:06,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 729 states to 622 states and 1064 transitions. [2019-11-19 22:21:06,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 193 [2019-11-19 22:21:06,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 196 [2019-11-19 22:21:06,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 622 states and 1064 transitions. [2019-11-19 22:21:06,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:06,628 INFO L688 BuchiCegarLoop]: Abstraction has 622 states and 1064 transitions. [2019-11-19 22:21:06,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states and 1064 transitions. [2019-11-19 22:21:06,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 584. [2019-11-19 22:21:06,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-11-19 22:21:06,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1011 transitions. [2019-11-19 22:21:06,667 INFO L711 BuchiCegarLoop]: Abstraction has 584 states and 1011 transitions. [2019-11-19 22:21:06,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:06,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:21:06,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:21:06,668 INFO L87 Difference]: Start difference. First operand 584 states and 1011 transitions. Second operand 6 states. [2019-11-19 22:21:06,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:06,873 INFO L93 Difference]: Finished difference Result 527 states and 860 transitions. [2019-11-19 22:21:06,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:21:06,874 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 527 states and 860 transitions. [2019-11-19 22:21:06,882 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 92 [2019-11-19 22:21:06,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 527 states to 527 states and 860 transitions. [2019-11-19 22:21:06,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 169 [2019-11-19 22:21:06,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 169 [2019-11-19 22:21:06,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 527 states and 860 transitions. [2019-11-19 22:21:06,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:06,893 INFO L688 BuchiCegarLoop]: Abstraction has 527 states and 860 transitions. [2019-11-19 22:21:06,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states and 860 transitions. [2019-11-19 22:21:06,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 510. [2019-11-19 22:21:06,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-11-19 22:21:06,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 836 transitions. [2019-11-19 22:21:06,917 INFO L711 BuchiCegarLoop]: Abstraction has 510 states and 836 transitions. [2019-11-19 22:21:06,917 INFO L591 BuchiCegarLoop]: Abstraction has 510 states and 836 transitions. [2019-11-19 22:21:06,917 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-19 22:21:06,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 510 states and 836 transitions. [2019-11-19 22:21:06,922 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 89 [2019-11-19 22:21:06,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:06,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:06,923 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-19 22:21:06,923 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-19 22:21:06,923 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-19 22:21:06,924 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~ret2;havoc binomialCoefficient_#t~ret1; 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-19 22:21:06,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:06,924 INFO L82 PathProgramCache]: Analyzing trace with hash 37377045, now seen corresponding path program 1 times [2019-11-19 22:21:06,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:06,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271484074] [2019-11-19 22:21:06,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:06,934 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:06,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:06,934 INFO L82 PathProgramCache]: Analyzing trace with hash -891671267, now seen corresponding path program 1 times [2019-11-19 22:21:06,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:06,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294039379] [2019-11-19 22:21:06,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:06,945 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-19 22:21:06,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [613699541] [2019-11-19 22:21:06,948 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-19 22:21:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:06,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-19 22:21:06,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:07,066 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-19 22:21:07,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294039379] [2019-11-19 22:21:07,067 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-19 22:21:07,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613699541] [2019-11-19 22:21:07,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:21:07,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-11-19 22:21:07,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126458010] [2019-11-19 22:21:07,067 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 22:21:07,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:07,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:21:07,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:21:07,068 INFO L87 Difference]: Start difference. First operand 510 states and 836 transitions. cyclomatic complexity: 343 Second operand 10 states. [2019-11-19 22:21:07,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:07,526 INFO L93 Difference]: Finished difference Result 770 states and 1214 transitions. [2019-11-19 22:21:07,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:21:07,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 770 states and 1214 transitions. [2019-11-19 22:21:07,538 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 148 [2019-11-19 22:21:07,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 770 states to 770 states and 1214 transitions. [2019-11-19 22:21:07,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 248 [2019-11-19 22:21:07,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 248 [2019-11-19 22:21:07,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 770 states and 1214 transitions. [2019-11-19 22:21:07,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:07,553 INFO L688 BuchiCegarLoop]: Abstraction has 770 states and 1214 transitions. [2019-11-19 22:21:07,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states and 1214 transitions. [2019-11-19 22:21:07,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 584. [2019-11-19 22:21:07,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-11-19 22:21:07,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 946 transitions. [2019-11-19 22:21:07,590 INFO L711 BuchiCegarLoop]: Abstraction has 584 states and 946 transitions. [2019-11-19 22:21:07,591 INFO L591 BuchiCegarLoop]: Abstraction has 584 states and 946 transitions. [2019-11-19 22:21:07,591 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-19 22:21:07,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 584 states and 946 transitions. [2019-11-19 22:21:07,597 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 95 [2019-11-19 22:21:07,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:07,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:07,599 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-19 22:21:07,599 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-19 22:21:07,599 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-19 22:21:07,599 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~ret2;havoc binomialCoefficient_#t~ret1; 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-19 22:21:07,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:07,600 INFO L82 PathProgramCache]: Analyzing trace with hash 37377045, now seen corresponding path program 2 times [2019-11-19 22:21:07,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:07,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173813044] [2019-11-19 22:21:07,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:07,614 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:07,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:07,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1978386707, now seen corresponding path program 2 times [2019-11-19 22:21:07,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:07,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561028662] [2019-11-19 22:21:07,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:07,631 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-19 22:21:07,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2001647762] [2019-11-19 22:21:07,632 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-19 22:21:07,684 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:21:07,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-19 22:21:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:07,713 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:07,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:07,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1569148711, now seen corresponding path program 1 times [2019-11-19 22:21:07,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:07,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005577324] [2019-11-19 22:21:07,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:07,746 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-19 22:21:07,751 INFO L168 Benchmark]: Toolchain (without parser) took 40366.28 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 303.6 MB). Free memory was 959.0 MB in the beginning and 861.5 MB in the end (delta: 97.5 MB). Peak memory consumption was 401.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:07,751 INFO L168 Benchmark]: CDTParser took 0.25 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-19 22:21:07,752 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.42 ms. Allocated memory is still 1.0 GB. Free memory was 959.0 MB in the beginning and 947.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:07,753 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -187.1 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:07,753 INFO L168 Benchmark]: Boogie Preprocessor took 20.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:07,754 INFO L168 Benchmark]: RCFGBuilder took 315.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:07,754 INFO L168 Benchmark]: BuchiAutomizer took 39661.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 166.2 MB). Free memory was 1.1 GB in the beginning and 861.5 MB in the end (delta: 246.7 MB). Peak memory consumption was 412.9 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:07,758 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.25 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 268.42 ms. Allocated memory is still 1.0 GB. Free memory was 959.0 MB in the beginning and 947.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 95.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -187.1 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 315.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 39661.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 166.2 MB). Free memory was 1.1 GB in the beginning and 861.5 MB in the end (delta: 246.7 MB). Peak memory consumption was 412.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...