./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-numeric/gcd01-2.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/run_dir_79f917e8-5637-4609-ad90-eb59561bd492/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_79f917e8-5637-4609-ad90-eb59561bd492/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_79f917e8-5637-4609-ad90-eb59561bd492/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_79f917e8-5637-4609-ad90-eb59561bd492/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-numeric/gcd01-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_79f917e8-5637-4609-ad90-eb59561bd492/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_79f917e8-5637-4609-ad90-eb59561bd492/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 60bddbffe1e2002d3081296e00d2a4e7e030158e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:27:16,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:27:16,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:27:16,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:27:16,171 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:27:16,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:27:16,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:27:16,188 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:27:16,190 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:27:16,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:27:16,193 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:27:16,194 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:27:16,194 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:27:16,195 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:27:16,196 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:27:16,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:27:16,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:27:16,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:27:16,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:27:16,203 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:27:16,205 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:27:16,206 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:27:16,207 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:27:16,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:27:16,211 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:27:16,211 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:27:16,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:27:16,212 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:27:16,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:27:16,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:27:16,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:27:16,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:27:16,215 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:27:16,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:27:16,217 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:27:16,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:27:16,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:27:16,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:27:16,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:27:16,219 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:27:16,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:27:16,220 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_79f917e8-5637-4609-ad90-eb59561bd492/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:27:16,244 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:27:16,245 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:27:16,246 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:27:16,247 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:27:16,247 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:27:16,247 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:27:16,248 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:27:16,248 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:27:16,248 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:27:16,248 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:27:16,250 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:27:16,250 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:27:16,250 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:27:16,250 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:27:16,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:27:16,251 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:27:16,251 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:27:16,252 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:27:16,252 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:27:16,252 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:27:16,252 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:27:16,253 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:27:16,253 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:27:16,253 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:27:16,254 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:27:16,254 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:27:16,254 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:27:16,255 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:27:16,256 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:27:16,256 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_79f917e8-5637-4609-ad90-eb59561bd492/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 -> 60bddbffe1e2002d3081296e00d2a4e7e030158e [2019-11-16 00:27:16,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:27:16,319 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:27:16,323 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:27:16,324 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:27:16,325 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:27:16,326 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_79f917e8-5637-4609-ad90-eb59561bd492/bin/uautomizer/../../sv-benchmarks/c/termination-numeric/gcd01-2.c [2019-11-16 00:27:16,388 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_79f917e8-5637-4609-ad90-eb59561bd492/bin/uautomizer/data/0793dda7e/a0f7192354c6440887e9d8ec94c31ab4/FLAGf00cf5e5e [2019-11-16 00:27:16,779 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:27:16,780 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_79f917e8-5637-4609-ad90-eb59561bd492/sv-benchmarks/c/termination-numeric/gcd01-2.c [2019-11-16 00:27:16,786 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_79f917e8-5637-4609-ad90-eb59561bd492/bin/uautomizer/data/0793dda7e/a0f7192354c6440887e9d8ec94c31ab4/FLAGf00cf5e5e [2019-11-16 00:27:16,799 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_79f917e8-5637-4609-ad90-eb59561bd492/bin/uautomizer/data/0793dda7e/a0f7192354c6440887e9d8ec94c31ab4 [2019-11-16 00:27:16,801 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:27:16,803 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:27:16,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:27:16,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:27:16,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:27:16,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:27:16" (1/1) ... [2019-11-16 00:27:16,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@587b9e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:16, skipping insertion in model container [2019-11-16 00:27:16,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:27:16" (1/1) ... [2019-11-16 00:27:16,819 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:27:16,842 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:27:17,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:27:17,068 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:27:17,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:27:17,106 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:27:17,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:17 WrapperNode [2019-11-16 00:27:17,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:27:17,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:27:17,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:27:17,109 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:27:17,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:17" (1/1) ... [2019-11-16 00:27:17,125 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:17" (1/1) ... [2019-11-16 00:27:17,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:27:17,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:27:17,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:27:17,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:27:17,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:17" (1/1) ... [2019-11-16 00:27:17,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:17" (1/1) ... [2019-11-16 00:27:17,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:17" (1/1) ... [2019-11-16 00:27:17,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:17" (1/1) ... [2019-11-16 00:27:17,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:17" (1/1) ... [2019-11-16 00:27:17,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:17" (1/1) ... [2019-11-16 00:27:17,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:17" (1/1) ... [2019-11-16 00:27:17,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:27:17,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:27:17,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:27:17,163 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:27:17,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79f917e8-5637-4609-ad90-eb59561bd492/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:27:17,225 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2019-11-16 00:27:17,225 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2019-11-16 00:27:17,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:27:17,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:27:17,425 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:27:17,425 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-16 00:27:17,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:27:17 BoogieIcfgContainer [2019-11-16 00:27:17,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:27:17,428 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:27:17,428 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:27:17,431 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:27:17,432 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:27:17,433 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:27:16" (1/3) ... [2019-11-16 00:27:17,434 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37780ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:27:17, skipping insertion in model container [2019-11-16 00:27:17,434 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:27:17,434 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:17" (2/3) ... [2019-11-16 00:27:17,435 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37780ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:27:17, skipping insertion in model container [2019-11-16 00:27:17,435 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:27:17,435 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:27:17" (3/3) ... [2019-11-16 00:27:17,437 INFO L371 chiAutomizerObserver]: Analyzing ICFG gcd01-2.c [2019-11-16 00:27:17,487 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:27:17,487 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:27:17,487 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:27:17,487 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:27:17,488 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:27:17,488 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:27:17,488 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:27:17,488 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:27:17,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-16 00:27:17,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-16 00:27:17,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:27:17,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:27:17,556 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:27:17,556 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:27:17,557 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:27:17,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-16 00:27:17,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-16 00:27:17,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:27:17,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:27:17,562 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:27:17,562 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:27:17,570 INFO L791 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~z~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; 10#L30true assume !(main_~m~0 <= 0);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 18#L34true assume !(main_~n~0 <= 0); 4#L37true call main_#t~ret4 := gcd(main_~m~0, main_~n~0);< 5#gcdENTRYtrue [2019-11-16 00:27:17,571 INFO L793 eck$LassoCheckResult]: Loop: 5#gcdENTRYtrue ~y1 := #in~y1;~y2 := #in~y2; 21#L16true assume !(~y1 <= 0 || ~y2 <= 0); 15#L19true assume !(~y1 == ~y2); 12#L22true assume ~y1 > ~y2; 3#L23true call #t~ret0 := gcd(~y1 - ~y2, ~y2);< 5#gcdENTRYtrue [2019-11-16 00:27:17,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:17,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1513559, now seen corresponding path program 1 times [2019-11-16 00:27:17,586 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:17,586 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544904035] [2019-11-16 00:27:17,586 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:17,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:17,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:17,678 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:17,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:17,680 INFO L82 PathProgramCache]: Analyzing trace with hash 28756386, now seen corresponding path program 1 times [2019-11-16 00:27:17,680 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:17,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604381512] [2019-11-16 00:27:17,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:17,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:17,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:17,697 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:17,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:17,699 INFO L82 PathProgramCache]: Analyzing trace with hash -15763700, now seen corresponding path program 1 times [2019-11-16 00:27:17,699 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:17,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006542994] [2019-11-16 00:27:17,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:17,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:17,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:17,723 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:17,845 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-11-16 00:27:17,952 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:27:17,954 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:27:17,954 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:27:17,954 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:27:17,955 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:27:17,955 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:27:17,955 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:27:17,955 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:27:17,955 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd01-2.c_Iteration1_Loop [2019-11-16 00:27:17,956 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:27:17,956 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:27:17,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:17,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:18,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:18,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:18,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:18,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:18,097 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:27:18,099 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79f917e8-5637-4609-ad90-eb59561bd492/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:27:18,119 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:27:18,119 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:27:18,132 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:27:18,132 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {gcd_#res=0} Honda state: {gcd_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79f917e8-5637-4609-ad90-eb59561bd492/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) [2019-11-16 00:27:18,152 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:27:18,152 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79f917e8-5637-4609-ad90-eb59561bd492/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:27:18,175 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:27:18,175 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:27:18,208 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:27:18,211 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:27:18,211 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:27:18,211 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:27:18,211 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:27:18,211 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:27:18,211 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:27:18,211 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:27:18,212 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:27:18,212 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd01-2.c_Iteration1_Loop [2019-11-16 00:27:18,212 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:27:18,212 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:27:18,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:18,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:18,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:18,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:18,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:18,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:18,303 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:27:18,307 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:27:18,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:18,311 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:18,311 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:18,312 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:18,312 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:18,313 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:18,315 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:18,315 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:18,319 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:18,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:18,320 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:18,320 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:18,320 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:18,321 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:18,321 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:18,321 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:18,322 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:18,323 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:18,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:18,324 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:18,325 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:18,325 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:18,325 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:18,325 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:18,326 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:18,326 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:18,338 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:27:18,348 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:27:18,348 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:27:18,350 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:27:18,350 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:27:18,351 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:27:18,351 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(gcd_#in~y1) = 1*gcd_#in~y1 Supporting invariants [] [2019-11-16 00:27:18,354 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:27:18,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:18,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:27:18,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:18,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:27:18,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:18,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:27:18,505 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-16 00:27:18,507 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states. Second operand 5 states. [2019-11-16 00:27:18,727 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states.. Second operand 5 states. Result 93 states and 129 transitions. Complement of second has 30 states. [2019-11-16 00:27:18,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-16 00:27:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:27:18,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2019-11-16 00:27:18,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 4 letters. Loop has 5 letters. [2019-11-16 00:27:18,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:18,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 9 letters. Loop has 5 letters. [2019-11-16 00:27:18,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:18,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 4 letters. Loop has 10 letters. [2019-11-16 00:27:18,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:18,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 129 transitions. [2019-11-16 00:27:18,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:27:18,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 35 states and 40 transitions. [2019-11-16 00:27:18,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-16 00:27:18,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-16 00:27:18,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2019-11-16 00:27:18,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:27:18,751 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-11-16 00:27:18,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2019-11-16 00:27:18,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 17. [2019-11-16 00:27:18,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-16 00:27:18,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-16 00:27:18,782 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-16 00:27:18,782 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-16 00:27:18,782 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:27:18,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-11-16 00:27:18,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:27:18,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:27:18,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:27:18,786 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:27:18,786 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:27:18,786 INFO L791 eck$LassoCheckResult]: Stem: 208#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~z~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; 209#L30 assume !(main_~m~0 <= 0);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 214#L34 assume !(main_~n~0 <= 0); 200#L37 call main_#t~ret4 := gcd(main_~m~0, main_~n~0);< 202#gcdENTRY ~y1 := #in~y1;~y2 := #in~y2; 205#L16 [2019-11-16 00:27:18,786 INFO L793 eck$LassoCheckResult]: Loop: 205#L16 assume !(~y1 <= 0 || ~y2 <= 0); 210#L19 assume !(~y1 == ~y2); 211#L22 assume !(~y1 > ~y2); 204#L25 call #t~ret1 := gcd(~y1, ~y2 - ~y1);< 203#gcdENTRY ~y1 := #in~y1;~y2 := #in~y2; 205#L16 [2019-11-16 00:27:18,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:18,787 INFO L82 PathProgramCache]: Analyzing trace with hash 46920329, now seen corresponding path program 1 times [2019-11-16 00:27:18,787 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:18,787 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028078421] [2019-11-16 00:27:18,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:18,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:18,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:18,800 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:18,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:18,800 INFO L82 PathProgramCache]: Analyzing trace with hash 32576381, now seen corresponding path program 1 times [2019-11-16 00:27:18,801 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:18,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153138467] [2019-11-16 00:27:18,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:18,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:18,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:18,812 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:18,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:18,813 INFO L82 PathProgramCache]: Analyzing trace with hash -488671755, now seen corresponding path program 1 times [2019-11-16 00:27:18,813 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:18,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865018225] [2019-11-16 00:27:18,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:18,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:18,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:18,830 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:18,946 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:27:18,947 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:27:18,947 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:27:18,947 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:27:18,947 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:27:18,947 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:27:18,947 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:27:18,947 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:27:18,948 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd01-2.c_Iteration2_Loop [2019-11-16 00:27:18,948 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:27:18,948 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:27:18,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:18,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:18,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:18,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:19,088 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:27:19,089 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79f917e8-5637-4609-ad90-eb59561bd492/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:27:19,095 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:27:19,095 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79f917e8-5637-4609-ad90-eb59561bd492/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:27:19,116 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:27:19,117 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:27:20,603 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:27:20,606 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:27:20,606 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:27:20,606 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:27:20,606 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:27:20,606 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:27:20,607 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:27:20,607 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:27:20,607 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:27:20,607 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd01-2.c_Iteration2_Loop [2019-11-16 00:27:20,607 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:27:20,607 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:27:20,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:20,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:20,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:20,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:20,790 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:27:20,790 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:27:20,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:20,791 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:20,792 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:20,792 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:20,792 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:20,792 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:20,794 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:20,794 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:20,821 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:27:20,847 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:27:20,850 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:27:20,850 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:27:20,851 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:27:20,851 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:27:20,851 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(gcd_~y2) = 1*gcd_~y2 Supporting invariants [] [2019-11-16 00:27:20,852 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:27:20,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:20,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:27:20,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:20,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:27:20,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:20,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:27:20,952 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:27:20,952 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-11-16 00:27:20,983 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 53 states and 60 transitions. Complement of second has 11 states. [2019-11-16 00:27:20,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:27:20,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:27:20,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-11-16 00:27:20,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 5 letters. [2019-11-16 00:27:20,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:20,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 5 letters. [2019-11-16 00:27:20,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:20,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-16 00:27:20,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:20,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 60 transitions. [2019-11-16 00:27:20,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:27:20,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 32 states and 36 transitions. [2019-11-16 00:27:20,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-16 00:27:20,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-16 00:27:20,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 36 transitions. [2019-11-16 00:27:20,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:27:20,991 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-11-16 00:27:20,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 36 transitions. [2019-11-16 00:27:20,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2019-11-16 00:27:20,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-16 00:27:20,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-11-16 00:27:20,994 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-11-16 00:27:20,994 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-11-16 00:27:20,994 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:27:20,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2019-11-16 00:27:20,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:27:20,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:27:20,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:27:20,996 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:20,996 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:27:20,997 INFO L791 eck$LassoCheckResult]: Stem: 335#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~z~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; 336#L30 assume !(main_~m~0 <= 0);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 344#L34 assume !(main_~n~0 <= 0); 331#L37 call main_#t~ret4 := gcd(main_~m~0, main_~n~0);< 332#gcdENTRY ~y1 := #in~y1;~y2 := #in~y2; 333#L16 assume !(~y1 <= 0 || ~y2 <= 0); 349#L19 assume !(~y1 == ~y2); 348#L22 assume ~y1 > ~y2; 327#L23 call #t~ret0 := gcd(~y1 - ~y2, ~y2);< 329#gcdENTRY ~y1 := #in~y1;~y2 := #in~y2; 345#L16 [2019-11-16 00:27:20,997 INFO L793 eck$LassoCheckResult]: Loop: 345#L16 assume !(~y1 <= 0 || ~y2 <= 0); 337#L19 assume !(~y1 == ~y2); 339#L22 assume !(~y1 > ~y2); 338#L25 call #t~ret1 := gcd(~y1, ~y2 - ~y1);< 342#gcdENTRY ~y1 := #in~y1;~y2 := #in~y2; 345#L16 [2019-11-16 00:27:20,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:20,997 INFO L82 PathProgramCache]: Analyzing trace with hash -488674700, now seen corresponding path program 2 times [2019-11-16 00:27:20,997 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:20,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201598204] [2019-11-16 00:27:20,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:20,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:20,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:21,013 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:21,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:21,014 INFO L82 PathProgramCache]: Analyzing trace with hash 32576381, now seen corresponding path program 2 times [2019-11-16 00:27:21,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:21,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753779074] [2019-11-16 00:27:21,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:21,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:21,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:21,029 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:21,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:21,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1201587990, now seen corresponding path program 1 times [2019-11-16 00:27:21,030 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:21,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196442467] [2019-11-16 00:27:21,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:21,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:21,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:21,062 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:21,163 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:27:21,163 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:27:21,163 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:27:21,163 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:27:21,164 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:27:21,164 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:27:21,164 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:27:21,164 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:27:21,164 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd01-2.c_Iteration3_Loop [2019-11-16 00:27:21,164 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:27:21,165 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:27:21,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:21,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:21,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:21,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:21,284 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:27:21,284 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79f917e8-5637-4609-ad90-eb59561bd492/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:27:21,290 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:27:21,290 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:27:21,294 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:27:21,294 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {gcd_#t~ret0=0} Honda state: {gcd_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79f917e8-5637-4609-ad90-eb59561bd492/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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:27:21,306 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:27:21,306 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79f917e8-5637-4609-ad90-eb59561bd492/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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:27:21,324 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:27:21,324 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:27:21,905 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:27:21,908 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:27:21,908 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:27:21,908 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:27:21,908 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:27:21,908 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:27:21,908 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:27:21,908 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:27:21,908 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:27:21,908 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd01-2.c_Iteration3_Loop [2019-11-16 00:27:21,908 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:27:21,909 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:27:21,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:21,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:21,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:21,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:22,016 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:27:22,016 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:27:22,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:22,017 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:22,018 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:22,018 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:22,018 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:22,018 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:22,019 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:22,019 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:22,020 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:22,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:22,021 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:22,022 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:22,022 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:22,022 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:22,022 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:22,024 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:22,024 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:22,032 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:27:22,039 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:27:22,040 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:27:22,040 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:27:22,040 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:27:22,041 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:27:22,041 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(gcd_~y2) = 1*gcd_~y2 Supporting invariants [] [2019-11-16 00:27:22,041 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:27:22,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:22,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:27:22,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:22,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:27:22,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:22,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:27:22,171 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:27:22,171 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-16 00:27:22,219 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 45 states and 50 transitions. Complement of second has 11 states. [2019-11-16 00:27:22,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:27:22,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:27:22,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-11-16 00:27:22,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 5 letters. [2019-11-16 00:27:22,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:22,222 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:27:22,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:22,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:27:22,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:22,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:27:22,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:22,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:27:22,309 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:27:22,309 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-16 00:27:22,337 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 45 states and 50 transitions. Complement of second has 11 states. [2019-11-16 00:27:22,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:27:22,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:27:22,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-11-16 00:27:22,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 5 letters. [2019-11-16 00:27:22,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:22,339 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:27:22,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:22,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:27:22,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:22,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:27:22,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:27:22,471 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:27:22,471 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-16 00:27:22,510 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 74 states and 85 transitions. Complement of second has 12 states. [2019-11-16 00:27:22,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:27:22,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:27:22,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-11-16 00:27:22,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 5 letters. [2019-11-16 00:27:22,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:22,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 5 letters. [2019-11-16 00:27:22,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:22,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 10 letters. [2019-11-16 00:27:22,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:22,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 85 transitions. [2019-11-16 00:27:22,516 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:27:22,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 0 states and 0 transitions. [2019-11-16 00:27:22,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:27:22,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:27:22,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:27:22,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:27:22,517 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:27:22,517 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:27:22,517 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:27:22,517 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:27:22,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:27:22,518 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:27:22,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:27:22,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:27:22 BoogieIcfgContainer [2019-11-16 00:27:22,525 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:27:22,526 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:27:22,526 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:27:22,526 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:27:22,527 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:27:17" (3/4) ... [2019-11-16 00:27:22,529 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:27:22,530 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:27:22,531 INFO L168 Benchmark]: Toolchain (without parser) took 5728.40 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 229.6 MB). Free memory was 947.8 MB in the beginning and 1.2 GB in the end (delta: -252.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:27:22,532 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:27:22,533 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 947.8 MB in the beginning and 1.2 GB in the end (delta: -212.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:22,533 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:27:22,533 INFO L168 Benchmark]: Boogie Preprocessor took 17.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:27:22,534 INFO L168 Benchmark]: RCFGBuilder took 264.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:22,535 INFO L168 Benchmark]: BuchiAutomizer took 5097.52 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -62.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:27:22,535 INFO L168 Benchmark]: Witness Printer took 4.25 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:27:22,538 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 304.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 947.8 MB in the beginning and 1.2 GB in the end (delta: -212.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 264.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5097.52 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -62.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.25 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function \old(y1) and consists of 7 locations. One deterministic module has affine ranking function y2 and consists of 4 locations. One nondeterministic module has affine ranking function y2 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.0s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 3.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 26 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 24 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 47 SDtfs, 78 SDslu, 8 SDs, 0 SdLazy, 115 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital25 mio100 ax100 hnf91 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq177 hnf91 smp89 dnf100 smp100 tf106 neg98 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...