./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-restricted-15/PastaA1_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-restricted-15/PastaA1_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 1a5ad591ce856c2d846b6a372eee9518c32c9e01 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:19:45,575 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:19:45,577 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:19:45,589 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:19:45,589 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:19:45,590 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:19:45,592 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:19:45,594 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:19:45,596 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:19:45,597 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:19:45,597 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:19:45,598 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:19:45,599 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:19:45,600 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:19:45,602 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:19:45,602 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:19:45,603 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:19:45,606 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:19:45,608 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:19:45,609 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:19:45,611 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:19:45,612 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:19:45,615 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:19:45,615 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:19:45,615 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:19:45,616 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:19:45,618 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:19:45,619 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:19:45,620 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:19:45,621 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:19:45,621 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:19:45,623 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:19:45,623 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:19:45,623 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:19:45,624 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:19:45,625 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:19:45,626 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:19:45,643 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:19:45,644 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:19:45,645 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:19:45,645 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:19:45,645 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:19:45,646 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:19:45,646 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:19:45,646 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:19:45,646 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:19:45,646 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:19:45,646 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:19:45,647 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:19:45,647 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:19:45,647 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:19:45,647 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:19:45,647 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:19:45,647 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:19:45,648 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:19:45,649 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:19:45,649 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:19:45,650 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:19:45,650 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:19:45,650 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:19:45,650 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:19:45,650 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:19:45,651 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:19:45,651 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:19:45,652 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:19:45,653 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:19:45,653 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 -> 1a5ad591ce856c2d846b6a372eee9518c32c9e01 [2019-01-14 02:19:45,688 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:19:45,701 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:19:45,705 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:19:45,706 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:19:45,706 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:19:45,707 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-restricted-15/PastaA1_true-termination_true-no-overflow.c [2019-01-14 02:19:45,762 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61e56fbc0/3fda9ea213a243848420ddc0032beda4/FLAG4dd3143a3 [2019-01-14 02:19:46,170 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:19:46,171 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/PastaA1_true-termination_true-no-overflow.c [2019-01-14 02:19:46,177 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61e56fbc0/3fda9ea213a243848420ddc0032beda4/FLAG4dd3143a3 [2019-01-14 02:19:46,546 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61e56fbc0/3fda9ea213a243848420ddc0032beda4 [2019-01-14 02:19:46,550 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:19:46,551 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:19:46,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:19:46,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:19:46,556 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:19:46,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:19:46" (1/1) ... [2019-01-14 02:19:46,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@333d3d3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:46, skipping insertion in model container [2019-01-14 02:19:46,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:19:46" (1/1) ... [2019-01-14 02:19:46,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:19:46,590 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:19:46,817 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:19:46,821 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:19:46,842 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:19:46,858 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:19:46,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:46 WrapperNode [2019-01-14 02:19:46,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:19:46,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:19:46,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:19:46,861 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:19:46,871 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:19:46" (1/1) ... [2019-01-14 02:19:46,877 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:19:46" (1/1) ... [2019-01-14 02:19:46,900 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:19:46,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:19:46,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:19:46,900 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:19:46,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:46" (1/1) ... [2019-01-14 02:19:46,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:46" (1/1) ... [2019-01-14 02:19:46,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:46" (1/1) ... [2019-01-14 02:19:46,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:46" (1/1) ... [2019-01-14 02:19:46,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:46" (1/1) ... [2019-01-14 02:19:46,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:46" (1/1) ... [2019-01-14 02:19:46,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:46" (1/1) ... [2019-01-14 02:19:46,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:19:46,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:19:46,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:19:46,926 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:19:46,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:46" (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:19:47,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:19:47,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:19:47,374 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:19:47,374 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 02:19:47,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:19:47 BoogieIcfgContainer [2019-01-14 02:19:47,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:19:47,379 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:19:47,379 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:19:47,384 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:19:47,385 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:19:47,385 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:19:46" (1/3) ... [2019-01-14 02:19:47,386 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66928fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:19:47, skipping insertion in model container [2019-01-14 02:19:47,386 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:19:47,387 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:46" (2/3) ... [2019-01-14 02:19:47,388 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66928fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:19:47, skipping insertion in model container [2019-01-14 02:19:47,389 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:19:47,389 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:19:47" (3/3) ... [2019-01-14 02:19:47,392 INFO L375 chiAutomizerObserver]: Analyzing ICFG PastaA1_true-termination_true-no-overflow.c [2019-01-14 02:19:47,461 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:19:47,462 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:19:47,462 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:19:47,462 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:19:47,462 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:19:47,462 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:19:47,462 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:19:47,462 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:19:47,463 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:19:47,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-14 02:19:47,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:19:47,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:47,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:47,513 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:19:47,514 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:19:47,514 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:19:47,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-14 02:19:47,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:19:47,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:47,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:47,516 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:19:47,516 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:19:47,524 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0; 8#L10-2true [2019-01-14 02:19:47,524 INFO L796 eck$LassoCheckResult]: Loop: 8#L10-2true assume !!(main_~x~0 > 0);main_~y~0 := 0; 3#L12-2true assume !(main_~y~0 < main_~x~0); 10#L12-3true main_~x~0 := main_~x~0 - 1; 8#L10-2true [2019-01-14 02:19:47,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:47,531 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:19:47,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:47,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:47,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:47,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:47,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:47,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:47,634 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2019-01-14 02:19:47,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:47,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:47,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:47,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:47,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:47,753 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:19:47,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:19:47,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:19:47,770 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:19:47,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:19:47,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:19:47,820 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-01-14 02:19:47,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:19:47,873 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-14 02:19:47,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:19:47,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-01-14 02:19:47,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:19:47,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 5 states and 6 transitions. [2019-01-14 02:19:47,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-14 02:19:47,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-14 02:19:47,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 6 transitions. [2019-01-14 02:19:47,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:19:47,883 INFO L706 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2019-01-14 02:19:47,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 6 transitions. [2019-01-14 02:19:47,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-14 02:19:47,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:19:47,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2019-01-14 02:19:47,911 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2019-01-14 02:19:47,911 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2019-01-14 02:19:47,911 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:19:47,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2019-01-14 02:19:47,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:19:47,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:47,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:47,913 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:19:47,913 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:19:47,913 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0; 29#L10-2 [2019-01-14 02:19:47,913 INFO L796 eck$LassoCheckResult]: Loop: 29#L10-2 assume !!(main_~x~0 > 0);main_~y~0 := 0; 26#L12-2 assume !!(main_~y~0 < main_~x~0);main_~y~0 := 1 + main_~y~0; 27#L12-2 assume !(main_~y~0 < main_~x~0); 30#L12-3 main_~x~0 := main_~x~0 - 1; 29#L10-2 [2019-01-14 02:19:47,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:47,915 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-14 02:19:47,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:47,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:47,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:47,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:47,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:47,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:47,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1240240, now seen corresponding path program 1 times [2019-01-14 02:19:47,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:47,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:47,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:47,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:47,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:47,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:47,938 INFO L82 PathProgramCache]: Analyzing trace with hash 29869391, now seen corresponding path program 1 times [2019-01-14 02:19:47,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:47,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:47,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:47,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:47,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:48,072 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2019-01-14 02:19:48,114 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:48,116 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:48,116 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:48,116 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:48,116 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:48,116 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:48,116 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:48,117 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:48,119 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaA1_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:19:48,119 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:48,119 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:48,145 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:19:48,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:19:48,235 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:19:48,386 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 02:19:48,782 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 02:19:48,790 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:48,791 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:19:48,801 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:48,801 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:48,831 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:48,831 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:19:48,839 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:48,840 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:48,862 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:48,862 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:19:48,867 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:48,868 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:19:48,899 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:48,899 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:48,926 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:48,928 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:48,928 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:48,929 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:48,929 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:48,929 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:48,929 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:48,929 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:48,929 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:48,929 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaA1_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:19:48,929 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:48,930 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:48,931 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:19:48,939 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:19:48,951 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:19:49,122 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:49,127 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:49,129 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:19:49,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:49,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:49,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:49,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:49,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:49,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:49,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:49,145 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:19:49,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:49,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:49,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:49,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:49,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:49,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:49,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:49,160 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:19:49,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:49,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:49,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:49,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:49,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:49,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:49,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:49,179 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:49,185 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:49,185 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:19:49,188 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:49,188 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:49,188 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:49,189 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-14 02:19:49,191 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:49,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:49,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:49,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:49,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:19:49,417 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:19:49,419 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 6 transitions. cyclomatic complexity: 2 Second operand 3 states. [2019-01-14 02:19:49,462 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5 states and 6 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 9 states and 12 transitions. Complement of second has 4 states. [2019-01-14 02:19:49,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:19:49,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:19:49,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:19:49,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 1 letters. Loop has 4 letters. [2019-01-14 02:19:49,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:49,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-14 02:19:49,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:49,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 1 letters. Loop has 8 letters. [2019-01-14 02:19:49,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:49,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 12 transitions. [2019-01-14 02:19:49,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:19:49,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 8 states and 11 transitions. [2019-01-14 02:19:49,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-14 02:19:49,470 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-14 02:19:49,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2019-01-14 02:19:49,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:49,470 INFO L706 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-14 02:19:49,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2019-01-14 02:19:49,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-01-14 02:19:49,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:19:49,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-14 02:19:49,473 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:19:49,473 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:19:49,473 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:19:49,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-01-14 02:19:49,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:19:49,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:49,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:49,475 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:19:49,475 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:19:49,475 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0; 79#L10-2 assume !!(main_~x~0 > 0);main_~y~0 := 0; 75#L12-2 [2019-01-14 02:19:49,475 INFO L796 eck$LassoCheckResult]: Loop: 75#L12-2 assume !!(main_~y~0 < main_~x~0);main_~y~0 := 1 + main_~y~0; 75#L12-2 [2019-01-14 02:19:49,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:49,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-01-14 02:19:49,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:49,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:49,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:49,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:49,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:49,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:49,484 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2019-01-14 02:19:49,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:49,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:49,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:49,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:49,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:49,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:49,493 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2019-01-14 02:19:49,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:49,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:49,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:49,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:49,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:49,545 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:49,545 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:49,545 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:49,545 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:49,546 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:49,546 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:49,546 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:49,546 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:49,546 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaA1_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:19:49,546 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:49,546 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:49,548 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:19:49,556 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:19:49,565 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:19:49,657 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:49,658 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:19:49,662 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:49,663 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:49,682 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:49,682 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:19:49,687 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:49,688 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:49,708 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:49,708 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 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:19:49,713 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:49,713 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:19:49,738 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:49,738 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:49,876 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:49,879 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:49,880 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:49,880 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:49,880 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:49,880 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:49,880 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:49,880 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:49,881 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:49,881 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaA1_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:19:49,881 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:49,881 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:49,882 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:19:49,886 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:19:49,894 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:19:50,345 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:50,345 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:50,346 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:19:50,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:50,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:50,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:50,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:50,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:50,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:50,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:50,356 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:19:50,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:50,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:50,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:50,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:50,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:50,359 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:50,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:50,365 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:19:50,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:50,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:50,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:50,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:50,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:50,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:50,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:50,374 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:50,378 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:50,379 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:19:50,379 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:50,379 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:50,379 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:50,380 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~x~0 - 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-01-14 02:19:50,381 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:50,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:50,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:50,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:50,439 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:19:50,440 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:19:50,440 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 2 states. [2019-01-14 02:19:50,481 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 2 states. Result 15 states and 20 transitions. Complement of second has 5 states. [2019-01-14 02:19:50,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:19:50,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:19:50,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:19:50,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 1 letters. [2019-01-14 02:19:50,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:50,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2019-01-14 02:19:50,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:50,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-14 02:19:50,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:50,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2019-01-14 02:19:50,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:19:50,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 15 transitions. [2019-01-14 02:19:50,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-14 02:19:50,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-01-14 02:19:50,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2019-01-14 02:19:50,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:50,488 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-14 02:19:50,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2019-01-14 02:19:50,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 7. [2019-01-14 02:19:50,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:19:50,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-01-14 02:19:50,491 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-14 02:19:50,491 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-14 02:19:50,492 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:19:50,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-01-14 02:19:50,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:19:50,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:50,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:50,493 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2019-01-14 02:19:50,493 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:19:50,494 INFO L794 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0; 130#L10-2 assume !!(main_~x~0 > 0);main_~y~0 := 0; 127#L12-2 assume !!(main_~y~0 < main_~x~0);main_~y~0 := 1 + main_~y~0; 128#L12-2 assume !(main_~y~0 < main_~x~0); 132#L12-3 main_~x~0 := main_~x~0 - 1; 131#L10-2 assume !!(main_~x~0 > 0);main_~y~0 := 0; 126#L12-2 [2019-01-14 02:19:50,494 INFO L796 eck$LassoCheckResult]: Loop: 126#L12-2 assume !!(main_~y~0 < main_~x~0);main_~y~0 := 1 + main_~y~0; 126#L12-2 [2019-01-14 02:19:50,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:50,496 INFO L82 PathProgramCache]: Analyzing trace with hash 925951131, now seen corresponding path program 2 times [2019-01-14 02:19:50,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:50,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:50,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:50,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:50,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:19:50,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:19:50,573 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:19:50,586 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:19:50,598 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 02:19:50,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:19:50,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:50,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:19:50,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:19:50,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 02:19:50,639 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:19:50,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:50,640 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2019-01-14 02:19:50,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:50,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:50,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:50,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:50,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:50,707 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:50,707 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:50,707 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:50,707 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:50,707 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:50,708 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:50,708 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:50,708 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:50,708 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaA1_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-14 02:19:50,708 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:50,708 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:50,710 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:19:50,714 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:19:50,718 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:19:50,792 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:50,793 INFO L412 LassoAnalysis]: Checking for nontermination... 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:19:50,797 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:50,797 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:50,817 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:50,817 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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:19:50,823 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:50,823 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:50,859 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:50,859 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:19:50,874 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:50,874 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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) [2019-01-14 02:19:50,917 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:50,917 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:51,032 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:51,034 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:51,034 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:51,034 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:51,034 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:51,034 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:51,034 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:51,035 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:51,035 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:51,035 INFO L131 ssoRankerPreferences]: Filename of dumped script: PastaA1_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-14 02:19:51,035 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:51,035 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:51,037 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:19:51,048 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:19:51,051 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:19:51,130 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:51,131 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:51,132 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:19:51,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:51,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:51,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:51,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:51,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:51,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:51,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:51,143 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:19:51,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:51,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:51,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:51,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:51,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:51,148 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:51,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:51,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:19:51,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:51,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:51,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:51,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:51,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:51,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:51,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:51,161 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:51,166 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:19:51,167 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:19:51,167 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:51,167 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:51,168 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:51,169 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 [] [2019-01-14 02:19:51,169 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:51,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:51,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:51,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:51,230 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:19:51,230 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:19:51,230 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-14 02:19:51,259 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 13 states and 17 transitions. Complement of second has 5 states. [2019-01-14 02:19:51,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:19:51,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:19:51,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:19:51,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-14 02:19:51,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:51,262 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:51,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:51,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:51,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:51,320 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:19:51,320 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:19:51,320 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-14 02:19:51,352 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 13 states and 17 transitions. Complement of second has 5 states. [2019-01-14 02:19:51,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:19:51,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:19:51,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:19:51,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-14 02:19:51,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:51,354 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:51,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:51,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:51,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:51,440 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:19:51,441 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:19:51,441 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-14 02:19:51,459 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 10 states and 12 transitions. Complement of second has 4 states. [2019-01-14 02:19:51,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:19:51,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:19:51,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-14 02:19:51,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-14 02:19:51,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:51,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 1 letters. [2019-01-14 02:19:51,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:51,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-14 02:19:51,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:51,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2019-01-14 02:19:51,466 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:19:51,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 0 states and 0 transitions. [2019-01-14 02:19:51,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:19:51,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:19:51,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:19:51,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:19:51,467 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:51,467 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:51,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 02:19:51,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 02:19:51,468 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 6 states. [2019-01-14 02:19:51,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:19:51,468 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 02:19:51,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:19:51,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 02:19:51,468 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:19:51,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 02:19:51,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:19:51,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:19:51,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:19:51,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:19:51,471 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:51,471 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:51,471 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:51,471 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:19:51,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:19:51,472 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:19:51,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:19:51,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:19:51 BoogieIcfgContainer [2019-01-14 02:19:51,481 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:19:51,482 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:19:51,482 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:19:51,482 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:19:51,482 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:19:47" (3/4) ... [2019-01-14 02:19:51,486 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:19:51,486 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:19:51,487 INFO L168 Benchmark]: Toolchain (without parser) took 4937.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 947.3 MB in the beginning and 887.2 MB in the end (delta: 60.1 MB). Peak memory consumption was 179.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:19:51,489 INFO L168 Benchmark]: CDTParser took 0.16 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:19:51,490 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.73 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.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:19:51,491 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.63 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:19:51,493 INFO L168 Benchmark]: Boogie Preprocessor took 24.44 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:19:51,495 INFO L168 Benchmark]: RCFGBuilder took 452.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -163.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:19:51,496 INFO L168 Benchmark]: BuchiAutomizer took 4102.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 887.2 MB in the end (delta: 212.4 MB). Peak memory consumption was 212.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:19:51,497 INFO L168 Benchmark]: Witness Printer took 4.76 ms. Allocated memory is still 1.1 GB. Free memory is still 887.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:19:51,501 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.16 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 307.73 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.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 39.63 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.44 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 452.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -163.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4102.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 887.2 MB in the end (delta: 212.4 MB). Peak memory consumption was 212.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.76 ms. Allocated memory is still 1.1 GB. Free memory is still 887.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function x and consists of 3 locations. One deterministic module has affine ranking function x + -1 * y and consists of 3 locations. One nondeterministic module has affine ranking function -1 * y + x and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.0s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 7 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 20 SDtfs, 14 SDslu, 3 SDs, 0 SdLazy, 42 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax203 hnf98 lsp49 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp95 dnf100 smp100 tf112 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...