./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/GCD3.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_96ef74f9-44b5-4b41-9e3c-eadacab211af/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/GCD3.c -s /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/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 aae625cda61f26fa063b78c3d3a58aff5ded8a89 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:54:11,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:11,500 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:11,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:11,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:11,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:11,511 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:11,512 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:11,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:11,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:11,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:11,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:11,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:11,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:11,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:11,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:11,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:11,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:11,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:11,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:11,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:11,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:11,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:11,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:11,527 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:11,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:11,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:11,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:11,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:11,529 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:11,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:11,530 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:11,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:11,531 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:11,532 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:11,532 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:11,533 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:11,533 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:11,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:11,534 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:11,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:11,535 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:54:11,546 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:11,546 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:11,547 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:11,547 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:11,547 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:11,547 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:54:11,548 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:54:11,548 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:54:11,548 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:54:11,548 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:54:11,548 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:54:11,548 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:11,548 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:54:11,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:11,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:11,549 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:54:11,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:54:11,549 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:54:11,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:11,549 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:54:11,550 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:11,550 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:54:11,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:11,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:11,550 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:54:11,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:11,551 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:11,551 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:54:11,552 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:54:11,552 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_96ef74f9-44b5-4b41-9e3c-eadacab211af/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 -> aae625cda61f26fa063b78c3d3a58aff5ded8a89 [2019-10-22 08:54:11,590 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:11,602 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:11,605 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:11,607 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:11,607 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:11,608 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/bin/uautomizer/../../sv-benchmarks/c/termination-restricted-15/GCD3.c [2019-10-22 08:54:11,666 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/bin/uautomizer/data/4b53e6d93/8b6f803cb04a4359b34570aca2f27d17/FLAG2a9d872bd [2019-10-22 08:54:12,055 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:12,056 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/sv-benchmarks/c/termination-restricted-15/GCD3.c [2019-10-22 08:54:12,061 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/bin/uautomizer/data/4b53e6d93/8b6f803cb04a4359b34570aca2f27d17/FLAG2a9d872bd [2019-10-22 08:54:12,074 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/bin/uautomizer/data/4b53e6d93/8b6f803cb04a4359b34570aca2f27d17 [2019-10-22 08:54:12,076 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:12,077 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:12,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:12,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:12,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:12,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27536aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12, skipping insertion in model container [2019-10-22 08:54:12,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,091 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:12,108 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:12,246 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:12,253 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:12,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:12,352 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:12,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12 WrapperNode [2019-10-22 08:54:12,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:12,354 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:12,354 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:12,354 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:12,361 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:12" (1/1) ... [2019-10-22 08:54:12,366 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:12" (1/1) ... [2019-10-22 08:54:12,384 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:12,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:12,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:12,385 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:12,393 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:12" (1/1) ... [2019-10-22 08:54:12,393 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:12" (1/1) ... [2019-10-22 08:54:12,394 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:12" (1/1) ... [2019-10-22 08:54:12,394 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:12" (1/1) ... [2019-10-22 08:54:12,396 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:12" (1/1) ... [2019-10-22 08:54:12,401 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:12" (1/1) ... [2019-10-22 08:54:12,401 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:12" (1/1) ... [2019-10-22 08:54:12,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:12,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:12,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:12,403 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:12,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/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:12,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:12,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:12,597 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:12,597 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:54:12,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:12 BoogieIcfgContainer [2019-10-22 08:54:12,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:12,599 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:54:12,599 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:54:12,602 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:54:12,603 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:12,603 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:54:12" (1/3) ... [2019-10-22 08:54:12,604 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53e106e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:12, skipping insertion in model container [2019-10-22 08:54:12,604 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:12,604 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (2/3) ... [2019-10-22 08:54:12,604 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53e106e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:12, skipping insertion in model container [2019-10-22 08:54:12,604 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:12,605 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:12" (3/3) ... [2019-10-22 08:54:12,606 INFO L371 chiAutomizerObserver]: Analyzing ICFG GCD3.c [2019-10-22 08:54:12,649 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:54:12,650 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:54:12,650 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:54:12,650 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:12,650 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:12,650 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:54:12,650 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:12,650 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:54:12,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-10-22 08:54:12,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-10-22 08:54:12,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:12,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:12,689 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 08:54:12,689 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:54:12,689 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:54:12,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-10-22 08:54:12,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-10-22 08:54:12,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:12,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:12,691 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 08:54:12,691 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:54:12,698 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~tmp~0, main_~xtmp~0;havoc main_~x~0;havoc main_~y~0;havoc main_~tmp~0;havoc main_~xtmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 11#L13-2true [2019-10-22 08:54:12,698 INFO L793 eck$LassoCheckResult]: Loop: 11#L13-2true assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 3#L17true assume 0 == main_~y~0;main_~y~0 := main_~y~0; 7#L21-2true assume !(main_~xtmp~0 > 0); 5#L31-2true assume !true; 4#L31-3true main_~y~0 := main_~xtmp~0; 15#L25-1true main_~x~0 := main_~tmp~0; 11#L13-2true [2019-10-22 08:54:12,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:12,703 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-10-22 08:54:12,711 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:12,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625701256] [2019-10-22 08:54:12,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:12,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:12,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:12,805 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:12,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:12,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1187012529, now seen corresponding path program 1 times [2019-10-22 08:54:12,806 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:12,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549422650] [2019-10-22 08:54:12,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:12,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:12,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:12,867 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:12,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549422650] [2019-10-22 08:54:12,868 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:12,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:12,868 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529772263] [2019-10-22 08:54:12,873 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:54:12,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:12,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:12,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:12,889 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2019-10-22 08:54:12,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:12,918 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-10-22 08:54:12,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:12,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-10-22 08:54:12,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-10-22 08:54:12,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2019-10-22 08:54:12,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:54:12,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:54:12,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-10-22 08:54:12,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:12,927 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-10-22 08:54:12,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-10-22 08:54:12,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-10-22 08:54:12,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-10-22 08:54:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-10-22 08:54:12,952 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-10-22 08:54:12,952 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-10-22 08:54:12,952 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:54:12,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-10-22 08:54:12,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-10-22 08:54:12,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:12,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:12,953 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 08:54:12,953 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:12,953 INFO L791 eck$LassoCheckResult]: Stem: 39#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~tmp~0, main_~xtmp~0;havoc main_~x~0;havoc main_~y~0;havoc main_~tmp~0;havoc main_~xtmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 40#L13-2 [2019-10-22 08:54:12,954 INFO L793 eck$LassoCheckResult]: Loop: 40#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 41#L17 assume !(0 == main_~y~0); 37#L21 assume !(main_~y~0 < 0); 38#L21-2 assume !(main_~xtmp~0 > 0); 45#L31-2 assume !(main_~xtmp~0 < 0); 42#L31-3 main_~y~0 := main_~xtmp~0; 43#L25-1 main_~x~0 := main_~tmp~0; 40#L13-2 [2019-10-22 08:54:12,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:12,954 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-10-22 08:54:12,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:12,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997693794] [2019-10-22 08:54:12,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:12,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:12,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:12,960 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:12,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:12,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1817939337, now seen corresponding path program 1 times [2019-10-22 08:54:12,960 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:12,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009276999] [2019-10-22 08:54:12,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:12,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:12,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:13,003 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:13,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009276999] [2019-10-22 08:54:13,003 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:13,004 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:13,004 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649204357] [2019-10-22 08:54:13,004 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:54:13,004 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:13,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:13,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:13,005 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-10-22 08:54:13,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:13,033 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-10-22 08:54:13,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:13,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2019-10-22 08:54:13,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-10-22 08:54:13,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 14 transitions. [2019-10-22 08:54:13,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:54:13,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:54:13,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2019-10-22 08:54:13,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:13,042 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-10-22 08:54:13,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2019-10-22 08:54:13,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-10-22 08:54:13,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 08:54:13,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-10-22 08:54:13,046 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-10-22 08:54:13,046 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-10-22 08:54:13,046 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:54:13,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2019-10-22 08:54:13,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:54:13,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:13,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:13,048 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 08:54:13,048 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:13,048 INFO L791 eck$LassoCheckResult]: Stem: 67#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~tmp~0, main_~xtmp~0;havoc main_~x~0;havoc main_~y~0;havoc main_~tmp~0;havoc main_~xtmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 68#L13-2 [2019-10-22 08:54:13,048 INFO L793 eck$LassoCheckResult]: Loop: 68#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 69#L17 assume !(0 == main_~y~0); 65#L21 assume !(main_~y~0 < 0); 66#L21-2 assume main_~xtmp~0 > 0; 72#L26-2 assume !(main_~xtmp~0 >= main_~y~0); 70#L26-3 main_~y~0 := main_~xtmp~0; 71#L25-1 main_~x~0 := main_~tmp~0; 68#L13-2 [2019-10-22 08:54:13,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,048 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-10-22 08:54:13,049 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529579082] [2019-10-22 08:54:13,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,057 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:13,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1818401082, now seen corresponding path program 1 times [2019-10-22 08:54:13,058 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150671053] [2019-10-22 08:54:13,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,080 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:13,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,081 INFO L82 PathProgramCache]: Analyzing trace with hash 669111751, now seen corresponding path program 1 times [2019-10-22 08:54:13,081 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,081 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641752172] [2019-10-22 08:54:13,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,094 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:13,173 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:13,174 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:13,174 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:13,174 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:13,174 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:13,174 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:13,174 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:13,174 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:13,175 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration3_Loop [2019-10-22 08:54:13,175 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:13,175 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:13,195 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:13,203 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:13,207 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:13,317 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:13,318 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/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:13,326 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:13,326 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:13,335 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:13,335 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/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:13,347 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:13,347 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:13,354 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:13,354 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/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-10-22 08:54:13,365 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:13,365 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 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/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-10-22 08:54:13,385 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:13,385 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 [2019-10-22 08:54:16,728 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:16,729 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:16,730 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:16,730 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:16,730 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:16,730 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:16,730 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:16,730 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:16,730 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:16,730 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration3_Loop [2019-10-22 08:54:16,730 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:16,730 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:16,731 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:16,736 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:16,739 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:16,805 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:16,809 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:16,811 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:16,812 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,812 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,812 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,812 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,815 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:16,815 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:16,827 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,827 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:16,828 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,828 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,828 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,828 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,829 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:16,830 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:16,835 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,836 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:16,837 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,837 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,837 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,837 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,837 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,838 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,838 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,849 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:16,857 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:16,857 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:16,859 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:16,859 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:16,859 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:16,860 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-10-22 08:54:16,862 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:16,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:16,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:54:16,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:16,961 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:16,964 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-10-22 08:54:16,965 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 6 states. [2019-10-22 08:54:17,049 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 2. Second operand 6 states. Result 27 states and 32 transitions. Complement of second has 9 states. [2019-10-22 08:54:17,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:17,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 08:54:17,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-10-22 08:54:17,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 1 letters. Loop has 7 letters. [2019-10-22 08:54:17,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:17,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 8 letters. Loop has 7 letters. [2019-10-22 08:54:17,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:17,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 1 letters. Loop has 14 letters. [2019-10-22 08:54:17,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:17,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2019-10-22 08:54:17,058 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 08:54:17,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 28 transitions. [2019-10-22 08:54:17,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-10-22 08:54:17,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 08:54:17,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2019-10-22 08:54:17,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:17,059 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-10-22 08:54:17,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2019-10-22 08:54:17,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-10-22 08:54:17,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-22 08:54:17,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-10-22 08:54:17,061 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-10-22 08:54:17,061 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-10-22 08:54:17,061 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:54:17,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2019-10-22 08:54:17,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:54:17,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:17,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:17,062 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:54:17,062 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:54:17,062 INFO L791 eck$LassoCheckResult]: Stem: 158#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~tmp~0, main_~xtmp~0;havoc main_~x~0;havoc main_~y~0;havoc main_~tmp~0;havoc main_~xtmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 159#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 161#L17 assume !(0 == main_~y~0); 174#L21 assume !(main_~y~0 < 0); 173#L21-2 assume main_~xtmp~0 > 0; 169#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 170#L26-2 [2019-10-22 08:54:17,062 INFO L793 eck$LassoCheckResult]: Loop: 170#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 170#L26-2 [2019-10-22 08:54:17,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:17,063 INFO L82 PathProgramCache]: Analyzing trace with hash 925834904, now seen corresponding path program 1 times [2019-10-22 08:54:17,063 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:17,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45918073] [2019-10-22 08:54:17,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:17,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:17,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:17,078 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:17,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:17,078 INFO L82 PathProgramCache]: Analyzing trace with hash 64, now seen corresponding path program 1 times [2019-10-22 08:54:17,079 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:17,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312947220] [2019-10-22 08:54:17,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:17,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:17,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:17,083 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:17,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:17,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1363889015, now seen corresponding path program 2 times [2019-10-22 08:54:17,084 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:17,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446122699] [2019-10-22 08:54:17,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:17,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:17,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:17,099 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:17,165 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:17,165 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:17,165 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:17,165 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:17,166 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:17,166 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:17,166 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:17,166 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:17,166 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration4_Lasso [2019-10-22 08:54:17,166 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:17,166 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:17,168 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:17,174 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:17,179 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:17,197 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:17,199 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:17,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:17,265 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:17,265 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/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-10-22 08:54:17,271 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:17,271 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-10-22 08:54:17,275 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:17,275 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/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:17,283 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:17,284 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:17,295 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:17,295 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/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:17,308 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:17,308 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 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/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:17,330 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:17,331 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:17,540 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:17,543 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:17,543 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:17,543 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:17,543 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:17,543 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:17,544 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:17,544 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:17,544 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:17,544 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration4_Lasso [2019-10-22 08:54:17,544 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:17,544 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:17,546 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:17,560 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:17,577 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:17,582 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:17,585 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:17,587 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:17,659 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:17,659 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:17,660 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:17,661 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,661 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,661 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,661 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,663 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:17,663 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:17,668 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,669 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:17,669 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,670 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,670 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,670 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,673 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:17,673 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:17,703 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:17,732 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:54:17,732 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:54:17,733 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:17,734 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-10-22 08:54:17,735 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:17,735 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~xtmp~0) = -2*ULTIMATE.start_main_~y~0 + 2*ULTIMATE.start_main_~xtmp~0 + 1 Supporting invariants [1*ULTIMATE.start_main_~y~0 - 1 >= 0] [2019-10-22 08:54:17,752 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:54:17,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:17,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:54:17,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:17,824 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:54:17,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:17,824 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:17,824 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-10-22 08:54:17,825 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-10-22 08:54:17,875 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 25 states and 31 transitions. Complement of second has 6 states. [2019-10-22 08:54:17,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:17,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:17,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-10-22 08:54:17,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 1 letters. [2019-10-22 08:54:17,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:17,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 1 letters. [2019-10-22 08:54:17,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:17,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2019-10-22 08:54:17,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:17,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2019-10-22 08:54:17,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:54:17,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 29 transitions. [2019-10-22 08:54:17,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-10-22 08:54:17,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-10-22 08:54:17,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 29 transitions. [2019-10-22 08:54:17,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:17,881 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-10-22 08:54:17,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 29 transitions. [2019-10-22 08:54:17,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-10-22 08:54:17,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-22 08:54:17,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2019-10-22 08:54:17,883 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-10-22 08:54:17,886 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-10-22 08:54:17,886 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:54:17,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2019-10-22 08:54:17,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:54:17,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:17,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:17,887 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:17,887 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:17,887 INFO L791 eck$LassoCheckResult]: Stem: 256#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~tmp~0, main_~xtmp~0;havoc main_~x~0;havoc main_~y~0;havoc main_~tmp~0;havoc main_~xtmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 257#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 271#L17 assume !(0 == main_~y~0); 274#L21 assume !(main_~y~0 < 0); 273#L21-2 assume main_~xtmp~0 > 0; 272#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 270#L26-2 assume !(main_~xtmp~0 >= main_~y~0); 262#L26-3 [2019-10-22 08:54:17,888 INFO L793 eck$LassoCheckResult]: Loop: 262#L26-3 main_~y~0 := main_~xtmp~0; 263#L25-1 main_~x~0 := main_~tmp~0; 258#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 259#L17 assume !(0 == main_~y~0); 252#L21 assume !(main_~y~0 < 0); 253#L21-2 assume main_~xtmp~0 > 0; 266#L26-2 assume !(main_~xtmp~0 >= main_~y~0); 262#L26-3 [2019-10-22 08:54:17,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:17,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1363889017, now seen corresponding path program 1 times [2019-10-22 08:54:17,888 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:17,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815685613] [2019-10-22 08:54:17,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:17,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:17,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:17,907 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:17,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:17,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1776384388, now seen corresponding path program 2 times [2019-10-22 08:54:17,908 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:17,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842860880] [2019-10-22 08:54:17,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:17,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:17,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:17,923 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:17,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:17,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1008190014, now seen corresponding path program 1 times [2019-10-22 08:54:17,930 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:17,930 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145238512] [2019-10-22 08:54:17,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:17,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:17,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:17,987 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:54:17,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145238512] [2019-10-22 08:54:17,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115499229] [2019-10-22 08:54:17,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:18,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:54:18,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:18,026 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:54:18,026 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:54:18,027 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-22 08:54:18,027 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894619231] [2019-10-22 08:54:18,065 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:18,065 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:18,065 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:18,066 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:18,066 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:18,066 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:18,066 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:18,066 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:18,066 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration5_Loop [2019-10-22 08:54:18,066 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:18,066 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:18,068 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:18,071 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:18,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:18,135 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:18,135 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/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:18,144 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:18,144 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:18,148 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:18,148 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/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:18,154 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:18,155 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/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:18,170 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:18,170 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:20,356 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:20,358 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:20,358 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:20,358 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:20,358 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:20,359 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:20,359 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:20,359 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:20,359 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:20,359 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration5_Loop [2019-10-22 08:54:20,359 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:20,359 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:20,360 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:20,364 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:20,377 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:20,437 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:20,438 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:20,438 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:20,439 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,439 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,439 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,439 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,440 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:20,441 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:20,444 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,444 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:20,445 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,445 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:20,445 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,445 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,445 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,446 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:20,446 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:20,451 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:20,455 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:20,455 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:20,455 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:20,456 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:20,456 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:20,456 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~xtmp~0) = 1*ULTIMATE.start_main_~xtmp~0 Supporting invariants [] [2019-10-22 08:54:20,456 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:20,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:20,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:20,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:20,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:54:20,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:20,501 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:20,502 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:20,502 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-10-22 08:54:20,544 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 58 states and 72 transitions. Complement of second has 8 states. [2019-10-22 08:54:20,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:20,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:54:20,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-10-22 08:54:20,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 7 letters. Loop has 7 letters. [2019-10-22 08:54:20,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:20,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 14 letters. Loop has 7 letters. [2019-10-22 08:54:20,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:20,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 7 letters. Loop has 14 letters. [2019-10-22 08:54:20,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:20,547 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 72 transitions. [2019-10-22 08:54:20,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:54:20,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 53 states and 67 transitions. [2019-10-22 08:54:20,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-10-22 08:54:20,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-10-22 08:54:20,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 67 transitions. [2019-10-22 08:54:20,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:20,552 INFO L688 BuchiCegarLoop]: Abstraction has 53 states and 67 transitions. [2019-10-22 08:54:20,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 67 transitions. [2019-10-22 08:54:20,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2019-10-22 08:54:20,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-22 08:54:20,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2019-10-22 08:54:20,557 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-10-22 08:54:20,557 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:20,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 08:54:20,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:54:20,558 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand 8 states. [2019-10-22 08:54:20,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:20,662 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2019-10-22 08:54:20,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:54:20,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 60 transitions. [2019-10-22 08:54:20,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:54:20,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 31 states and 37 transitions. [2019-10-22 08:54:20,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-10-22 08:54:20,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-10-22 08:54:20,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 37 transitions. [2019-10-22 08:54:20,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:20,665 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-10-22 08:54:20,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 37 transitions. [2019-10-22 08:54:20,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-10-22 08:54:20,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-22 08:54:20,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-10-22 08:54:20,668 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-10-22 08:54:20,668 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-10-22 08:54:20,668 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:54:20,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2019-10-22 08:54:20,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:54:20,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:20,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:20,670 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:20,670 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:20,670 INFO L791 eck$LassoCheckResult]: Stem: 559#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~tmp~0, main_~xtmp~0;havoc main_~x~0;havoc main_~y~0;havoc main_~tmp~0;havoc main_~xtmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 560#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 576#L17 assume !(0 == main_~y~0); 575#L21 assume !(main_~y~0 < 0); 574#L21-2 assume main_~xtmp~0 > 0; 573#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 572#L26-2 assume !(main_~xtmp~0 >= main_~y~0); 563#L26-3 [2019-10-22 08:54:20,671 INFO L793 eck$LassoCheckResult]: Loop: 563#L26-3 main_~y~0 := main_~xtmp~0; 564#L25-1 main_~x~0 := main_~tmp~0; 561#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 562#L17 assume !(0 == main_~y~0); 557#L21 assume !(main_~y~0 < 0); 558#L21-2 assume main_~xtmp~0 > 0; 565#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 566#L26-2 assume !(main_~xtmp~0 >= main_~y~0); 563#L26-3 [2019-10-22 08:54:20,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:20,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1363889017, now seen corresponding path program 2 times [2019-10-22 08:54:20,671 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:20,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283797897] [2019-10-22 08:54:20,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:20,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:20,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:20,685 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:20,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:20,686 INFO L82 PathProgramCache]: Analyzing trace with hash -766658727, now seen corresponding path program 1 times [2019-10-22 08:54:20,686 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:20,686 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21408082] [2019-10-22 08:54:20,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:20,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:20,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:20,695 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:20,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:20,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1189119455, now seen corresponding path program 2 times [2019-10-22 08:54:20,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:20,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153153668] [2019-10-22 08:54:20,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:20,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:20,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:20,710 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:20,785 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:20,786 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:20,786 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:20,786 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:20,786 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:20,786 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:20,786 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:20,786 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:20,786 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration6_Loop [2019-10-22 08:54:20,786 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:20,786 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:20,787 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:20,798 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:20,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:20,860 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:20,861 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/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:20,868 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:20,868 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/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) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:20,877 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:20,877 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:22,645 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:22,647 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:22,647 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:22,648 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:22,648 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:22,648 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:22,648 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:22,648 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:22,648 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:22,648 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration6_Loop [2019-10-22 08:54:22,648 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:22,648 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:22,649 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:22,662 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:22,666 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:22,708 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:22,708 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:22,709 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:22,709 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,709 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,709 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,709 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,709 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,710 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,710 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,713 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:22,715 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:22,715 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:22,716 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:22,716 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:54:22,716 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:22,716 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~xtmp~0) = 1*ULTIMATE.start_main_~xtmp~0 Supporting invariants [] [2019-10-22 08:54:22,716 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:54:22,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:22,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:22,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:22,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:54:22,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:22,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:54:22,775 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:22,775 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-10-22 08:54:22,807 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 45 states and 54 transitions. Complement of second has 6 states. [2019-10-22 08:54:22,808 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-10-22 08:54:22,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:54:22,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-10-22 08:54:22,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 8 letters. [2019-10-22 08:54:22,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:22,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 8 letters. [2019-10-22 08:54:22,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:22,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 16 letters. [2019-10-22 08:54:22,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:22,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. [2019-10-22 08:54:22,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:54:22,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 37 states and 45 transitions. [2019-10-22 08:54:22,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-10-22 08:54:22,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-10-22 08:54:22,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 45 transitions. [2019-10-22 08:54:22,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:22,811 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 45 transitions. [2019-10-22 08:54:22,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 45 transitions. [2019-10-22 08:54:22,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2019-10-22 08:54:22,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-22 08:54:22,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-10-22 08:54:22,813 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-10-22 08:54:22,813 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-10-22 08:54:22,813 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:54:22,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2019-10-22 08:54:22,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:54:22,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:22,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:22,814 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-10-22 08:54:22,814 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:54:22,814 INFO L791 eck$LassoCheckResult]: Stem: 699#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~tmp~0, main_~xtmp~0;havoc main_~x~0;havoc main_~y~0;havoc main_~tmp~0;havoc main_~xtmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 700#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 718#L17 assume !(0 == main_~y~0); 717#L21 assume !(main_~y~0 < 0); 716#L21-2 assume main_~xtmp~0 > 0; 715#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 713#L26-2 assume !(main_~xtmp~0 >= main_~y~0); 712#L26-3 main_~y~0 := main_~xtmp~0; 708#L25-1 main_~x~0 := main_~tmp~0; 701#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 702#L17 assume !(0 == main_~y~0); 695#L21 assume !(main_~y~0 < 0); 696#L21-2 assume main_~xtmp~0 > 0; 709#L26-2 [2019-10-22 08:54:22,814 INFO L793 eck$LassoCheckResult]: Loop: 709#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 709#L26-2 [2019-10-22 08:54:22,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:22,815 INFO L82 PathProgramCache]: Analyzing trace with hash -521667071, now seen corresponding path program 3 times [2019-10-22 08:54:22,815 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:22,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023896710] [2019-10-22 08:54:22,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:22,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:22,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:22,825 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:22,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:22,825 INFO L82 PathProgramCache]: Analyzing trace with hash 64, now seen corresponding path program 2 times [2019-10-22 08:54:22,826 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:22,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81879286] [2019-10-22 08:54:22,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:22,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:22,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:22,829 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:22,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:22,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1008190016, now seen corresponding path program 4 times [2019-10-22 08:54:22,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:22,830 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588611578] [2019-10-22 08:54:22,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:22,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:22,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:22,840 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:22,899 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:22,899 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:22,899 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:22,899 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:22,899 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:54:22,899 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:22,899 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:22,899 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:22,900 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration7_Lasso [2019-10-22 08:54:22,900 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:22,900 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:22,901 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:22,902 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:22,910 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:22,911 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:22,912 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:22,914 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:22,968 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:22,968 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:22,974 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:22,974 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:54:22,976 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:54:22,977 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:22,980 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:54:22,981 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96ef74f9-44b5-4b41-9e3c-eadacab211af/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:54:23,009 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:54:23,009 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:23,117 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:54:23,119 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:23,119 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:23,119 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:23,119 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:23,119 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:23,119 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:23,120 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:23,120 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:23,120 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration7_Lasso [2019-10-22 08:54:23,120 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:23,120 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:23,121 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:23,125 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:23,126 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:23,129 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:23,130 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:23,132 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:23,186 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:23,186 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:23,186 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:23,187 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:23,187 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:23,187 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:23,187 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:23,188 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:23,188 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:23,188 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:23,188 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:23,189 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:23,189 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:23,189 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:23,189 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:23,189 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:23,190 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:23,190 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:23,190 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:23,190 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:23,191 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:23,191 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:23,191 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:23,191 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:23,191 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:23,192 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:23,192 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:23,194 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:23,194 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:23,194 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:23,195 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:23,195 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:23,195 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:23,195 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:23,195 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:23,195 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:23,196 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:23,196 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:23,196 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:23,196 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:23,197 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:23,197 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:23,198 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:23,198 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:23,200 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:23,200 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:23,201 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:23,201 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:23,201 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:23,201 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:23,202 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:23,203 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:23,210 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:23,216 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:54:23,216 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:54:23,216 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:23,217 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-10-22 08:54:23,217 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:23,218 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~xtmp~0) = -2*ULTIMATE.start_main_~y~0 + 2*ULTIMATE.start_main_~xtmp~0 + 1 Supporting invariants [1*ULTIMATE.start_main_~y~0 - 1 >= 0] [2019-10-22 08:54:23,232 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:54:23,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:23,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:54:23,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:23,269 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:54:23,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:23,269 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:23,269 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-10-22 08:54:23,269 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-10-22 08:54:23,293 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 30 states and 37 transitions. Complement of second has 6 states. [2019-10-22 08:54:23,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:23,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:23,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-10-22 08:54:23,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 13 letters. Loop has 1 letters. [2019-10-22 08:54:23,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:23,295 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:23,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:23,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:54:23,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:23,334 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:54:23,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:23,334 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:23,334 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 1 loop predicates [2019-10-22 08:54:23,334 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-10-22 08:54:23,359 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 30 states and 37 transitions. Complement of second has 6 states. [2019-10-22 08:54:23,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:23,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:23,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-10-22 08:54:23,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 13 letters. Loop has 1 letters. [2019-10-22 08:54:23,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:23,362 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:23,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:23,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:54:23,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:23,393 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:54:23,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:23,393 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:23,394 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-10-22 08:54:23,394 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-10-22 08:54:23,414 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 32 states and 39 transitions. Complement of second has 5 states. [2019-10-22 08:54:23,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:23,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:23,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-10-22 08:54:23,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 1 letters. [2019-10-22 08:54:23,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:23,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 1 letters. [2019-10-22 08:54:23,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:23,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2019-10-22 08:54:23,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:23,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2019-10-22 08:54:23,416 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:23,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2019-10-22 08:54:23,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:54:23,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:54:23,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:54:23,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:23,417 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:23,417 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:23,417 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:23,417 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:54:23,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:54:23,417 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:23,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:54:23,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:54:23 BoogieIcfgContainer [2019-10-22 08:54:23,422 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:54:23,422 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:54:23,423 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:54:23,423 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:54:23,423 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:12" (3/4) ... [2019-10-22 08:54:23,426 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:54:23,426 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:54:23,428 INFO L168 Benchmark]: Toolchain (without parser) took 11350.76 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 223.3 MB). Free memory was 944.5 MB in the beginning and 1.0 GB in the end (delta: -92.2 MB). Peak memory consumption was 131.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:23,429 INFO L168 Benchmark]: CDTParser took 0.20 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:23,429 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -203.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:23,430 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.87 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:23,430 INFO L168 Benchmark]: Boogie Preprocessor took 17.76 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:23,430 INFO L168 Benchmark]: RCFGBuilder took 195.36 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:23,431 INFO L168 Benchmark]: BuchiAutomizer took 10823.60 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.7 MB). Peak memory consumption was 161.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:23,431 INFO L168 Benchmark]: Witness Printer took 4.04 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:23,434 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.20 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 275.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -203.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.87 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 17.76 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. * RCFGBuilder took 195.36 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10823.60 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.7 MB). Peak memory consumption was 161.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.04 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 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 8 terminating modules (3 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function y and consists of 5 locations. One deterministic module has affine ranking function -2 * y + 2 * xtmp + 1 and consists of 4 locations. One deterministic module has affine ranking function xtmp and consists of 5 locations. One deterministic module has affine ranking function xtmp and consists of 4 locations. One nondeterministic module has affine ranking function -2 * y + 2 * xtmp + 1 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.7s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 9.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 32 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 6. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 56 SDtfs, 93 SDslu, 16 SDs, 0 SdLazy, 185 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax152 hnf96 lsp64 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq174 hnf90 smp100 dnf100 smp100 tf103 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 7.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...