./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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/Ben-Amram-2010LMCS-Ex2.3-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 4ab4fc7901859c456c176827e7d5fcf9e4988b17 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:43:01,765 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:43:01,767 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:43:01,783 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:43:01,783 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:43:01,784 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:43:01,785 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:43:01,787 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:43:01,789 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:43:01,790 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:43:01,792 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:43:01,792 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:43:01,794 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:43:01,795 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:43:01,796 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:43:01,797 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:43:01,798 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:43:01,800 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:43:01,802 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:43:01,804 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:43:01,805 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:43:01,806 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:43:01,809 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:43:01,813 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:43:01,813 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:43:01,814 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:43:01,815 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:43:01,816 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:43:01,817 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:43:01,822 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:43:01,822 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:43:01,823 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:43:01,824 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:43:01,824 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:43:01,825 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:43:01,826 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:43:01,826 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:43:01,843 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:43:01,844 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:43:01,845 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:43:01,845 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:43:01,845 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:43:01,845 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:43:01,846 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:43:01,846 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:43:01,846 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:43:01,846 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:43:01,846 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:43:01,847 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:43:01,847 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:43:01,847 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:43:01,847 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:43:01,847 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:43:01,847 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:43:01,848 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:43:01,848 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:43:01,848 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:43:01,848 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:43:01,848 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:43:01,849 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:43:01,849 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:43:01,849 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:43:01,849 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:43:01,849 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:43:01,849 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:43:01,850 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:43:01,851 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 -> 4ab4fc7901859c456c176827e7d5fcf9e4988b17 [2019-01-01 21:43:01,915 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:43:01,934 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:43:01,941 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:43:01,943 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:43:01,943 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:43:01,944 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i [2019-01-01 21:43:02,023 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/174b2fd4b/c6caee74aa754fc48ab9a6c92e16d204/FLAG357c0a8ec [2019-01-01 21:43:02,557 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:43:02,558 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i [2019-01-01 21:43:02,581 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/174b2fd4b/c6caee74aa754fc48ab9a6c92e16d204/FLAG357c0a8ec [2019-01-01 21:43:02,839 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/174b2fd4b/c6caee74aa754fc48ab9a6c92e16d204 [2019-01-01 21:43:02,843 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:43:02,844 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:43:02,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:43:02,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:43:02,850 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:43:02,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:43:02" (1/1) ... [2019-01-01 21:43:02,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cf41562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:02, skipping insertion in model container [2019-01-01 21:43:02,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:43:02" (1/1) ... [2019-01-01 21:43:02,867 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:43:02,932 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:43:03,343 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:43:03,357 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:43:03,425 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:43:03,591 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:43:03,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:03 WrapperNode [2019-01-01 21:43:03,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:43:03,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:43:03,593 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:43:03,593 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:43:03,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:03" (1/1) ... [2019-01-01 21:43:03,630 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:03" (1/1) ... [2019-01-01 21:43:03,655 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:43:03,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:43:03,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:43:03,656 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:43:03,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:03" (1/1) ... [2019-01-01 21:43:03,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:03" (1/1) ... [2019-01-01 21:43:03,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:03" (1/1) ... [2019-01-01 21:43:03,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:03" (1/1) ... [2019-01-01 21:43:03,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:03" (1/1) ... [2019-01-01 21:43:03,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:03" (1/1) ... [2019-01-01 21:43:03,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:03" (1/1) ... [2019-01-01 21:43:03,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:43:03,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:43:03,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:43:03,689 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:43:03,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:03" (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-01 21:43:03,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:43:03,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:43:03,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:43:03,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:43:03,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:43:03,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:43:04,157 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:43:04,158 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 21:43:04,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:43:04 BoogieIcfgContainer [2019-01-01 21:43:04,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:43:04,160 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:43:04,160 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:43:04,165 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:43:04,167 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:43:04,167 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:43:02" (1/3) ... [2019-01-01 21:43:04,169 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12b5a0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:43:04, skipping insertion in model container [2019-01-01 21:43:04,169 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:43:04,170 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:43:03" (2/3) ... [2019-01-01 21:43:04,170 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12b5a0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:43:04, skipping insertion in model container [2019-01-01 21:43:04,170 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:43:04,170 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:43:04" (3/3) ... [2019-01-01 21:43:04,172 INFO L375 chiAutomizerObserver]: Analyzing ICFG Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i [2019-01-01 21:43:04,291 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:43:04,292 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:43:04,292 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:43:04,292 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:43:04,292 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:43:04,292 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:43:04,292 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:43:04,293 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:43:04,293 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:43:04,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-01 21:43:04,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:43:04,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:43:04,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:43:04,339 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:43:04,339 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:43:04,339 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:43:04,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-01 21:43:04,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:43:04,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:43:04,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:43:04,342 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:43:04,342 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:43:04,350 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 5#L555-2true [2019-01-01 21:43:04,351 INFO L796 eck$LassoCheckResult]: Loop: 5#L555-2true call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 6#L554-1true assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 9#L554-3true main_#t~short12 := main_#t~short10; 11#L554-4true assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 4#L554-6true assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 12#L555true assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 5#L555-2true [2019-01-01 21:43:04,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:04,358 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 21:43:04,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:04,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:04,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:04,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:04,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:04,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:04,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 1 times [2019-01-01 21:43:04,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:04,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:04,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:04,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:04,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:04,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:04,618 INFO L82 PathProgramCache]: Analyzing trace with hash 177626380, now seen corresponding path program 1 times [2019-01-01 21:43:04,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:04,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:04,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:04,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:04,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:05,685 WARN L181 SmtUtils]: Spent 937.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-01-01 21:43:06,533 WARN L181 SmtUtils]: Spent 730.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-01-01 21:43:06,696 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-01 21:43:06,713 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:43:06,715 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:43:06,715 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:43:06,715 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:43:06,715 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:43:06,715 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:43:06,718 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:43:06,719 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:43:06,719 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-01 21:43:06,719 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:43:06,720 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:43:06,756 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-01 21:43:06,791 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-01 21:43:06,804 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-01 21:43:06,808 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-01 21:43:07,459 WARN L181 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2019-01-01 21:43:07,640 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-01 21:43:07,641 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-01 21:43:07,649 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-01 21:43:07,653 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-01 21:43:07,655 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-01 21:43:07,664 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-01 21:43:07,666 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-01 21:43:07,669 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-01 21:43:07,672 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-01 21:43:07,680 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-01 21:43:07,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:07,726 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-01 21:43:07,728 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-01 21:43:07,730 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-01 21:43:07,734 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-01 21:43:07,760 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-01 21:43:07,762 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-01 21:43:07,778 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-01 21:43:07,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:08,175 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-01-01 21:43:08,881 WARN L181 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-01 21:43:09,046 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-01 21:43:09,195 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:43:09,200 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:43:09,203 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-01 21:43:09,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:09,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:09,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:09,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:09,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:09,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:09,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:09,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:09,215 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-01 21:43:09,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:09,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:09,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:09,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:09,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:09,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:09,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:09,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:09,220 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-01 21:43:09,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:09,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:09,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:09,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:09,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:09,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:09,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:09,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:09,223 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-01 21:43:09,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:09,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:09,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:09,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:09,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:09,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:09,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:09,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-01 21:43:09,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:09,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:09,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:09,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:09,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:09,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:09,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:09,265 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-01 21:43:09,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:09,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:09,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:09,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:09,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:09,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:09,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:09,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-01 21:43:09,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:09,275 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-01 21:43:09,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:09,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:09,300 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-01 21:43:09,306 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:09,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:09,424 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-01 21:43:09,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:09,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:09,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:09,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:09,437 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:09,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:09,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:09,495 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-01 21:43:09,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:09,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:09,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:09,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:09,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:09,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:09,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:09,520 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-01 21:43:09,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:09,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:09,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:09,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:09,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:09,524 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:09,543 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:43:09,572 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:43:09,573 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:43:09,577 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:43:09,578 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:43:09,578 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:43:09,580 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 Supporting invariants [] [2019-01-01 21:43:10,223 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-01-01 21:43:10,259 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:43:10,261 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:43:10,262 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:43:10,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:10,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:10,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:11,059 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-01 21:43:11,076 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:43:11,077 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 5 states. [2019-01-01 21:43:11,326 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 5 states. Result 36 states and 47 transitions. Complement of second has 10 states. [2019-01-01 21:43:11,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:43:11,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:43:11,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2019-01-01 21:43:11,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-01 21:43:11,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:11,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 8 letters. Loop has 6 letters. [2019-01-01 21:43:11,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:11,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 12 letters. [2019-01-01 21:43:11,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:11,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. [2019-01-01 21:43:11,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:43:11,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 20 states and 29 transitions. [2019-01-01 21:43:11,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-01 21:43:11,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-01 21:43:11,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2019-01-01 21:43:11,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:43:11,348 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-01-01 21:43:11,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2019-01-01 21:43:11,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-01 21:43:11,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-01 21:43:11,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-01-01 21:43:11,375 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-01-01 21:43:11,375 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-01-01 21:43:11,375 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:43:11,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-01-01 21:43:11,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:43:11,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:43:11,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:43:11,377 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:43:11,377 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:43:11,378 INFO L794 eck$LassoCheckResult]: Stem: 218#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 209#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 210#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 215#L554-1 assume !main_#t~short10; 216#L554-3 main_#t~short12 := main_#t~short10; 219#L554-4 assume !main_#t~short12; 205#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 206#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 211#L555-2 [2019-01-01 21:43:11,378 INFO L796 eck$LassoCheckResult]: Loop: 211#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 212#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 224#L554-3 main_#t~short12 := main_#t~short10; 223#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 222#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 221#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 211#L555-2 [2019-01-01 21:43:11,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:11,378 INFO L82 PathProgramCache]: Analyzing trace with hash 179475346, now seen corresponding path program 1 times [2019-01-01 21:43:11,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:11,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:11,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:11,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:11,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:11,457 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-01 21:43:11,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:43:11,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:43:11,463 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:43:11,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:11,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 2 times [2019-01-01 21:43:11,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:11,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:11,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:11,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:11,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:11,801 WARN L181 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-01-01 21:43:11,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:43:11,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:43:11,861 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-01-01 21:43:11,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:43:11,874 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2019-01-01 21:43:11,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:43:11,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2019-01-01 21:43:11,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:43:11,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 20 states and 26 transitions. [2019-01-01 21:43:11,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-01 21:43:11,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-01 21:43:11,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-01-01 21:43:11,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:43:11,881 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-01-01 21:43:11,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-01-01 21:43:11,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-01 21:43:11,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-01 21:43:11,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2019-01-01 21:43:11,884 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-01-01 21:43:11,884 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-01-01 21:43:11,884 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:43:11,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2019-01-01 21:43:11,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:43:11,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:43:11,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:43:11,886 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:43:11,886 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:43:11,886 INFO L794 eck$LassoCheckResult]: Stem: 267#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 254#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 255#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 264#L554-1 assume !main_#t~short10; 265#L554-3 main_#t~short12 := main_#t~short10; 268#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 256#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 257#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 260#L555-2 [2019-01-01 21:43:11,886 INFO L796 eck$LassoCheckResult]: Loop: 260#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 261#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 273#L554-3 main_#t~short12 := main_#t~short10; 272#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 271#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 270#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 260#L555-2 [2019-01-01 21:43:11,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:11,887 INFO L82 PathProgramCache]: Analyzing trace with hash 179473424, now seen corresponding path program 1 times [2019-01-01 21:43:11,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:11,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:11,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:11,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:43:11,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:11,938 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-01 21:43:11,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:43:11,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:43:11,939 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:43:11,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:11,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 3 times [2019-01-01 21:43:11,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:11,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:11,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:11,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:11,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:12,419 WARN L181 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-01-01 21:43:12,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:43:12,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:43:12,510 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-01 21:43:12,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:43:12,551 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2019-01-01 21:43:12,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:43:12,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 29 transitions. [2019-01-01 21:43:12,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:43:12,554 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 23 transitions. [2019-01-01 21:43:12,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-01 21:43:12,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-01 21:43:12,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2019-01-01 21:43:12,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:43:12,554 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-01-01 21:43:12,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2019-01-01 21:43:12,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-01 21:43:12,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-01 21:43:12,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-01-01 21:43:12,559 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-01-01 21:43:12,559 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-01-01 21:43:12,559 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:43:12,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2019-01-01 21:43:12,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:43:12,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:43:12,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:43:12,563 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:43:12,563 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:43:12,563 INFO L794 eck$LassoCheckResult]: Stem: 322#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 313#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 314#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 319#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 320#L554-3 main_#t~short12 := main_#t~short10; 323#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 309#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 310#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 315#L555-2 [2019-01-01 21:43:12,564 INFO L796 eck$LassoCheckResult]: Loop: 315#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 316#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 328#L554-3 main_#t~short12 := main_#t~short10; 327#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 326#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 325#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 315#L555-2 [2019-01-01 21:43:12,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:12,564 INFO L82 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 1 times [2019-01-01 21:43:12,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:12,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:12,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:12,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:43:12,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:12,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:12,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 4 times [2019-01-01 21:43:12,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:12,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:12,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:12,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:12,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:12,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:12,617 INFO L82 PathProgramCache]: Analyzing trace with hash -692497897, now seen corresponding path program 1 times [2019-01-01 21:43:12,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:12,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:12,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:12,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:43:12,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:12,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:43:12,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:43:12,779 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:43:12,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:12,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:12,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:12,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 52 [2019-01-01 21:43:12,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:12,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-01 21:43:12,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:12,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2019-01-01 21:43:12,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 21:43:12,971 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:12,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:13,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 42 [2019-01-01 21:43:13,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-01-01 21:43:13,067 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:13,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2019-01-01 21:43:13,135 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:13,159 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:43:13,173 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:43:13,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:43:13,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:43:13,203 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:92, output treesize:31 [2019-01-01 21:43:13,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:13,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:13,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2019-01-01 21:43:13,305 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2019-01-01 21:43:13,308 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 21:43:13,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-01-01 21:43:13,328 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:13,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:13,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-01 21:43:13,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-01 21:43:13,349 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:13,357 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:13,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:13,387 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:44, output treesize:3 [2019-01-01 21:43:13,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:43:13,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:43:13,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-01-01 21:43:13,673 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-01-01 21:43:13,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 21:43:13,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-01 21:43:13,738 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 8 states. [2019-01-01 21:43:13,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:43:13,936 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-01-01 21:43:13,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:43:13,937 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2019-01-01 21:43:13,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:43:13,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2019-01-01 21:43:13,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-01 21:43:13,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-01 21:43:13,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2019-01-01 21:43:13,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:43:13,941 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-01-01 21:43:13,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2019-01-01 21:43:13,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-01-01 21:43:13,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 21:43:13,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-01-01 21:43:13,945 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-01 21:43:13,945 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-01 21:43:13,945 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:43:13,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-01-01 21:43:13,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:43:13,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:43:13,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:43:13,948 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:43:13,949 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:43:13,949 INFO L794 eck$LassoCheckResult]: Stem: 419#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 411#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 412#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 414#L554-1 [2019-01-01 21:43:13,949 INFO L796 eck$LassoCheckResult]: Loop: 414#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 417#L554-3 main_#t~short12 := main_#t~short10; 420#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 407#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 408#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 413#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 414#L554-1 [2019-01-01 21:43:13,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:13,949 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-01 21:43:13,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:13,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:13,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:13,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:13,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:13,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:13,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1187255894, now seen corresponding path program 1 times [2019-01-01 21:43:13,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:13,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:13,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:13,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:13,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:13,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:13,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450553, now seen corresponding path program 2 times [2019-01-01 21:43:13,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:13,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:13,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:13,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:13,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:14,425 WARN L181 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-01-01 21:43:14,644 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-01-01 21:43:15,031 WARN L181 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-01-01 21:43:15,483 WARN L181 SmtUtils]: Spent 447.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-01 21:43:15,488 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:43:15,488 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:43:15,488 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:43:15,488 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:43:15,489 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:43:15,489 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:43:15,489 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:43:15,489 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:43:15,489 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i_Iteration5_Lasso [2019-01-01 21:43:15,489 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:43:15,489 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:43:15,499 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-01 21:43:16,638 WARN L181 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-01-01 21:43:17,096 WARN L181 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-01-01 21:43:17,097 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-01 21:43:17,099 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-01 21:43:17,100 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-01 21:43:17,102 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-01 21:43:17,104 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-01 21:43:17,133 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-01 21:43:17,135 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-01 21:43:17,139 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-01 21:43:17,141 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-01 21:43:17,142 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-01 21:43:17,144 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-01 21:43:17,146 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-01 21:43:17,149 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-01 21:43:17,150 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-01 21:43:17,152 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-01 21:43:17,154 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-01 21:43:17,155 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-01 21:43:17,159 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-01 21:43:17,160 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-01 21:43:17,163 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-01 21:43:17,169 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-01 21:43:17,286 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-01-01 21:43:18,247 WARN L181 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-01 21:43:18,487 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-01-01 21:43:18,557 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:43:18,557 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:43:18,558 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-01 21:43:18,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:18,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:18,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:18,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:18,563 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:18,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:18,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:18,578 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-01 21:43:18,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:18,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:18,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:18,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:18,583 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:18,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:18,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:18,590 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-01 21:43:18,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:18,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:18,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:18,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:18,595 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:18,595 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:18,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:18,599 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-01 21:43:18,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:18,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:18,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:18,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:18,604 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:18,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:18,610 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:43:18,614 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:43:18,614 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:43:18,615 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:43:18,617 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:43:18,618 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:43:18,618 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2 Supporting invariants [] [2019-01-01 21:43:18,855 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-01 21:43:18,861 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:43:18,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:18,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:18,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:18,985 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 17 treesize of output 29 [2019-01-01 21:43:19,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:19,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:19,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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-01 21:43:19,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:19,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:19,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:19,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-01 21:43:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:19,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:19,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:19,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 62 [2019-01-01 21:43:19,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:19,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-01 21:43:19,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:19,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2019-01-01 21:43:19,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 21:43:19,402 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:19,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2019-01-01 21:43:19,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2019-01-01 21:43:19,477 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:19,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:19,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 46 [2019-01-01 21:43:19,593 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-01-01 21:43:19,667 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:43:19,695 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:43:19,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:43:19,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 21:43:19,758 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2019-01-01 21:43:19,954 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 30 [2019-01-01 21:43:19,955 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-01 21:43:19,955 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-01 21:43:19,956 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 7 states. [2019-01-01 21:43:20,090 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 37 states and 40 transitions. Complement of second has 10 states. [2019-01-01 21:43:20,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:43:20,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:43:20,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-01-01 21:43:20,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-01 21:43:20,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:20,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-01 21:43:20,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:20,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 3 letters. Loop has 12 letters. [2019-01-01 21:43:20,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:20,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 40 transitions. [2019-01-01 21:43:20,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:43:20,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 20 states and 21 transitions. [2019-01-01 21:43:20,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-01 21:43:20,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-01 21:43:20,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2019-01-01 21:43:20,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:43:20,099 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-01 21:43:20,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2019-01-01 21:43:20,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-01-01 21:43:20,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 21:43:20,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-01-01 21:43:20,102 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-01 21:43:20,102 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-01 21:43:20,102 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:43:20,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2019-01-01 21:43:20,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:43:20,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:43:20,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:43:20,103 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:43:20,104 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:43:20,104 INFO L794 eck$LassoCheckResult]: Stem: 630#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 623#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 624#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 625#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 629#L554-3 main_#t~short12 := main_#t~short10; 632#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 621#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 622#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 626#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 627#L554-1 [2019-01-01 21:43:20,104 INFO L796 eck$LassoCheckResult]: Loop: 627#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 628#L554-3 main_#t~short12 := main_#t~short10; 631#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 619#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 620#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 633#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 627#L554-1 [2019-01-01 21:43:20,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:20,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450491, now seen corresponding path program 2 times [2019-01-01 21:43:20,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:20,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:20,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:20,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:43:20,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:20,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:20,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1187255894, now seen corresponding path program 2 times [2019-01-01 21:43:20,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:20,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:20,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:20,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:43:20,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:20,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:20,169 INFO L82 PathProgramCache]: Analyzing trace with hash 816748368, now seen corresponding path program 2 times [2019-01-01 21:43:20,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:20,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:20,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:20,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:43:20,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:20,570 WARN L181 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-01-01 21:43:20,849 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-01-01 21:43:21,931 WARN L181 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 160 DAG size of output: 128 [2019-01-01 21:43:22,847 WARN L181 SmtUtils]: Spent 902.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-01-01 21:43:22,853 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:43:22,853 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:43:22,853 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:43:22,853 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:43:22,854 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:43:22,854 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:43:22,854 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:43:22,854 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:43:22,854 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i_Iteration6_Lasso [2019-01-01 21:43:22,854 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:43:22,854 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:43:22,862 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-01 21:43:22,872 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-01 21:43:22,874 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-01 21:43:22,879 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-01 21:43:22,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:22,884 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-01 21:43:22,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:22,888 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-01 21:43:22,891 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-01 21:43:22,895 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-01 21:43:22,897 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-01 21:43:22,899 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-01 21:43:22,902 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-01 21:43:22,904 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-01 21:43:23,987 WARN L181 SmtUtils]: Spent 882.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-01-01 21:43:24,233 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-01-01 21:43:24,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:24,236 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-01 21:43:24,240 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-01 21:43:24,243 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-01 21:43:24,246 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-01 21:43:24,249 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-01 21:43:24,591 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-01-01 21:43:24,888 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-01-01 21:43:25,079 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-01-01 21:43:25,627 WARN L181 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-01 21:43:25,656 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:43:25,657 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:43:25,658 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-01 21:43:25,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,662 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-01 21:43:25,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,673 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-01 21:43:25,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,675 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:25,675 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:25,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,678 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-01 21:43:25,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,680 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-01 21:43:25,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,683 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-01 21:43:25,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,685 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:25,685 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:25,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,693 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-01 21:43:25,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,697 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-01 21:43:25,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,706 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-01 21:43:25,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:25,711 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:25,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,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-01 21:43:25,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,722 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-01 21:43:25,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,728 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-01 21:43:25,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,734 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-01 21:43:25,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:25,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:25,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:25,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,737 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-01 21:43:25,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,739 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:25,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:25,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,744 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-01 21:43:25,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:25,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:25,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,751 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-01 21:43:25,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,753 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:25,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:25,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,755 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-01 21:43:25,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:25,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:25,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,756 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:25,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:25,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:25,758 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-01 21:43:25,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:25,760 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:43:25,760 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:43:25,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:25,768 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-01 21:43:25,768 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 21:43:25,943 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:43:26,061 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:43:26,061 INFO L444 ModelExtractionUtils]: 29 out of 36 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-01 21:43:26,062 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:43:26,064 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-01-01 21:43:26,065 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:43:26,065 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_3 Supporting invariants [] [2019-01-01 21:43:26,722 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-01 21:43:26,797 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:43:26,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:26,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:26,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:26,939 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 17 treesize of output 29 [2019-01-01 21:43:27,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:27,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:27,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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-01 21:43:27,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:27,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:27,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:27,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-01 21:43:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:27,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:27,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:27,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 62 [2019-01-01 21:43:27,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:27,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-01 21:43:27,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:27,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2019-01-01 21:43:27,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 21:43:27,257 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:27,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2019-01-01 21:43:27,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2019-01-01 21:43:27,310 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:27,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:27,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 46 [2019-01-01 21:43:27,375 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-01-01 21:43:27,411 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:43:27,440 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:43:27,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:43:27,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 21:43:27,507 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2019-01-01 21:43:27,580 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-01 21:43:27,580 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-01 21:43:27,580 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-01-01 21:43:27,734 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 24 states and 25 transitions. Complement of second has 10 states. [2019-01-01 21:43:27,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:43:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:43:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-01 21:43:27,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-01 21:43:27,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:27,738 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:43:27,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:27,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:27,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:27,834 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 17 treesize of output 29 [2019-01-01 21:43:27,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:27,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:27,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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-01 21:43:27,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:27,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:27,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:27,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-01 21:43:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:27,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:28,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:28,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 62 [2019-01-01 21:43:28,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:28,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-01 21:43:28,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:28,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2019-01-01 21:43:28,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 21:43:28,276 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:28,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2019-01-01 21:43:28,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2019-01-01 21:43:28,339 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:28,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:28,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 46 [2019-01-01 21:43:28,654 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-01-01 21:43:28,691 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:43:28,720 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:43:28,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:43:28,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 21:43:28,788 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2019-01-01 21:43:28,867 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-01 21:43:28,867 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-01 21:43:28,867 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-01-01 21:43:28,942 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 24 states and 25 transitions. Complement of second has 10 states. [2019-01-01 21:43:28,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:43:28,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:43:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-01 21:43:28,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-01 21:43:28,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:28,945 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:43:28,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:29,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:29,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:29,042 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 17 treesize of output 29 [2019-01-01 21:43:29,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:29,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:29,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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-01 21:43:29,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:29,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:29,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:29,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-01 21:43:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:29,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:29,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:29,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 62 [2019-01-01 21:43:29,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:29,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-01 21:43:29,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:29,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2019-01-01 21:43:29,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 21:43:29,238 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:29,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2019-01-01 21:43:29,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2019-01-01 21:43:29,296 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:29,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:29,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 46 [2019-01-01 21:43:29,473 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-01-01 21:43:29,639 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:43:29,668 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:43:29,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:43:29,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 21:43:29,736 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2019-01-01 21:43:29,815 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-01 21:43:29,815 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-01 21:43:29,816 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-01-01 21:43:29,915 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 26 states and 28 transitions. Complement of second has 11 states. [2019-01-01 21:43:29,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:43:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:43:29,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2019-01-01 21:43:29,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-01 21:43:29,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:29,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 15 letters. Loop has 6 letters. [2019-01-01 21:43:29,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:29,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 12 letters. [2019-01-01 21:43:29,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:29,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2019-01-01 21:43:29,923 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:43:29,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2019-01-01 21:43:29,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:43:29,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:43:29,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:43:29,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:43:29,924 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:43:29,925 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:43:29,926 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:43:29,926 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:43:29,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:43:29,926 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:43:29,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:43:29,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:43:29 BoogieIcfgContainer [2019-01-01 21:43:29,971 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:43:29,972 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:43:29,972 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:43:29,972 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:43:29,973 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:43:04" (3/4) ... [2019-01-01 21:43:29,982 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:43:29,982 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:43:29,983 INFO L168 Benchmark]: Toolchain (without parser) took 27139.45 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 341.3 MB). Free memory was 951.3 MB in the beginning and 1.3 GB in the end (delta: -378.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:43:29,985 INFO L168 Benchmark]: CDTParser took 0.18 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-01 21:43:29,986 INFO L168 Benchmark]: CACSL2BoogieTranslator took 746.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -136.5 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:43:29,986 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.66 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:43:29,988 INFO L168 Benchmark]: Boogie Preprocessor took 32.39 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:43:29,990 INFO L168 Benchmark]: RCFGBuilder took 471.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:43:29,991 INFO L168 Benchmark]: BuchiAutomizer took 25811.10 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 233.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -261.2 MB). Peak memory consumption was 533.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:43:29,991 INFO L168 Benchmark]: Witness Printer took 10.44 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:43:29,998 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.18 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 746.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -136.5 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.66 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.39 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 471.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 25811.10 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 233.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -261.2 MB). Peak memory consumption was 533.0 MB. Max. memory is 11.5 GB. * Witness Printer took 10.44 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 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 - 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 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[z][z] + unknown-#memory_int-unknown[y][y] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 25.6s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 19.7s. Construction of modules took 0.4s. Büchi inclusion checks took 5.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 47 SDtfs, 55 SDslu, 45 SDs, 0 SdLazy, 134 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital1031 mio100 ax103 hnf99 lsp64 ukn56 mio100 lsp28 div100 bol104 ite100 ukn100 eq174 hnf88 smp97 dnf301 smp90 tf100 neg92 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 146ms VariablesStem: 7 VariablesLoop: 6 DisjunctsStem: 8 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 20 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...