./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 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-numeric/Binomial.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7271d13f0b7b365fd7ecc81e9b65f9e103181ef3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/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-6b5699a [2019-11-25 08:47:16,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:47:16,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:47:16,541 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:47:16,542 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:47:16,543 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:47:16,544 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:47:16,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:47:16,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:47:16,548 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:47:16,549 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:47:16,550 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:47:16,550 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:47:16,551 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:47:16,552 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:47:16,553 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:47:16,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:47:16,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:47:16,556 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:47:16,558 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:47:16,559 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:47:16,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:47:16,566 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:47:16,566 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:47:16,569 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:47:16,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:47:16,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:47:16,570 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:47:16,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:47:16,571 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:47:16,571 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:47:16,572 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:47:16,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:47:16,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:47:16,574 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:47:16,574 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:47:16,574 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:47:16,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:47:16,575 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:47:16,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:47:16,576 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:47:16,577 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-25 08:47:16,599 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:47:16,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:47:16,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:47:16,602 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:47:16,602 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:47:16,602 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-25 08:47:16,602 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-25 08:47:16,602 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-25 08:47:16,602 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-25 08:47:16,603 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-25 08:47:16,603 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-25 08:47:16,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:47:16,604 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:47:16,604 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:47:16,604 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:47:16,604 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-25 08:47:16,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-25 08:47:16,605 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-25 08:47:16,605 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:47:16,605 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-25 08:47:16,605 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:47:16,605 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-25 08:47:16,606 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:47:16,606 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:47:16,606 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-25 08:47:16,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:47:16,606 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:47:16,607 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-25 08:47:16,607 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-25 08:47:16,607 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7271d13f0b7b365fd7ecc81e9b65f9e103181ef3 [2019-11-25 08:47:16,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:47:16,757 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:47:16,760 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:47:16,762 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:47:16,762 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:47:16,763 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/../../sv-benchmarks/c/termination-numeric/Binomial.c [2019-11-25 08:47:16,817 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/data/8293a2368/ae80490e9e9d41879a7d5e97c7f6a5f3/FLAGa69f465bb [2019-11-25 08:47:17,224 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:47:17,224 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/sv-benchmarks/c/termination-numeric/Binomial.c [2019-11-25 08:47:17,231 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/data/8293a2368/ae80490e9e9d41879a7d5e97c7f6a5f3/FLAGa69f465bb [2019-11-25 08:47:17,246 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/data/8293a2368/ae80490e9e9d41879a7d5e97c7f6a5f3 [2019-11-25 08:47:17,249 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:47:17,251 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:47:17,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:47:17,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:47:17,256 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:47:17,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:47:17" (1/1) ... [2019-11-25 08:47:17,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@488e3ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:17, skipping insertion in model container [2019-11-25 08:47:17,260 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:47:17" (1/1) ... [2019-11-25 08:47:17,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:47:17,285 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:47:17,423 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:47:17,426 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:47:17,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:47:17,519 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:47:17,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:17 WrapperNode [2019-11-25 08:47:17,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:47:17,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:47:17,521 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:47:17,521 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:47:17,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:17" (1/1) ... [2019-11-25 08:47:17,532 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:17" (1/1) ... [2019-11-25 08:47:17,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:47:17,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:47:17,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:47:17,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:47:17,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:17" (1/1) ... [2019-11-25 08:47:17,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:17" (1/1) ... [2019-11-25 08:47:17,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:17" (1/1) ... [2019-11-25 08:47:17,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:17" (1/1) ... [2019-11-25 08:47:17,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:17" (1/1) ... [2019-11-25 08:47:17,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:17" (1/1) ... [2019-11-25 08:47:17,575 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:17" (1/1) ... [2019-11-25 08:47:17,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:47:17,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:47:17,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:47:17,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:47:17,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:17,635 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2019-11-25 08:47:17,635 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2019-11-25 08:47:17,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:47:17,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:47:18,000 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:47:18,001 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-25 08:47:18,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:18 BoogieIcfgContainer [2019-11-25 08:47:18,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:47:18,003 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-25 08:47:18,003 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-25 08:47:18,006 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-25 08:47:18,007 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:47:18,007 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 08:47:17" (1/3) ... [2019-11-25 08:47:18,009 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18892cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:47:18, skipping insertion in model container [2019-11-25 08:47:18,009 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:47:18,010 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:17" (2/3) ... [2019-11-25 08:47:18,013 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18892cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:47:18, skipping insertion in model container [2019-11-25 08:47:18,013 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:47:18,013 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:18" (3/3) ... [2019-11-25 08:47:18,015 INFO L371 chiAutomizerObserver]: Analyzing ICFG Binomial.c [2019-11-25 08:47:18,061 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-25 08:47:18,061 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-25 08:47:18,061 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-25 08:47:18,062 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:47:18,063 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:47:18,063 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-25 08:47:18,064 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:47:18,064 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-25 08:47:18,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-11-25 08:47:18,098 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-11-25 08:47:18,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:18,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:18,103 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-25 08:47:18,104 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:47:18,104 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-25 08:47:18,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-11-25 08:47:18,107 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-11-25 08:47:18,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:18,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:18,107 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-25 08:47:18,108 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:47:18,113 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-25 08:47:18,113 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-25 08:47:18,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:18,117 INFO L82 PathProgramCache]: Analyzing trace with hash 38893, now seen corresponding path program 1 times [2019-11-25 08:47:18,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:18,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994822556] [2019-11-25 08:47:18,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:18,200 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:18,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:18,201 INFO L82 PathProgramCache]: Analyzing trace with hash 56819, now seen corresponding path program 1 times [2019-11-25 08:47:18,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:18,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997578186] [2019-11-25 08:47:18,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:18,214 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:18,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:18,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1158688391, now seen corresponding path program 1 times [2019-11-25 08:47:18,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:18,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226758125] [2019-11-25 08:47:18,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:18,268 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-25 08:47:18,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226758125] [2019-11-25 08:47:18,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:18,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:18,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819607354] [2019-11-25 08:47:18,327 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:47:18,328 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:47:18,328 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:47:18,328 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:47:18,328 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-25 08:47:18,328 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:18,328 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:47:18,328 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:47:18,328 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2019-11-25 08:47:18,328 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:47:18,329 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:47:18,343 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-25 08:47:18,348 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-25 08:47:18,434 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:47:18,434 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/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-25 08:47:18,446 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:18,446 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-25 08:47:18,457 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:18,457 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: [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:18,465 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:18,465 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/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-25 08:47:18,490 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-25 08:47:18,490 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-25 08:47:18,687 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-25 08:47:18,689 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:47:18,689 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:47:18,689 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:47:18,689 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:47:18,689 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:47:18,689 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:18,689 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:47:18,689 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:47:18,689 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2019-11-25 08:47:18,690 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:47:18,690 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:47:18,691 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-25 08:47:18,693 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-25 08:47:18,770 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:47:18,775 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/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-25 08:47:18,790 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-25 08:47:18,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:18,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:18,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:18,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:18,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:18,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:18,797 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-25 08:47:18,801 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:47:18,815 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-25 08:47:18,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:18,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:18,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:18,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:18,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:18,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:18,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:18,825 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:47:18,832 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-25 08:47:18,832 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/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-25 08:47:18,858 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:47:18,858 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-25 08:47:18,858 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:47:18,859 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-25 08:47:18,863 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-25 08:47:18,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:18,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:47:18,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:18,930 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:47:18,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:18,976 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-25 08:47:18,992 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-25 08:47:18,993 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states. Second operand 4 states. [2019-11-25 08:47:19,105 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-25 08:47:19,106 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-25 08:47:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-25 08:47:19,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2019-11-25 08:47:19,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 3 letters. Loop has 3 letters. [2019-11-25 08:47:19,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:19,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-25 08:47:19,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:19,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 3 letters. Loop has 6 letters. [2019-11-25 08:47:19,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:19,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 105 transitions. [2019-11-25 08:47:19,118 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-11-25 08:47:19,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 32 states and 47 transitions. [2019-11-25 08:47:19,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-25 08:47:19,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-25 08:47:19,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 47 transitions. [2019-11-25 08:47:19,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:19,126 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-11-25 08:47:19,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 47 transitions. [2019-11-25 08:47:19,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-11-25 08:47:19,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-25 08:47:19,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2019-11-25 08:47:19,152 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 41 transitions. [2019-11-25 08:47:19,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:19,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:19,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:19,155 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 4 states. [2019-11-25 08:47:19,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:19,227 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2019-11-25 08:47:19,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:19,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 37 transitions. [2019-11-25 08:47:19,230 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2019-11-25 08:47:19,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 36 transitions. [2019-11-25 08:47:19,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-25 08:47:19,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-25 08:47:19,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2019-11-25 08:47:19,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:47:19,232 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-11-25 08:47:19,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2019-11-25 08:47:19,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-11-25 08:47:19,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-25 08:47:19,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2019-11-25 08:47:19,236 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-25 08:47:19,236 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-25 08:47:19,236 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-25 08:47:19,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2019-11-25 08:47:19,240 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2019-11-25 08:47:19,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:19,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:19,243 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-25 08:47:19,243 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-25 08:47:19,244 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-25 08:47:19,244 INFO L796 eck$LassoCheckResult]: Loop: 215#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 216#L42-3 assume !!(main_~k~0 <= main_~x~0); 229#L43 assume main_~k~0 <= main_~n~0;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 225#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 228#factENTRY ~n := #in~n; 232#L25 assume ~n <= 0;#res := 1; 236#factFINAL assume true; 218#factEXIT >#67#return; 222#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 228#factENTRY ~n := #in~n; 232#L25 assume ~n <= 0;#res := 1; 236#factFINAL assume true; 218#factEXIT >#69#return; 224#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 228#factENTRY ~n := #in~n; 232#L25 assume ~n <= 0;#res := 1; 236#factFINAL assume true; 218#factEXIT >#71#return; 214#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 212#L30-4 main_#t~ret9 := binomialCoefficient_#res;havoc main_#t~ret9; 213#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 231#L42-3 assume !(main_~k~0 <= main_~x~0); 230#L41-2 main_#t~post7 := main_~n~0;main_~n~0 := 1 + main_#t~post7;havoc main_#t~post7; 215#L41-3 [2019-11-25 08:47:19,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:19,245 INFO L82 PathProgramCache]: Analyzing trace with hash 38893, now seen corresponding path program 2 times [2019-11-25 08:47:19,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:19,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012718373] [2019-11-25 08:47:19,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:19,271 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:19,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:19,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1214025381, now seen corresponding path program 1 times [2019-11-25 08:47:19,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:19,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874378823] [2019-11-25 08:47:19,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:19,285 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:47:19,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1040830805] [2019-11-25 08:47:19,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:19,365 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:19,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:19,366 INFO L82 PathProgramCache]: Analyzing trace with hash -2062430919, now seen corresponding path program 1 times [2019-11-25 08:47:19,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:19,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247593314] [2019-11-25 08:47:19,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:19,375 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:47:19,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [443272813] [2019-11-25 08:47:19,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/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-25 08:47:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:19,434 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:19,675 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-11-25 08:47:19,797 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:47:19,797 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:47:19,797 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:47:19,798 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:47:19,798 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-25 08:47:19,798 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:19,798 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:47:19,798 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:47:19,798 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration2_Loop [2019-11-25 08:47:19,798 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:47:19,799 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:47:19,800 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-25 08:47:19,806 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-25 08:47:19,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-25 08:47:19,813 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-25 08:47:19,816 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-25 08:47:19,820 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-25 08:47:19,823 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-25 08:47:19,825 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-25 08:47:19,980 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:47:19,980 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:47:19,987 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:19,988 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:19,992 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:19,993 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 /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:47:20,006 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:20,006 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:20,011 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:20,012 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 /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/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-25 08:47:20,035 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:20,036 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-25 08:47:20,041 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:20,041 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 /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/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-25 08:47:20,058 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:20,058 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-25 08:47:20,063 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:20,064 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 /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/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-25 08:47:20,081 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:20,081 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-25 08:47:20,087 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:20,087 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 /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/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-25 08:47:20,102 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:20,102 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-25 08:47:20,106 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:20,106 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 /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/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-25 08:47:20,121 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:20,121 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-25 08:47:20,125 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:20,126 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 /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/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-25 08:47:20,142 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:20,143 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 /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/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-25 08:47:20,171 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-25 08:47:20,171 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-25 08:47:20,661 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-25 08:47:20,664 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:47:20,664 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:47:20,664 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:47:20,664 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:47:20,665 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:47:20,665 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:20,665 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:47:20,665 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:47:20,665 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration2_Loop [2019-11-25 08:47:20,665 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:47:20,665 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:47:20,667 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-25 08:47:20,673 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-25 08:47:20,676 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-25 08:47:20,680 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-25 08:47:20,683 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-25 08:47:20,686 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-25 08:47:20,689 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-25 08:47:20,694 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-25 08:47:20,834 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:47:20,835 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/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-25 08:47:20,840 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-25 08:47:20,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:20,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:20,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:20,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:20,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:20,843 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:20,844 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-25 08:47:20,845 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/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-25 08:47:20,861 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-25 08:47:20,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:20,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:20,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:20,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:20,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:20,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:20,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:20,866 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:47:20,894 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-25 08:47:20,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:20,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:20,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:20,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:20,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:20,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:20,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:20,900 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/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-25 08:47:20,910 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-25 08:47:20,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:20,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:20,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:20,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:20,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:20,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:20,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:20,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:20,933 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-25 08:47:20,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:20,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:20,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:20,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:20,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:20,939 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:20,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:20,941 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/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-25 08:47:20,947 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-25 08:47:20,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:20,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:20,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:20,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:20,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:20,950 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:20,950 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-25 08:47:20,953 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:47:20,985 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-25 08:47:20,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:20,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:20,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:20,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:20,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:20,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:20,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:21,001 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/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-25 08:47:21,011 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-25 08:47:21,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:21,013 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:21,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:21,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:21,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:21,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:21,019 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-25 08:47:21,024 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:47:21,051 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-25 08:47:21,052 INFO L444 ModelExtractionUtils]: 5 out of 9 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:47:21,059 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:47:21,059 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-25 08:47:21,059 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:47:21,059 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 1 Supporting invariants [] Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:21,066 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-25 08:47:21,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:21,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:47:21,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:21,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 08:47:21,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:21,216 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-25 08:47:21,217 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-25 08:47:21,217 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 11 Second operand 8 states. [2019-11-25 08:47:21,549 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-25 08:47:21,551 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-25 08:47:21,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-25 08:47:21,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2019-11-25 08:47:21,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 73 transitions. Stem has 3 letters. Loop has 23 letters. [2019-11-25 08:47:21,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:21,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 73 transitions. Stem has 26 letters. Loop has 23 letters. [2019-11-25 08:47:21,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:21,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 73 transitions. Stem has 3 letters. Loop has 46 letters. [2019-11-25 08:47:21,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:21,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 181 transitions. [2019-11-25 08:47:21,562 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2019-11-25 08:47:21,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 115 states and 180 transitions. [2019-11-25 08:47:21,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2019-11-25 08:47:21,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2019-11-25 08:47:21,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 180 transitions. [2019-11-25 08:47:21,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:21,576 INFO L688 BuchiCegarLoop]: Abstraction has 115 states and 180 transitions. [2019-11-25 08:47:21,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 180 transitions. [2019-11-25 08:47:21,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2019-11-25 08:47:21,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-25 08:47:21,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 153 transitions. [2019-11-25 08:47:21,606 INFO L711 BuchiCegarLoop]: Abstraction has 104 states and 153 transitions. [2019-11-25 08:47:21,606 INFO L591 BuchiCegarLoop]: Abstraction has 104 states and 153 transitions. [2019-11-25 08:47:21,607 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-25 08:47:21,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 153 transitions. [2019-11-25 08:47:21,614 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 [2019-11-25 08:47:21,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:21,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:21,615 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-25 08:47:21,615 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-25 08:47:21,616 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-25 08:47:21,616 INFO L796 eck$LassoCheckResult]: Loop: 493#L42-3 assume !!(main_~k~0 <= main_~x~0); 514#L43 assume main_~k~0 <= main_~n~0;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 538#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 567#factENTRY ~n := #in~n; 572#L25 assume !(~n <= 0); 497#L26 call #t~ret0 := fact(~n - 1);< 526#factENTRY ~n := #in~n; 527#L25 assume ~n <= 0;#res := 1; 544#factFINAL assume true; 496#factEXIT >#65#return; 500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 570#factFINAL assume true; 568#factEXIT >#67#return; 563#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 567#factENTRY ~n := #in~n; 572#L25 assume ~n <= 0;#res := 1; 573#factFINAL assume true; 562#factEXIT >#69#return; 565#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 567#factENTRY ~n := #in~n; 572#L25 assume ~n <= 0;#res := 1; 573#factFINAL assume true; 562#factEXIT >#71#return; 561#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 559#L30-4 main_#t~ret9 := binomialCoefficient_#res;havoc main_#t~ret9; 557#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 556#L42-3 assume !(main_~k~0 <= main_~x~0); 516#L41-2 main_#t~post7 := main_~n~0;main_~n~0 := 1 + main_#t~post7;havoc main_#t~post7; 492#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 493#L42-3 [2019-11-25 08:47:21,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:21,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 1 times [2019-11-25 08:47:21,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:21,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580491908] [2019-11-25 08:47:21,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:21,637 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:21,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:21,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1320440455, now seen corresponding path program 1 times [2019-11-25 08:47:21,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:21,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262254789] [2019-11-25 08:47:21,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:21,644 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:47:21,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [710996469] [2019-11-25 08:47:21,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/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-25 08:47:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:21,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 08:47:21,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:21,737 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-25 08:47:21,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262254789] [2019-11-25 08:47:21,738 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-25 08:47:21,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710996469] [2019-11-25 08:47:21,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:47:21,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-11-25 08:47:21,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941453071] [2019-11-25 08:47:21,739 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:47:21,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:21,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:47:21,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:47:21,740 INFO L87 Difference]: Start difference. First operand 104 states and 153 transitions. cyclomatic complexity: 54 Second operand 8 states. [2019-11-25 08:47:22,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:22,041 INFO L93 Difference]: Finished difference Result 192 states and 293 transitions. [2019-11-25 08:47:22,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:47:22,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 293 transitions. [2019-11-25 08:47:22,047 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 64 [2019-11-25 08:47:22,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 192 states and 293 transitions. [2019-11-25 08:47:22,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2019-11-25 08:47:22,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2019-11-25 08:47:22,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 293 transitions. [2019-11-25 08:47:22,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:22,052 INFO L688 BuchiCegarLoop]: Abstraction has 192 states and 293 transitions. [2019-11-25 08:47:22,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 293 transitions. [2019-11-25 08:47:22,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 128. [2019-11-25 08:47:22,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-25 08:47:22,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 203 transitions. [2019-11-25 08:47:22,068 INFO L711 BuchiCegarLoop]: Abstraction has 128 states and 203 transitions. [2019-11-25 08:47:22,068 INFO L591 BuchiCegarLoop]: Abstraction has 128 states and 203 transitions. [2019-11-25 08:47:22,068 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-25 08:47:22,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 203 transitions. [2019-11-25 08:47:22,070 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2019-11-25 08:47:22,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:22,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:22,071 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-25 08:47:22,071 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-25 08:47:22,072 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-25 08:47:22,072 INFO L796 eck$LassoCheckResult]: Loop: 889#L42-3 assume !!(main_~k~0 <= main_~x~0); 939#L43 assume main_~k~0 <= main_~n~0;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 940#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 981#factENTRY ~n := #in~n; 983#L25 assume !(~n <= 0); 896#L26 call #t~ret0 := fact(~n - 1);< 925#factENTRY ~n := #in~n; 926#L25 assume ~n <= 0;#res := 1; 946#factFINAL assume true; 894#factEXIT >#65#return; 899#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979#factFINAL assume true; 980#factEXIT >#67#return; 973#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 981#factENTRY ~n := #in~n; 983#L25 assume ~n <= 0;#res := 1; 982#factFINAL assume true; 971#factEXIT >#69#return; 977#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 978#factENTRY ~n := #in~n; 985#L25 assume !(~n <= 0); 896#L26 call #t~ret0 := fact(~n - 1);< 925#factENTRY ~n := #in~n; 926#L25 assume ~n <= 0;#res := 1; 946#factFINAL assume true; 894#factEXIT >#65#return; 899#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979#factFINAL assume true; 980#factEXIT >#71#return; 970#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 968#L30-4 main_#t~ret9 := binomialCoefficient_#res;havoc main_#t~ret9; 966#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 965#L42-3 assume !(main_~k~0 <= main_~x~0); 915#L41-2 main_#t~post7 := main_~n~0;main_~n~0 := 1 + main_#t~post7;havoc main_#t~post7; 888#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 889#L42-3 [2019-11-25 08:47:22,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:22,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 2 times [2019-11-25 08:47:22,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:22,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416521902] [2019-11-25 08:47:22,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:22,080 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:22,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:22,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1015509379, now seen corresponding path program 2 times [2019-11-25 08:47:22,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:22,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805856685] [2019-11-25 08:47:22,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:22,086 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:47:22,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [193768915] [2019-11-25 08:47:22,087 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:22,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:47:22,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:47:22,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 08:47:22,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:22,258 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-25 08:47:22,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805856685] [2019-11-25 08:47:22,258 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-25 08:47:22,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193768915] [2019-11-25 08:47:22,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:47:22,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-11-25 08:47:22,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678095253] [2019-11-25 08:47:22,259 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:47:22,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:22,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 08:47:22,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:47:22,260 INFO L87 Difference]: Start difference. First operand 128 states and 203 transitions. cyclomatic complexity: 80 Second operand 12 states. [2019-11-25 08:47:22,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:22,799 INFO L93 Difference]: Finished difference Result 198 states and 313 transitions. [2019-11-25 08:47:22,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 08:47:22,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 313 transitions. [2019-11-25 08:47:22,804 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 68 [2019-11-25 08:47:22,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 192 states and 307 transitions. [2019-11-25 08:47:22,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2019-11-25 08:47:22,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2019-11-25 08:47:22,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 307 transitions. [2019-11-25 08:47:22,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:22,816 INFO L688 BuchiCegarLoop]: Abstraction has 192 states and 307 transitions. [2019-11-25 08:47:22,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 307 transitions. [2019-11-25 08:47:22,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 156. [2019-11-25 08:47:22,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-25 08:47:22,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 247 transitions. [2019-11-25 08:47:22,843 INFO L711 BuchiCegarLoop]: Abstraction has 156 states and 247 transitions. [2019-11-25 08:47:22,843 INFO L591 BuchiCegarLoop]: Abstraction has 156 states and 247 transitions. [2019-11-25 08:47:22,843 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-25 08:47:22,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 247 transitions. [2019-11-25 08:47:22,846 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 52 [2019-11-25 08:47:22,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:22,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:22,850 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-25 08:47:22,850 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-25 08:47:22,851 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-25 08:47:22,851 INFO L796 eck$LassoCheckResult]: Loop: 1350#L42-3 assume !!(main_~k~0 <= main_~x~0); 1412#L43 assume main_~k~0 <= main_~n~0;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 1414#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 1459#factENTRY ~n := #in~n; 1466#L25 assume !(~n <= 0); 1359#L26 call #t~ret0 := fact(~n - 1);< 1385#factENTRY ~n := #in~n; 1386#L25 assume ~n <= 0;#res := 1; 1407#factFINAL assume true; 1357#factEXIT >#65#return; 1363#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1462#factFINAL assume true; 1460#factEXIT >#67#return; 1454#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 1459#factENTRY ~n := #in~n; 1466#L25 assume !(~n <= 0); 1359#L26 call #t~ret0 := fact(~n - 1);< 1385#factENTRY ~n := #in~n; 1386#L25 assume ~n <= 0;#res := 1; 1407#factFINAL assume true; 1357#factEXIT >#65#return; 1363#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1462#factFINAL assume true; 1460#factEXIT >#69#return; 1455#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 1459#factENTRY ~n := #in~n; 1466#L25 assume !(~n <= 0); 1359#L26 call #t~ret0 := fact(~n - 1);< 1385#factENTRY ~n := #in~n; 1386#L25 assume ~n <= 0;#res := 1; 1407#factFINAL assume true; 1357#factEXIT >#65#return; 1363#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1462#factFINAL assume true; 1460#factEXIT >#71#return; 1458#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 1495#L30-4 main_#t~ret9 := binomialCoefficient_#res;havoc main_#t~ret9; 1413#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 1411#L42-3 assume !(main_~k~0 <= main_~x~0); 1375#L41-2 main_#t~post7 := main_~n~0;main_~n~0 := 1 + main_#t~post7;havoc main_#t~post7; 1349#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 1350#L42-3 [2019-11-25 08:47:22,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:22,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 3 times [2019-11-25 08:47:22,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:22,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982868174] [2019-11-25 08:47:22,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:22,875 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:22,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:22,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1510379783, now seen corresponding path program 3 times [2019-11-25 08:47:22,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:22,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190856115] [2019-11-25 08:47:22,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:22,889 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:47:22,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2042760068] [2019-11-25 08:47:22,890 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:22,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-25 08:47:22,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:47:22,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:47:22,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:22,954 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-25 08:47:22,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190856115] [2019-11-25 08:47:22,954 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-25 08:47:22,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042760068] [2019-11-25 08:47:22,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:22,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:47:22,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331093345] [2019-11-25 08:47:22,955 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:47:22,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:22,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:47:22,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:47:22,956 INFO L87 Difference]: Start difference. First operand 156 states and 247 transitions. cyclomatic complexity: 96 Second operand 6 states. [2019-11-25 08:47:23,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:23,036 INFO L93 Difference]: Finished difference Result 204 states and 331 transitions. [2019-11-25 08:47:23,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:47:23,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 204 states and 331 transitions. [2019-11-25 08:47:23,039 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 73 [2019-11-25 08:47:23,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 204 states to 198 states and 325 transitions. [2019-11-25 08:47:23,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2019-11-25 08:47:23,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 100 [2019-11-25 08:47:23,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 325 transitions. [2019-11-25 08:47:23,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:23,044 INFO L688 BuchiCegarLoop]: Abstraction has 198 states and 325 transitions. [2019-11-25 08:47:23,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 325 transitions. [2019-11-25 08:47:23,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 160. [2019-11-25 08:47:23,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-25 08:47:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 251 transitions. [2019-11-25 08:47:23,060 INFO L711 BuchiCegarLoop]: Abstraction has 160 states and 251 transitions. [2019-11-25 08:47:23,060 INFO L591 BuchiCegarLoop]: Abstraction has 160 states and 251 transitions. [2019-11-25 08:47:23,060 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-25 08:47:23,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 160 states and 251 transitions. [2019-11-25 08:47:23,062 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 53 [2019-11-25 08:47:23,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:23,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:23,063 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-25 08:47:23,063 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-25 08:47:23,063 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-25 08:47:23,064 INFO L796 eck$LassoCheckResult]: Loop: 1843#L42-3 assume !!(main_~k~0 <= main_~x~0); 1926#L43 assume main_~k~0 <= main_~n~0;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 1934#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 1947#factENTRY ~n := #in~n; 1950#L25 assume !(~n <= 0); 1912#L26 call #t~ret0 := fact(~n - 1);< 1913#factENTRY ~n := #in~n; 1956#L25 assume ~n <= 0;#res := 1; 1954#factFINAL assume true; 1952#factEXIT >#65#return; 1951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1945#factFINAL assume true; 1946#factEXIT >#67#return; 1935#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 1947#factENTRY ~n := #in~n; 1950#L25 assume !(~n <= 0); 1912#L26 call #t~ret0 := fact(~n - 1);< 1913#factENTRY ~n := #in~n; 1956#L25 assume ~n <= 0;#res := 1; 1954#factFINAL assume true; 1952#factEXIT >#65#return; 1951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1945#factFINAL assume true; 1946#factEXIT >#69#return; 1939#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 1947#factENTRY ~n := #in~n; 1950#L25 assume !(~n <= 0); 1912#L26 call #t~ret0 := fact(~n - 1);< 1913#factENTRY ~n := #in~n; 1956#L25 assume ~n <= 0;#res := 1; 1954#factFINAL assume true; 1952#factEXIT >#65#return; 1951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1945#factFINAL assume true; 1946#factEXIT >#71#return; 1942#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 1958#L30-4 main_#t~ret9 := binomialCoefficient_#res;havoc main_#t~ret9; 1957#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 1843#L42-3 [2019-11-25 08:47:23,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:23,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 4 times [2019-11-25 08:47:23,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:23,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204758444] [2019-11-25 08:47:23,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:23,072 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:23,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:23,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1831628649, now seen corresponding path program 1 times [2019-11-25 08:47:23,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:23,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886738903] [2019-11-25 08:47:23,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:23,078 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:47:23,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1008173140] [2019-11-25 08:47:23,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:23,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 08:47:23,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:23,162 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-25 08:47:23,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886738903] [2019-11-25 08:47:23,162 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-25 08:47:23,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008173140] [2019-11-25 08:47:23,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:47:23,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-11-25 08:47:23,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761133702] [2019-11-25 08:47:23,163 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:47:23,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:23,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 08:47:23,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:47:23,163 INFO L87 Difference]: Start difference. First operand 160 states and 251 transitions. cyclomatic complexity: 96 Second operand 9 states. [2019-11-25 08:47:23,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:23,516 INFO L93 Difference]: Finished difference Result 312 states and 527 transitions. [2019-11-25 08:47:23,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:47:23,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 312 states and 527 transitions. [2019-11-25 08:47:23,523 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 110 [2019-11-25 08:47:23,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 312 states to 312 states and 527 transitions. [2019-11-25 08:47:23,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 152 [2019-11-25 08:47:23,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2019-11-25 08:47:23,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 312 states and 527 transitions. [2019-11-25 08:47:23,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:23,535 INFO L688 BuchiCegarLoop]: Abstraction has 312 states and 527 transitions. [2019-11-25 08:47:23,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states and 527 transitions. [2019-11-25 08:47:23,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 200. [2019-11-25 08:47:23,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-25 08:47:23,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 367 transitions. [2019-11-25 08:47:23,567 INFO L711 BuchiCegarLoop]: Abstraction has 200 states and 367 transitions. [2019-11-25 08:47:23,567 INFO L591 BuchiCegarLoop]: Abstraction has 200 states and 367 transitions. [2019-11-25 08:47:23,567 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-25 08:47:23,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 200 states and 367 transitions. [2019-11-25 08:47:23,569 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 61 [2019-11-25 08:47:23,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:23,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:23,570 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-25 08:47:23,570 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:23,571 INFO L794 eck$LassoCheckResult]: Stem: 2499#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; 2500#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-25 08:47:23,571 INFO L796 eck$LassoCheckResult]: Loop: 2448#L42-3 assume !!(main_~k~0 <= main_~x~0); 2529#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; 2530#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 2554#factENTRY ~n := #in~n; 2560#L25 assume !(~n <= 0); 2561#L26 call #t~ret0 := fact(~n - 1);< 2527#factENTRY ~n := #in~n; 2573#L25 assume ~n <= 0;#res := 1; 2571#factFINAL assume true; 2566#factEXIT >#65#return; 2564#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2552#factFINAL assume true; 2553#factEXIT >#67#return; 2545#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 2554#factENTRY ~n := #in~n; 2560#L25 assume !(~n <= 0); 2561#L26 call #t~ret0 := fact(~n - 1);< 2527#factENTRY ~n := #in~n; 2573#L25 assume ~n <= 0;#res := 1; 2571#factFINAL assume true; 2566#factEXIT >#65#return; 2564#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2552#factFINAL assume true; 2553#factEXIT >#69#return; 2541#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 2559#factENTRY ~n := #in~n; 2562#L25 assume ~n <= 0;#res := 1; 2558#factFINAL assume true; 2540#factEXIT >#71#return; 2443#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 2439#L30-4 main_#t~ret9 := binomialCoefficient_#res;havoc main_#t~ret9; 2440#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 2448#L42-3 [2019-11-25 08:47:23,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:23,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 5 times [2019-11-25 08:47:23,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:23,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929321378] [2019-11-25 08:47:23,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:23,579 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:23,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:23,580 INFO L82 PathProgramCache]: Analyzing trace with hash -677796173, now seen corresponding path program 2 times [2019-11-25 08:47:23,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:23,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712400405] [2019-11-25 08:47:23,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:23,584 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:47:23,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [341687550] [2019-11-25 08:47:23,585 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:23,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:47:23,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-25 08:47:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:23,641 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:23,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:23,642 INFO L82 PathProgramCache]: Analyzing trace with hash -224814976, now seen corresponding path program 1 times [2019-11-25 08:47:23,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:23,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963945664] [2019-11-25 08:47:23,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:23,654 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:47:23,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1755119750] [2019-11-25 08:47:23,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/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-25 08:47:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:23,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:47:23,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:23,741 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-25 08:47:23,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963945664] [2019-11-25 08:47:23,741 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-25 08:47:23,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755119750] [2019-11-25 08:47:23,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:47:23,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-11-25 08:47:23,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704554345] [2019-11-25 08:47:24,077 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-11-25 08:47:24,213 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 25 [2019-11-25 08:47:24,214 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:47:24,215 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:47:24,215 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:47:24,215 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:47:24,215 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-25 08:47:24,215 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:24,215 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:47:24,215 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:47:24,216 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration7_Loop [2019-11-25 08:47:24,216 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:47:24,216 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:47:24,217 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-25 08:47:24,220 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-25 08:47:24,274 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-25 08:47:24,277 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-25 08:47:24,279 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-25 08:47:24,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-25 08:47:24,394 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:47:24,394 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:24,401 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:24,402 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:47:24,404 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:47:24,404 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 /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:24,410 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:47:24,410 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:47:24,426 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-25 08:47:24,426 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:24,439 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-25 08:47:24,441 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:47:24,441 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:47:24,441 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:47:24,442 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:47:24,442 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:47:24,442 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:24,442 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:47:24,442 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:47:24,442 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration7_Loop [2019-11-25 08:47:24,442 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:47:24,442 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:47:24,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:24,447 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-25 08:47:24,475 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-25 08:47:24,477 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-25 08:47:24,479 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-25 08:47:24,480 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-25 08:47:24,615 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2019-11-25 08:47:24,652 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:47:24,652 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:24,657 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-25 08:47:24,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:24,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:24,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:24,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:24,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:24,659 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:24,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:24,660 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:24,665 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-25 08:47:24,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:24,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:24,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:24,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:24,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:24,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:24,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:24,677 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:47:24,687 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-25 08:47:24,687 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:47:24,694 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:47:24,694 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-25 08:47:24,694 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:47:24,695 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0) = -2*ULTIMATE.start_main_~k~0 + 3 Supporting invariants [] [2019-11-25 08:47:24,705 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:24,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:24,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:47:24,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:24,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-25 08:47:24,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:24,856 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-25 08:47:24,857 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-25 08:47:24,857 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 200 states and 367 transitions. cyclomatic complexity: 172 Second operand 9 states. [2019-11-25 08:47:25,227 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 200 states and 367 transitions. cyclomatic complexity: 172. Second operand 9 states. Result 819 states and 1395 transitions. Complement of second has 33 states. [2019-11-25 08:47:25,227 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-25 08:47:25,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-25 08:47:25,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2019-11-25 08:47:25,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 73 transitions. Stem has 4 letters. Loop has 32 letters. [2019-11-25 08:47:25,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:25,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 73 transitions. Stem has 36 letters. Loop has 32 letters. [2019-11-25 08:47:25,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:25,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 73 transitions. Stem has 4 letters. Loop has 64 letters. [2019-11-25 08:47:25,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:25,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 819 states and 1395 transitions. [2019-11-25 08:47:25,242 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 108 [2019-11-25 08:47:25,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 819 states to 710 states and 1201 transitions. [2019-11-25 08:47:25,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 212 [2019-11-25 08:47:25,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 217 [2019-11-25 08:47:25,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 710 states and 1201 transitions. [2019-11-25 08:47:25,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:25,256 INFO L688 BuchiCegarLoop]: Abstraction has 710 states and 1201 transitions. [2019-11-25 08:47:25,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states and 1201 transitions. [2019-11-25 08:47:25,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 658. [2019-11-25 08:47:25,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-11-25 08:47:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1101 transitions. [2019-11-25 08:47:25,290 INFO L711 BuchiCegarLoop]: Abstraction has 658 states and 1101 transitions. [2019-11-25 08:47:25,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:25,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:47:25,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:47:25,291 INFO L87 Difference]: Start difference. First operand 658 states and 1101 transitions. Second operand 6 states. [2019-11-25 08:47:25,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:25,471 INFO L93 Difference]: Finished difference Result 537 states and 866 transitions. [2019-11-25 08:47:25,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:47:25,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 537 states and 866 transitions. [2019-11-25 08:47:25,482 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 82 [2019-11-25 08:47:25,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 537 states to 535 states and 861 transitions. [2019-11-25 08:47:25,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 175 [2019-11-25 08:47:25,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 175 [2019-11-25 08:47:25,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 535 states and 861 transitions. [2019-11-25 08:47:25,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:25,498 INFO L688 BuchiCegarLoop]: Abstraction has 535 states and 861 transitions. [2019-11-25 08:47:25,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states and 861 transitions. [2019-11-25 08:47:25,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 526. [2019-11-25 08:47:25,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2019-11-25 08:47:25,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 848 transitions. [2019-11-25 08:47:25,523 INFO L711 BuchiCegarLoop]: Abstraction has 526 states and 848 transitions. [2019-11-25 08:47:25,523 INFO L591 BuchiCegarLoop]: Abstraction has 526 states and 848 transitions. [2019-11-25 08:47:25,524 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-25 08:47:25,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 526 states and 848 transitions. [2019-11-25 08:47:25,527 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 82 [2019-11-25 08:47:25,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:25,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:25,529 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-25 08:47:25,529 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-25 08:47:25,529 INFO L794 eck$LassoCheckResult]: Stem: 4986#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; 4987#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 4944#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 4945#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 5075#L42-3 assume !!(main_~k~0 <= main_~x~0); 5048#L43 [2019-11-25 08:47:25,530 INFO L796 eck$LassoCheckResult]: Loop: 5048#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; 5024#L30-5 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 5148#factENTRY ~n := #in~n; 5262#L25 assume !(~n <= 0); 5156#L26 call #t~ret0 := fact(~n - 1);< 5159#factENTRY ~n := #in~n; 5166#L25 assume !(~n <= 0); 5153#L26 call #t~ret0 := fact(~n - 1);< 5159#factENTRY ~n := #in~n; 5166#L25 assume ~n <= 0;#res := 1; 5164#factFINAL assume true; 5162#factEXIT >#65#return; 5158#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5160#factFINAL assume true; 5152#factEXIT >#65#return; 5151#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5150#factFINAL assume true; 5149#factEXIT >#73#return; 5023#L30-6 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 5148#factENTRY ~n := #in~n; 5262#L25 assume ~n <= 0;#res := 1; 5247#factFINAL assume true; 5248#factEXIT >#75#return; 5025#L30-7 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 5146#factENTRY ~n := #in~n; 5161#L25 assume !(~n <= 0); 5156#L26 call #t~ret0 := fact(~n - 1);< 5159#factENTRY ~n := #in~n; 5166#L25 assume ~n <= 0;#res := 1; 5164#factFINAL assume true; 5162#factEXIT >#65#return; 5021#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5027#factFINAL assume true; 5117#factEXIT >#77#return; 5114#L30-8 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 5115#L30-9 main_#t~ret10 := binomialCoefficient_#res;havoc main_#t~ret10; 5058#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 5059#L42-3 assume !!(main_~k~0 <= main_~x~0); 5048#L43 [2019-11-25 08:47:25,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:25,530 INFO L82 PathProgramCache]: Analyzing trace with hash 37377045, now seen corresponding path program 1 times [2019-11-25 08:47:25,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:25,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796579168] [2019-11-25 08:47:25,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:25,537 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:25,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:25,538 INFO L82 PathProgramCache]: Analyzing trace with hash -891671267, now seen corresponding path program 1 times [2019-11-25 08:47:25,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:25,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941986864] [2019-11-25 08:47:25,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:25,544 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:47:25,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2096000566] [2019-11-25 08:47:25,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:25,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-25 08:47:25,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:25,649 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-25 08:47:25,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941986864] [2019-11-25 08:47:25,650 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-25 08:47:25,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096000566] [2019-11-25 08:47:25,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:47:25,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-11-25 08:47:25,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314604531] [2019-11-25 08:47:25,651 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:47:25,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:25,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:47:25,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:47:25,651 INFO L87 Difference]: Start difference. First operand 526 states and 848 transitions. cyclomatic complexity: 339 Second operand 10 states. [2019-11-25 08:47:26,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:26,022 INFO L93 Difference]: Finished difference Result 736 states and 1153 transitions. [2019-11-25 08:47:26,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:47:26,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 736 states and 1153 transitions. [2019-11-25 08:47:26,032 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 139 [2019-11-25 08:47:26,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 736 states to 736 states and 1153 transitions. [2019-11-25 08:47:26,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 250 [2019-11-25 08:47:26,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 250 [2019-11-25 08:47:26,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 736 states and 1153 transitions. [2019-11-25 08:47:26,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:26,047 INFO L688 BuchiCegarLoop]: Abstraction has 736 states and 1153 transitions. [2019-11-25 08:47:26,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states and 1153 transitions. [2019-11-25 08:47:26,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 566. [2019-11-25 08:47:26,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-11-25 08:47:26,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 900 transitions. [2019-11-25 08:47:26,072 INFO L711 BuchiCegarLoop]: Abstraction has 566 states and 900 transitions. [2019-11-25 08:47:26,072 INFO L591 BuchiCegarLoop]: Abstraction has 566 states and 900 transitions. [2019-11-25 08:47:26,073 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-25 08:47:26,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 566 states and 900 transitions. [2019-11-25 08:47:26,077 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 86 [2019-11-25 08:47:26,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:26,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:26,080 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-25 08:47:26,080 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 9, 6, 6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:26,080 INFO L794 eck$LassoCheckResult]: Stem: 6385#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; 6386#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 6348#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 6349#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 6493#L42-3 assume !!(main_~k~0 <= main_~x~0); 6419#L43 [2019-11-25 08:47:26,081 INFO L796 eck$LassoCheckResult]: Loop: 6419#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; 6554#L30-5 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 6552#factENTRY ~n := #in~n; 6586#L25 assume !(~n <= 0); 6572#L26 call #t~ret0 := fact(~n - 1);< 6594#factENTRY ~n := #in~n; 6599#L25 assume !(~n <= 0); 6575#L26 call #t~ret0 := fact(~n - 1);< 6594#factENTRY ~n := #in~n; 6599#L25 assume ~n <= 0;#res := 1; 6595#factFINAL assume true; 6591#factEXIT >#65#return; 6576#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6581#factFINAL assume true; 6569#factEXIT >#65#return; 6568#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6567#factFINAL assume true; 6563#factEXIT >#73#return; 6555#L30-6 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 6552#factENTRY ~n := #in~n; 6586#L25 assume !(~n <= 0); 6572#L26 call #t~ret0 := fact(~n - 1);< 6594#factENTRY ~n := #in~n; 6599#L25 assume !(~n <= 0); 6575#L26 call #t~ret0 := fact(~n - 1);< 6594#factENTRY ~n := #in~n; 6599#L25 assume ~n <= 0;#res := 1; 6595#factFINAL assume true; 6591#factEXIT >#65#return; 6576#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6581#factFINAL assume true; 6569#factEXIT >#65#return; 6568#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6567#factFINAL assume true; 6563#factEXIT >#75#return; 6564#L30-7 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 6552#factENTRY ~n := #in~n; 6586#L25 assume !(~n <= 0); 6572#L26 call #t~ret0 := fact(~n - 1);< 6594#factENTRY ~n := #in~n; 6599#L25 assume !(~n <= 0); 6575#L26 call #t~ret0 := fact(~n - 1);< 6594#factENTRY ~n := #in~n; 6599#L25 assume ~n <= 0;#res := 1; 6595#factFINAL assume true; 6591#factEXIT >#65#return; 6576#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6581#factFINAL assume true; 6569#factEXIT >#65#return; 6568#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6567#factFINAL assume true; 6563#factEXIT >#77#return; 6566#L30-8 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 6669#L30-9 main_#t~ret10 := binomialCoefficient_#res;havoc main_#t~ret10; 6667#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 6418#L42-3 assume !!(main_~k~0 <= main_~x~0); 6419#L43 [2019-11-25 08:47:26,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:26,081 INFO L82 PathProgramCache]: Analyzing trace with hash 37377045, now seen corresponding path program 2 times [2019-11-25 08:47:26,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:26,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240112819] [2019-11-25 08:47:26,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:26,089 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:26,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:26,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1503110995, now seen corresponding path program 2 times [2019-11-25 08:47:26,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:26,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578987206] [2019-11-25 08:47:26,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:26,094 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:47:26,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2009632862] [2019-11-25 08:47:26,095 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:26,139 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:47:26,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:47:26,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-25 08:47:26,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:26,238 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 95 proven. 45 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-25 08:47:26,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578987206] [2019-11-25 08:47:26,239 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-25 08:47:26,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009632862] [2019-11-25 08:47:26,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:47:26,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-11-25 08:47:26,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347472989] [2019-11-25 08:47:26,240 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:47:26,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:26,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 08:47:26,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-25 08:47:26,240 INFO L87 Difference]: Start difference. First operand 566 states and 900 transitions. cyclomatic complexity: 351 Second operand 11 states. [2019-11-25 08:47:26,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:26,684 INFO L93 Difference]: Finished difference Result 971 states and 1562 transitions. [2019-11-25 08:47:26,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 08:47:26,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 971 states and 1562 transitions. [2019-11-25 08:47:26,696 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 149 [2019-11-25 08:47:26,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 971 states to 942 states and 1519 transitions. [2019-11-25 08:47:26,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 315 [2019-11-25 08:47:26,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 315 [2019-11-25 08:47:26,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 942 states and 1519 transitions. [2019-11-25 08:47:26,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:26,711 INFO L688 BuchiCegarLoop]: Abstraction has 942 states and 1519 transitions. [2019-11-25 08:47:26,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states and 1519 transitions. [2019-11-25 08:47:26,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 674. [2019-11-25 08:47:26,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-11-25 08:47:26,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1096 transitions. [2019-11-25 08:47:26,741 INFO L711 BuchiCegarLoop]: Abstraction has 674 states and 1096 transitions. [2019-11-25 08:47:26,741 INFO L591 BuchiCegarLoop]: Abstraction has 674 states and 1096 transitions. [2019-11-25 08:47:26,741 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-25 08:47:26,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 674 states and 1096 transitions. [2019-11-25 08:47:26,746 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 85 [2019-11-25 08:47:26,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:26,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:26,747 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-25 08:47:26,747 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:26,747 INFO L794 eck$LassoCheckResult]: Stem: 8133#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; 8134#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 8079#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 8080#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 8241#L42-3 assume !!(main_~k~0 <= main_~x~0); 8163#L43 [2019-11-25 08:47:26,748 INFO L796 eck$LassoCheckResult]: Loop: 8163#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; 8288#L30-5 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 8305#factENTRY ~n := #in~n; 8418#L25 assume !(~n <= 0); 8356#L26 call #t~ret0 := fact(~n - 1);< 8392#factENTRY ~n := #in~n; 8402#L25 assume !(~n <= 0); 8354#L26 call #t~ret0 := fact(~n - 1);< 8392#factENTRY ~n := #in~n; 8402#L25 assume ~n <= 0;#res := 1; 8394#factFINAL assume true; 8387#factEXIT >#65#return; 8386#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 8385#factFINAL assume true; 8366#factEXIT >#65#return; 8365#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 8347#factFINAL assume true; 8348#factEXIT >#73#return; 8289#L30-6 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 8306#factENTRY ~n := #in~n; 8419#L25 assume ~n <= 0;#res := 1; 8414#factFINAL assume true; 8413#factEXIT >#75#return; 8346#L30-7 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 8405#factENTRY ~n := #in~n; 8403#L25 assume !(~n <= 0); 8355#L26 call #t~ret0 := fact(~n - 1);< 8361#factENTRY ~n := #in~n; 8400#L25 assume !(~n <= 0); 8354#L26 call #t~ret0 := fact(~n - 1);< 8392#factENTRY ~n := #in~n; 8402#L25 assume !(~n <= 0); 8354#L26 call #t~ret0 := fact(~n - 1);< 8392#factENTRY ~n := #in~n; 8402#L25 assume ~n <= 0;#res := 1; 8394#factFINAL assume true; 8387#factEXIT >#65#return; 8386#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 8385#factFINAL assume true; 8366#factEXIT >#65#return; 8360#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 8379#factFINAL assume true; 8352#factEXIT >#65#return; 8351#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 8350#factFINAL assume true; 8345#factEXIT >#77#return; 8282#L30-8 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret3;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2; 8279#L30-9 main_#t~ret10 := binomialCoefficient_#res;havoc main_#t~ret10; 8280#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 8456#L42-3 assume !!(main_~k~0 <= main_~x~0); 8163#L43 [2019-11-25 08:47:26,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:26,748 INFO L82 PathProgramCache]: Analyzing trace with hash 37377045, now seen corresponding path program 3 times [2019-11-25 08:47:26,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:26,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573792164] [2019-11-25 08:47:26,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:26,755 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:26,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:26,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1089104419, now seen corresponding path program 3 times [2019-11-25 08:47:26,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:26,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654289388] [2019-11-25 08:47:26,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:26,760 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:47:26,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1250734966] [2019-11-25 08:47:26,760 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f14ca376-aeef-4222-ad2e-74d62a960738/bin/uautomizer/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:26,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-25 08:47:26,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-25 08:47:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:26,908 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:26,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:26,908 INFO L82 PathProgramCache]: Analyzing trace with hash -344900367, now seen corresponding path program 1 times [2019-11-25 08:47:26,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:26,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397227333] [2019-11-25 08:47:26,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:26,932 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-25 08:47:26,937 INFO L168 Benchmark]: Toolchain (without parser) took 9686.85 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 269.0 MB). Free memory was 951.4 MB in the beginning and 805.8 MB in the end (delta: 145.6 MB). Peak memory consumption was 414.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:26,937 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:47:26,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -152.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:26,938 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.59 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:47:26,938 INFO L168 Benchmark]: Boogie Preprocessor took 26.61 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:47:26,939 INFO L168 Benchmark]: RCFGBuilder took 424.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:26,939 INFO L168 Benchmark]: BuchiAutomizer took 8933.67 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 155.2 MB). Free memory was 1.1 GB in the beginning and 805.8 MB in the end (delta: 272.4 MB). Peak memory consumption was 427.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:26,941 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 267.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -152.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.59 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.61 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 424.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8933.67 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 155.2 MB). Free memory was 1.1 GB in the beginning and 805.8 MB in the end (delta: 272.4 MB). Peak memory consumption was 427.5 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...