./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_573443d0-5607-47bc-8a7c-ddeabd64098d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_573443d0-5607-47bc-8a7c-ddeabd64098d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_573443d0-5607-47bc-8a7c-ddeabd64098d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_573443d0-5607-47bc-8a7c-ddeabd64098d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_573443d0-5607-47bc-8a7c-ddeabd64098d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_573443d0-5607-47bc-8a7c-ddeabd64098d/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7ed84bee4308b8cf5be51a33ec471886cd45cc40 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 07:09:03,721 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 07:09:03,722 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 07:09:03,730 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 07:09:03,730 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 07:09:03,731 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 07:09:03,732 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 07:09:03,733 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 07:09:03,734 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 07:09:03,735 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 07:09:03,735 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 07:09:03,736 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 07:09:03,736 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 07:09:03,737 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 07:09:03,738 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 07:09:03,738 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 07:09:03,739 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 07:09:03,740 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 07:09:03,741 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 07:09:03,742 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 07:09:03,743 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 07:09:03,744 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 07:09:03,745 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 07:09:03,746 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 07:09:03,746 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 07:09:03,746 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 07:09:03,747 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 07:09:03,748 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 07:09:03,748 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 07:09:03,749 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 07:09:03,749 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 07:09:03,750 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 07:09:03,750 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 07:09:03,750 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 07:09:03,750 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 07:09:03,751 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 07:09:03,751 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_573443d0-5607-47bc-8a7c-ddeabd64098d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 07:09:03,762 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 07:09:03,762 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 07:09:03,763 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 07:09:03,763 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 07:09:03,763 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 07:09:03,763 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 07:09:03,763 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 07:09:03,763 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 07:09:03,763 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 07:09:03,764 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 07:09:03,764 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 07:09:03,764 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 07:09:03,764 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 07:09:03,764 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 07:09:03,764 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 07:09:03,764 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 07:09:03,764 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 07:09:03,764 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 07:09:03,764 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 07:09:03,765 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 07:09:03,765 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 07:09:03,765 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 07:09:03,765 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 07:09:03,765 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 07:09:03,765 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 07:09:03,765 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 07:09:03,765 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 07:09:03,766 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 07:09:03,766 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 07:09:03,766 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_573443d0-5607-47bc-8a7c-ddeabd64098d/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7ed84bee4308b8cf5be51a33ec471886cd45cc40 [2018-12-02 07:09:03,787 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 07:09:03,793 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 07:09:03,795 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 07:09:03,796 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 07:09:03,796 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 07:09:03,797 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_573443d0-5607-47bc-8a7c-ddeabd64098d/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i [2018-12-02 07:09:03,830 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_573443d0-5607-47bc-8a7c-ddeabd64098d/bin-2019/uautomizer/data/0f177281d/4de17deb4a334e44871d7733a7804ac9/FLAGb9a2496a9 [2018-12-02 07:09:04,265 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 07:09:04,265 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_573443d0-5607-47bc-8a7c-ddeabd64098d/sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i [2018-12-02 07:09:04,271 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_573443d0-5607-47bc-8a7c-ddeabd64098d/bin-2019/uautomizer/data/0f177281d/4de17deb4a334e44871d7733a7804ac9/FLAGb9a2496a9 [2018-12-02 07:09:04,279 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_573443d0-5607-47bc-8a7c-ddeabd64098d/bin-2019/uautomizer/data/0f177281d/4de17deb4a334e44871d7733a7804ac9 [2018-12-02 07:09:04,280 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 07:09:04,281 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 07:09:04,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 07:09:04,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 07:09:04,285 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 07:09:04,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:09:04" (1/1) ... [2018-12-02 07:09:04,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@725a737b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:09:04, skipping insertion in model container [2018-12-02 07:09:04,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:09:04" (1/1) ... [2018-12-02 07:09:04,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 07:09:04,314 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 07:09:04,473 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:09:04,479 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 07:09:04,540 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:09:04,560 INFO L195 MainTranslator]: Completed translation [2018-12-02 07:09:04,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:09:04 WrapperNode [2018-12-02 07:09:04,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 07:09:04,561 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 07:09:04,561 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 07:09:04,561 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 07:09:04,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:09:04" (1/1) ... [2018-12-02 07:09:04,574 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:09:04" (1/1) ... [2018-12-02 07:09:04,588 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 07:09:04,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 07:09:04,589 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 07:09:04,589 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 07:09:04,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:09:04" (1/1) ... [2018-12-02 07:09:04,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:09:04" (1/1) ... [2018-12-02 07:09:04,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:09:04" (1/1) ... [2018-12-02 07:09:04,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:09:04" (1/1) ... [2018-12-02 07:09:04,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:09:04" (1/1) ... [2018-12-02 07:09:04,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:09:04" (1/1) ... [2018-12-02 07:09:04,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:09:04" (1/1) ... [2018-12-02 07:09:04,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 07:09:04,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 07:09:04,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 07:09:04,606 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 07:09:04,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:09:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_573443d0-5607-47bc-8a7c-ddeabd64098d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:09:04,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 07:09:04,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 07:09:04,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 07:09:04,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 07:09:04,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 07:09:04,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 07:09:04,830 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 07:09:04,830 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-02 07:09:04,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:09:04 BoogieIcfgContainer [2018-12-02 07:09:04,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 07:09:04,831 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 07:09:04,831 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 07:09:04,833 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 07:09:04,833 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 07:09:04,834 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 07:09:04" (1/3) ... [2018-12-02 07:09:04,834 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@70b43618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 07:09:04, skipping insertion in model container [2018-12-02 07:09:04,834 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 07:09:04,834 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:09:04" (2/3) ... [2018-12-02 07:09:04,835 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@70b43618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 07:09:04, skipping insertion in model container [2018-12-02 07:09:04,835 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 07:09:04,835 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:09:04" (3/3) ... [2018-12-02 07:09:04,836 INFO L375 chiAutomizerObserver]: Analyzing ICFG Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i [2018-12-02 07:09:04,868 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 07:09:04,869 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 07:09:04,869 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 07:09:04,869 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 07:09:04,869 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 07:09:04,869 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 07:09:04,869 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 07:09:04,869 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 07:09:04,869 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 07:09:04,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-12-02 07:09:04,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:09:04,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:09:04,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:09:04,896 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:09:04,896 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 07:09:04,896 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 07:09:04,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-12-02 07:09:04,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:09:04,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:09:04,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:09:04,898 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:09:04,898 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 07:09:04,903 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(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.alloc(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.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 22#L553true assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 25#L553-2true call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 17#L558true assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;havoc main_#t~post12; 19#L558-2true call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 9#L563true assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 13#L563-2true call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3#L568true assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post22;havoc main_#t~mem21; 5#L568-2true call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 24#L573true assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem26;havoc main_#t~post27; 27#L573-2true call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 18#L578true assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 21#L578-2true call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 11#L583true assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post35;havoc main_#t~mem34; 16#L583-2true call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 4#L588true assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 6#L588-2true call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 26#L593true assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post47;havoc main_#t~mem46; 10#L598-4true [2018-12-02 07:09:04,903 INFO L796 eck$LassoCheckResult]: Loop: 10#L598-4true call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 20#L598true assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 8#L598-2true assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 10#L598-4true [2018-12-02 07:09:04,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:04,907 INFO L82 PathProgramCache]: Analyzing trace with hash 187436106, now seen corresponding path program 1 times [2018-12-02 07:09:04,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:04,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:04,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:04,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:09:04,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:09:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:09:05,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:09:05,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:09:05,065 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 07:09:05,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:05,065 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 1 times [2018-12-02 07:09:05,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:05,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:05,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:05,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:09:05,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:05,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:09:05,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:09:05,256 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 5 states. [2018-12-02 07:09:05,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:09:05,335 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2018-12-02 07:09:05,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:09:05,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 49 transitions. [2018-12-02 07:09:05,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:09:05,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 29 states and 41 transitions. [2018-12-02 07:09:05,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-12-02 07:09:05,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-12-02 07:09:05,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 41 transitions. [2018-12-02 07:09:05,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 07:09:05,342 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 41 transitions. [2018-12-02 07:09:05,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 41 transitions. [2018-12-02 07:09:05,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-12-02 07:09:05,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-02 07:09:05,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-12-02 07:09:05,359 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-12-02 07:09:05,359 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-12-02 07:09:05,359 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 07:09:05,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 34 transitions. [2018-12-02 07:09:05,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:09:05,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:09:05,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:09:05,360 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:09:05,360 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 07:09:05,360 INFO L794 eck$LassoCheckResult]: Stem: 94#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 91#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(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.alloc(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.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 92#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 93#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 76#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;havoc main_#t~post12; 77#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 82#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 95#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 78#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post22;havoc main_#t~mem21; 79#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 87#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem26;havoc main_#t~post27; 96#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 80#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 81#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 88#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post37;havoc main_#t~mem36; 97#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 99#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 84#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 89#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post47;havoc main_#t~mem46; 90#L598-4 [2018-12-02 07:09:05,361 INFO L796 eck$LassoCheckResult]: Loop: 90#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 85#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 86#L598-2 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 90#L598-4 [2018-12-02 07:09:05,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:05,361 INFO L82 PathProgramCache]: Analyzing trace with hash 189283148, now seen corresponding path program 1 times [2018-12-02 07:09:05,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:05,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:05,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:05,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:09:05,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:05,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:05,400 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 2 times [2018-12-02 07:09:05,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:05,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:05,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:05,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:09:05,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:05,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:05,420 INFO L82 PathProgramCache]: Analyzing trace with hash -357729952, now seen corresponding path program 1 times [2018-12-02 07:09:05,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:05,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:05,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:05,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:09:05,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:05,574 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-12-02 07:09:08,943 WARN L180 SmtUtils]: Spent 3.33 s on a formula simplification. DAG size of input: 185 DAG size of output: 166 [2018-12-02 07:09:09,024 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:09:09,024 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:09:09,024 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:09:09,025 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:09:09,025 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 07:09:09,025 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:09:09,025 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:09:09,025 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:09:09,025 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i_Iteration2_Lasso [2018-12-02 07:09:09,025 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:09:09,025 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:09:09,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,355 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2018-12-02 07:09:09,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:09,761 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:09:09,764 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 07:09:09,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,784 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:09:09,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:09:09,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,789 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:09:09,808 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:09:09,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,812 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:09:09,812 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:09:09,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,841 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:09:09,841 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:09:09,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:09:09,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:09:09,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:09,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:09,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:09,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,861 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:09:09,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,861 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:09:09,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:09:09,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:09:09,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:09:09,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:09:09,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:09:09,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:09,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:09,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:09,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:09,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:09,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:09,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:09:09,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:09:09,879 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 07:09:09,883 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 07:09:09,883 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 07:09:09,884 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 07:09:09,885 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-02 07:09:09,885 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 07:09:09,886 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)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1 + 207 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 - 9 >= 0] [2018-12-02 07:09:09,996 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2018-12-02 07:09:10,004 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:09:10,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:09:10,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:09:10,071 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-12-02 07:09:10,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:10,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:10,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 41 [2018-12-02 07:09:10,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-12-02 07:09:10,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:10,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:10,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:10,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:10,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-02 07:09:10,105 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,111 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,117 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,132 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:13 [2018-12-02 07:09:10,153 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 07:09:10,155 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 [2018-12-02 07:09:10,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-12-02 07:09:10,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:10,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 30 [2018-12-02 07:09:10,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:10,178 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 0 case distinctions, treesize of input 30 treesize of output 7 [2018-12-02 07:09:10,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:20 [2018-12-02 07:09:10,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:10,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 30 [2018-12-02 07:09:10,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:10,214 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 0 case distinctions, treesize of input 30 treesize of output 7 [2018-12-02 07:09:10,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:20 [2018-12-02 07:09:10,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:10,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 30 [2018-12-02 07:09:10,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:10,241 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 0 case distinctions, treesize of input 30 treesize of output 7 [2018-12-02 07:09:10,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:20 [2018-12-02 07:09:10,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:10,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 30 [2018-12-02 07:09:10,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:10,267 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 0 case distinctions, treesize of input 30 treesize of output 7 [2018-12-02 07:09:10,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:20 [2018-12-02 07:09:10,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:10,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 30 [2018-12-02 07:09:10,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:10,296 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 0 case distinctions, treesize of input 30 treesize of output 7 [2018-12-02 07:09:10,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:20 [2018-12-02 07:09:10,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:10,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 30 [2018-12-02 07:09:10,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:10,321 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 0 case distinctions, treesize of input 30 treesize of output 7 [2018-12-02 07:09:10,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:20 [2018-12-02 07:09:10,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:10,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 30 [2018-12-02 07:09:10,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:10,352 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 0 case distinctions, treesize of input 30 treesize of output 7 [2018-12-02 07:09:10,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:10,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:20 [2018-12-02 07:09:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:09:10,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:09:10,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:09:10,424 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2018-12-02 07:09:10,424 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 11 Second operand 13 states. [2018-12-02 07:09:11,266 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 11. Second operand 13 states. Result 91 states and 129 transitions. Complement of second has 17 states. [2018-12-02 07:09:11,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2018-12-02 07:09:11,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-02 07:09:11,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 111 transitions. [2018-12-02 07:09:11,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 111 transitions. Stem has 19 letters. Loop has 3 letters. [2018-12-02 07:09:11,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:09:11,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 111 transitions. Stem has 22 letters. Loop has 3 letters. [2018-12-02 07:09:11,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:09:11,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 111 transitions. Stem has 19 letters. Loop has 6 letters. [2018-12-02 07:09:11,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:09:11,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 129 transitions. [2018-12-02 07:09:11,271 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-02 07:09:11,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 85 states and 119 transitions. [2018-12-02 07:09:11,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2018-12-02 07:09:11,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2018-12-02 07:09:11,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 119 transitions. [2018-12-02 07:09:11,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 07:09:11,272 INFO L705 BuchiCegarLoop]: Abstraction has 85 states and 119 transitions. [2018-12-02 07:09:11,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 119 transitions. [2018-12-02 07:09:11,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 40. [2018-12-02 07:09:11,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 07:09:11,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 57 transitions. [2018-12-02 07:09:11,275 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 57 transitions. [2018-12-02 07:09:11,275 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 57 transitions. [2018-12-02 07:09:11,275 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 07:09:11,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 57 transitions. [2018-12-02 07:09:11,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:09:11,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:09:11,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:09:11,276 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:09:11,276 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 07:09:11,276 INFO L794 eck$LassoCheckResult]: Stem: 498#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 494#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(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.alloc(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.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 495#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 496#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 478#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;havoc main_#t~post12; 479#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 499#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 500#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 480#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post22;havoc main_#t~mem21; 481#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 490#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem26;havoc main_#t~post27; 501#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 482#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 483#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 491#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post37;havoc main_#t~mem36; 502#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 506#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 485#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 492#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post47;havoc main_#t~mem46; 493#L598-4 [2018-12-02 07:09:11,276 INFO L796 eck$LassoCheckResult]: Loop: 493#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 488#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 489#L598-2 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 493#L598-4 [2018-12-02 07:09:11,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:11,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1777631050, now seen corresponding path program 1 times [2018-12-02 07:09:11,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:11,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:11,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:11,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:09:11,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:09:11,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:09:11,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:09:11,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:09:11,299 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 07:09:11,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:11,300 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 3 times [2018-12-02 07:09:11,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:11,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:11,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:11,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:09:11,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:11,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:09:11,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:09:11,411 INFO L87 Difference]: Start difference. First operand 40 states and 57 transitions. cyclomatic complexity: 18 Second operand 4 states. [2018-12-02 07:09:11,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:09:11,440 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2018-12-02 07:09:11,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:09:11,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 56 transitions. [2018-12-02 07:09:11,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:09:11,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 56 transitions. [2018-12-02 07:09:11,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-12-02 07:09:11,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-12-02 07:09:11,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 56 transitions. [2018-12-02 07:09:11,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 07:09:11,442 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 56 transitions. [2018-12-02 07:09:11,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 56 transitions. [2018-12-02 07:09:11,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-02 07:09:11,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 07:09:11,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2018-12-02 07:09:11,443 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 56 transitions. [2018-12-02 07:09:11,443 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 56 transitions. [2018-12-02 07:09:11,443 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 07:09:11,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 56 transitions. [2018-12-02 07:09:11,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:09:11,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:09:11,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:09:11,444 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:09:11,444 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 07:09:11,444 INFO L794 eck$LassoCheckResult]: Stem: 590#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 585#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(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.alloc(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.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 586#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 588#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 567#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 568#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 591#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 592#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 604#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post22;havoc main_#t~mem21; 570#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 603#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem26;havoc main_#t~post27; 593#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 602#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 573#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 601#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post37;havoc main_#t~mem36; 600#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 599#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 578#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 598#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post47;havoc main_#t~mem46; 587#L598-4 [2018-12-02 07:09:11,444 INFO L796 eck$LassoCheckResult]: Loop: 587#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 580#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 581#L598-2 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 587#L598-4 [2018-12-02 07:09:11,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:11,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1237472568, now seen corresponding path program 1 times [2018-12-02 07:09:11,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:11,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:11,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:11,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:09:11,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:09:11,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:09:11,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:09:11,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:09:11,465 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 07:09:11,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:11,465 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 4 times [2018-12-02 07:09:11,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:11,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:11,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:11,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:09:11,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:11,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:09:11,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:09:11,577 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. cyclomatic complexity: 17 Second operand 5 states. [2018-12-02 07:09:11,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:09:11,643 INFO L93 Difference]: Finished difference Result 55 states and 76 transitions. [2018-12-02 07:09:11,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:09:11,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 76 transitions. [2018-12-02 07:09:11,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:09:11,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 76 transitions. [2018-12-02 07:09:11,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-12-02 07:09:11,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-12-02 07:09:11,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 76 transitions. [2018-12-02 07:09:11,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 07:09:11,645 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 76 transitions. [2018-12-02 07:09:11,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 76 transitions. [2018-12-02 07:09:11,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2018-12-02 07:09:11,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 07:09:11,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2018-12-02 07:09:11,647 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 55 transitions. [2018-12-02 07:09:11,647 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 55 transitions. [2018-12-02 07:09:11,647 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 07:09:11,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 55 transitions. [2018-12-02 07:09:11,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:09:11,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:09:11,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:09:11,648 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:09:11,648 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 07:09:11,648 INFO L794 eck$LassoCheckResult]: Stem: 691#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 687#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(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.alloc(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.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 688#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 689#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 672#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 673#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 680#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post15;havoc main_#t~mem14; 692#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 674#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post22;havoc main_#t~mem21; 675#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 683#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem26;havoc main_#t~post27; 693#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 676#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 677#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 684#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post37;havoc main_#t~mem36; 694#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 711#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 679#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 685#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post47;havoc main_#t~mem46; 686#L598-4 [2018-12-02 07:09:11,648 INFO L796 eck$LassoCheckResult]: Loop: 686#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 681#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 682#L598-2 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 686#L598-4 [2018-12-02 07:09:11,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:11,648 INFO L82 PathProgramCache]: Analyzing trace with hash -650666554, now seen corresponding path program 1 times [2018-12-02 07:09:11,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:11,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:11,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:11,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:09:11,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:09:11,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:09:11,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:09:11,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:09:11,671 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 07:09:11,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:11,671 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 5 times [2018-12-02 07:09:11,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:11,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:11,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:11,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:09:11,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:11,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:09:11,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:09:11,776 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-12-02 07:09:11,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:09:11,837 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2018-12-02 07:09:11,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:09:11,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 72 transitions. [2018-12-02 07:09:11,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:09:11,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 72 transitions. [2018-12-02 07:09:11,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2018-12-02 07:09:11,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2018-12-02 07:09:11,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 72 transitions. [2018-12-02 07:09:11,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 07:09:11,839 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 72 transitions. [2018-12-02 07:09:11,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 72 transitions. [2018-12-02 07:09:11,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2018-12-02 07:09:11,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 07:09:11,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2018-12-02 07:09:11,841 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 54 transitions. [2018-12-02 07:09:11,841 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 54 transitions. [2018-12-02 07:09:11,841 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 07:09:11,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 54 transitions. [2018-12-02 07:09:11,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:09:11,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:09:11,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:09:11,842 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:09:11,842 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 07:09:11,842 INFO L794 eck$LassoCheckResult]: Stem: 796#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 792#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(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.alloc(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.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 793#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 794#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 775#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 776#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 781#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post15;havoc main_#t~mem14; 797#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 777#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 778#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 786#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem26;havoc main_#t~post27; 798#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 779#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 780#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 809#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post37;havoc main_#t~mem36; 808#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 806#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 783#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 805#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post47;havoc main_#t~mem46; 791#L598-4 [2018-12-02 07:09:11,842 INFO L796 eck$LassoCheckResult]: Loop: 791#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 784#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 785#L598-2 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 791#L598-4 [2018-12-02 07:09:11,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:11,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1351731132, now seen corresponding path program 1 times [2018-12-02 07:09:11,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:11,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:11,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:11,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:09:11,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:09:11,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:09:11,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:09:11,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:09:11,861 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 07:09:11,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:11,861 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 6 times [2018-12-02 07:09:11,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:11,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:11,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:11,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:09:11,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:11,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:09:11,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:09:11,964 INFO L87 Difference]: Start difference. First operand 40 states and 54 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-12-02 07:09:12,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:09:12,027 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2018-12-02 07:09:12,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:09:12,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 68 transitions. [2018-12-02 07:09:12,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:09:12,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 68 transitions. [2018-12-02 07:09:12,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2018-12-02 07:09:12,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2018-12-02 07:09:12,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 68 transitions. [2018-12-02 07:09:12,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 07:09:12,029 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 68 transitions. [2018-12-02 07:09:12,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 68 transitions. [2018-12-02 07:09:12,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2018-12-02 07:09:12,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 07:09:12,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2018-12-02 07:09:12,030 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2018-12-02 07:09:12,030 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2018-12-02 07:09:12,030 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 07:09:12,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 53 transitions. [2018-12-02 07:09:12,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:09:12,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:09:12,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:09:12,031 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:09:12,031 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 07:09:12,031 INFO L794 eck$LassoCheckResult]: Stem: 896#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 891#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(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.alloc(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.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 892#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 894#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 876#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 877#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 882#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post15;havoc main_#t~mem14; 897#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 878#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 879#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 898#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; 899#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 880#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 881#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 889#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post37;havoc main_#t~mem36; 901#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 915#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 884#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 890#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post47;havoc main_#t~mem46; 893#L598-4 [2018-12-02 07:09:12,031 INFO L796 eck$LassoCheckResult]: Loop: 893#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 887#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 888#L598-2 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 893#L598-4 [2018-12-02 07:09:12,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:12,031 INFO L82 PathProgramCache]: Analyzing trace with hash -2031789502, now seen corresponding path program 1 times [2018-12-02 07:09:12,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:12,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:12,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:12,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:09:12,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:09:12,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:09:12,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:09:12,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 07:09:12,058 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 07:09:12,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:12,058 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 7 times [2018-12-02 07:09:12,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:12,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:12,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:12,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:09:12,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:12,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:09:12,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:09:12,160 INFO L87 Difference]: Start difference. First operand 40 states and 53 transitions. cyclomatic complexity: 14 Second operand 6 states. [2018-12-02 07:09:12,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:09:12,236 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2018-12-02 07:09:12,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 07:09:12,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 76 transitions. [2018-12-02 07:09:12,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:09:12,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 76 transitions. [2018-12-02 07:09:12,237 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2018-12-02 07:09:12,237 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2018-12-02 07:09:12,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 76 transitions. [2018-12-02 07:09:12,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 07:09:12,237 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 76 transitions. [2018-12-02 07:09:12,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 76 transitions. [2018-12-02 07:09:12,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2018-12-02 07:09:12,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 07:09:12,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2018-12-02 07:09:12,239 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2018-12-02 07:09:12,239 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2018-12-02 07:09:12,239 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 07:09:12,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 55 transitions. [2018-12-02 07:09:12,239 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:09:12,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:09:12,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:09:12,240 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:09:12,240 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 07:09:12,240 INFO L794 eck$LassoCheckResult]: Stem: 1010#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1005#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(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.alloc(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.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1006#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 1008#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 991#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 992#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 997#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post15;havoc main_#t~mem14; 1011#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 993#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 994#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1000#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; 1012#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 995#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 996#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1003#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post35;havoc main_#t~mem34; 1014#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 998#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 999#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1004#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post47;havoc main_#t~mem46; 1007#L598-4 [2018-12-02 07:09:12,240 INFO L796 eck$LassoCheckResult]: Loop: 1007#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1001#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1002#L598-2 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1007#L598-4 [2018-12-02 07:09:12,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:12,240 INFO L82 PathProgramCache]: Analyzing trace with hash -2033638466, now seen corresponding path program 1 times [2018-12-02 07:09:12,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:12,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:12,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:12,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:09:12,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:09:12,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:09:12,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:09:12,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:09:12,266 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 07:09:12,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:12,266 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 8 times [2018-12-02 07:09:12,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:12,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:12,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:12,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:09:12,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:12,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:09:12,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:09:12,382 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-12-02 07:09:12,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:09:12,448 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-12-02 07:09:12,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 07:09:12,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 48 transitions. [2018-12-02 07:09:12,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:09:12,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 38 states and 46 transitions. [2018-12-02 07:09:12,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-12-02 07:09:12,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-12-02 07:09:12,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 46 transitions. [2018-12-02 07:09:12,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 07:09:12,450 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-12-02 07:09:12,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 46 transitions. [2018-12-02 07:09:12,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-02 07:09:12,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-02 07:09:12,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-12-02 07:09:12,452 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-12-02 07:09:12,452 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-12-02 07:09:12,452 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-02 07:09:12,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 46 transitions. [2018-12-02 07:09:12,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:09:12,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:09:12,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:09:12,453 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:09:12,453 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 07:09:12,453 INFO L794 eck$LassoCheckResult]: Stem: 1106#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1101#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(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.alloc(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.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1102#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 1104#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1085#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 1086#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1107#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post15;havoc main_#t~mem14; 1108#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1087#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 1088#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1095#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; 1109#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1119#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem29;havoc main_#t~post30; 1098#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1099#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post35;havoc main_#t~mem34; 1110#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1093#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 1094#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1100#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post47;havoc main_#t~mem46; 1103#L598-4 [2018-12-02 07:09:12,454 INFO L796 eck$LassoCheckResult]: Loop: 1103#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1096#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1097#L598-2 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1103#L598-4 [2018-12-02 07:09:12,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:12,454 INFO L82 PathProgramCache]: Analyzing trace with hash 486321468, now seen corresponding path program 1 times [2018-12-02 07:09:12,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:12,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:12,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:12,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:09:12,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:09:12,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:09:12,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:09:12,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:09:12,476 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 07:09:12,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:12,476 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 9 times [2018-12-02 07:09:12,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:12,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:12,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:12,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:09:12,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:12,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:09:12,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:09:12,580 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-12-02 07:09:12,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:09:12,621 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-12-02 07:09:12,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:09:12,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 49 transitions. [2018-12-02 07:09:12,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:09:12,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 49 transitions. [2018-12-02 07:09:12,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-12-02 07:09:12,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-12-02 07:09:12,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 49 transitions. [2018-12-02 07:09:12,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 07:09:12,622 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-12-02 07:09:12,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 49 transitions. [2018-12-02 07:09:12,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2018-12-02 07:09:12,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-02 07:09:12,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-12-02 07:09:12,623 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-12-02 07:09:12,623 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-12-02 07:09:12,624 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-02 07:09:12,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2018-12-02 07:09:12,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:09:12,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:09:12,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:09:12,624 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:09:12,624 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 07:09:12,624 INFO L794 eck$LassoCheckResult]: Stem: 1193#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1189#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(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.alloc(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.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1190#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 1191#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1174#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 1175#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1182#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post15;havoc main_#t~mem14; 1194#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1176#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 1177#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1185#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; 1195#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1197#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem29;havoc main_#t~post30; 1203#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1209#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post35;havoc main_#t~mem34; 1208#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1180#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 1181#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1187#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post45;havoc main_#t~mem44; 1188#L598-4 [2018-12-02 07:09:12,624 INFO L796 eck$LassoCheckResult]: Loop: 1188#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1183#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1184#L598-2 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1188#L598-4 [2018-12-02 07:09:12,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:12,625 INFO L82 PathProgramCache]: Analyzing trace with hash 486321466, now seen corresponding path program 1 times [2018-12-02 07:09:12,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:12,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:12,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:12,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:09:12,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:12,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:12,637 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 10 times [2018-12-02 07:09:12,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:12,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:12,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:12,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:09:12,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:12,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:12,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1078171826, now seen corresponding path program 1 times [2018-12-02 07:09:12,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:12,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:12,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:12,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:09:12,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:15,046 WARN L180 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 177 DAG size of output: 166 [2018-12-02 07:09:15,121 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:09:15,121 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:09:15,121 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:09:15,121 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:09:15,121 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 07:09:15,121 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:09:15,121 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:09:15,121 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:09:15,121 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i_Iteration10_Lasso [2018-12-02 07:09:15,121 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:09:15,121 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:09:15,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:09:15,713 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:09:15,713 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 07:09:15,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:15,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:15,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:15,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:15,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:15,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:15,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:15,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:15,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:15,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:15,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:15,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:15,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:15,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:15,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:15,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:15,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:15,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:15,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 [2018-12-02 07:09:15,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:15,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:15,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:15,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:15,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:15,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:15,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:15,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:15,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:15,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:15,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:15,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:15,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:15,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:15,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:15,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:15,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:15,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:15,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:15,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:15,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:15,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:15,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:15,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:15,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:15,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:15,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:15,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:15,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:15,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:15,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:15,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:15,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:15,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:15,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:15,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:15,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:15,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:15,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:15,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:15,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:15,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:15,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:15,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:15,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:15,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:15,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:15,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:15,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:15,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:15,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:15,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:15,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:15,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:15,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:15,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:15,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:15,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:15,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:15,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:15,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:15,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:15,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:15,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:15,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:15,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:15,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:15,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:15,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:15,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:15,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:15,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 [2018-12-02 07:09:15,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:15,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:15,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:15,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:15,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:15,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:15,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:15,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:15,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:15,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:15,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:15,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:15,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:15,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:15,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:15,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:15,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:15,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:15,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:15,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:15,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:15,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:15,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:15,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:15,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:15,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:15,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:15,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:15,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:15,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:15,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:15,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:09:15,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:09:15,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:15,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 [2018-12-02 07:09:15,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:15,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:15,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:15,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:15,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:15,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:15,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:15,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:15,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:15,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:15,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:15,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:15,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:15,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:15,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:15,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:15,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:15,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 [2018-12-02 07:09:15,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:15,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:15,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:15,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:15,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:15,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:15,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:15,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:15,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:15,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:15,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:15,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:15,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:15,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:15,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:15,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:15,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:15,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:15,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:15,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:09:15,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:15,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:15,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:15,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:09:15,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:09:15,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:15,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:15,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:15,741 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:09:15,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:15,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:15,741 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:09:15,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:09:15,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:15,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:15,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:15,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:15,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:15,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:15,745 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:09:15,745 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:09:15,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:15,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:15,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:15,748 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:09:15,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:15,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:15,748 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:09:15,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:09:15,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:09:15,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:09:15,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:09:15,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:09:15,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:09:15,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:09:15,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:09:15,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:09:15,757 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 07:09:15,759 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 07:09:15,759 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 07:09:15,759 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 07:09:15,760 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-02 07:09:15,760 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 07:09:15,760 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 + 207 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 - 9 >= 0] [2018-12-02 07:09:15,866 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2018-12-02 07:09:15,870 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:09:15,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:09:15,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:09:15,901 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-12-02 07:09:15,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:15,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:15,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 41 [2018-12-02 07:09:15,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-12-02 07:09:15,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:15,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:15,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:15,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:15,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-02 07:09:15,930 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:09:15,936 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:15,940 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:15,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:15,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:15,951 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:13 [2018-12-02 07:09:15,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:15,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 28 [2018-12-02 07:09:15,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:15,973 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 28 treesize of output 19 [2018-12-02 07:09:15,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:09:15,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:15,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:15,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-12-02 07:09:15,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:15,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 28 [2018-12-02 07:09:15,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:15,994 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 28 treesize of output 19 [2018-12-02 07:09:15,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:09:15,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:16,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:16,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-12-02 07:09:16,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:16,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 28 [2018-12-02 07:09:16,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:16,016 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 28 treesize of output 19 [2018-12-02 07:09:16,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:09:16,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:16,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:16,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-12-02 07:09:16,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:16,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 28 [2018-12-02 07:09:16,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:16,040 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 28 treesize of output 19 [2018-12-02 07:09:16,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:09:16,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:16,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:16,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-12-02 07:09:16,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:16,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 28 [2018-12-02 07:09:16,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:16,064 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 28 treesize of output 19 [2018-12-02 07:09:16,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:09:16,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:16,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:16,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-12-02 07:09:16,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:16,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 28 [2018-12-02 07:09:16,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:16,088 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 28 treesize of output 19 [2018-12-02 07:09:16,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:09:16,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:16,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:16,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-12-02 07:09:16,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:16,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 28 [2018-12-02 07:09:16,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:09:16,120 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 28 treesize of output 19 [2018-12-02 07:09:16,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:09:16,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:16,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:09:16,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-12-02 07:09:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:09:16,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:09:16,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:09:16,194 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 3 loop predicates [2018-12-02 07:09:16,194 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 43 transitions. cyclomatic complexity: 8 Second operand 13 states. [2018-12-02 07:09:16,384 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 43 transitions. cyclomatic complexity: 8. Second operand 13 states. Result 58 states and 68 transitions. Complement of second has 17 states. [2018-12-02 07:09:16,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2018-12-02 07:09:16,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-02 07:09:16,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 46 transitions. [2018-12-02 07:09:16,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 46 transitions. Stem has 19 letters. Loop has 3 letters. [2018-12-02 07:09:16,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:09:16,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 46 transitions. Stem has 22 letters. Loop has 3 letters. [2018-12-02 07:09:16,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:09:16,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 46 transitions. Stem has 19 letters. Loop has 6 letters. [2018-12-02 07:09:16,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:09:16,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 68 transitions. [2018-12-02 07:09:16,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:09:16,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 34 states and 40 transitions. [2018-12-02 07:09:16,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-12-02 07:09:16,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-12-02 07:09:16,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 40 transitions. [2018-12-02 07:09:16,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 07:09:16,386 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-12-02 07:09:16,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 40 transitions. [2018-12-02 07:09:16,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-12-02 07:09:16,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-02 07:09:16,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-12-02 07:09:16,388 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-02 07:09:16,388 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-02 07:09:16,388 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-02 07:09:16,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2018-12-02 07:09:16,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:09:16,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:09:16,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:09:16,388 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:09:16,389 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 07:09:16,389 INFO L794 eck$LassoCheckResult]: Stem: 1576#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1571#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(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.alloc(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.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1572#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 1573#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1556#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;havoc main_#t~post12; 1557#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1562#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post15;havoc main_#t~mem14; 1574#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1558#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 1559#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1567#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; 1577#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1560#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem29;havoc main_#t~post30; 1561#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1568#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post35;havoc main_#t~mem34; 1578#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1563#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 1564#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1569#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post45;havoc main_#t~mem44; 1570#L598-4 [2018-12-02 07:09:16,389 INFO L796 eck$LassoCheckResult]: Loop: 1570#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1565#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1566#L598-2 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1570#L598-4 [2018-12-02 07:09:16,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:16,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1913077182, now seen corresponding path program 1 times [2018-12-02 07:09:16,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:16,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:16,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:16,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:09:16,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:09:16,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:09:16,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:09:16,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 07:09:16,421 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 07:09:16,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:16,421 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 11 times [2018-12-02 07:09:16,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:16,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:16,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:16,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:09:16,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:16,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:09:16,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:09:16,543 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. cyclomatic complexity: 6 Second operand 6 states. [2018-12-02 07:09:16,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:09:16,604 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-12-02 07:09:16,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 07:09:16,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2018-12-02 07:09:16,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:09:16,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 36 transitions. [2018-12-02 07:09:16,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-12-02 07:09:16,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-12-02 07:09:16,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 36 transitions. [2018-12-02 07:09:16,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 07:09:16,605 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-12-02 07:09:16,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 36 transitions. [2018-12-02 07:09:16,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-12-02 07:09:16,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-02 07:09:16,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-12-02 07:09:16,606 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-12-02 07:09:16,606 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-12-02 07:09:16,606 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-02 07:09:16,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 34 transitions. [2018-12-02 07:09:16,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:09:16,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:09:16,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:09:16,607 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:09:16,607 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 07:09:16,607 INFO L794 eck$LassoCheckResult]: Stem: 1651#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1647#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(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.alloc(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.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1648#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 1649#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1631#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;havoc main_#t~post12; 1632#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1638#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 1650#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1633#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 1634#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1652#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; 1653#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1660#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem29;havoc main_#t~post30; 1659#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1654#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post35;havoc main_#t~mem34; 1655#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1639#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 1640#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1645#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post45;havoc main_#t~mem44; 1646#L598-4 [2018-12-02 07:09:16,607 INFO L796 eck$LassoCheckResult]: Loop: 1646#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1642#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1643#L598-2 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1646#L598-4 [2018-12-02 07:09:16,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:16,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1326271168, now seen corresponding path program 1 times [2018-12-02 07:09:16,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:16,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:16,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:16,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:09:16,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:09:16,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:09:16,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:09:16,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:09:16,631 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 07:09:16,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:16,631 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 12 times [2018-12-02 07:09:16,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:16,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:16,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:16,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:09:16,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:16,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:09:16,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:09:16,738 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-12-02 07:09:16,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:09:16,784 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-12-02 07:09:16,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:09:16,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 33 transitions. [2018-12-02 07:09:16,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:09:16,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 33 transitions. [2018-12-02 07:09:16,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-12-02 07:09:16,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-02 07:09:16,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 33 transitions. [2018-12-02 07:09:16,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 07:09:16,785 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-12-02 07:09:16,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 33 transitions. [2018-12-02 07:09:16,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-12-02 07:09:16,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 07:09:16,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-12-02 07:09:16,786 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-12-02 07:09:16,786 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-12-02 07:09:16,786 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-02 07:09:16,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 31 transitions. [2018-12-02 07:09:16,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:09:16,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:09:16,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:09:16,787 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:09:16,787 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 07:09:16,787 INFO L794 eck$LassoCheckResult]: Stem: 1721#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1717#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(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.alloc(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.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1718#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 1720#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1703#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;havoc main_#t~post12; 1704#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1709#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 1722#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1705#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post22;havoc main_#t~mem21; 1706#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1712#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; 1723#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1730#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem29;havoc main_#t~post30; 1729#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1725#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post35;havoc main_#t~mem34; 1726#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1710#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 1711#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1716#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post45;havoc main_#t~mem44; 1719#L598-4 [2018-12-02 07:09:16,787 INFO L796 eck$LassoCheckResult]: Loop: 1719#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1713#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1714#L598-2 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1719#L598-4 [2018-12-02 07:09:16,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:16,787 INFO L82 PathProgramCache]: Analyzing trace with hash 2027335746, now seen corresponding path program 1 times [2018-12-02 07:09:16,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:16,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:16,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:16,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:09:16,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:09:16,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:09:16,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:09:16,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:09:16,806 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 07:09:16,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:16,806 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 13 times [2018-12-02 07:09:16,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:16,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:16,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:16,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:09:16,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:16,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:09:16,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:09:16,914 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. cyclomatic complexity: 4 Second operand 5 states. [2018-12-02 07:09:16,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:09:16,961 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-12-02 07:09:16,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:09:16,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2018-12-02 07:09:16,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:09:16,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 26 transitions. [2018-12-02 07:09:16,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-12-02 07:09:16,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-02 07:09:16,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2018-12-02 07:09:16,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 07:09:16,962 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-12-02 07:09:16,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2018-12-02 07:09:16,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-12-02 07:09:16,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-02 07:09:16,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-12-02 07:09:16,962 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-12-02 07:09:16,962 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-12-02 07:09:16,962 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-02 07:09:16,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2018-12-02 07:09:16,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:09:16,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:09:16,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:09:16,963 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:09:16,963 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 07:09:16,963 INFO L794 eck$LassoCheckResult]: Stem: 1785#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1782#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(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.alloc(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.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1783#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 1784#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1767#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;havoc main_#t~post12; 1768#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1773#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 1786#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1769#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post22;havoc main_#t~mem21; 1770#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1778#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem26;havoc main_#t~post27; 1787#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1771#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 1772#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1779#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post37;havoc main_#t~mem36; 1788#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1774#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 1775#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1780#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post45;havoc main_#t~mem44; 1781#L598-4 [2018-12-02 07:09:16,963 INFO L796 eck$LassoCheckResult]: Loop: 1781#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1776#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1777#L598-2 assume !!main_#t~short50;havoc main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1781#L598-4 [2018-12-02 07:09:16,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:16,963 INFO L82 PathProgramCache]: Analyzing trace with hash 189283146, now seen corresponding path program 1 times [2018-12-02 07:09:16,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:16,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:16,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:16,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:09:16,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:09:16,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:09:16,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:09:16,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:09:16,985 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 07:09:16,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:09:16,985 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 14 times [2018-12-02 07:09:16,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:09:16,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:09:16,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:16,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:09:16,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:09:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:09:17,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:09:17,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:09:17,080 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-12-02 07:09:17,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:09:17,113 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2018-12-02 07:09:17,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:09:17,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 18 transitions. [2018-12-02 07:09:17,114 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 07:09:17,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2018-12-02 07:09:17,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 07:09:17,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 07:09:17,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 07:09:17,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 07:09:17,114 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 07:09:17,114 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 07:09:17,114 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 07:09:17,114 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-02 07:09:17,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 07:09:17,115 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 07:09:17,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 07:09:17,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 07:09:17 BoogieIcfgContainer [2018-12-02 07:09:17,120 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 07:09:17,120 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 07:09:17,120 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 07:09:17,120 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 07:09:17,121 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:09:04" (3/4) ... [2018-12-02 07:09:17,123 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 07:09:17,123 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 07:09:17,124 INFO L168 Benchmark]: Toolchain (without parser) took 12843.06 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 369.1 MB). Free memory was 950.6 MB in the beginning and 1.2 GB in the end (delta: -255.1 MB). Peak memory consumption was 114.0 MB. Max. memory is 11.5 GB. [2018-12-02 07:09:17,124 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:09:17,125 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -151.8 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-12-02 07:09:17,125 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.91 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. [2018-12-02 07:09:17,125 INFO L168 Benchmark]: Boogie Preprocessor took 16.95 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. [2018-12-02 07:09:17,125 INFO L168 Benchmark]: RCFGBuilder took 224.62 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: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. [2018-12-02 07:09:17,126 INFO L168 Benchmark]: BuchiAutomizer took 12289.16 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 250.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -135.5 MB). Peak memory consumption was 115.1 MB. Max. memory is 11.5 GB. [2018-12-02 07:09:17,126 INFO L168 Benchmark]: Witness Printer took 3.30 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-12-02 07:09:17,128 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 278.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -151.8 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.91 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 16.95 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 224.62 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: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12289.16 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 250.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -135.5 MB). Peak memory consumption was 115.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.30 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (12 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z][z] + 207 and consists of 14 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y][y] + 207 and consists of 14 locations. 12 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.2s and 15 iterations. TraceHistogramMax:1. Analysis of lassos took 9.6s. Construction of modules took 1.1s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 120 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 42 states and ocurred in iteration 7. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 241 SDtfs, 258 SDslu, 318 SDs, 0 SdLazy, 2055 SolverSat, 141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU12 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital354 mio100 ax105 hnf100 lsp90 ukn55 mio100 lsp36 div100 bol100 ite100 ukn100 eq194 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 3ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...