./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i --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-memory-alloca/Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i -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 9b56ae1f9bab9d3b2bc1bd2f033ce64d7d92cfe1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:25:55,887 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:25:55,889 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:25:55,902 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:25:55,902 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:25:55,903 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:25:55,904 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:25:55,906 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:25:55,908 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:25:55,909 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:25:55,910 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:25:55,910 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:25:55,911 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:25:55,912 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:25:55,913 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:25:55,914 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:25:55,915 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:25:55,916 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:25:55,922 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:25:55,926 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:25:55,930 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:25:55,934 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:25:55,938 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:25:55,940 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:25:55,940 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:25:55,942 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:25:55,943 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:25:55,944 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:25:55,947 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:25:55,948 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:25:55,949 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:25:55,951 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:25:55,951 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:25:55,953 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:25:55,954 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:25:55,956 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:25:55,956 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:25:55,984 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:25:55,985 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:25:55,987 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:25:55,987 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:25:55,988 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:25:55,988 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:25:55,989 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:25:55,989 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:25:55,989 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:25:55,990 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:25:55,990 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:25:55,990 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:25:55,991 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:25:55,991 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:25:55,991 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:25:55,991 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:25:55,992 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:25:55,992 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:25:55,992 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:25:55,992 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:25:55,992 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:25:55,992 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:25:55,993 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:25:55,995 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:25:55,995 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:25:55,995 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:25:55,996 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:25:55,996 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:25:55,997 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:25:55,997 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 -> 9b56ae1f9bab9d3b2bc1bd2f033ce64d7d92cfe1 [2019-01-14 02:25:56,047 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:25:56,066 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:25:56,074 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:25:56,075 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:25:56,076 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:25:56,078 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i [2019-01-14 02:25:56,135 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca872974a/e860c369275b4a5bb15dd6c1c1fe8759/FLAGef9d8e01e [2019-01-14 02:25:56,622 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:25:56,623 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i [2019-01-14 02:25:56,636 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca872974a/e860c369275b4a5bb15dd6c1c1fe8759/FLAGef9d8e01e [2019-01-14 02:25:56,959 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca872974a/e860c369275b4a5bb15dd6c1c1fe8759 [2019-01-14 02:25:56,963 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:25:56,966 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:25:56,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:25:56,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:25:56,971 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:25:56,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:25:56" (1/1) ... [2019-01-14 02:25:56,975 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4998b6ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:56, skipping insertion in model container [2019-01-14 02:25:56,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:25:56" (1/1) ... [2019-01-14 02:25:56,983 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:25:57,030 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:25:57,385 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:25:57,400 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:25:57,536 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:25:57,605 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:25:57,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:57 WrapperNode [2019-01-14 02:25:57,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:25:57,606 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:25:57,606 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:25:57,606 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:25:57,616 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:25:57" (1/1) ... [2019-01-14 02:25:57,643 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:25:57" (1/1) ... [2019-01-14 02:25:57,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:25:57,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:25:57,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:25:57,680 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:25:57,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:57" (1/1) ... [2019-01-14 02:25:57,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:57" (1/1) ... [2019-01-14 02:25:57,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:57" (1/1) ... [2019-01-14 02:25:57,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:57" (1/1) ... [2019-01-14 02:25:57,720 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:57" (1/1) ... [2019-01-14 02:25:57,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:57" (1/1) ... [2019-01-14 02:25:57,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:57" (1/1) ... [2019-01-14 02:25:57,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:25:57,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:25:57,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:25:57,741 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:25:57,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:57" (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:25:57,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:25:57,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:25:57,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:25:57,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:25:57,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:25:57,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:25:58,292 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:25:58,292 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:25:58,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:25:58 BoogieIcfgContainer [2019-01-14 02:25:58,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:25:58,295 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:25:58,295 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:25:58,298 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:25:58,299 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:25:58,300 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:25:56" (1/3) ... [2019-01-14 02:25:58,301 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@514f457a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:25:58, skipping insertion in model container [2019-01-14 02:25:58,301 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:25:58,301 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:57" (2/3) ... [2019-01-14 02:25:58,302 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@514f457a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:25:58, skipping insertion in model container [2019-01-14 02:25:58,304 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:25:58,304 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:25:58" (3/3) ... [2019-01-14 02:25:58,306 INFO L375 chiAutomizerObserver]: Analyzing ICFG Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i [2019-01-14 02:25:58,372 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:25:58,373 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:25:58,373 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:25:58,373 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:25:58,374 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:25:58,374 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:25:58,374 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:25:58,374 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:25:58,374 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:25:58,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-14 02:25:58,407 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:25:58,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:25:58,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:25:58,415 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:25:58,415 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:25:58,415 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:25:58,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-14 02:25:58,418 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:25:58,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:25:58,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:25:58,419 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:25:58,419 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:25:58,427 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet22;havoc main_#t~nondet22;main_~y~0 := main_#t~nondet23;havoc main_#t~nondet23;subxy_#in~x, subxy_#in~y := main_~x~0, main_~y~0;havoc subxy_#res;havoc subxy_#t~malloc2.base, subxy_#t~malloc2.offset, subxy_#t~malloc3.base, subxy_#t~malloc3.offset, subxy_#t~malloc4.base, subxy_#t~malloc4.offset, subxy_#t~malloc5.base, subxy_#t~malloc5.offset, subxy_#t~mem6, subxy_#t~mem7, subxy_#t~mem8, subxy_#t~short9, subxy_#t~mem11, subxy_#t~post12, subxy_#t~mem13, subxy_#t~post14, subxy_#t~mem10, subxy_#t~mem17, subxy_#t~post18, subxy_#t~mem19, subxy_#t~post20, subxy_#t~mem15, subxy_#t~mem16, subxy_#t~mem21, subxy_~x, subxy_~y, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, subxy_~z~0.base, subxy_~z~0.offset, subxy_~i~0.base, subxy_~i~0.offset;subxy_~x := subxy_#in~x;subxy_~y := subxy_#in~y;call subxy_#t~malloc2.base, subxy_#t~malloc2.offset := #Ultimate.allocOnStack(4);subxy_~x_ref~0.base, subxy_~x_ref~0.offset := subxy_#t~malloc2.base, subxy_#t~malloc2.offset;call subxy_#t~malloc3.base, subxy_#t~malloc3.offset := #Ultimate.allocOnStack(4);subxy_~y_ref~0.base, subxy_~y_ref~0.offset := subxy_#t~malloc3.base, subxy_#t~malloc3.offset;call subxy_#t~malloc4.base, subxy_#t~malloc4.offset := #Ultimate.allocOnStack(4);subxy_~z~0.base, subxy_~z~0.offset := subxy_#t~malloc4.base, subxy_#t~malloc4.offset;call subxy_#t~malloc5.base, subxy_#t~malloc5.offset := #Ultimate.allocOnStack(4);subxy_~i~0.base, subxy_~i~0.offset := subxy_#t~malloc5.base, subxy_#t~malloc5.offset;call write~int(subxy_~x, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_~y, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);call write~int(0, subxy_~z~0.base, subxy_~z~0.offset, 4);call subxy_#t~mem6 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_#t~mem6, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~mem6;call subxy_#t~mem7 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem7 <= 0; 5#L556true assume !subxy_#t~short9;call subxy_#t~mem8 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem8 <= 0; 7#L556-2true assume !subxy_#t~short9;havoc subxy_#t~mem8;havoc subxy_#t~mem7;havoc subxy_#t~short9; 6#L559-3true [2019-01-14 02:25:58,428 INFO L796 eck$LassoCheckResult]: Loop: 6#L559-3true call subxy_#t~mem10 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); 3#L559-1true assume !!(subxy_#t~mem10 > 0);havoc subxy_#t~mem10;call subxy_#t~mem11 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);subxy_#t~post12 := subxy_#t~mem11;call write~int(subxy_#t~post12 - 1, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~mem11;havoc subxy_#t~post12;call subxy_#t~mem13 := read~int(subxy_~z~0.base, subxy_~z~0.offset, 4);subxy_#t~post14 := subxy_#t~mem13;call write~int(1 + subxy_#t~post14, subxy_~z~0.base, subxy_~z~0.offset, 4);havoc subxy_#t~mem13;havoc subxy_#t~post14; 6#L559-3true [2019-01-14 02:25:58,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:58,434 INFO L82 PathProgramCache]: Analyzing trace with hash 925673, now seen corresponding path program 1 times [2019-01-14 02:25:58,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:58,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:58,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:58,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:58,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:58,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:58,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1542, now seen corresponding path program 1 times [2019-01-14 02:25:58,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:58,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:58,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:58,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:58,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:58,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:58,685 INFO L82 PathProgramCache]: Analyzing trace with hash 889572334, now seen corresponding path program 1 times [2019-01-14 02:25:58,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:58,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:58,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:58,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:58,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:58,936 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-14 02:26:00,637 WARN L181 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 151 DAG size of output: 127 [2019-01-14 02:26:00,955 WARN L181 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-01-14 02:26:00,987 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:26:00,989 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:26:00,989 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:26:00,989 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:26:00,990 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:26:00,990 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:26:00,990 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:26:00,990 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:26:00,990 INFO L131 ssoRankerPreferences]: Filename of dumped script: Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:26:00,990 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:26:00,991 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:26:01,016 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:26:01,024 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:26:01,029 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:26:01,032 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:26:01,036 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:26:01,060 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:26:01,069 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:26:01,072 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:26:01,075 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:26:01,084 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:26:02,076 WARN L181 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 93 [2019-01-14 02:26:02,270 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-01-14 02:26:02,271 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:26:02,275 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:26:02,278 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:26:02,281 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:26:02,306 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:26:02,308 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:26:02,310 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:26:02,315 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:26:02,320 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:26:02,322 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:26:02,325 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:26:02,328 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:26:02,334 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:26:02,336 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:26:02,338 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:26:02,341 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:26:02,365 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:26:02,368 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:26:02,556 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-01-14 02:26:03,062 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-14 02:26:04,374 WARN L181 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-01-14 02:26:04,601 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:26:04,606 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:26:04,608 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:26:04,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:04,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:04,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:04,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:04,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:04,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:04,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:04,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:04,618 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:26:04,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:04,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:04,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:04,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:04,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:04,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:04,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:04,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:04,621 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:26:04,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:04,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:04,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:04,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:04,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:04,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:04,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:04,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:04,626 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:26:04,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:04,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:04,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:04,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:04,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:04,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:04,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:04,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:04,632 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:26:04,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:04,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:04,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:04,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:04,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:04,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:04,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:04,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:04,637 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:26:04,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:04,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:04,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:04,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:04,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:04,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:04,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:04,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:04,642 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:26:04,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:04,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:04,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:04,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:04,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:04,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:04,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:04,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:04,647 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:26:04,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:04,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:04,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:04,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:04,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:04,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:04,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:04,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:04,652 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:26:04,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:04,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:04,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:04,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:04,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:04,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:04,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:04,661 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:26:04,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:04,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:04,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:04,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:04,665 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:04,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:04,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:04,671 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:26:04,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:04,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:04,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:04,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:04,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:04,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:04,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:04,717 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:26:04,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:04,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:04,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:04,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:04,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:04,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:04,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:04,736 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:26:04,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:04,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:04,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:04,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:04,745 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:04,745 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:04,798 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:26:04,841 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:26:04,844 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 02:26:04,846 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:26:04,848 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:26:04,848 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:26:04,849 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_1 Supporting invariants [] [2019-01-14 02:26:05,132 INFO L297 tatePredicateManager]: 33 out of 36 supporting invariants were superfluous and have been removed [2019-01-14 02:26:05,147 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:26:05,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:05,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:05,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:05,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 32 [2019-01-14 02:26:05,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-14 02:26:05,503 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 02:26:05,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:05,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:05,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:05,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 02:26:05,546 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:05,585 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:05,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:05,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:05,608 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:12 [2019-01-14 02:26:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:05,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:05,666 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:26:05,679 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 02:26:05,680 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2019-01-14 02:26:05,838 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 4 states. Result 32 states and 41 transitions. Complement of second has 9 states. [2019-01-14 02:26:05,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:26:05,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:26:05,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2019-01-14 02:26:05,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:26:05,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:05,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-14 02:26:05,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:05,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-14 02:26:05,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:05,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 41 transitions. [2019-01-14 02:26:05,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:26:05,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 12 states and 15 transitions. [2019-01-14 02:26:05,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 02:26:05,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:26:05,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2019-01-14 02:26:05,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:26:05,859 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-01-14 02:26:05,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2019-01-14 02:26:05,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2019-01-14 02:26:05,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:26:05,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-14 02:26:05,884 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:26:05,884 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:26:05,885 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:26:05,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-14 02:26:05,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:26:05,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:26:05,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:26:05,886 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:26:05,886 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:26:05,887 INFO L794 eck$LassoCheckResult]: Stem: 248#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 242#L-1 havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet22;havoc main_#t~nondet22;main_~y~0 := main_#t~nondet23;havoc main_#t~nondet23;subxy_#in~x, subxy_#in~y := main_~x~0, main_~y~0;havoc subxy_#res;havoc subxy_#t~malloc2.base, subxy_#t~malloc2.offset, subxy_#t~malloc3.base, subxy_#t~malloc3.offset, subxy_#t~malloc4.base, subxy_#t~malloc4.offset, subxy_#t~malloc5.base, subxy_#t~malloc5.offset, subxy_#t~mem6, subxy_#t~mem7, subxy_#t~mem8, subxy_#t~short9, subxy_#t~mem11, subxy_#t~post12, subxy_#t~mem13, subxy_#t~post14, subxy_#t~mem10, subxy_#t~mem17, subxy_#t~post18, subxy_#t~mem19, subxy_#t~post20, subxy_#t~mem15, subxy_#t~mem16, subxy_#t~mem21, subxy_~x, subxy_~y, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, subxy_~z~0.base, subxy_~z~0.offset, subxy_~i~0.base, subxy_~i~0.offset;subxy_~x := subxy_#in~x;subxy_~y := subxy_#in~y;call subxy_#t~malloc2.base, subxy_#t~malloc2.offset := #Ultimate.allocOnStack(4);subxy_~x_ref~0.base, subxy_~x_ref~0.offset := subxy_#t~malloc2.base, subxy_#t~malloc2.offset;call subxy_#t~malloc3.base, subxy_#t~malloc3.offset := #Ultimate.allocOnStack(4);subxy_~y_ref~0.base, subxy_~y_ref~0.offset := subxy_#t~malloc3.base, subxy_#t~malloc3.offset;call subxy_#t~malloc4.base, subxy_#t~malloc4.offset := #Ultimate.allocOnStack(4);subxy_~z~0.base, subxy_~z~0.offset := subxy_#t~malloc4.base, subxy_#t~malloc4.offset;call subxy_#t~malloc5.base, subxy_#t~malloc5.offset := #Ultimate.allocOnStack(4);subxy_~i~0.base, subxy_~i~0.offset := subxy_#t~malloc5.base, subxy_#t~malloc5.offset;call write~int(subxy_~x, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_~y, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);call write~int(0, subxy_~z~0.base, subxy_~z~0.offset, 4);call subxy_#t~mem6 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_#t~mem6, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~mem6;call subxy_#t~mem7 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem7 <= 0; 243#L556 assume !subxy_#t~short9;call subxy_#t~mem8 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem8 <= 0; 250#L556-2 assume !subxy_#t~short9;havoc subxy_#t~mem8;havoc subxy_#t~mem7;havoc subxy_#t~short9; 251#L559-3 call subxy_#t~mem10 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); 244#L559-1 assume !(subxy_#t~mem10 > 0);havoc subxy_#t~mem10; 245#L563-2 [2019-01-14 02:26:05,887 INFO L796 eck$LassoCheckResult]: Loop: 245#L563-2 call subxy_#t~mem15 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);call subxy_#t~mem16 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4); 249#L563 assume !!(subxy_#t~mem15 < subxy_#t~mem16);havoc subxy_#t~mem15;havoc subxy_#t~mem16;call subxy_#t~mem17 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);subxy_#t~post18 := subxy_#t~mem17;call write~int(1 + subxy_#t~post18, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~mem17;havoc subxy_#t~post18;call subxy_#t~mem19 := read~int(subxy_~z~0.base, subxy_~z~0.offset, 4);subxy_#t~post20 := subxy_#t~mem19;call write~int(subxy_#t~post20 - 1, subxy_~z~0.base, subxy_~z~0.offset, 4);havoc subxy_#t~post20;havoc subxy_#t~mem19; 245#L563-2 [2019-01-14 02:26:05,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:05,887 INFO L82 PathProgramCache]: Analyzing trace with hash 889572332, now seen corresponding path program 1 times [2019-01-14 02:26:05,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:05,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:05,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:05,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:05,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:06,132 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:26:06,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:26:06,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 02:26:06,136 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:26:06,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:06,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2019-01-14 02:26:06,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:06,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:06,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:06,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:06,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:06,332 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-14 02:26:06,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 02:26:06,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 02:26:06,367 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-01-14 02:26:06,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:26:06,453 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-01-14 02:26:06,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 02:26:06,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2019-01-14 02:26:06,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:26:06,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 11 states and 13 transitions. [2019-01-14 02:26:06,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 02:26:06,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 02:26:06,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2019-01-14 02:26:06,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:26:06,458 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-14 02:26:06,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2019-01-14 02:26:06,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-14 02:26:06,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:26:06,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-01-14 02:26:06,461 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-01-14 02:26:06,461 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-01-14 02:26:06,461 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:26:06,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2019-01-14 02:26:06,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:26:06,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:26:06,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:26:06,463 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-14 02:26:06,463 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:26:06,464 INFO L794 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 279#L-1 havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet22;havoc main_#t~nondet22;main_~y~0 := main_#t~nondet23;havoc main_#t~nondet23;subxy_#in~x, subxy_#in~y := main_~x~0, main_~y~0;havoc subxy_#res;havoc subxy_#t~malloc2.base, subxy_#t~malloc2.offset, subxy_#t~malloc3.base, subxy_#t~malloc3.offset, subxy_#t~malloc4.base, subxy_#t~malloc4.offset, subxy_#t~malloc5.base, subxy_#t~malloc5.offset, subxy_#t~mem6, subxy_#t~mem7, subxy_#t~mem8, subxy_#t~short9, subxy_#t~mem11, subxy_#t~post12, subxy_#t~mem13, subxy_#t~post14, subxy_#t~mem10, subxy_#t~mem17, subxy_#t~post18, subxy_#t~mem19, subxy_#t~post20, subxy_#t~mem15, subxy_#t~mem16, subxy_#t~mem21, subxy_~x, subxy_~y, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, subxy_~z~0.base, subxy_~z~0.offset, subxy_~i~0.base, subxy_~i~0.offset;subxy_~x := subxy_#in~x;subxy_~y := subxy_#in~y;call subxy_#t~malloc2.base, subxy_#t~malloc2.offset := #Ultimate.allocOnStack(4);subxy_~x_ref~0.base, subxy_~x_ref~0.offset := subxy_#t~malloc2.base, subxy_#t~malloc2.offset;call subxy_#t~malloc3.base, subxy_#t~malloc3.offset := #Ultimate.allocOnStack(4);subxy_~y_ref~0.base, subxy_~y_ref~0.offset := subxy_#t~malloc3.base, subxy_#t~malloc3.offset;call subxy_#t~malloc4.base, subxy_#t~malloc4.offset := #Ultimate.allocOnStack(4);subxy_~z~0.base, subxy_~z~0.offset := subxy_#t~malloc4.base, subxy_#t~malloc4.offset;call subxy_#t~malloc5.base, subxy_#t~malloc5.offset := #Ultimate.allocOnStack(4);subxy_~i~0.base, subxy_~i~0.offset := subxy_#t~malloc5.base, subxy_#t~malloc5.offset;call write~int(subxy_~x, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_~y, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);call write~int(0, subxy_~z~0.base, subxy_~z~0.offset, 4);call subxy_#t~mem6 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_#t~mem6, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~mem6;call subxy_#t~mem7 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem7 <= 0; 280#L556 assume !subxy_#t~short9;call subxy_#t~mem8 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem8 <= 0; 288#L556-2 assume !subxy_#t~short9;havoc subxy_#t~mem8;havoc subxy_#t~mem7;havoc subxy_#t~short9; 287#L559-3 call subxy_#t~mem10 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); 283#L559-1 assume !!(subxy_#t~mem10 > 0);havoc subxy_#t~mem10;call subxy_#t~mem11 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);subxy_#t~post12 := subxy_#t~mem11;call write~int(subxy_#t~post12 - 1, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~mem11;havoc subxy_#t~post12;call subxy_#t~mem13 := read~int(subxy_~z~0.base, subxy_~z~0.offset, 4);subxy_#t~post14 := subxy_#t~mem13;call write~int(1 + subxy_#t~post14, subxy_~z~0.base, subxy_~z~0.offset, 4);havoc subxy_#t~mem13;havoc subxy_#t~post14; 284#L559-3 call subxy_#t~mem10 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); 281#L559-1 assume !(subxy_#t~mem10 > 0);havoc subxy_#t~mem10; 282#L563-2 [2019-01-14 02:26:06,464 INFO L796 eck$LassoCheckResult]: Loop: 282#L563-2 call subxy_#t~mem15 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);call subxy_#t~mem16 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4); 286#L563 assume !!(subxy_#t~mem15 < subxy_#t~mem16);havoc subxy_#t~mem15;havoc subxy_#t~mem16;call subxy_#t~mem17 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);subxy_#t~post18 := subxy_#t~mem17;call write~int(1 + subxy_#t~post18, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~mem17;havoc subxy_#t~post18;call subxy_#t~mem19 := read~int(subxy_~z~0.base, subxy_~z~0.offset, 4);subxy_#t~post20 := subxy_#t~mem19;call write~int(subxy_#t~post20 - 1, subxy_~z~0.base, subxy_~z~0.offset, 4);havoc subxy_#t~post20;havoc subxy_#t~mem19; 282#L563-2 [2019-01-14 02:26:06,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:06,464 INFO L82 PathProgramCache]: Analyzing trace with hash 180521649, now seen corresponding path program 1 times [2019-01-14 02:26:06,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:06,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:06,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:06,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:06,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:06,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:06,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 2 times [2019-01-14 02:26:06,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:06,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:06,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:06,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:06,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:06,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:06,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1682613814, now seen corresponding path program 1 times [2019-01-14 02:26:06,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:06,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:06,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:06,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:26:06,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:07,725 WARN L181 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 173 DAG size of output: 144 [2019-01-14 02:26:08,309 WARN L181 SmtUtils]: Spent 565.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-14 02:26:08,326 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:26:08,327 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:26:08,327 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:26:08,327 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:26:08,327 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:26:08,327 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:26:08,327 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:26:08,328 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:26:08,330 INFO L131 ssoRankerPreferences]: Filename of dumped script: Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-14 02:26:08,331 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:26:08,331 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:26:08,346 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:26:08,383 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:26:08,417 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:26:08,447 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:26:08,483 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:26:08,513 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:26:08,544 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:26:08,568 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:26:08,611 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:26:08,637 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:26:08,665 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:26:08,694 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:26:08,720 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:26:08,761 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:26:08,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:08,816 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:26:08,844 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:26:08,878 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:26:08,908 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:26:08,941 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:26:08,967 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:26:11,200 WARN L181 SmtUtils]: Spent 866.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 95 [2019-01-14 02:26:11,358 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-01-14 02:26:11,358 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:26:11,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:11,361 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:26:11,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:11,365 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:26:11,366 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:26:11,368 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:26:13,148 WARN L181 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-01-14 02:26:13,238 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:26:13,238 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:26:13,238 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:26:13,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:13,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:13,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:13,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,244 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:26:13,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:13,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:13,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,251 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:26:13,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:13,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:13,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:13,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,255 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:26:13,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:13,260 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:13,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,263 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:26:13,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:13,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:13,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:13,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,268 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:26:13,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:13,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:13,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:13,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,273 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:26:13,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:13,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:13,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:13,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,278 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:26:13,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:13,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:13,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,285 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:26:13,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:13,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:13,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:13,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,290 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:26:13,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:13,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:13,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:13,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,296 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:26:13,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:13,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:13,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:13,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,301 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:26:13,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:13,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:13,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:13,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,307 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:26:13,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:13,311 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:13,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,314 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:26:13,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:13,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:13,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:13,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,319 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:26:13,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:13,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:13,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:13,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,324 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:26:13,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:13,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:13,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:13,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,330 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:26:13,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:13,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:13,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,335 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:26:13,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:13,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:13,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:13,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,341 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:26:13,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:13,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:13,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:13,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,347 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:26:13,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:13,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:13,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:13,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,352 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:26:13,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:13,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:13,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,360 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:26:13,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:13,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:13,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,372 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:26:13,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:13,377 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:13,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,382 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:26:13,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:13,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:13,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,397 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:26:13,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:13,410 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:13,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:13,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:13,441 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:13,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,448 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:26:13,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,449 INFO L205 nArgumentSynthesizer]: 16 stem disjuncts [2019-01-14 02:26:13,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,469 INFO L402 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2019-01-14 02:26:13,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:13,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,519 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:26:13,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:13,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:13,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:13,534 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:26:13,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:13,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:13,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:13,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:13,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:13,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:13,554 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:26:13,563 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:26:13,563 INFO L444 ModelExtractionUtils]: 24 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 02:26:13,564 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:26:13,565 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:26:13,566 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:26:13,566 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_subxy_~y_ref~0.base) ULTIMATE.start_subxy_~y_ref~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_subxy_~y_ref~0.base) ULTIMATE.start_subxy_~y_ref~0.offset)_2 Supporting invariants [] [2019-01-14 02:26:13,879 INFO L297 tatePredicateManager]: 34 out of 37 supporting invariants were superfluous and have been removed [2019-01-14 02:26:13,886 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:26:13,886 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:26:13,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:13,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:13,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:13,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 32 [2019-01-14 02:26:13,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-14 02:26:13,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:14,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:14,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:14,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 02:26:14,042 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:14,093 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:14,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:14,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:14,168 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:12 [2019-01-14 02:26:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:14,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:14,309 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:26:14,310 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 02:26:14,310 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-01-14 02:26:14,356 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 12 states and 15 transitions. Complement of second has 5 states. [2019-01-14 02:26:14,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:26:14,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:26:14,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-14 02:26:14,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-14 02:26:14,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:14,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 10 letters. Loop has 2 letters. [2019-01-14 02:26:14,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:14,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-14 02:26:14,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:14,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 15 transitions. [2019-01-14 02:26:14,360 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:26:14,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2019-01-14 02:26:14,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:26:14,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:26:14,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:26:14,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:26:14,361 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:26:14,361 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:26:14,361 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:26:14,361 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:26:14,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:26:14,361 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:26:14,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:26:14,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:26:14 BoogieIcfgContainer [2019-01-14 02:26:14,368 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:26:14,368 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:26:14,369 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:26:14,369 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:26:14,369 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:25:58" (3/4) ... [2019-01-14 02:26:14,375 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:26:14,375 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:26:14,376 INFO L168 Benchmark]: Toolchain (without parser) took 17412.32 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.2 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -95.2 MB). Peak memory consumption was 223.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:26:14,378 INFO L168 Benchmark]: CDTParser took 0.23 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:26:14,379 INFO L168 Benchmark]: CACSL2BoogieTranslator took 639.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -180.6 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:26:14,381 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:26:14,381 INFO L168 Benchmark]: Boogie Preprocessor took 60.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:26:14,382 INFO L168 Benchmark]: RCFGBuilder took 553.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:26:14,382 INFO L168 Benchmark]: BuchiAutomizer took 16073.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.3 MB). Peak memory consumption was 225.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:26:14,386 INFO L168 Benchmark]: Witness Printer took 7.13 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:26:14,391 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.23 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 639.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -180.6 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 553.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16073.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.3 MB). Peak memory consumption was 225.5 MB. Max. memory is 11.5 GB. * Witness Printer took 7.13 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[i][i] and consists of 6 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.0s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 14.6s. Construction of modules took 0.0s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 21 SDtfs, 24 SDslu, 16 SDs, 0 SdLazy, 44 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital791 mio100 ax102 hnf100 lsp96 ukn32 mio100 lsp32 div100 bol100 ite100 ukn100 eq192 hnf87 smp98 dnf733 smp90 tf100 neg91 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 67ms VariablesStem: 9 VariablesLoop: 6 DisjunctsStem: 16 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 36 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...