./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_aaa5fd40-3aa8-471b-ac04-d1736a763314/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_aaa5fd40-3aa8-471b-ac04-d1736a763314/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_aaa5fd40-3aa8-471b-ac04-d1736a763314/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_aaa5fd40-3aa8-471b-ac04-d1736a763314/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_aaa5fd40-3aa8-471b-ac04-d1736a763314/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_aaa5fd40-3aa8-471b-ac04-d1736a763314/bin-2019/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 32bit --witnessprinter.graph.data.programhash 9918b49e0d76e4ce36b6a6760021b33460a8ae9b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 03:58:30,270 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:58:30,271 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:58:30,278 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:58:30,279 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:58:30,279 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:58:30,280 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:58:30,281 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:58:30,282 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:58:30,283 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:58:30,284 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:58:30,284 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:58:30,285 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:58:30,285 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:58:30,286 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:58:30,287 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:58:30,287 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:58:30,289 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:58:30,290 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:58:30,291 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:58:30,292 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:58:30,293 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:58:30,295 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:58:30,295 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:58:30,296 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:58:30,296 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:58:30,297 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:58:30,298 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:58:30,298 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:58:30,299 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:58:30,300 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:58:30,300 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:58:30,300 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:58:30,300 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:58:30,301 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:58:30,302 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:58:30,302 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_aaa5fd40-3aa8-471b-ac04-d1736a763314/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 03:58:30,315 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:58:30,316 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:58:30,316 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:58:30,317 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:58:30,317 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:58:30,317 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 03:58:30,317 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 03:58:30,317 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 03:58:30,317 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 03:58:30,318 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 03:58:30,318 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 03:58:30,318 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:58:30,318 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:58:30,318 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 03:58:30,318 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:58:30,318 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:58:30,319 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:58:30,319 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 03:58:30,319 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 03:58:30,319 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 03:58:30,319 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:58:30,319 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:58:30,320 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 03:58:30,320 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 03:58:30,320 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:58:30,320 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:58:30,320 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 03:58:30,320 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:58:30,320 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 03:58:30,320 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 03:58:30,321 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 03:58:30,321 INFO L133 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_aaa5fd40-3aa8-471b-ac04-d1736a763314/bin-2019/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9918b49e0d76e4ce36b6a6760021b33460a8ae9b [2018-11-10 03:58:30,347 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:58:30,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:58:30,359 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:58:30,360 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:58:30,360 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:58:30,361 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_aaa5fd40-3aa8-471b-ac04-d1736a763314/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i [2018-11-10 03:58:30,405 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_aaa5fd40-3aa8-471b-ac04-d1736a763314/bin-2019/uautomizer/data/0556b917c/2e5d1270d1454522a140991ae7c352ec/FLAGe0f2139ac [2018-11-10 03:58:30,759 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:58:30,760 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_aaa5fd40-3aa8-471b-ac04-d1736a763314/sv-benchmarks/c/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i [2018-11-10 03:58:30,764 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_aaa5fd40-3aa8-471b-ac04-d1736a763314/bin-2019/uautomizer/data/0556b917c/2e5d1270d1454522a140991ae7c352ec/FLAGe0f2139ac [2018-11-10 03:58:30,775 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_aaa5fd40-3aa8-471b-ac04-d1736a763314/bin-2019/uautomizer/data/0556b917c/2e5d1270d1454522a140991ae7c352ec [2018-11-10 03:58:30,778 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:58:30,779 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:58:30,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:58:30,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:58:30,783 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:58:30,784 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:58:30" (1/1) ... [2018-11-10 03:58:30,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62ca410a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:58:30, skipping insertion in model container [2018-11-10 03:58:30,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:58:30" (1/1) ... [2018-11-10 03:58:30,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:58:30,808 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:58:30,922 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:58:30,925 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:58:30,939 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:58:30,948 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:58:30,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:58:30 WrapperNode [2018-11-10 03:58:30,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:58:30,949 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:58:30,949 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:58:30,950 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:58:30,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:58:30" (1/1) ... [2018-11-10 03:58:30,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:58:30" (1/1) ... [2018-11-10 03:58:30,973 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:58:30,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:58:30,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:58:30,974 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:58:30,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:58:30" (1/1) ... [2018-11-10 03:58:30,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:58:30" (1/1) ... [2018-11-10 03:58:30,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:58:30" (1/1) ... [2018-11-10 03:58:30,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:58:30" (1/1) ... [2018-11-10 03:58:30,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:58:30" (1/1) ... [2018-11-10 03:58:30,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:58:30" (1/1) ... [2018-11-10 03:58:30,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:58:30" (1/1) ... [2018-11-10 03:58:30,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:58:30,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:58:30,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:58:30,989 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:58:30,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:58:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aaa5fd40-3aa8-471b-ac04-d1736a763314/bin-2019/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 [2018-11-10 03:58:31,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:58:31,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:58:31,267 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:58:31,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:58:31 BoogieIcfgContainer [2018-11-10 03:58:31,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:58:31,268 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 03:58:31,269 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 03:58:31,272 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 03:58:31,273 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:58:31,274 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 03:58:30" (1/3) ... [2018-11-10 03:58:31,275 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@633842d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:58:31, skipping insertion in model container [2018-11-10 03:58:31,275 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:58:31,275 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:58:30" (2/3) ... [2018-11-10 03:58:31,276 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@633842d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:58:31, skipping insertion in model container [2018-11-10 03:58:31,276 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:58:31,276 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:58:31" (3/3) ... [2018-11-10 03:58:31,278 INFO L375 chiAutomizerObserver]: Analyzing ICFG gcd_4_true-unreach-call_true-no-overflow_true-termination.i [2018-11-10 03:58:31,339 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:58:31,339 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 03:58:31,340 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 03:58:31,340 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 03:58:31,340 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:58:31,340 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:58:31,340 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 03:58:31,340 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:58:31,340 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 03:58:31,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 03:58:31,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 03:58:31,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:58:31,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:58:31,386 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 03:58:31,386 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 03:58:31,386 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 03:58:31,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 03:58:31,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 03:58:31,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:58:31,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:58:31,389 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 03:58:31,389 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 03:58:31,396 INFO L793 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 17#L12true assume !(gcd_test_~a < 0); 14#L12-2true assume !(gcd_test_~b < 0); 18#L13-1true assume !(gcd_test_~a == 0); 8#L20-2true [2018-11-10 03:58:31,396 INFO L795 eck$LassoCheckResult]: Loop: 8#L20-2true assume true; 9#L19-1true assume !!(gcd_test_~b != 0); 11#L20true assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 8#L20-2true [2018-11-10 03:58:31,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:31,401 INFO L82 PathProgramCache]: Analyzing trace with hash 28695882, now seen corresponding path program 1 times [2018-11-10 03:58:31,402 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:58:31,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:58:31,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:31,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:58:31,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:31,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:31,493 INFO L82 PathProgramCache]: Analyzing trace with hash 52825, now seen corresponding path program 1 times [2018-11-10 03:58:31,493 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:58:31,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:58:31,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:31,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:58:31,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:31,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:31,505 INFO L82 PathProgramCache]: Analyzing trace with hash 180551792, now seen corresponding path program 1 times [2018-11-10 03:58:31,505 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:58:31,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:58:31,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:31,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:58:31,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:31,569 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:58:31,570 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:58:31,571 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:58:31,571 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:58:31,571 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:58:31,571 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:58:31,571 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:58:31,571 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:58:31,571 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd_4_true-unreach-call_true-no-overflow_true-termination.i_Iteration1_Loop [2018-11-10 03:58:31,572 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:58:31,572 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:58:31,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:58:31,675 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:58:31,675 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aaa5fd40-3aa8-471b-ac04-d1736a763314/bin-2019/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 [2018-11-10 03:58:31,679 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:58:31,679 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aaa5fd40-3aa8-471b-ac04-d1736a763314/bin-2019/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 [2018-11-10 03:58:31,706 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:58:31,706 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:58:31,743 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:58:31,743 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gcd_test_~a=-3, ULTIMATE.start_gcd_test_~b=-4} Honda state: {ULTIMATE.start_gcd_test_~a=-3, ULTIMATE.start_gcd_test_~b=-4} Generalized eigenvectors: [{ULTIMATE.start_gcd_test_~a=0, ULTIMATE.start_gcd_test_~b=0}, {ULTIMATE.start_gcd_test_~a=4, ULTIMATE.start_gcd_test_~b=0}, {ULTIMATE.start_gcd_test_~a=0, ULTIMATE.start_gcd_test_~b=0}] Lambdas: [10, 1, 0] Nus: [0, 0] [2018-11-10 03:58:31,805 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:58:31,805 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:58:31,805 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:58:31,805 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:58:31,805 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:58:31,805 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:58:31,806 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:58:31,806 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:58:31,806 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd_4_true-unreach-call_true-no-overflow_true-termination.i_Iteration1_Lasso [2018-11-10 03:58:31,806 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:58:31,806 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:58:31,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:58:31,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:58:31,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:58:31,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:58:31,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:58:32,016 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:58:32,016 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aaa5fd40-3aa8-471b-ac04-d1736a763314/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:58:32,021 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:58:32,022 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:58:32,024 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:58:32,024 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret0=0} Honda state: {ULTIMATE.start_main_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aaa5fd40-3aa8-471b-ac04-d1736a763314/bin-2019/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:58:32,045 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:58:32,045 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:58:32,048 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:58:32,048 INFO L446 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_aaa5fd40-3aa8-471b-ac04-d1736a763314/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:58:32,069 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:58:32,069 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aaa5fd40-3aa8-471b-ac04-d1736a763314/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:58:32,099 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:58:32,099 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:58:33,269 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:58:33,271 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:58:33,271 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:58:33,271 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:58:33,271 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:58:33,271 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:58:33,272 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:58:33,272 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:58:33,272 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:58:33,272 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd_4_true-unreach-call_true-no-overflow_true-termination.i_Iteration1_Lasso [2018-11-10 03:58:33,272 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:58:33,272 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:58:33,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:58:33,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:58:33,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:58:33,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:58:33,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:58:33,420 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:58:33,424 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:58:33,425 INFO L122 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 [2018-11-10 03:58:33,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:58:33,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:58:33,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:58:33,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:58:33,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:58:33,428 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:58:33,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:58:33,430 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:58:33,430 INFO L122 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 [2018-11-10 03:58:33,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:58:33,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:58:33,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:58:33,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:58:33,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:58:33,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:58:33,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:58:33,434 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:58:33,435 INFO L122 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 [2018-11-10 03:58:33,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:58:33,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:58:33,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:58:33,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:58:33,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:58:33,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:58:33,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:58:33,438 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:58:33,439 INFO L122 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 [2018-11-10 03:58:33,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:58:33,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:58:33,440 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:58:33,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:58:33,449 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-10 03:58:33,449 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 03:58:33,545 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:58:33,614 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2018-11-10 03:58:33,614 INFO L444 ModelExtractionUtils]: 27 out of 36 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 03:58:33,616 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:58:33,619 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 4. [2018-11-10 03:58:33,620 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:58:33,620 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_gcd_test_~a) = 2*ULTIMATE.start_gcd_test_~a + 1 Supporting invariants [1*ULTIMATE.start_gcd_test_~b >= 0, 1*ULTIMATE.start_gcd_test_~a >= 0] [2018-11-10 03:58:33,641 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2018-11-10 03:58:33,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:58:33,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:58:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:58:33,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:58:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:58:33,717 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-10 03:58:33,718 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 5 states. [2018-11-10 03:58:33,775 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 5 states. Result 76 states and 97 transitions. Complement of second has 8 states. [2018-11-10 03:58:33,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:58:33,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 03:58:33,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2018-11-10 03:58:33,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 71 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-10 03:58:33,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:58:33,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 71 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-10 03:58:33,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:58:33,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 71 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-10 03:58:33,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:58:33,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 97 transitions. [2018-11-10 03:58:33,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 03:58:33,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 14 states and 18 transitions. [2018-11-10 03:58:33,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-10 03:58:33,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-10 03:58:33,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2018-11-10 03:58:33,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:58:33,790 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-10 03:58:33,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2018-11-10 03:58:33,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-10 03:58:33,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-10 03:58:33,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-10 03:58:33,807 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-10 03:58:33,807 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-10 03:58:33,807 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 03:58:33,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-10 03:58:33,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 03:58:33,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:58:33,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:58:33,809 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 03:58:33,809 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 03:58:33,809 INFO L793 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 164#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 165#L12 assume !(gcd_test_~a < 0); 166#L12-2 assume !(gcd_test_~b < 0); 167#L13-1 assume !(gcd_test_~a == 0); 169#L20-2 assume true; 170#L19-1 [2018-11-10 03:58:33,809 INFO L795 eck$LassoCheckResult]: Loop: 170#L19-1 assume !!(gcd_test_~b != 0); 171#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 174#L20-2 assume true; 170#L19-1 [2018-11-10 03:58:33,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:33,809 INFO L82 PathProgramCache]: Analyzing trace with hash 889572365, now seen corresponding path program 1 times [2018-11-10 03:58:33,809 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:58:33,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:58:33,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:33,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:58:33,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:33,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:33,816 INFO L82 PathProgramCache]: Analyzing trace with hash 58737, now seen corresponding path program 1 times [2018-11-10 03:58:33,816 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:58:33,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:58:33,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:33,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:58:33,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:33,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:33,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1302138341, now seen corresponding path program 1 times [2018-11-10 03:58:33,822 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:58:33,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:58:33,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:33,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:58:33,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:58:33,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:58:33,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:58:33,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:58:33,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:58:33,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:58:33,885 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-10 03:58:33,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:58:33,895 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-11-10 03:58:33,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:58:33,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2018-11-10 03:58:33,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 03:58:33,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 15 states and 17 transitions. [2018-11-10 03:58:33,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-10 03:58:33,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-10 03:58:33,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2018-11-10 03:58:33,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:58:33,897 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-10 03:58:33,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2018-11-10 03:58:33,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-10 03:58:33,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-10 03:58:33,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-11-10 03:58:33,899 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-10 03:58:33,899 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-10 03:58:33,899 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 03:58:33,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2018-11-10 03:58:33,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 03:58:33,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:58:33,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:58:33,900 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:58:33,900 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 03:58:33,900 INFO L793 eck$LassoCheckResult]: Stem: 206#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 202#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 203#L12 assume !(gcd_test_~a < 0); 204#L12-2 assume !(gcd_test_~b < 0); 205#L13-1 assume !(gcd_test_~a == 0); 207#L20-2 assume true; 210#L19-1 assume !!(gcd_test_~b != 0); 211#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 215#L20-2 assume true; 208#L19-1 [2018-11-10 03:58:33,900 INFO L795 eck$LassoCheckResult]: Loop: 208#L19-1 assume !!(gcd_test_~b != 0); 209#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 214#L20-2 assume true; 208#L19-1 [2018-11-10 03:58:33,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:33,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1302138279, now seen corresponding path program 2 times [2018-11-10 03:58:33,901 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:58:33,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:58:33,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:33,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:58:33,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:33,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:33,908 INFO L82 PathProgramCache]: Analyzing trace with hash 58737, now seen corresponding path program 2 times [2018-11-10 03:58:33,908 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:58:33,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:58:33,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:33,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:58:33,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:33,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:33,912 INFO L82 PathProgramCache]: Analyzing trace with hash -143118837, now seen corresponding path program 1 times [2018-11-10 03:58:33,912 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:58:33,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:58:33,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:33,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:58:33,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:58:33,940 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:58:33,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:58:33,941 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aaa5fd40-3aa8-471b-ac04-d1736a763314/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:58:33,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:58:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:58:33,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:58:33,992 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:58:34,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:58:34,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-10 03:58:34,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 03:58:34,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:58:34,016 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-11-10 03:58:34,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:58:34,040 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-10 03:58:34,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:58:34,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2018-11-10 03:58:34,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 03:58:34,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 20 transitions. [2018-11-10 03:58:34,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-10 03:58:34,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-10 03:58:34,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2018-11-10 03:58:34,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:58:34,042 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-10 03:58:34,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2018-11-10 03:58:34,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-10 03:58:34,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-10 03:58:34,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-10 03:58:34,044 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-10 03:58:34,044 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-10 03:58:34,044 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 03:58:34,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2018-11-10 03:58:34,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 03:58:34,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:58:34,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:58:34,045 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1] [2018-11-10 03:58:34,045 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 03:58:34,045 INFO L793 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 281#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 282#L12 assume !(gcd_test_~a < 0); 283#L12-2 assume !(gcd_test_~b < 0); 284#L13-1 assume !(gcd_test_~a == 0); 286#L20-2 assume true; 287#L19-1 assume !!(gcd_test_~b != 0); 294#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 295#L20-2 assume true; 298#L19-1 assume !!(gcd_test_~b != 0); 297#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 296#L20-2 assume true; 290#L19-1 [2018-11-10 03:58:34,045 INFO L795 eck$LassoCheckResult]: Loop: 290#L19-1 assume !!(gcd_test_~b != 0); 291#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 293#L20-2 assume true; 290#L19-1 [2018-11-10 03:58:34,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:34,045 INFO L82 PathProgramCache]: Analyzing trace with hash -143118899, now seen corresponding path program 3 times [2018-11-10 03:58:34,045 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:58:34,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:58:34,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:34,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:58:34,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:34,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:34,052 INFO L82 PathProgramCache]: Analyzing trace with hash 58737, now seen corresponding path program 3 times [2018-11-10 03:58:34,052 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:58:34,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:58:34,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:34,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:58:34,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:34,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:34,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1247433765, now seen corresponding path program 2 times [2018-11-10 03:58:34,057 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:58:34,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:58:34,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:34,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:58:34,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:58:34,110 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:58:34,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:58:34,111 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aaa5fd40-3aa8-471b-ac04-d1736a763314/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:58:34,125 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 03:58:34,130 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 03:58:34,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:58:34,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:58:34,160 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:58:34,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:58:34,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-10 03:58:34,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 03:58:34,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 03:58:34,188 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 8 states. [2018-11-10 03:58:34,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:58:34,206 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-10 03:58:34,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:58:34,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2018-11-10 03:58:34,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 03:58:34,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 21 states and 23 transitions. [2018-11-10 03:58:34,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-10 03:58:34,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-10 03:58:34,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2018-11-10 03:58:34,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:58:34,208 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-10 03:58:34,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2018-11-10 03:58:34,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-10 03:58:34,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 03:58:34,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-10 03:58:34,209 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-10 03:58:34,209 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-10 03:58:34,210 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 03:58:34,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2018-11-10 03:58:34,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 03:58:34,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:58:34,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:58:34,211 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 1, 1, 1, 1, 1] [2018-11-10 03:58:34,211 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 03:58:34,211 INFO L793 eck$LassoCheckResult]: Stem: 381#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 377#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 378#L12 assume !(gcd_test_~a < 0); 379#L12-2 assume !(gcd_test_~b < 0); 380#L13-1 assume !(gcd_test_~a == 0); 382#L20-2 assume true; 383#L19-1 assume !!(gcd_test_~b != 0); 394#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 395#L20-2 assume true; 396#L19-1 assume !!(gcd_test_~b != 0); 390#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 391#L20-2 assume true; 397#L19-1 assume !!(gcd_test_~b != 0); 393#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 392#L20-2 assume true; 386#L19-1 [2018-11-10 03:58:34,211 INFO L795 eck$LassoCheckResult]: Loop: 386#L19-1 assume !!(gcd_test_~b != 0); 387#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 389#L20-2 assume true; 386#L19-1 [2018-11-10 03:58:34,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:34,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1247433703, now seen corresponding path program 4 times [2018-11-10 03:58:34,211 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:58:34,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:58:34,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:34,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:58:34,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:34,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:34,218 INFO L82 PathProgramCache]: Analyzing trace with hash 58737, now seen corresponding path program 4 times [2018-11-10 03:58:34,218 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:58:34,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:58:34,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:34,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:58:34,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:34,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:34,221 INFO L82 PathProgramCache]: Analyzing trace with hash -2054537269, now seen corresponding path program 3 times [2018-11-10 03:58:34,221 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:58:34,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:58:34,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:34,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:58:34,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:34,297 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:58:34,297 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:58:34,297 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:58:34,297 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:58:34,297 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:58:34,298 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:58:34,298 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:58:34,298 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:58:34,298 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd_4_true-unreach-call_true-no-overflow_true-termination.i_Iteration5_Lasso [2018-11-10 03:58:34,298 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:58:34,298 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:58:34,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:58:34,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:58:34,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:58:34,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:58:34,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:58:34,360 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:58:34,360 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aaa5fd40-3aa8-471b-ac04-d1736a763314/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:58:34,361 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:58:34,362 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:58:34,364 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:58:34,364 INFO L446 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_aaa5fd40-3aa8-471b-ac04-d1736a763314/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:58:34,380 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:58:34,380 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aaa5fd40-3aa8-471b-ac04-d1736a763314/bin-2019/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 [2018-11-10 03:58:34,404 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:58:34,404 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:58:34,751 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:58:34,753 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:58:34,753 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:58:34,753 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:58:34,753 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:58:34,753 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:58:34,754 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:58:34,754 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:58:34,754 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:58:34,754 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd_4_true-unreach-call_true-no-overflow_true-termination.i_Iteration5_Lasso [2018-11-10 03:58:34,754 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:58:34,754 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:58:34,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:58:34,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:58:34,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:58:34,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:58:34,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:58:34,832 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:58:34,832 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:58:34,833 INFO L122 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 [2018-11-10 03:58:34,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:58:34,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:58:34,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:58:34,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:58:34,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:58:34,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:58:34,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:58:34,834 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:58:34,835 INFO L122 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 [2018-11-10 03:58:34,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:58:34,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:58:34,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:58:34,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:58:34,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:58:34,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:58:34,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:58:34,836 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:58:34,837 INFO L122 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 [2018-11-10 03:58:34,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:58:34,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:58:34,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:58:34,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:58:34,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:58:34,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:58:34,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:58:34,838 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:58:34,839 INFO L122 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 [2018-11-10 03:58:34,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:58:34,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:58:34,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:58:34,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:58:34,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:58:34,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:58:34,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:58:34,840 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:58:34,841 INFO L122 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 [2018-11-10 03:58:34,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:58:34,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:58:34,841 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:58:34,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:58:34,846 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-10 03:58:34,846 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 03:58:34,881 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:58:34,908 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 03:58:34,909 INFO L444 ModelExtractionUtils]: 27 out of 36 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 03:58:34,909 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:58:34,911 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2018-11-10 03:58:34,911 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:58:34,911 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_gcd_test_~a, ULTIMATE.start_gcd_test_~b) = -2*ULTIMATE.start_gcd_test_~a + 2*ULTIMATE.start_gcd_test_~b + 1 Supporting invariants [1*ULTIMATE.start_gcd_test_~a - 1 >= 0] [2018-11-10 03:58:34,925 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2018-11-10 03:58:34,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:58:34,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:58:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:58:35,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:58:35,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:58:35,094 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-11-10 03:58:35,094 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4 Second operand 8 states. [2018-11-10 03:58:35,143 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4. Second operand 8 states. Result 22 states and 24 transitions. Complement of second has 6 states. [2018-11-10 03:58:35,144 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 [2018-11-10 03:58:35,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 03:58:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2018-11-10 03:58:35,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-10 03:58:35,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:58:35,145 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:58:35,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:58:35,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:58:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:58:35,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:58:35,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:58:35,231 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2018-11-10 03:58:35,231 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4 Second operand 8 states. [2018-11-10 03:58:35,263 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4. Second operand 8 states. Result 22 states and 24 transitions. Complement of second has 6 states. [2018-11-10 03:58:35,264 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 [2018-11-10 03:58:35,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 03:58:35,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2018-11-10 03:58:35,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-10 03:58:35,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:58:35,265 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:58:35,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:58:35,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:58:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:58:35,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:58:35,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:58:35,360 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-11-10 03:58:35,360 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4 Second operand 8 states. [2018-11-10 03:58:35,466 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4. Second operand 8 states. Result 38 states and 43 transitions. Complement of second has 20 states. [2018-11-10 03:58:35,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2018-11-10 03:58:35,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 03:58:35,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2018-11-10 03:58:35,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 31 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-10 03:58:35,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:58:35,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 31 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-10 03:58:35,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:58:35,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 31 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-10 03:58:35,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:58:35,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 43 transitions. [2018-11-10 03:58:35,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 03:58:35,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 28 states and 32 transitions. [2018-11-10 03:58:35,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-10 03:58:35,470 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-10 03:58:35,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2018-11-10 03:58:35,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:58:35,470 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-10 03:58:35,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2018-11-10 03:58:35,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-10 03:58:35,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-10 03:58:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-10 03:58:35,472 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-10 03:58:35,472 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-10 03:58:35,472 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 03:58:35,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2018-11-10 03:58:35,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 03:58:35,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:58:35,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:58:35,473 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1, 1, 1] [2018-11-10 03:58:35,473 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 03:58:35,473 INFO L793 eck$LassoCheckResult]: Stem: 735#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 731#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 732#L12 assume !(gcd_test_~a < 0); 733#L12-2 assume !(gcd_test_~b < 0); 734#L13-1 assume !(gcd_test_~a == 0); 736#L20-2 assume true; 737#L19-1 assume !!(gcd_test_~b != 0); 756#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 738#L20-2 assume true; 739#L19-1 assume !!(gcd_test_~b != 0); 757#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 755#L20-2 assume true; 754#L19-1 assume !!(gcd_test_~b != 0); 753#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 752#L20-2 assume true; 751#L19-1 assume !!(gcd_test_~b != 0); 748#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 746#L20-2 assume true; 740#L19-1 [2018-11-10 03:58:35,473 INFO L795 eck$LassoCheckResult]: Loop: 740#L19-1 assume !!(gcd_test_~b != 0); 741#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 744#L20-2 assume true; 740#L19-1 [2018-11-10 03:58:35,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:35,474 INFO L82 PathProgramCache]: Analyzing trace with hash -2054537331, now seen corresponding path program 5 times [2018-11-10 03:58:35,474 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:58:35,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:58:35,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:35,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:58:35,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:58:35,511 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:58:35,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:58:35,511 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aaa5fd40-3aa8-471b-ac04-d1736a763314/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:58:35,527 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 03:58:35,535 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-11-10 03:58:35,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:58:35,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:58:35,585 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:58:35,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:58:35,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-11-10 03:58:35,611 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:58:35,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:35,611 INFO L82 PathProgramCache]: Analyzing trace with hash 58737, now seen corresponding path program 5 times [2018-11-10 03:58:35,612 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:58:35,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:58:35,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:35,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:58:35,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:35,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 03:58:35,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-11-10 03:58:35,622 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. cyclomatic complexity: 7 Second operand 10 states. [2018-11-10 03:58:35,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:58:35,648 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-10 03:58:35,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 03:58:35,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 33 transitions. [2018-11-10 03:58:35,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 03:58:35,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 32 transitions. [2018-11-10 03:58:35,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-10 03:58:35,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-10 03:58:35,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 32 transitions. [2018-11-10 03:58:35,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:58:35,650 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-10 03:58:35,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 32 transitions. [2018-11-10 03:58:35,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-10 03:58:35,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-10 03:58:35,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-10 03:58:35,652 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-10 03:58:35,652 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-10 03:58:35,652 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 03:58:35,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2018-11-10 03:58:35,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 03:58:35,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:58:35,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:58:35,653 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 1, 1, 1, 1, 1, 1] [2018-11-10 03:58:35,653 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 03:58:35,653 INFO L793 eck$LassoCheckResult]: Stem: 857#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 853#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 854#L12 assume !(gcd_test_~a < 0); 855#L12-2 assume !(gcd_test_~b < 0); 856#L13-1 assume !(gcd_test_~a == 0); 858#L20-2 assume true; 861#L19-1 assume !!(gcd_test_~b != 0); 862#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 863#L20-2 assume true; 864#L19-1 assume !!(gcd_test_~b != 0); 879#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 878#L20-2 assume true; 877#L19-1 assume !!(gcd_test_~b != 0); 876#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 875#L20-2 assume true; 874#L19-1 assume !!(gcd_test_~b != 0); 871#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 872#L20-2 assume true; 873#L19-1 assume !!(gcd_test_~b != 0); 868#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 866#L20-2 assume true; 859#L19-1 [2018-11-10 03:58:35,653 INFO L795 eck$LassoCheckResult]: Loop: 859#L19-1 assume !!(gcd_test_~b != 0); 860#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 865#L20-2 assume true; 859#L19-1 [2018-11-10 03:58:35,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:35,653 INFO L82 PathProgramCache]: Analyzing trace with hash 859183401, now seen corresponding path program 4 times [2018-11-10 03:58:35,654 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:58:35,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:58:35,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:35,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:58:35,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:58:35,702 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:58:35,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:58:35,702 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aaa5fd40-3aa8-471b-ac04-d1736a763314/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:58:35,707 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 03:58:35,712 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 03:58:35,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:58:35,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:58:35,750 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 23 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:58:35,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:58:35,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-10 03:58:35,767 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:58:35,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:35,767 INFO L82 PathProgramCache]: Analyzing trace with hash 58737, now seen corresponding path program 6 times [2018-11-10 03:58:35,767 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:58:35,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:58:35,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:35,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:58:35,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:35,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 03:58:35,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-10 03:58:35,792 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand 12 states. [2018-11-10 03:58:35,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:58:35,823 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-10 03:58:35,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 03:58:35,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 37 transitions. [2018-11-10 03:58:35,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 03:58:35,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 32 states and 35 transitions. [2018-11-10 03:58:35,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-10 03:58:35,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-10 03:58:35,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 35 transitions. [2018-11-10 03:58:35,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:58:35,824 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-10 03:58:35,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 35 transitions. [2018-11-10 03:58:35,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-10 03:58:35,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 03:58:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-11-10 03:58:35,826 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-10 03:58:35,826 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-10 03:58:35,826 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 03:58:35,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 33 transitions. [2018-11-10 03:58:35,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 03:58:35,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:58:35,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:58:35,826 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 4, 2, 1, 1, 1, 1, 1] [2018-11-10 03:58:35,827 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 03:58:35,827 INFO L793 eck$LassoCheckResult]: Stem: 995#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 991#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 992#L12 assume !(gcd_test_~a < 0); 993#L12-2 assume !(gcd_test_~b < 0); 994#L13-1 assume !(gcd_test_~a == 0); 996#L20-2 assume true; 997#L19-1 assume !!(gcd_test_~b != 0); 1002#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 998#L20-2 assume true; 999#L19-1 assume !!(gcd_test_~b != 0); 1020#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 1019#L20-2 assume true; 1018#L19-1 assume !!(gcd_test_~b != 0); 1017#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 1016#L20-2 assume true; 1015#L19-1 assume !!(gcd_test_~b != 0); 1014#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 1013#L20-2 assume true; 1012#L19-1 assume !!(gcd_test_~b != 0); 1009#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 1010#L20-2 assume true; 1011#L19-1 assume !!(gcd_test_~b != 0); 1006#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 1004#L20-2 assume true; 1000#L19-1 [2018-11-10 03:58:35,827 INFO L795 eck$LassoCheckResult]: Loop: 1000#L19-1 assume !!(gcd_test_~b != 0); 1001#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 1003#L20-2 assume true; 1000#L19-1 [2018-11-10 03:58:35,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:35,827 INFO L82 PathProgramCache]: Analyzing trace with hash -2070509043, now seen corresponding path program 5 times [2018-11-10 03:58:35,827 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:58:35,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:58:35,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:35,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:58:35,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:58:35,897 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:58:35,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:58:35,897 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aaa5fd40-3aa8-471b-ac04-d1736a763314/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:58:35,909 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 03:58:35,937 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-10 03:58:35,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:58:35,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:58:36,023 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:58:36,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:58:36,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-10 03:58:36,051 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:58:36,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:36,051 INFO L82 PathProgramCache]: Analyzing trace with hash 58737, now seen corresponding path program 7 times [2018-11-10 03:58:36,051 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:58:36,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:58:36,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:36,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:58:36,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:58:36,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 03:58:36,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-10 03:58:36,084 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. cyclomatic complexity: 6 Second operand 13 states. [2018-11-10 03:58:36,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:58:36,219 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2018-11-10 03:58:36,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 03:58:36,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 22 transitions. [2018-11-10 03:58:36,220 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 03:58:36,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2018-11-10 03:58:36,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 03:58:36,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 03:58:36,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 03:58:36,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:58:36,220 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:58:36,220 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:58:36,220 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:58:36,220 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 03:58:36,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 03:58:36,220 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 03:58:36,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 03:58:36,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 03:58:36 BoogieIcfgContainer [2018-11-10 03:58:36,225 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 03:58:36,225 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:58:36,225 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:58:36,225 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:58:36,225 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:58:31" (3/4) ... [2018-11-10 03:58:36,227 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 03:58:36,227 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:58:36,228 INFO L168 Benchmark]: Toolchain (without parser) took 5450.01 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.4 MB). Free memory was 953.8 MB in the beginning and 1.0 GB in the end (delta: -47.0 MB). Peak memory consumption was 177.4 MB. Max. memory is 11.5 GB. [2018-11-10 03:58:36,229 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:58:36,229 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.80 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:58:36,230 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.76 ms. Allocated memory is still 1.0 GB. Free memory is still 943.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:58:36,230 INFO L168 Benchmark]: Boogie Preprocessor took 15.41 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:58:36,230 INFO L168 Benchmark]: RCFGBuilder took 279.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-11-10 03:58:36,231 INFO L168 Benchmark]: BuchiAutomizer took 4956.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 79.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 128.8 MB). Peak memory consumption was 208.0 MB. Max. memory is 11.5 GB. [2018-11-10 03:58:36,231 INFO L168 Benchmark]: Witness Printer took 2.75 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. [2018-11-10 03:58:36,234 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 169.80 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.76 ms. Allocated memory is still 1.0 GB. Free memory is still 943.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.41 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 279.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4956.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 79.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 128.8 MB). Peak memory consumption was 208.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.75 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 (6 trivial, 1 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * a + 1 and consists of 6 locations. One nondeterministic module has affine ranking function -2 * a + 2 * b + 1 and consists of 8 locations. 6 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 9 iterations. TraceHistogramMax:7. Analysis of lassos took 3.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 30 states and ocurred in iteration 7. Nontrivial modules had stage [1, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 72 SDtfs, 137 SDslu, 149 SDs, 0 SdLazy, 301 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN3 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital32 mio100 ax100 hnf92 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq199 hnf91 smp100 dnf132 smp100 tf101 neg96 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 181ms VariablesStem: 6 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...