./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0ba88550-2761-461a-a1c6-00f3196e520e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0ba88550-2761-461a-a1c6-00f3196e520e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0ba88550-2761-461a-a1c6-00f3196e520e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0ba88550-2761-461a-a1c6-00f3196e520e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0ba88550-2761-461a-a1c6-00f3196e520e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0ba88550-2761-461a-a1c6-00f3196e520e/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 64bit --witnessprinter.graph.data.programhash 4c761fb15c9d367876fc9f1553874e9680fa1668 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 13:53:01,673 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 13:53:01,674 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 13:53:01,680 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 13:53:01,680 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 13:53:01,681 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 13:53:01,681 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 13:53:01,682 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 13:53:01,683 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 13:53:01,683 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 13:53:01,684 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 13:53:01,684 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 13:53:01,684 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 13:53:01,685 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 13:53:01,686 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 13:53:01,686 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 13:53:01,686 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 13:53:01,687 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 13:53:01,688 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 13:53:01,689 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 13:53:01,690 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 13:53:01,690 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 13:53:01,691 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 13:53:01,691 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 13:53:01,692 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 13:53:01,692 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 13:53:01,693 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 13:53:01,693 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 13:53:01,694 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 13:53:01,694 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 13:53:01,694 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 13:53:01,695 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 13:53:01,695 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 13:53:01,695 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 13:53:01,695 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 13:53:01,696 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 13:53:01,696 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0ba88550-2761-461a-a1c6-00f3196e520e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-01 13:53:01,703 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 13:53:01,703 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 13:53:01,704 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 13:53:01,704 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 13:53:01,704 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 13:53:01,704 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 13:53:01,704 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 13:53:01,705 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 13:53:01,705 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 13:53:01,705 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 13:53:01,705 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 13:53:01,705 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 13:53:01,705 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 13:53:01,705 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 13:53:01,705 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 13:53:01,705 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 13:53:01,705 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 13:53:01,706 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 13:53:01,706 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 13:53:01,706 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 13:53:01,706 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 13:53:01,706 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 13:53:01,706 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 13:53:01,706 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 13:53:01,706 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 13:53:01,706 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 13:53:01,706 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 13:53:01,706 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 13:53:01,707 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 13:53:01,707 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_0ba88550-2761-461a-a1c6-00f3196e520e/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4c761fb15c9d367876fc9f1553874e9680fa1668 [2018-12-01 13:53:01,725 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 13:53:01,733 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 13:53:01,736 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 13:53:01,737 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 13:53:01,737 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 13:53:01,738 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0ba88550-2761-461a-a1c6-00f3196e520e/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c [2018-12-01 13:53:01,782 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0ba88550-2761-461a-a1c6-00f3196e520e/bin-2019/uautomizer/data/b5d24034e/0b392df303254fa8b9f5ed7bd86500fa/FLAG00d9cd90e [2018-12-01 13:53:02,160 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 13:53:02,160 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0ba88550-2761-461a-a1c6-00f3196e520e/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c [2018-12-01 13:53:02,164 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0ba88550-2761-461a-a1c6-00f3196e520e/bin-2019/uautomizer/data/b5d24034e/0b392df303254fa8b9f5ed7bd86500fa/FLAG00d9cd90e [2018-12-01 13:53:02,171 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0ba88550-2761-461a-a1c6-00f3196e520e/bin-2019/uautomizer/data/b5d24034e/0b392df303254fa8b9f5ed7bd86500fa [2018-12-01 13:53:02,173 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 13:53:02,174 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 13:53:02,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 13:53:02,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 13:53:02,176 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 13:53:02,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 01:53:02" (1/1) ... [2018-12-01 13:53:02,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42aa496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:53:02, skipping insertion in model container [2018-12-01 13:53:02,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 01:53:02" (1/1) ... [2018-12-01 13:53:02,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 13:53:02,190 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 13:53:02,270 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 13:53:02,272 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 13:53:02,281 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 13:53:02,288 INFO L195 MainTranslator]: Completed translation [2018-12-01 13:53:02,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:53:02 WrapperNode [2018-12-01 13:53:02,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 13:53:02,289 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 13:53:02,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 13:53:02,289 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 13:53:02,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:53:02" (1/1) ... [2018-12-01 13:53:02,298 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:53:02" (1/1) ... [2018-12-01 13:53:02,308 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 13:53:02,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 13:53:02,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 13:53:02,308 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 13:53:02,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:53:02" (1/1) ... [2018-12-01 13:53:02,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:53:02" (1/1) ... [2018-12-01 13:53:02,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:53:02" (1/1) ... [2018-12-01 13:53:02,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:53:02" (1/1) ... [2018-12-01 13:53:02,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:53:02" (1/1) ... [2018-12-01 13:53:02,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:53:02" (1/1) ... [2018-12-01 13:53:02,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:53:02" (1/1) ... [2018-12-01 13:53:02,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 13:53:02,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 13:53:02,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 13:53:02,319 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 13:53:02,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:53:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba88550-2761-461a-a1c6-00f3196e520e/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-12-01 13:53:02,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 13:53:02,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 13:53:02,451 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 13:53:02,451 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-01 13:53:02,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:53:02 BoogieIcfgContainer [2018-12-01 13:53:02,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 13:53:02,452 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 13:53:02,452 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 13:53:02,454 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 13:53:02,455 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 13:53:02,455 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 01:53:02" (1/3) ... [2018-12-01 13:53:02,455 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75131f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 01:53:02, skipping insertion in model container [2018-12-01 13:53:02,455 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 13:53:02,455 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:53:02" (2/3) ... [2018-12-01 13:53:02,456 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75131f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 01:53:02, skipping insertion in model container [2018-12-01 13:53:02,456 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 13:53:02,456 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:53:02" (3/3) ... [2018-12-01 13:53:02,457 INFO L375 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c [2018-12-01 13:53:02,491 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 13:53:02,491 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 13:53:02,491 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 13:53:02,491 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 13:53:02,491 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 13:53:02,491 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 13:53:02,491 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 13:53:02,491 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 13:53:02,491 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 13:53:02,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2018-12-01 13:53:02,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 13:53:02,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 13:53:02,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 13:53:02,516 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 13:53:02,516 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 13:53:02,516 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 13:53:02,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2018-12-01 13:53:02,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 13:53:02,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 13:53:02,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 13:53:02,517 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 13:53:02,517 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 13:53:02,522 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 6#L17true assume main_~x~0 >= 0 && main_~y~0 >= 0; 7#L19-2true [2018-12-01 13:53:02,522 INFO L796 eck$LassoCheckResult]: Loop: 7#L19-2true assume !!(main_~x~0 - main_~y~0 > 2 || main_~y~0 - main_~x~0 > 2); 9#L19true assume main_~x~0 < main_~y~0;main_~x~0 := 1 + main_~x~0; 7#L19-2true [2018-12-01 13:53:02,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:53:02,526 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2018-12-01 13:53:02,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:53:02,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:53:02,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:53:02,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:53:02,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:53:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:53:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:53:02,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:53:02,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1380, now seen corresponding path program 1 times [2018-12-01 13:53:02,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:53:02,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:53:02,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:53:02,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:53:02,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:53:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:53:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:53:02,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:53:02,594 INFO L82 PathProgramCache]: Analyzing trace with hash 957575, now seen corresponding path program 1 times [2018-12-01 13:53:02,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:53:02,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:53:02,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:53:02,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:53:02,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:53:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:53:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:53:02,634 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 13:53:02,634 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 13:53:02,635 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 13:53:02,635 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 13:53:02,635 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 13:53:02,635 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 13:53:02,635 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 13:53:02,635 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 13:53:02,635 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c_Iteration1_Loop [2018-12-01 13:53:02,635 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 13:53:02,635 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 13:53:02,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:53:02,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:53:02,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:53:02,716 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 13:53:02,716 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba88550-2761-461a-a1c6-00f3196e520e/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-12-01 13:53:02,719 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 13:53:02,720 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 13:53:02,741 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 13:53:02,741 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba88550-2761-461a-a1c6-00f3196e520e/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-12-01 13:53:02,743 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 13:53:02,743 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 13:53:02,758 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 13:53:02,758 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba88550-2761-461a-a1c6-00f3196e520e/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-12-01 13:53:02,761 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 13:53:02,761 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba88550-2761-461a-a1c6-00f3196e520e/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-12-01 13:53:02,778 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 13:53:02,778 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 13:53:02,870 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 13:53:02,871 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 13:53:02,871 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 13:53:02,871 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 13:53:02,872 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 13:53:02,872 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 13:53:02,872 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 13:53:02,872 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 13:53:02,872 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 13:53:02,872 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c_Iteration1_Loop [2018-12-01 13:53:02,872 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 13:53:02,872 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 13:53:02,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:53:02,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:53:02,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:53:02,904 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 13:53:02,907 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 13:53:02,908 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-12-01 13:53:02,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:53:02,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:53:02,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:53:02,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:53:02,912 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:53:02,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:53:02,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:53:02,916 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-12-01 13:53:02,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:53:02,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:53:02,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:53:02,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:53:02,918 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:53:02,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:53:02,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:53:02,923 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-12-01 13:53:02,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:53:02,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:53:02,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:53:02,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:53:02,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:53:02,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:53:02,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:53:02,929 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 13:53:02,933 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 13:53:02,933 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 13:53:02,935 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 13:53:02,935 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 13:53:02,935 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 13:53:02,935 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~y~0 - 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-12-01 13:53:02,936 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 13:53:02,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:53:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:53:02,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:53:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:53:02,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:53:02,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:53:02,979 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-12-01 13:53:02,980 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 3 states. [2018-12-01 13:53:03,009 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 3 states. Result 28 states and 35 transitions. Complement of second has 6 states. [2018-12-01 13:53:03,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 13:53:03,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 13:53:03,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-01 13:53:03,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 2 letters. [2018-12-01 13:53:03,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 13:53:03,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-01 13:53:03,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 13:53:03,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 4 letters. [2018-12-01 13:53:03,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 13:53:03,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2018-12-01 13:53:03,016 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 13:53:03,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 8 states and 11 transitions. [2018-12-01 13:53:03,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-12-01 13:53:03,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-12-01 13:53:03,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2018-12-01 13:53:03,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 13:53:03,020 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2018-12-01 13:53:03,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2018-12-01 13:53:03,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-01 13:53:03,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-01 13:53:03,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-12-01 13:53:03,037 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2018-12-01 13:53:03,037 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2018-12-01 13:53:03,037 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 13:53:03,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2018-12-01 13:53:03,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 13:53:03,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 13:53:03,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 13:53:03,038 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-01 13:53:03,038 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 13:53:03,039 INFO L794 eck$LassoCheckResult]: Stem: 72#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 73#L17 assume main_~x~0 >= 0 && main_~y~0 >= 0; 74#L19-2 assume !!(main_~x~0 - main_~y~0 > 2 || main_~y~0 - main_~x~0 > 2); 79#L19 assume !(main_~x~0 < main_~y~0);main_~y~0 := 1 + main_~y~0; 75#L19-2 [2018-12-01 13:53:03,039 INFO L796 eck$LassoCheckResult]: Loop: 75#L19-2 assume !!(main_~x~0 - main_~y~0 > 2 || main_~y~0 - main_~x~0 > 2); 76#L19 assume main_~x~0 < main_~y~0;main_~x~0 := 1 + main_~x~0; 75#L19-2 [2018-12-01 13:53:03,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:53:03,039 INFO L82 PathProgramCache]: Analyzing trace with hash 957577, now seen corresponding path program 1 times [2018-12-01 13:53:03,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:53:03,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:53:03,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:53:03,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:53:03,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:53:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:53:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:53:03,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:53:03,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1380, now seen corresponding path program 2 times [2018-12-01 13:53:03,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:53:03,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:53:03,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:53:03,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:53:03,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:53:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:53:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:53:03,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:53:03,055 INFO L82 PathProgramCache]: Analyzing trace with hash 920231916, now seen corresponding path program 1 times [2018-12-01 13:53:03,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:53:03,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:53:03,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:53:03,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 13:53:03,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:53:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:53:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:53:03,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:53:03,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 13:53:03,119 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 13:53:03,119 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 13:53:03,119 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 13:53:03,120 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 13:53:03,120 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 13:53:03,120 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 13:53:03,120 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 13:53:03,120 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 13:53:03,120 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c_Iteration2_Loop [2018-12-01 13:53:03,120 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 13:53:03,120 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 13:53:03,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:53:03,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:53:03,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:53:03,169 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 13:53:03,169 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba88550-2761-461a-a1c6-00f3196e520e/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-12-01 13:53:03,175 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 13:53:03,175 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 13:53:03,190 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 13:53:03,190 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba88550-2761-461a-a1c6-00f3196e520e/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-12-01 13:53:03,192 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 13:53:03,192 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba88550-2761-461a-a1c6-00f3196e520e/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 13:53:03,208 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 13:53:03,208 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 13:53:03,318 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 13:53:03,320 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 13:53:03,320 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 13:53:03,320 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 13:53:03,320 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 13:53:03,320 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 13:53:03,320 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 13:53:03,320 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 13:53:03,320 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 13:53:03,320 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c_Iteration2_Loop [2018-12-01 13:53:03,320 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 13:53:03,320 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 13:53:03,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:53:03,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:53:03,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:53:03,365 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 13:53:03,366 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 13:53:03,366 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-12-01 13:53:03,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:53:03,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:53:03,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:53:03,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:53:03,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 13:53:03,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 13:53:03,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 13:53:03,370 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-12-01 13:53:03,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:53:03,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:53:03,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:53:03,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:53:03,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:53:03,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:53:03,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:53:03,374 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 13:53:03,376 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 13:53:03,377 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 13:53:03,377 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 13:53:03,377 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 13:53:03,377 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 13:53:03,377 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~y~0 - 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-12-01 13:53:03,377 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 13:53:03,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:53:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:53:03,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:53:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:53:03,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:53:03,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:53:03,392 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-12-01 13:53:03,392 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-01 13:53:03,398 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 12 states and 17 transitions. Complement of second has 5 states. [2018-12-01 13:53:03,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 13:53:03,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 13:53:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-12-01 13:53:03,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-01 13:53:03,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 13:53:03,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2018-12-01 13:53:03,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 13:53:03,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2018-12-01 13:53:03,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 13:53:03,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2018-12-01 13:53:03,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 13:53:03,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 17 transitions. [2018-12-01 13:53:03,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-01 13:53:03,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-01 13:53:03,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2018-12-01 13:53:03,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 13:53:03,401 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-12-01 13:53:03,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2018-12-01 13:53:03,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-01 13:53:03,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-01 13:53:03,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-12-01 13:53:03,402 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-12-01 13:53:03,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 13:53:03,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 13:53:03,405 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand 5 states. [2018-12-01 13:53:03,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:53:03,419 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-12-01 13:53:03,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 13:53:03,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2018-12-01 13:53:03,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 13:53:03,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 10 states and 12 transitions. [2018-12-01 13:53:03,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-01 13:53:03,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-01 13:53:03,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2018-12-01 13:53:03,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 13:53:03,420 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-01 13:53:03,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2018-12-01 13:53:03,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2018-12-01 13:53:03,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-01 13:53:03,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-12-01 13:53:03,421 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-12-01 13:53:03,421 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-12-01 13:53:03,421 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 13:53:03,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2018-12-01 13:53:03,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 13:53:03,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 13:53:03,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 13:53:03,422 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-01 13:53:03,422 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 13:53:03,422 INFO L794 eck$LassoCheckResult]: Stem: 156#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 157#L17 assume main_~x~0 >= 0 && main_~y~0 >= 0; 158#L19-2 assume !!(main_~x~0 - main_~y~0 > 2 || main_~y~0 - main_~x~0 > 2); 160#L19 [2018-12-01 13:53:03,422 INFO L796 eck$LassoCheckResult]: Loop: 160#L19 assume !(main_~x~0 < main_~y~0);main_~y~0 := 1 + main_~y~0; 159#L19-2 assume !!(main_~x~0 - main_~y~0 > 2 || main_~y~0 - main_~x~0 > 2); 160#L19 [2018-12-01 13:53:03,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:53:03,422 INFO L82 PathProgramCache]: Analyzing trace with hash 30889, now seen corresponding path program 1 times [2018-12-01 13:53:03,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:53:03,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:53:03,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:53:03,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:53:03,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:53:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:53:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:53:03,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:53:03,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1532, now seen corresponding path program 1 times [2018-12-01 13:53:03,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:53:03,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:53:03,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:53:03,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:53:03,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:53:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:53:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:53:03,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:53:03,431 INFO L82 PathProgramCache]: Analyzing trace with hash 29684900, now seen corresponding path program 2 times [2018-12-01 13:53:03,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:53:03,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:53:03,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:53:03,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:53:03,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:53:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:53:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:53:03,454 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 13:53:03,454 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 13:53:03,454 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 13:53:03,454 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 13:53:03,454 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 13:53:03,454 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 13:53:03,454 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 13:53:03,454 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 13:53:03,454 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c_Iteration3_Loop [2018-12-01 13:53:03,454 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 13:53:03,455 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 13:53:03,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:53:03,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:53:03,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:53:03,484 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 13:53:03,485 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba88550-2761-461a-a1c6-00f3196e520e/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 13:53:03,486 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 13:53:03,486 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 13:53:03,501 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 13:53:03,501 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba88550-2761-461a-a1c6-00f3196e520e/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-12-01 13:53:03,504 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 13:53:03,504 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba88550-2761-461a-a1c6-00f3196e520e/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-12-01 13:53:03,520 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 13:53:03,520 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 13:53:03,724 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 13:53:03,725 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 13:53:03,726 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 13:53:03,726 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 13:53:03,726 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 13:53:03,726 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 13:53:03,726 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 13:53:03,726 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 13:53:03,726 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 13:53:03,726 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c_Iteration3_Loop [2018-12-01 13:53:03,726 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 13:53:03,726 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 13:53:03,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:53:03,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:53:03,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:53:03,762 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 13:53:03,762 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 13:53:03,762 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-12-01 13:53:03,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:53:03,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:53:03,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:53:03,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:53:03,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:53:03,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:53:03,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:53:03,765 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 13:53:03,768 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 13:53:03,769 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 13:53:03,769 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 13:53:03,769 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 13:53:03,769 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 13:53:03,769 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~y~0 + 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-12-01 13:53:03,769 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 13:53:03,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:53:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:53:03,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:53:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:53:03,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:53:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:53:03,794 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-01 13:53:03,795 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-12-01 13:53:03,800 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 12 states and 14 transitions. Complement of second has 5 states. [2018-12-01 13:53:03,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 13:53:03,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 13:53:03,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-12-01 13:53:03,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2018-12-01 13:53:03,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 13:53:03,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-01 13:53:03,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 13:53:03,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2018-12-01 13:53:03,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 13:53:03,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2018-12-01 13:53:03,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 13:53:03,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 9 transitions. [2018-12-01 13:53:03,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-12-01 13:53:03,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-12-01 13:53:03,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2018-12-01 13:53:03,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 13:53:03,802 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-12-01 13:53:03,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2018-12-01 13:53:03,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-12-01 13:53:03,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-01 13:53:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-01 13:53:03,803 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-01 13:53:03,803 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-01 13:53:03,803 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 13:53:03,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2018-12-01 13:53:03,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 13:53:03,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 13:53:03,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 13:53:03,804 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2018-12-01 13:53:03,804 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 13:53:03,804 INFO L794 eck$LassoCheckResult]: Stem: 211#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 212#L17 assume main_~x~0 >= 0 && main_~y~0 >= 0; 213#L19-2 assume !!(main_~x~0 - main_~y~0 > 2 || main_~y~0 - main_~x~0 > 2); 214#L19 assume main_~x~0 < main_~y~0;main_~x~0 := 1 + main_~x~0; 215#L19-2 assume !!(main_~x~0 - main_~y~0 > 2 || main_~y~0 - main_~x~0 > 2); 216#L19 [2018-12-01 13:53:03,804 INFO L796 eck$LassoCheckResult]: Loop: 216#L19 assume !(main_~x~0 < main_~y~0);main_~y~0 := 1 + main_~y~0; 217#L19-2 assume !!(main_~x~0 - main_~y~0 > 2 || main_~y~0 - main_~x~0 > 2); 216#L19 [2018-12-01 13:53:03,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:53:03,804 INFO L82 PathProgramCache]: Analyzing trace with hash 29684838, now seen corresponding path program 2 times [2018-12-01 13:53:03,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:53:03,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:53:03,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:53:03,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 13:53:03,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:53:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:53:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:53:03,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:53:03,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1532, now seen corresponding path program 2 times [2018-12-01 13:53:03,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:53:03,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:53:03,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:53:03,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 13:53:03,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:53:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:53:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 13:53:03,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:53:03,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1537641183, now seen corresponding path program 2 times [2018-12-01 13:53:03,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:53:03,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:53:03,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:53:03,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 13:53:03,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:53:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:53:03,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:53:03,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:53:03,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 13:53:03,859 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 13:53:03,859 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 13:53:03,859 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 13:53:03,859 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 13:53:03,859 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 13:53:03,859 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 13:53:03,859 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 13:53:03,859 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 13:53:03,859 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c_Iteration4_Loop [2018-12-01 13:53:03,860 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 13:53:03,860 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 13:53:03,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:53:03,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:53:03,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:53:03,892 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 13:53:03,892 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba88550-2761-461a-a1c6-00f3196e520e/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-12-01 13:53:03,894 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 13:53:03,894 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba88550-2761-461a-a1c6-00f3196e520e/bin-2019/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 13:53:03,910 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 13:53:03,910 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 13:53:04,114 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 13:53:04,115 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 13:53:04,115 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 13:53:04,116 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 13:53:04,116 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 13:53:04,116 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 13:53:04,116 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 13:53:04,116 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 13:53:04,116 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 13:53:04,116 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise_true-termination_true-no-overflow.c_Iteration4_Loop [2018-12-01 13:53:04,116 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 13:53:04,116 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 13:53:04,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:53:04,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:53:04,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 13:53:04,151 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 13:53:04,151 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 13:53:04,152 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-12-01 13:53:04,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 13:53:04,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 13:53:04,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 13:53:04,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 13:53:04,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 13:53:04,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 13:53:04,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 13:53:04,155 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 13:53:04,157 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 13:53:04,157 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 13:53:04,157 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 13:53:04,157 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 13:53:04,157 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 13:53:04,157 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~y~0 + 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-12-01 13:53:04,157 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 13:53:04,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:53:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:53:04,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:53:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:53:04,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:53:04,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:53:04,178 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-01 13:53:04,179 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-12-01 13:53:04,181 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 8 states and 9 transitions. Complement of second has 3 states. [2018-12-01 13:53:04,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2018-12-01 13:53:04,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 13:53:04,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2018-12-01 13:53:04,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-01 13:53:04,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 13:53:04,182 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 13:53:04,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:53:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:53:04,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:53:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:53:04,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:53:04,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:53:04,203 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-01 13:53:04,204 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-12-01 13:53:04,206 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 8 states and 9 transitions. Complement of second has 3 states. [2018-12-01 13:53:04,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2018-12-01 13:53:04,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 13:53:04,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2018-12-01 13:53:04,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-01 13:53:04,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 13:53:04,207 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 13:53:04,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:53:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:53:04,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:53:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:53:04,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:53:04,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:53:04,233 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-01 13:53:04,233 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-12-01 13:53:04,238 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 9 states and 10 transitions. Complement of second has 4 states. [2018-12-01 13:53:04,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 13:53:04,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 13:53:04,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-12-01 13:53:04,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-01 13:53:04,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 13:53:04,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-01 13:53:04,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 13:53:04,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-01 13:53:04,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 13:53:04,240 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2018-12-01 13:53:04,240 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 13:53:04,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2018-12-01 13:53:04,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 13:53:04,240 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 13:53:04,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 13:53:04,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 13:53:04,241 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 13:53:04,241 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 13:53:04,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 13:53:04,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 13:53:04,241 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2018-12-01 13:53:04,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:53:04,241 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-01 13:53:04,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-01 13:53:04,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-12-01 13:53:04,242 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 13:53:04,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-12-01 13:53:04,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 13:53:04,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 13:53:04,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 13:53:04,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 13:53:04,242 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 13:53:04,242 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 13:53:04,242 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 13:53:04,242 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 13:53:04,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 13:53:04,242 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 13:53:04,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 13:53:04,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 01:53:04 BoogieIcfgContainer [2018-12-01 13:53:04,246 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 13:53:04,247 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 13:53:04,247 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 13:53:04,247 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 13:53:04,247 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:53:02" (3/4) ... [2018-12-01 13:53:04,249 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 13:53:04,249 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 13:53:04,250 INFO L168 Benchmark]: Toolchain (without parser) took 2076.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 959.7 MB in the beginning and 855.5 MB in the end (delta: 104.3 MB). Peak memory consumption was 224.3 MB. Max. memory is 11.5 GB. [2018-12-01 13:53:04,251 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 13:53:04,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 114.58 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 949.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-01 13:53:04,251 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.94 ms. Allocated memory is still 1.0 GB. Free memory was 949.0 MB in the beginning and 947.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2018-12-01 13:53:04,252 INFO L168 Benchmark]: Boogie Preprocessor took 10.57 ms. Allocated memory is still 1.0 GB. Free memory was 947.9 MB in the beginning and 945.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-01 13:53:04,252 INFO L168 Benchmark]: RCFGBuilder took 132.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -157.9 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-12-01 13:53:04,252 INFO L168 Benchmark]: BuchiAutomizer took 1794.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 855.5 MB in the end (delta: 247.7 MB). Peak memory consumption was 247.7 MB. Max. memory is 11.5 GB. [2018-12-01 13:53:04,253 INFO L168 Benchmark]: Witness Printer took 2.68 ms. Allocated memory is still 1.1 GB. Free memory is still 855.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 13:53:04,255 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 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 114.58 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 949.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 18.94 ms. Allocated memory is still 1.0 GB. Free memory was 949.0 MB in the beginning and 947.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.57 ms. Allocated memory is still 1.0 GB. Free memory was 947.9 MB in the beginning and 945.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 132.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -157.9 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1794.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 855.5 MB in the end (delta: 247.7 MB). Peak memory consumption was 247.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.68 ms. Allocated memory is still 1.1 GB. Free memory is still 855.5 MB. 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 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function y + -1 * x and consists of 4 locations. One deterministic module has affine ranking function y + -1 * x and consists of 3 locations. One deterministic module has affine ranking function -1 * y + x and consists of 3 locations. One nondeterministic module has affine ranking function -1 * y + x and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 8 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 31 SDtfs, 29 SDslu, 3 SDs, 0 SdLazy, 44 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax200 hnf100 lsp50 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...