./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-loops_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-loops_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 1b43ce72b37c8e17b4dbab62d6d09279867a7da3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:16:03,433 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:16:03,435 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:16:03,448 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:16:03,448 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:16:03,449 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:16:03,451 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:16:03,453 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:16:03,455 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:16:03,456 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:16:03,457 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:16:03,457 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:16:03,459 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:16:03,460 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:16:03,461 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:16:03,462 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:16:03,463 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:16:03,465 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:16:03,468 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:16:03,470 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:16:03,472 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:16:03,473 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:16:03,476 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:16:03,476 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:16:03,476 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:16:03,478 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:16:03,479 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:16:03,480 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:16:03,481 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:16:03,482 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:16:03,482 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:16:03,483 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:16:03,483 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:16:03,484 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:16:03,485 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:16:03,485 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:16:03,486 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:16:03,503 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:16:03,504 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:16:03,505 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:16:03,505 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:16:03,505 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:16:03,506 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:16:03,506 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:16:03,506 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:16:03,506 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:16:03,506 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:16:03,507 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:16:03,507 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:16:03,507 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:16:03,507 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:16:03,507 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:16:03,507 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:16:03,508 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:16:03,508 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:16:03,508 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:16:03,508 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:16:03,508 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:16:03,509 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:16:03,509 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:16:03,509 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:16:03,509 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:16:03,509 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:16:03,509 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:16:03,510 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:16:03,511 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:16:03,511 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 1b43ce72b37c8e17b4dbab62d6d09279867a7da3 [2019-01-14 02:16:03,555 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:16:03,570 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:16:03,576 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:16:03,579 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:16:03,580 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:16:03,581 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-loops_true-termination_true-no-overflow.c [2019-01-14 02:16:03,650 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2813c7ae/85888e9b27fa4cce8358762ab6332b9a/FLAG3720130e2 [2019-01-14 02:16:04,100 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:16:04,101 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-loops_true-termination_true-no-overflow.c [2019-01-14 02:16:04,108 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2813c7ae/85888e9b27fa4cce8358762ab6332b9a/FLAG3720130e2 [2019-01-14 02:16:04,481 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2813c7ae/85888e9b27fa4cce8358762ab6332b9a [2019-01-14 02:16:04,486 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:16:04,488 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:16:04,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:16:04,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:16:04,493 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:16:04,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:16:04" (1/1) ... [2019-01-14 02:16:04,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@302c1a03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:04, skipping insertion in model container [2019-01-14 02:16:04,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:16:04" (1/1) ... [2019-01-14 02:16:04,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:16:04,530 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:16:04,753 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:16:04,760 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:16:04,790 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:16:04,807 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:16:04,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:04 WrapperNode [2019-01-14 02:16:04,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:16:04,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:16:04,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:16:04,810 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:16:04,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:04" (1/1) ... [2019-01-14 02:16:04,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:04" (1/1) ... [2019-01-14 02:16:04,857 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:16:04,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:16:04,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:16:04,858 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:16:04,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:04" (1/1) ... [2019-01-14 02:16:04,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:04" (1/1) ... [2019-01-14 02:16:04,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:04" (1/1) ... [2019-01-14 02:16:04,871 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:04" (1/1) ... [2019-01-14 02:16:04,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:04" (1/1) ... [2019-01-14 02:16:04,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:04" (1/1) ... [2019-01-14 02:16:04,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:04" (1/1) ... [2019-01-14 02:16:04,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:16:04,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:16:04,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:16:04,886 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:16:04,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:05,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:16:05,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:16:05,264 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:16:05,264 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 02:16:05,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:16:05 BoogieIcfgContainer [2019-01-14 02:16:05,266 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:16:05,266 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:16:05,266 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:16:05,270 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:16:05,271 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:16:05,271 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:16:04" (1/3) ... [2019-01-14 02:16:05,273 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a4aa29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:16:05, skipping insertion in model container [2019-01-14 02:16:05,273 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:16:05,273 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:16:04" (2/3) ... [2019-01-14 02:16:05,273 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a4aa29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:16:05, skipping insertion in model container [2019-01-14 02:16:05,274 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:16:05,274 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:16:05" (3/3) ... [2019-01-14 02:16:05,276 INFO L375 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-loops_true-termination_true-no-overflow.c [2019-01-14 02:16:05,344 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:16:05,345 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:16:05,345 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:16:05,346 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:16:05,346 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:16:05,346 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:16:05,346 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:16:05,346 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:16:05,346 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:16:05,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-01-14 02:16:05,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:16:05,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:05,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:05,446 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:16:05,446 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:16:05,447 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:16:05,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-01-14 02:16:05,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:16:05,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:05,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:05,452 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:16:05,452 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:16:05,466 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~n~0;havoc main_~x~0;havoc main_~y~0;havoc main_~n~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~x~0 := main_~n~0; 8#L18true assume main_~x~0 >= 0 && main_~x~0 <= 1073741823; 5#L19-2true [2019-01-14 02:16:05,467 INFO L796 eck$LassoCheckResult]: Loop: 5#L19-2true assume !!(main_~x~0 >= 0);main_~y~0 := 1; 3#L21true assume !(main_~y~0 < main_~x~0); 12#L21-1true main_~x~0 := main_~x~0 - 1; 5#L19-2true [2019-01-14 02:16:05,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:05,477 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2019-01-14 02:16:05,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:05,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:05,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:05,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:05,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:05,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:05,607 INFO L82 PathProgramCache]: Analyzing trace with hash 43246, now seen corresponding path program 1 times [2019-01-14 02:16:05,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:05,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:05,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:05,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:05,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:05,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:05,624 INFO L82 PathProgramCache]: Analyzing trace with hash 29685291, now seen corresponding path program 1 times [2019-01-14 02:16:05,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:05,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:05,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:05,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:05,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:05,748 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:05,750 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:05,750 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:05,750 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:05,751 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:16:05,751 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:05,751 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:05,751 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:05,751 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-loops_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:16:05,751 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:05,752 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:05,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:05,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:05,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:06,088 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:06,089 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:06,095 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:06,095 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:06,135 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:06,136 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:06,144 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:06,144 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:06,166 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:06,166 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:06,174 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:06,174 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:16:06,204 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:16:06,204 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:06,235 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:16:06,237 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:06,237 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:06,237 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:06,237 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:06,238 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:16:06,238 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:06,238 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:06,238 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:06,238 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-loops_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-14 02:16:06,239 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:06,239 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:06,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:06,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:06,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:06,701 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 02:16:06,703 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:06,710 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:16:06,712 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 [2019-01-14 02:16:06,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:06,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:06,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:06,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:06,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:06,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:06,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:06,742 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 [2019-01-14 02:16:06,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:06,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:06,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:06,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:06,753 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:06,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:06,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:06,779 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 [2019-01-14 02:16:06,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:06,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:06,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:06,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:06,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:06,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:06,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:06,808 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:16:06,823 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:16:06,828 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:16:06,831 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:16:06,835 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:16:06,835 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:16:06,836 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 2*ULTIMATE.start_main_~x~0 + 1 Supporting invariants [] [2019-01-14 02:16:06,841 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:16:06,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:06,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:06,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:07,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:07,086 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 [2019-01-14 02:16:07,087 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states. Second operand 3 states. [2019-01-14 02:16:07,209 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states.. Second operand 3 states. Result 30 states and 44 transitions. Complement of second has 7 states. [2019-01-14 02:16:07,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:07,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:16:07,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2019-01-14 02:16:07,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 2 letters. Loop has 3 letters. [2019-01-14 02:16:07,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:07,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-14 02:16:07,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:07,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-14 02:16:07,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:07,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 44 transitions. [2019-01-14 02:16:07,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:16:07,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 9 states and 13 transitions. [2019-01-14 02:16:07,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-14 02:16:07,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-14 02:16:07,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2019-01-14 02:16:07,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:16:07,244 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-01-14 02:16:07,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2019-01-14 02:16:07,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-14 02:16:07,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 02:16:07,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2019-01-14 02:16:07,280 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-01-14 02:16:07,280 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-01-14 02:16:07,280 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:16:07,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 13 transitions. [2019-01-14 02:16:07,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:16:07,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:07,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:07,284 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:16:07,286 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:16:07,286 INFO L794 eck$LassoCheckResult]: Stem: 87#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~n~0;havoc main_~x~0;havoc main_~y~0;havoc main_~n~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~x~0 := main_~n~0; 88#L18 assume main_~x~0 >= 0 && main_~x~0 <= 1073741823; 89#L19-2 assume !!(main_~x~0 >= 0);main_~y~0 := 1; 82#L21 assume main_~y~0 < main_~x~0; 83#L22-2 [2019-01-14 02:16:07,286 INFO L796 eck$LassoCheckResult]: Loop: 83#L22-2 assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; 83#L22-2 [2019-01-14 02:16:07,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:07,287 INFO L82 PathProgramCache]: Analyzing trace with hash 957575, now seen corresponding path program 1 times [2019-01-14 02:16:07,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:07,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:07,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:07,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:07,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:07,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:07,317 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 1 times [2019-01-14 02:16:07,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:07,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:07,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:07,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:07,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:07,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:07,343 INFO L82 PathProgramCache]: Analyzing trace with hash 29684850, now seen corresponding path program 1 times [2019-01-14 02:16:07,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:07,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:07,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:07,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:07,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:07,477 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:07,478 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:07,478 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:07,478 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:07,478 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:16:07,478 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:07,478 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:07,478 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:07,479 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-loops_true-termination_true-no-overflow.c_Iteration2_Lasso [2019-01-14 02:16:07,479 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:07,479 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:07,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:07,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:07,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:07,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:07,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:07,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:08,086 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 02:16:08,095 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:08,095 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:16:08,104 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:08,104 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:08,124 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:08,124 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:08,130 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:08,130 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:08,140 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:08,140 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:08,174 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:08,174 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:08,177 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:08,177 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:08,199 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:08,199 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:08,205 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:08,206 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:16:08,231 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:08,231 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:08,257 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:08,258 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:16:08,262 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:08,263 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:08,291 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:16:08,291 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:20,418 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-14 02:16:20,426 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:20,426 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:20,426 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:20,427 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:20,427 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:16:20,427 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:20,427 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:20,427 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:20,427 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-loops_true-termination_true-no-overflow.c_Iteration2_Lasso [2019-01-14 02:16:20,427 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:20,430 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:20,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:20,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:20,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:20,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:20,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:20,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:20,844 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:20,844 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:16:20,845 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 [2019-01-14 02:16:20,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:20,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:20,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:20,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:20,852 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:20,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:20,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:20,859 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 [2019-01-14 02:16:20,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:20,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:20,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:20,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:20,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:20,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:20,994 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:16:21,037 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 02:16:21,037 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:16:21,040 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:16:21,044 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2019-01-14 02:16:21,044 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:16:21,045 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = -2*ULTIMATE.start_main_~y~0 + 2147483645 Supporting invariants [1*ULTIMATE.start_main_~y~0 - 1 >= 0, -1*ULTIMATE.start_main_~x~0 + 1073741823 >= 0] [2019-01-14 02:16:21,101 INFO L297 tatePredicateManager]: 0 out of 2 supporting invariants were superfluous and have been removed [2019-01-14 02:16:21,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:21,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:21,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:21,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:21,565 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates [2019-01-14 02:16:21,565 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-14 02:16:21,745 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 20 states and 28 transitions. Complement of second has 7 states. [2019-01-14 02:16:21,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:21,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:16:21,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-01-14 02:16:21,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 4 letters. Loop has 1 letters. [2019-01-14 02:16:21,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:21,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-14 02:16:21,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:21,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:16:21,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:21,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 28 transitions. [2019-01-14 02:16:21,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:16:21,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 21 transitions. [2019-01-14 02:16:21,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-14 02:16:21,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-14 02:16:21,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2019-01-14 02:16:21,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:16:21,753 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-01-14 02:16:21,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2019-01-14 02:16:21,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2019-01-14 02:16:21,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 02:16:21,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-01-14 02:16:21,755 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 02:16:21,755 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 02:16:21,755 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:16:21,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-01-14 02:16:21,756 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:16:21,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:21,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:21,757 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-01-14 02:16:21,757 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:16:21,758 INFO L794 eck$LassoCheckResult]: Stem: 169#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~n~0;havoc main_~x~0;havoc main_~y~0;havoc main_~n~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~x~0 := main_~n~0; 170#L18 assume main_~x~0 >= 0 && main_~x~0 <= 1073741823; 171#L19-2 assume !!(main_~x~0 >= 0);main_~y~0 := 1; 172#L21 assume main_~y~0 < main_~x~0; 167#L22-2 assume !(main_~y~0 < main_~x~0); 168#L21-1 main_~x~0 := main_~x~0 - 1; 174#L19-2 assume !!(main_~x~0 >= 0);main_~y~0 := 1; 164#L21 assume main_~y~0 < main_~x~0; 165#L22-2 [2019-01-14 02:16:21,758 INFO L796 eck$LassoCheckResult]: Loop: 165#L22-2 assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; 165#L22-2 [2019-01-14 02:16:21,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:21,758 INFO L82 PathProgramCache]: Analyzing trace with hash -421925037, now seen corresponding path program 1 times [2019-01-14 02:16:21,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:21,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:21,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:21,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:21,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:21,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:16:21,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:16:21,808 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:16:21,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:21,808 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 2 times [2019-01-14 02:16:21,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:21,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:21,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:21,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:21,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:21,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:16:21,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:16:21,839 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-14 02:16:21,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:16:21,868 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2019-01-14 02:16:21,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:16:21,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 18 transitions. [2019-01-14 02:16:21,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:16:21,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 18 transitions. [2019-01-14 02:16:21,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:16:21,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-14 02:16:21,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2019-01-14 02:16:21,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:16:21,873 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-01-14 02:16:21,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2019-01-14 02:16:21,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-14 02:16:21,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 02:16:21,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-01-14 02:16:21,876 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 02:16:21,876 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 02:16:21,877 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:16:21,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-01-14 02:16:21,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:16:21,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:21,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:21,879 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2019-01-14 02:16:21,879 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:16:21,879 INFO L794 eck$LassoCheckResult]: Stem: 201#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~n~0;havoc main_~x~0;havoc main_~y~0;havoc main_~n~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~x~0 := main_~n~0; 202#L18 assume main_~x~0 >= 0 && main_~x~0 <= 1073741823; 203#L19-2 assume !!(main_~x~0 >= 0);main_~y~0 := 1; 198#L21 assume main_~y~0 < main_~x~0; 199#L22-2 assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; 205#L22-2 assume !(main_~y~0 < main_~x~0); 208#L21-1 main_~x~0 := main_~x~0 - 1; 206#L19-2 assume !!(main_~x~0 >= 0);main_~y~0 := 1; 196#L21 assume main_~y~0 < main_~x~0; 197#L22-2 [2019-01-14 02:16:21,879 INFO L796 eck$LassoCheckResult]: Loop: 197#L22-2 assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; 197#L22-2 [2019-01-14 02:16:21,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:21,880 INFO L82 PathProgramCache]: Analyzing trace with hash -193177154, now seen corresponding path program 1 times [2019-01-14 02:16:21,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:21,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:21,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:21,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:21,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:22,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:16:22,012 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:16:22,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:22,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:22,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:22,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:16:22,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 02:16:22,130 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:16:22,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:22,130 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 3 times [2019-01-14 02:16:22,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:22,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:22,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:22,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:16:22,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:22,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 02:16:22,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-14 02:16:22,212 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 7 Second operand 8 states. [2019-01-14 02:16:22,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:16:22,436 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2019-01-14 02:16:22,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 02:16:22,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2019-01-14 02:16:22,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:16:22,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 14 states and 16 transitions. [2019-01-14 02:16:22,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 02:16:22,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:16:22,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2019-01-14 02:16:22,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:16:22,442 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-14 02:16:22,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2019-01-14 02:16:22,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 11. [2019-01-14 02:16:22,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 02:16:22,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-01-14 02:16:22,445 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-14 02:16:22,445 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-14 02:16:22,445 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:16:22,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2019-01-14 02:16:22,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:16:22,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:16:22,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:16:22,446 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2019-01-14 02:16:22,447 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:16:22,448 INFO L794 eck$LassoCheckResult]: Stem: 283#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~n~0;havoc main_~x~0;havoc main_~y~0;havoc main_~n~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~x~0 := main_~n~0; 284#L18 assume main_~x~0 >= 0 && main_~x~0 <= 1073741823; 285#L19-2 assume !!(main_~x~0 >= 0);main_~y~0 := 1; 281#L21 assume main_~y~0 < main_~x~0; 282#L22-2 assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; 287#L22-2 assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; 289#L22-2 assume !(main_~y~0 < main_~x~0); 288#L21-1 main_~x~0 := main_~x~0 - 1; 286#L19-2 assume !!(main_~x~0 >= 0);main_~y~0 := 1; 279#L21 assume main_~y~0 < main_~x~0; 280#L22-2 [2019-01-14 02:16:22,448 INFO L796 eck$LassoCheckResult]: Loop: 280#L22-2 assume !!(main_~y~0 < main_~x~0);main_~y~0 := 2 * main_~y~0; 280#L22-2 [2019-01-14 02:16:22,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:22,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1691927373, now seen corresponding path program 2 times [2019-01-14 02:16:22,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:22,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:22,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:22,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:22,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:22,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:22,466 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 4 times [2019-01-14 02:16:22,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:22,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:22,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:22,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:22,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:22,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:22,477 INFO L82 PathProgramCache]: Analyzing trace with hash -910140986, now seen corresponding path program 3 times [2019-01-14 02:16:22,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:16:22,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:16:22,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:22,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:16:22,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:16:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:16:22,762 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:22,762 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:22,762 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:22,763 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:22,763 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:16:22,763 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:22,763 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:22,763 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:22,764 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-loops_true-termination_true-no-overflow.c_Iteration5_Lasso [2019-01-14 02:16:22,764 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:22,764 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:22,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:22,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:22,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:22,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:22,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:22,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:22,920 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:22,921 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:22,927 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:22,927 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:22,932 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:22,932 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:22,954 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:22,954 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:22,958 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:22,958 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:22,982 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:22,982 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:22,985 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:22,985 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:23,008 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:23,009 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:23,029 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:16:23,030 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:23,037 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:16:23,037 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:23,064 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:16:23,064 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:16:23,166 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:16:23,169 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:16:23,169 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:16:23,169 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:16:23,169 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:16:23,169 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:16:23,169 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:16:23,169 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:16:23,170 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:16:23,170 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-loops_true-termination_true-no-overflow.c_Iteration5_Lasso [2019-01-14 02:16:23,170 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:16:23,170 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:16:23,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:23,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:23,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:23,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:23,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:23,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:16:23,373 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:16:23,373 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:16:23,374 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 [2019-01-14 02:16:23,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:23,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:23,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:23,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:23,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:23,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:23,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:23,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:23,381 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 [2019-01-14 02:16:23,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:23,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:23,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:23,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:23,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:23,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:23,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:23,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:23,384 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 [2019-01-14 02:16:23,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:23,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:16:23,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:23,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:23,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:23,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:16:23,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:16:23,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:23,387 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 [2019-01-14 02:16:23,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:23,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:23,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:23,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:23,389 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:23,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:23,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:16:23,395 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 [2019-01-14 02:16:23,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:16:23,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:16:23,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:16:23,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:16:23,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:16:23,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:16:23,466 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:16:23,496 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-14 02:16:23,497 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 02:16:23,498 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:16:23,501 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 02:16:23,502 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:16:23,503 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 [1*ULTIMATE.start_main_~y~0 - 1 >= 0] [2019-01-14 02:16:23,535 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 02:16:23,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:23,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:23,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:23,630 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-14 02:16:23,631 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-14 02:16:23,719 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 19 states and 23 transitions. Complement of second has 6 states. [2019-01-14 02:16:23,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:23,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:16:23,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-01-14 02:16:23,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 10 letters. Loop has 1 letters. [2019-01-14 02:16:23,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:23,723 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:16:23,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:23,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:23,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:23,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:23,842 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-14 02:16:23,842 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-14 02:16:23,874 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 19 states and 23 transitions. Complement of second has 6 states. [2019-01-14 02:16:23,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:23,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:16:23,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-01-14 02:16:23,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 10 letters. Loop has 1 letters. [2019-01-14 02:16:23,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:23,877 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:16:23,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:16:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:23,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:16:23,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:16:23,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:16:23,918 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-14 02:16:23,918 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-14 02:16:23,995 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 14 states and 16 transitions. Complement of second has 5 states. [2019-01-14 02:16:23,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:16:23,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:16:23,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-14 02:16:23,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 1 letters. [2019-01-14 02:16:23,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:23,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 11 letters. Loop has 1 letters. [2019-01-14 02:16:23,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:23,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2019-01-14 02:16:23,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:16:23,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2019-01-14 02:16:24,000 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:16:24,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2019-01-14 02:16:24,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:16:24,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:16:24,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:16:24,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:16:24,001 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:16:24,001 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:16:24,001 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:16:24,001 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:16:24,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:16:24,001 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:16:24,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:16:24,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:16:24 BoogieIcfgContainer [2019-01-14 02:16:24,011 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:16:24,012 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:16:24,012 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:16:24,012 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:16:24,013 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:16:05" (3/4) ... [2019-01-14 02:16:24,020 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:16:24,021 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:16:24,022 INFO L168 Benchmark]: Toolchain (without parser) took 19534.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.0 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -191.9 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:16:24,023 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:16:24,024 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.47 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:16:24,024 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.89 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:16:24,025 INFO L168 Benchmark]: Boogie Preprocessor took 28.24 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:16:24,026 INFO L168 Benchmark]: RCFGBuilder took 379.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -167.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:16:24,027 INFO L168 Benchmark]: BuchiAutomizer took 18745.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -35.3 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:16:24,028 INFO L168 Benchmark]: Witness Printer took 8.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:16:24,033 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.34 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 319.47 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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 47.89 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.24 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 379.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -167.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18745.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -35.3 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. * Witness Printer took 8.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * x + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * y + 2147483645 and consists of 5 locations. One nondeterministic module has affine ranking function -1 * y + x and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.6s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 16.8s. Construction of modules took 0.2s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 32 SDtfs, 37 SDslu, 11 SDs, 0 SdLazy, 108 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN2 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax158 hnf98 lsp62 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq164 hnf92 smp100 dnf100 smp100 tf102 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 12.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...