./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-numeric/Binomial.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/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/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/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-cad4683 [2019-10-22 08:54:40,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:40,190 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:40,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:40,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:40,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:40,202 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:40,204 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:40,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:40,206 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:40,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:40,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:40,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:40,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:40,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:40,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:40,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:40,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:40,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:40,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:40,218 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:40,219 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:40,220 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:40,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:40,222 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:40,222 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:40,223 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:40,223 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:40,224 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:40,224 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:40,225 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:40,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:40,226 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:40,226 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:40,227 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:40,227 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:40,228 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:40,228 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:40,229 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:40,229 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:40,230 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:40,230 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:54:40,247 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:40,247 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:40,249 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:40,251 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:40,251 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:40,252 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:54:40,252 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:54:40,252 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:54:40,252 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:54:40,252 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:54:40,253 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:54:40,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:40,253 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:54:40,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:40,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:40,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:54:40,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:54:40,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:54:40,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:40,255 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:54:40,255 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:40,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:54:40,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:40,256 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:40,256 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:54:40,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:40,256 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:40,256 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:54:40,257 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:54:40,258 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/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/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-10-22 08:54:40,297 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:40,307 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:40,311 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:40,313 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:40,313 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:40,314 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/bin/uautomizer/../../sv-benchmarks/c/termination-numeric/Binomial.c [2019-10-22 08:54:40,362 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/bin/uautomizer/data/4f77f5ae6/a08afdd44a7047eeb1c10d9d307e05b5/FLAG114e57348 [2019-10-22 08:54:40,751 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:40,752 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/sv-benchmarks/c/termination-numeric/Binomial.c [2019-10-22 08:54:40,757 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/bin/uautomizer/data/4f77f5ae6/a08afdd44a7047eeb1c10d9d307e05b5/FLAG114e57348 [2019-10-22 08:54:41,145 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/bin/uautomizer/data/4f77f5ae6/a08afdd44a7047eeb1c10d9d307e05b5 [2019-10-22 08:54:41,147 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:41,148 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:41,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:41,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:41,152 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:41,153 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:41" (1/1) ... [2019-10-22 08:54:41,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5390f377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:41, skipping insertion in model container [2019-10-22 08:54:41,155 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:41" (1/1) ... [2019-10-22 08:54:41,162 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:41,178 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:41,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:41,346 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:41,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:41,438 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:41,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:41 WrapperNode [2019-10-22 08:54:41,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:41,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:41,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:41,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:41,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:41" (1/1) ... [2019-10-22 08:54:41,455 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:41" (1/1) ... [2019-10-22 08:54:41,475 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:41,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:41,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:41,476 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:41,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:41" (1/1) ... [2019-10-22 08:54:41,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:41" (1/1) ... [2019-10-22 08:54:41,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:41" (1/1) ... [2019-10-22 08:54:41,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:41" (1/1) ... [2019-10-22 08:54:41,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:41" (1/1) ... [2019-10-22 08:54:41,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:41" (1/1) ... [2019-10-22 08:54:41,490 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:41" (1/1) ... [2019-10-22 08:54:41,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:41,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:41,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:41,492 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:41,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/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-10-22 08:54:41,547 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2019-10-22 08:54:41,548 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2019-10-22 08:54:41,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:41,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:41,690 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:41,691 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-22 08:54:41,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:41 BoogieIcfgContainer [2019-10-22 08:54:41,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:41,693 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:54:41,693 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:54:41,696 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:54:41,697 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:41,697 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:54:41" (1/3) ... [2019-10-22 08:54:41,698 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c749fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:41, skipping insertion in model container [2019-10-22 08:54:41,699 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:41,699 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:41" (2/3) ... [2019-10-22 08:54:41,699 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c749fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:41, skipping insertion in model container [2019-10-22 08:54:41,699 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:41,699 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:41" (3/3) ... [2019-10-22 08:54:41,701 INFO L371 chiAutomizerObserver]: Analyzing ICFG Binomial.c [2019-10-22 08:54:41,750 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:54:41,750 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:54:41,750 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:54:41,750 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:41,750 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:41,751 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:54:41,751 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:41,751 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:54:41,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-10-22 08:54:41,793 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-10-22 08:54:41,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:41,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:41,801 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:54:41,801 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:54:41,801 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:54:41,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-10-22 08:54:41,804 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-10-22 08:54:41,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:41,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:41,804 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:54:41,805 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:54:41,812 INFO L791 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-10-22 08:54:41,812 INFO L793 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-10-22 08:54:41,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:41,818 INFO L82 PathProgramCache]: Analyzing trace with hash 38893, now seen corresponding path program 1 times [2019-10-22 08:54:41,826 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:41,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120216303] [2019-10-22 08:54:41,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:41,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:41,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:41,923 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:41,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:41,924 INFO L82 PathProgramCache]: Analyzing trace with hash 56819, now seen corresponding path program 1 times [2019-10-22 08:54:41,924 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:41,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253853595] [2019-10-22 08:54:41,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:41,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:41,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:41,936 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:41,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:41,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1158688391, now seen corresponding path program 1 times [2019-10-22 08:54:41,938 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:41,939 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005889424] [2019-10-22 08:54:41,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:41,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:41,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:42,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:42,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005889424] [2019-10-22 08:54:42,027 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:42,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:54:42,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996483456] [2019-10-22 08:54:42,086 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:42,086 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:42,087 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:42,087 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:42,087 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:42,087 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:42,087 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:42,087 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:42,088 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2019-10-22 08:54:42,088 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:42,088 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:42,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:42,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:42,191 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:42,193 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:42,203 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:42,203 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:42,213 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:42,214 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/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/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-10-22 08:54:42,221 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:42,222 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:42,237 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:42,237 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:42,393 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:42,395 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:42,396 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:42,396 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:42,396 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:42,396 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:42,396 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:42,396 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:42,396 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:42,396 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2019-10-22 08:54:42,396 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:42,396 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:42,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:42,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:42,475 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:42,480 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:42,482 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-10-22 08:54:42,485 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:42,487 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:42,488 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:42,488 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:42,488 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:42,490 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:42,490 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:42,494 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:42,495 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-10-22 08:54:42,496 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:42,496 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:42,497 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:42,497 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:42,497 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:42,498 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:42,498 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:42,513 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:42,526 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:54:42,529 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:54:42,532 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:42,532 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:42,532 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:42,533 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-10-22 08:54:42,538 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:42,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:42,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:42,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:42,596 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:54:42,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:42,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:42,650 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-10-22 08:54:42,652 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states. Second operand 4 states. [2019-10-22 08:54:42,736 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-10-22 08:54:42,737 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-10-22 08:54:42,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:54:42,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2019-10-22 08:54:42,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 3 letters. Loop has 3 letters. [2019-10-22 08:54:42,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:42,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 6 letters. Loop has 3 letters. [2019-10-22 08:54:42,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:42,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 3 letters. Loop has 6 letters. [2019-10-22 08:54:42,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:42,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 105 transitions. [2019-10-22 08:54:42,750 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-10-22 08:54:42,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 32 states and 47 transitions. [2019-10-22 08:54:42,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-10-22 08:54:42,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-10-22 08:54:42,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 47 transitions. [2019-10-22 08:54:42,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:42,762 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-10-22 08:54:42,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 47 transitions. [2019-10-22 08:54:42,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-10-22 08:54:42,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-22 08:54:42,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2019-10-22 08:54:42,795 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 41 transitions. [2019-10-22 08:54:42,795 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:42,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:42,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:42,800 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 4 states. [2019-10-22 08:54:42,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:42,861 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2019-10-22 08:54:42,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:42,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 37 transitions. [2019-10-22 08:54:42,864 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2019-10-22 08:54:42,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 36 transitions. [2019-10-22 08:54:42,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-10-22 08:54:42,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-10-22 08:54:42,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2019-10-22 08:54:42,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:42,867 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-10-22 08:54:42,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2019-10-22 08:54:42,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-10-22 08:54:42,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-22 08:54:42,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2019-10-22 08:54:42,871 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-10-22 08:54:42,871 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-10-22 08:54:42,871 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:54:42,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2019-10-22 08:54:42,872 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2019-10-22 08:54:42,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:42,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:42,874 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:54:42,874 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:42,874 INFO L791 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-10-22 08:54:42,875 INFO L793 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~ret2;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3; 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-10-22 08:54:42,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:42,875 INFO L82 PathProgramCache]: Analyzing trace with hash 38893, now seen corresponding path program 2 times [2019-10-22 08:54:42,875 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:42,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095192417] [2019-10-22 08:54:42,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:42,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:42,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:42,887 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:42,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:42,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1214025381, now seen corresponding path program 1 times [2019-10-22 08:54:42,887 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:42,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479613005] [2019-10-22 08:54:42,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:42,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:42,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:42,902 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:54:42,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2009704614] [2019-10-22 08:54:42,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:42,966 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:42,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:42,967 INFO L82 PathProgramCache]: Analyzing trace with hash -2062430919, now seen corresponding path program 1 times [2019-10-22 08:54:42,967 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:42,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182145635] [2019-10-22 08:54:42,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:42,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:42,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:42,979 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:54:42,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [392073559] [2019-10-22 08:54:42,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:43,047 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:43,280 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-10-22 08:54:43,393 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:43,393 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:43,393 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:43,394 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:43,394 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:43,394 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:43,394 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:43,394 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:43,394 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration2_Loop [2019-10-22 08:54:43,394 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:43,394 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:43,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:43,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:43,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:43,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:43,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:43,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:43,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:43,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:43,547 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:43,547 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/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) [2019-10-22 08:54:43,554 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:43,554 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:43,559 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:43,559 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/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:43,572 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:43,572 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:43,576 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:43,577 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/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:43,584 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:43,584 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:43,588 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:43,588 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/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/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-10-22 08:54:43,597 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:43,597 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-10-22 08:54:43,602 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:43,602 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/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/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-10-22 08:54:43,609 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:43,610 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-10-22 08:54:43,614 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:43,614 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/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/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) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:43,623 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:43,623 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:43,629 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:43,630 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/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/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-10-22 08:54:43,637 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:43,637 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-10-22 08:54:43,641 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:43,641 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/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:43,649 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:43,649 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/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-10-22 08:54:43,665 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:43,665 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-10-22 08:54:44,126 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:44,140 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:44,141 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:44,141 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:44,141 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:44,141 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:44,141 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:44,141 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:44,141 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:44,142 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration2_Loop [2019-10-22 08:54:44,142 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:44,142 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:44,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:44,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:44,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:44,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:44,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:44,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:44,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:44,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:44,267 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:44,268 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:44,268 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-10-22 08:54:44,269 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:44,269 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:44,269 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:44,269 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:44,269 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:44,270 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:44,270 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:44,271 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:44,271 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-10-22 08:54:44,272 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:44,273 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:44,273 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:44,273 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:44,273 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:44,273 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:44,274 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:44,275 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:44,275 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-10-22 08:54:44,276 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:44,276 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:44,276 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:44,276 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:44,277 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:44,277 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:44,277 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:44,282 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:44,282 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-10-22 08:54:44,283 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:44,283 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:44,283 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:44,283 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:44,284 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:44,284 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:44,284 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:44,285 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:44,286 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-10-22 08:54:44,286 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:44,287 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:44,287 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:44,287 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:44,287 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:44,287 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:44,288 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:44,295 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:44,295 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-10-22 08:54:44,296 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:44,296 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:44,297 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:44,297 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:44,297 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:44,297 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:44,297 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:44,298 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:44,299 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-10-22 08:54:44,299 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:44,299 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:44,300 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:44,300 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:44,301 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:44,301 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:44,302 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:44,303 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:44,303 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-10-22 08:54:44,303 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:44,304 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:44,304 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:44,304 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:44,304 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:44,305 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:44,306 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:44,329 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:44,343 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:54:44,343 INFO L444 ModelExtractionUtils]: 5 out of 9 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:44,344 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:44,344 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:44,344 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:44,344 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 1 Supporting invariants [] [2019-10-22 08:54:44,346 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:44,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:44,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:44,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:44,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 08:54:44,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:44,467 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 08:54:44,467 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-10-22 08:54:44,467 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 11 Second operand 8 states. [2019-10-22 08:54:44,740 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-10-22 08:54:44,741 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-10-22 08:54:44,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 08:54:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2019-10-22 08:54:44,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 73 transitions. Stem has 3 letters. Loop has 23 letters. [2019-10-22 08:54:44,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:44,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 73 transitions. Stem has 26 letters. Loop has 23 letters. [2019-10-22 08:54:44,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:44,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 73 transitions. Stem has 3 letters. Loop has 46 letters. [2019-10-22 08:54:44,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:44,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 181 transitions. [2019-10-22 08:54:44,748 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2019-10-22 08:54:44,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 115 states and 180 transitions. [2019-10-22 08:54:44,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2019-10-22 08:54:44,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2019-10-22 08:54:44,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 180 transitions. [2019-10-22 08:54:44,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:44,752 INFO L688 BuchiCegarLoop]: Abstraction has 115 states and 180 transitions. [2019-10-22 08:54:44,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 180 transitions. [2019-10-22 08:54:44,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2019-10-22 08:54:44,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-22 08:54:44,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 153 transitions. [2019-10-22 08:54:44,765 INFO L711 BuchiCegarLoop]: Abstraction has 104 states and 153 transitions. [2019-10-22 08:54:44,765 INFO L591 BuchiCegarLoop]: Abstraction has 104 states and 153 transitions. [2019-10-22 08:54:44,765 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:54:44,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 153 transitions. [2019-10-22 08:54:44,767 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 [2019-10-22 08:54:44,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:44,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:44,769 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:54:44,769 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-10-22 08:54:44,769 INFO L791 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-10-22 08:54:44,769 INFO L793 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~ret2;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3; 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-10-22 08:54:44,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:44,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 1 times [2019-10-22 08:54:44,769 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:44,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698909824] [2019-10-22 08:54:44,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:44,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:44,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:44,783 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:44,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:44,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1320440455, now seen corresponding path program 1 times [2019-10-22 08:54:44,783 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:44,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122494979] [2019-10-22 08:54:44,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:44,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:44,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:44,795 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:54:44,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [574022987] [2019-10-22 08:54:44,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:44,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:54:44,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:44,875 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-22 08:54:44,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122494979] [2019-10-22 08:54:44,875 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:54:44,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574022987] [2019-10-22 08:54:44,875 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:54:44,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-10-22 08:54:44,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342024667] [2019-10-22 08:54:44,880 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:54:44,881 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:44,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 08:54:44,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:54:44,881 INFO L87 Difference]: Start difference. First operand 104 states and 153 transitions. cyclomatic complexity: 54 Second operand 8 states. [2019-10-22 08:54:45,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:45,104 INFO L93 Difference]: Finished difference Result 192 states and 293 transitions. [2019-10-22 08:54:45,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:54:45,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 293 transitions. [2019-10-22 08:54:45,109 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 64 [2019-10-22 08:54:45,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 192 states and 293 transitions. [2019-10-22 08:54:45,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2019-10-22 08:54:45,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2019-10-22 08:54:45,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 293 transitions. [2019-10-22 08:54:45,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:45,114 INFO L688 BuchiCegarLoop]: Abstraction has 192 states and 293 transitions. [2019-10-22 08:54:45,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 293 transitions. [2019-10-22 08:54:45,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 128. [2019-10-22 08:54:45,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-10-22 08:54:45,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 203 transitions. [2019-10-22 08:54:45,128 INFO L711 BuchiCegarLoop]: Abstraction has 128 states and 203 transitions. [2019-10-22 08:54:45,128 INFO L591 BuchiCegarLoop]: Abstraction has 128 states and 203 transitions. [2019-10-22 08:54:45,128 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:54:45,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 203 transitions. [2019-10-22 08:54:45,130 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2019-10-22 08:54:45,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:45,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:45,131 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:54:45,131 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-10-22 08:54:45,131 INFO L791 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-10-22 08:54:45,131 INFO L793 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~ret2;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3; 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-10-22 08:54:45,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:45,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 2 times [2019-10-22 08:54:45,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:45,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577195017] [2019-10-22 08:54:45,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:45,139 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:45,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:45,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1015509379, now seen corresponding path program 2 times [2019-10-22 08:54:45,140 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:45,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467978551] [2019-10-22 08:54:45,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:45,145 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:54:45,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1873547000] [2019-10-22 08:54:45,145 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:45,173 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:54:45,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:54:45,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 08:54:45,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:45,273 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-22 08:54:45,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467978551] [2019-10-22 08:54:45,274 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:54:45,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873547000] [2019-10-22 08:54:45,274 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:54:45,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-10-22 08:54:45,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273982355] [2019-10-22 08:54:45,274 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:54:45,275 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:45,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 08:54:45,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:54:45,275 INFO L87 Difference]: Start difference. First operand 128 states and 203 transitions. cyclomatic complexity: 80 Second operand 12 states. [2019-10-22 08:54:45,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:45,685 INFO L93 Difference]: Finished difference Result 198 states and 313 transitions. [2019-10-22 08:54:45,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:54:45,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 313 transitions. [2019-10-22 08:54:45,689 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 68 [2019-10-22 08:54:45,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 192 states and 307 transitions. [2019-10-22 08:54:45,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2019-10-22 08:54:45,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2019-10-22 08:54:45,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 307 transitions. [2019-10-22 08:54:45,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:45,700 INFO L688 BuchiCegarLoop]: Abstraction has 192 states and 307 transitions. [2019-10-22 08:54:45,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 307 transitions. [2019-10-22 08:54:45,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 156. [2019-10-22 08:54:45,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-10-22 08:54:45,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 247 transitions. [2019-10-22 08:54:45,723 INFO L711 BuchiCegarLoop]: Abstraction has 156 states and 247 transitions. [2019-10-22 08:54:45,725 INFO L591 BuchiCegarLoop]: Abstraction has 156 states and 247 transitions. [2019-10-22 08:54:45,725 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:54:45,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 247 transitions. [2019-10-22 08:54:45,726 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 52 [2019-10-22 08:54:45,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:45,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:45,728 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:54:45,728 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-10-22 08:54:45,730 INFO L791 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-10-22 08:54:45,730 INFO L793 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~ret2;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3; 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-10-22 08:54:45,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:45,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 3 times [2019-10-22 08:54:45,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:45,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997820319] [2019-10-22 08:54:45,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:45,740 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:45,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:45,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1510379783, now seen corresponding path program 3 times [2019-10-22 08:54:45,742 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:45,743 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856115193] [2019-10-22 08:54:45,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:45,747 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:54:45,750 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1088338897] [2019-10-22 08:54:45,751 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:45,781 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-22 08:54:45,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:54:45,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:54:45,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:45,807 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-22 08:54:45,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856115193] [2019-10-22 08:54:45,807 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:54:45,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088338897] [2019-10-22 08:54:45,808 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:45,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:54:45,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831775882] [2019-10-22 08:54:45,808 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:54:45,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:45,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:45,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:45,809 INFO L87 Difference]: Start difference. First operand 156 states and 247 transitions. cyclomatic complexity: 96 Second operand 6 states. [2019-10-22 08:54:45,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:45,879 INFO L93 Difference]: Finished difference Result 204 states and 331 transitions. [2019-10-22 08:54:45,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:54:45,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 204 states and 331 transitions. [2019-10-22 08:54:45,883 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 73 [2019-10-22 08:54:45,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 204 states to 198 states and 325 transitions. [2019-10-22 08:54:45,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2019-10-22 08:54:45,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 100 [2019-10-22 08:54:45,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 325 transitions. [2019-10-22 08:54:45,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:45,890 INFO L688 BuchiCegarLoop]: Abstraction has 198 states and 325 transitions. [2019-10-22 08:54:45,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 325 transitions. [2019-10-22 08:54:45,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 160. [2019-10-22 08:54:45,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-22 08:54:45,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 251 transitions. [2019-10-22 08:54:45,921 INFO L711 BuchiCegarLoop]: Abstraction has 160 states and 251 transitions. [2019-10-22 08:54:45,921 INFO L591 BuchiCegarLoop]: Abstraction has 160 states and 251 transitions. [2019-10-22 08:54:45,921 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:54:45,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 160 states and 251 transitions. [2019-10-22 08:54:45,922 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 53 [2019-10-22 08:54:45,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:45,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:45,927 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:54:45,927 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-10-22 08:54:45,927 INFO L791 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-10-22 08:54:45,927 INFO L793 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~ret2;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3; 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-10-22 08:54:45,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:45,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 4 times [2019-10-22 08:54:45,928 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:45,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440143425] [2019-10-22 08:54:45,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:45,941 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:45,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:45,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1831628649, now seen corresponding path program 1 times [2019-10-22 08:54:45,944 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:45,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365758044] [2019-10-22 08:54:45,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:45,953 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:54:45,953 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [436571891] [2019-10-22 08:54:45,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:45,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 08:54:45,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:46,030 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 7 proven. 35 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-22 08:54:46,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365758044] [2019-10-22 08:54:46,030 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:54:46,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436571891] [2019-10-22 08:54:46,030 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:54:46,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-10-22 08:54:46,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531712345] [2019-10-22 08:54:46,031 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:54:46,031 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:46,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 08:54:46,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:54:46,032 INFO L87 Difference]: Start difference. First operand 160 states and 251 transitions. cyclomatic complexity: 96 Second operand 9 states. [2019-10-22 08:54:46,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:46,270 INFO L93 Difference]: Finished difference Result 312 states and 527 transitions. [2019-10-22 08:54:46,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:54:46,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 312 states and 527 transitions. [2019-10-22 08:54:46,275 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 110 [2019-10-22 08:54:46,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 312 states to 312 states and 527 transitions. [2019-10-22 08:54:46,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 152 [2019-10-22 08:54:46,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2019-10-22 08:54:46,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 312 states and 527 transitions. [2019-10-22 08:54:46,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:46,280 INFO L688 BuchiCegarLoop]: Abstraction has 312 states and 527 transitions. [2019-10-22 08:54:46,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states and 527 transitions. [2019-10-22 08:54:46,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 200. [2019-10-22 08:54:46,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-22 08:54:46,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 367 transitions. [2019-10-22 08:54:46,294 INFO L711 BuchiCegarLoop]: Abstraction has 200 states and 367 transitions. [2019-10-22 08:54:46,294 INFO L591 BuchiCegarLoop]: Abstraction has 200 states and 367 transitions. [2019-10-22 08:54:46,294 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:54:46,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 200 states and 367 transitions. [2019-10-22 08:54:46,296 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 61 [2019-10-22 08:54:46,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:46,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:46,297 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:54:46,297 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-10-22 08:54:46,297 INFO L791 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-10-22 08:54:46,297 INFO L793 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~ret2;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3; 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-10-22 08:54:46,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:46,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 5 times [2019-10-22 08:54:46,298 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:46,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622843984] [2019-10-22 08:54:46,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:46,312 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:46,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:46,313 INFO L82 PathProgramCache]: Analyzing trace with hash -677796173, now seen corresponding path program 2 times [2019-10-22 08:54:46,313 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:46,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2149913] [2019-10-22 08:54:46,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:46,322 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:54:46,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1607882825] [2019-10-22 08:54:46,326 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:46,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:54:46,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-10-22 08:54:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:46,378 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:46,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:46,379 INFO L82 PathProgramCache]: Analyzing trace with hash -224814976, now seen corresponding path program 1 times [2019-10-22 08:54:46,379 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:46,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004653760] [2019-10-22 08:54:46,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:46,390 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:54:46,392 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [874910214] [2019-10-22 08:54:46,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:46,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:54:46,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-22 08:54:46,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004653760] [2019-10-22 08:54:46,456 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:54:46,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874910214] [2019-10-22 08:54:46,456 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:54:46,456 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-10-22 08:54:46,456 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186577612] [2019-10-22 08:54:46,751 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-10-22 08:54:46,858 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:46,859 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:46,859 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:46,859 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:46,859 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:46,859 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:46,859 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:46,859 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:46,859 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration7_Loop [2019-10-22 08:54:46,859 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:46,859 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:46,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:46,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:46,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:46,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:46,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:46,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:47,002 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:47,002 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/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-10-22 08:54:47,012 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:47,013 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:47,015 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:47,016 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/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/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) [2019-10-22 08:54:47,029 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:47,029 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/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-10-22 08:54:47,047 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:47,047 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:47,057 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:47,060 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:47,060 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:47,060 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:47,060 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:47,060 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:47,060 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:47,060 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:47,060 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:47,060 INFO L131 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration7_Loop [2019-10-22 08:54:47,061 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:47,061 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:47,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:47,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:47,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:47,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:47,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:47,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:47,184 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:47,185 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:47,185 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-10-22 08:54:47,186 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:47,186 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:47,186 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:47,186 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:47,186 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:47,186 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:47,187 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:47,187 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:47,188 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-10-22 08:54:47,189 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:47,189 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:47,189 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:47,189 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:47,189 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:47,190 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:47,190 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:47,196 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:47,201 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:47,201 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:47,202 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:47,202 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:47,202 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:47,202 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-10-22 08:54:47,202 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:47,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:47,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-22 08:54:47,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:47,324 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-22 08:54:47,325 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-10-22 08:54:47,325 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 200 states and 367 transitions. cyclomatic complexity: 172 Second operand 9 states. [2019-10-22 08:54:47,630 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-10-22 08:54:47,631 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-10-22 08:54:47,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-10-22 08:54:47,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2019-10-22 08:54:47,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 73 transitions. Stem has 4 letters. Loop has 32 letters. [2019-10-22 08:54:47,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:47,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 73 transitions. Stem has 36 letters. Loop has 32 letters. [2019-10-22 08:54:47,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:47,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 73 transitions. Stem has 4 letters. Loop has 64 letters. [2019-10-22 08:54:47,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:47,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 819 states and 1395 transitions. [2019-10-22 08:54:47,646 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 108 [2019-10-22 08:54:47,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 819 states to 710 states and 1201 transitions. [2019-10-22 08:54:47,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 212 [2019-10-22 08:54:47,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 217 [2019-10-22 08:54:47,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 710 states and 1201 transitions. [2019-10-22 08:54:47,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:47,656 INFO L688 BuchiCegarLoop]: Abstraction has 710 states and 1201 transitions. [2019-10-22 08:54:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states and 1201 transitions. [2019-10-22 08:54:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 658. [2019-10-22 08:54:47,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-10-22 08:54:47,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1101 transitions. [2019-10-22 08:54:47,688 INFO L711 BuchiCegarLoop]: Abstraction has 658 states and 1101 transitions. [2019-10-22 08:54:47,692 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:47,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:47,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:47,692 INFO L87 Difference]: Start difference. First operand 658 states and 1101 transitions. Second operand 6 states. [2019-10-22 08:54:47,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:47,850 INFO L93 Difference]: Finished difference Result 537 states and 866 transitions. [2019-10-22 08:54:47,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:54:47,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 537 states and 866 transitions. [2019-10-22 08:54:47,856 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 82 [2019-10-22 08:54:47,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 537 states to 535 states and 861 transitions. [2019-10-22 08:54:47,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 175 [2019-10-22 08:54:47,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 175 [2019-10-22 08:54:47,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 535 states and 861 transitions. [2019-10-22 08:54:47,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:47,863 INFO L688 BuchiCegarLoop]: Abstraction has 535 states and 861 transitions. [2019-10-22 08:54:47,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states and 861 transitions. [2019-10-22 08:54:47,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 526. [2019-10-22 08:54:47,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2019-10-22 08:54:47,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 848 transitions. [2019-10-22 08:54:47,880 INFO L711 BuchiCegarLoop]: Abstraction has 526 states and 848 transitions. [2019-10-22 08:54:47,881 INFO L591 BuchiCegarLoop]: Abstraction has 526 states and 848 transitions. [2019-10-22 08:54:47,881 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:54:47,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 526 states and 848 transitions. [2019-10-22 08:54:47,883 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 82 [2019-10-22 08:54:47,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:47,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:47,885 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:47,885 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-10-22 08:54:47,885 INFO L791 eck$LassoCheckResult]: Stem: 4989#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; 4990#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; 5062#L42-3 assume !!(main_~k~0 <= main_~x~0); 5035#L43 [2019-10-22 08:54:47,885 INFO L793 eck$LassoCheckResult]: Loop: 5035#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; 5108#L30-5 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 5203#factENTRY ~n := #in~n; 5204#L25 assume !(~n <= 0); 5147#L26 call #t~ret0 := fact(~n - 1);< 5153#factENTRY ~n := #in~n; 5160#L25 assume !(~n <= 0); 5148#L26 call #t~ret0 := fact(~n - 1);< 5153#factENTRY ~n := #in~n; 5160#L25 assume ~n <= 0;#res := 1; 5159#factFINAL assume true; 5156#factEXIT >#65#return; 5152#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5154#factFINAL assume true; 5146#factEXIT >#65#return; 5151#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5206#factFINAL assume true; 5205#factEXIT >#73#return; 5105#L30-6 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 5203#factENTRY ~n := #in~n; 5204#L25 assume ~n <= 0;#res := 1; 5240#factFINAL assume true; 5241#factEXIT >#75#return; 5106#L30-7 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 5140#factENTRY ~n := #in~n; 5161#L25 assume !(~n <= 0); 5147#L26 call #t~ret0 := fact(~n - 1);< 5153#factENTRY ~n := #in~n; 5160#L25 assume ~n <= 0;#res := 1; 5159#factFINAL assume true; 5156#factEXIT >#65#return; 5157#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5242#factFINAL assume true; 5104#factEXIT >#77#return; 5101#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~ret2;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3; 5102#L30-9 main_#t~ret10 := binomialCoefficient_#res;havoc main_#t~ret10; 5045#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 5046#L42-3 assume !!(main_~k~0 <= main_~x~0); 5035#L43 [2019-10-22 08:54:47,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:47,885 INFO L82 PathProgramCache]: Analyzing trace with hash 37377045, now seen corresponding path program 1 times [2019-10-22 08:54:47,886 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:47,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676728638] [2019-10-22 08:54:47,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:47,896 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:47,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:47,896 INFO L82 PathProgramCache]: Analyzing trace with hash -891671267, now seen corresponding path program 1 times [2019-10-22 08:54:47,896 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:47,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781242924] [2019-10-22 08:54:47,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:47,902 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:54:47,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [475513707] [2019-10-22 08:54:47,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-22 08:54:47,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:48,033 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 29 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-22 08:54:48,033 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781242924] [2019-10-22 08:54:48,034 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:54:48,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475513707] [2019-10-22 08:54:48,034 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:54:48,034 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-10-22 08:54:48,034 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037698396] [2019-10-22 08:54:48,034 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:54:48,034 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:48,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:54:48,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:54:48,035 INFO L87 Difference]: Start difference. First operand 526 states and 848 transitions. cyclomatic complexity: 339 Second operand 10 states. [2019-10-22 08:54:48,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:48,350 INFO L93 Difference]: Finished difference Result 736 states and 1153 transitions. [2019-10-22 08:54:48,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 08:54:48,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 736 states and 1153 transitions. [2019-10-22 08:54:48,358 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 139 [2019-10-22 08:54:48,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 736 states to 736 states and 1153 transitions. [2019-10-22 08:54:48,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 250 [2019-10-22 08:54:48,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 250 [2019-10-22 08:54:48,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 736 states and 1153 transitions. [2019-10-22 08:54:48,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:48,365 INFO L688 BuchiCegarLoop]: Abstraction has 736 states and 1153 transitions. [2019-10-22 08:54:48,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states and 1153 transitions. [2019-10-22 08:54:48,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 566. [2019-10-22 08:54:48,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-10-22 08:54:48,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 900 transitions. [2019-10-22 08:54:48,383 INFO L711 BuchiCegarLoop]: Abstraction has 566 states and 900 transitions. [2019-10-22 08:54:48,383 INFO L591 BuchiCegarLoop]: Abstraction has 566 states and 900 transitions. [2019-10-22 08:54:48,384 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 08:54:48,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 566 states and 900 transitions. [2019-10-22 08:54:48,387 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 86 [2019-10-22 08:54:48,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:48,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:48,387 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:48,387 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:48,388 INFO L791 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; 6510#L42-3 assume !!(main_~k~0 <= main_~x~0); 6438#L43 [2019-10-22 08:54:48,388 INFO L793 eck$LassoCheckResult]: Loop: 6438#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; 6565#L30-5 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 6563#factENTRY ~n := #in~n; 6595#L25 assume !(~n <= 0); 6581#L26 call #t~ret0 := fact(~n - 1);< 6607#factENTRY ~n := #in~n; 6617#L25 assume !(~n <= 0); 6584#L26 call #t~ret0 := fact(~n - 1);< 6607#factENTRY ~n := #in~n; 6617#L25 assume ~n <= 0;#res := 1; 6608#factFINAL assume true; 6604#factEXIT >#65#return; 6586#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6590#factFINAL assume true; 6578#factEXIT >#65#return; 6577#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6576#factFINAL assume true; 6572#factEXIT >#73#return; 6566#L30-6 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 6563#factENTRY ~n := #in~n; 6595#L25 assume !(~n <= 0); 6581#L26 call #t~ret0 := fact(~n - 1);< 6607#factENTRY ~n := #in~n; 6617#L25 assume ~n <= 0;#res := 1; 6608#factFINAL assume true; 6604#factEXIT >#65#return; 6605#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6625#factFINAL assume true; 6594#factEXIT >#75#return; 6573#L30-7 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 6563#factENTRY ~n := #in~n; 6595#L25 assume !(~n <= 0); 6581#L26 call #t~ret0 := fact(~n - 1);< 6607#factENTRY ~n := #in~n; 6617#L25 assume ~n <= 0;#res := 1; 6608#factFINAL assume true; 6604#factEXIT >#65#return; 6605#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6625#factFINAL assume true; 6594#factEXIT >#77#return; 6575#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~ret2;havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret3; 6674#L30-9 main_#t~ret10 := binomialCoefficient_#res;havoc main_#t~ret10; 6673#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 6662#L42-3 assume !!(main_~k~0 <= main_~x~0); 6438#L43 [2019-10-22 08:54:48,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:48,388 INFO L82 PathProgramCache]: Analyzing trace with hash 37377045, now seen corresponding path program 2 times [2019-10-22 08:54:48,388 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:48,389 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231701286] [2019-10-22 08:54:48,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:48,394 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:48,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:48,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1196724781, now seen corresponding path program 2 times [2019-10-22 08:54:48,395 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:48,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891832955] [2019-10-22 08:54:48,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:48,398 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:54:48,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1679821225] [2019-10-22 08:54:48,398 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a731914e-5d83-4f44-b330-ea31c78a7fb3/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:48,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:54:48,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-10-22 08:54:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:48,476 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:48,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:48,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1605962777, now seen corresponding path program 1 times [2019-10-22 08:54:48,477 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:48,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313946438] [2019-10-22 08:54:48,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,496 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.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) 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.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:921) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkConcatFeasibility(LassoCheck.java:896) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:829) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:248) 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-10-22 08:54:48,502 INFO L168 Benchmark]: Toolchain (without parser) took 7353.55 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.1 MB). Free memory was 949.9 MB in the beginning and 941.9 MB in the end (delta: 8.0 MB). Peak memory consumption was 313.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:48,502 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:48,503 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:48,503 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:48,504 INFO L168 Benchmark]: Boogie Preprocessor took 16.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:48,504 INFO L168 Benchmark]: RCFGBuilder took 200.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:48,505 INFO L168 Benchmark]: BuchiAutomizer took 6808.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 941.9 MB in the end (delta: 154.2 MB). Peak memory consumption was 332.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:48,508 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 289.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 200.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6808.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 941.9 MB in the end (delta: 154.2 MB). Peak memory consumption was 332.0 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.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:368) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...