./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Avery-2006FLOPS-Tabel1_true-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_2f705835-d205-4ce5-9c54-2e0e87ef1a38/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2f705835-d205-4ce5-9c54-2e0e87ef1a38/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2f705835-d205-4ce5-9c54-2e0e87ef1a38/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2f705835-d205-4ce5-9c54-2e0e87ef1a38/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2f705835-d205-4ce5-9c54-2e0e87ef1a38/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2f705835-d205-4ce5-9c54-2e0e87ef1a38/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 9b56ae1f9bab9d3b2bc1bd2f033ce64d7d92cfe1 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 09:19:07,715 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 09:19:07,716 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 09:19:07,722 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 09:19:07,722 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 09:19:07,722 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 09:19:07,723 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 09:19:07,724 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 09:19:07,724 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 09:19:07,725 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 09:19:07,725 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 09:19:07,725 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 09:19:07,726 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 09:19:07,726 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 09:19:07,727 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 09:19:07,727 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 09:19:07,728 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 09:19:07,729 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 09:19:07,730 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 09:19:07,731 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 09:19:07,731 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 09:19:07,732 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 09:19:07,733 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 09:19:07,733 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 09:19:07,734 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 09:19:07,734 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 09:19:07,735 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 09:19:07,735 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 09:19:07,736 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 09:19:07,736 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 09:19:07,736 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 09:19:07,737 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 09:19:07,737 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 09:19:07,737 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 09:19:07,738 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 09:19:07,738 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 09:19:07,738 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2f705835-d205-4ce5-9c54-2e0e87ef1a38/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-08 09:19:07,747 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 09:19:07,747 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 09:19:07,748 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 09:19:07,748 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 09:19:07,748 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 09:19:07,748 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 09:19:07,748 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 09:19:07,749 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 09:19:07,749 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 09:19:07,749 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 09:19:07,749 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 09:19:07,749 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 09:19:07,749 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 09:19:07,749 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 09:19:07,749 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 09:19:07,750 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 09:19:07,750 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 09:19:07,750 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 09:19:07,750 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 09:19:07,750 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 09:19:07,750 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 09:19:07,750 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 09:19:07,751 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 09:19:07,751 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 09:19:07,751 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 09:19:07,751 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 09:19:07,751 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 09:19:07,751 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 09:19:07,752 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 09:19:07,752 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_2f705835-d205-4ce5-9c54-2e0e87ef1a38/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 -> 9b56ae1f9bab9d3b2bc1bd2f033ce64d7d92cfe1 [2018-12-08 09:19:07,775 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 09:19:07,785 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 09:19:07,787 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 09:19:07,788 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 09:19:07,788 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 09:19:07,788 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2f705835-d205-4ce5-9c54-2e0e87ef1a38/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i [2018-12-08 09:19:07,833 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2f705835-d205-4ce5-9c54-2e0e87ef1a38/bin-2019/uautomizer/data/f40b101a2/30f068b61343462b879a2547383d1cc6/FLAG25c38feb5 [2018-12-08 09:19:08,257 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 09:19:08,258 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2f705835-d205-4ce5-9c54-2e0e87ef1a38/sv-benchmarks/c/termination-memory-alloca/Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i [2018-12-08 09:19:08,263 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2f705835-d205-4ce5-9c54-2e0e87ef1a38/bin-2019/uautomizer/data/f40b101a2/30f068b61343462b879a2547383d1cc6/FLAG25c38feb5 [2018-12-08 09:19:08,271 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2f705835-d205-4ce5-9c54-2e0e87ef1a38/bin-2019/uautomizer/data/f40b101a2/30f068b61343462b879a2547383d1cc6 [2018-12-08 09:19:08,273 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 09:19:08,273 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 09:19:08,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 09:19:08,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 09:19:08,276 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 09:19:08,276 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:19:08" (1/1) ... [2018-12-08 09:19:08,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5b6929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:19:08, skipping insertion in model container [2018-12-08 09:19:08,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:19:08" (1/1) ... [2018-12-08 09:19:08,282 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 09:19:08,300 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 09:19:08,438 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:19:08,444 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 09:19:08,500 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:19:08,520 INFO L195 MainTranslator]: Completed translation [2018-12-08 09:19:08,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:19:08 WrapperNode [2018-12-08 09:19:08,521 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 09:19:08,521 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 09:19:08,521 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 09:19:08,521 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 09:19:08,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:19:08" (1/1) ... [2018-12-08 09:19:08,535 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:19:08" (1/1) ... [2018-12-08 09:19:08,547 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 09:19:08,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 09:19:08,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 09:19:08,548 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 09:19:08,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:19:08" (1/1) ... [2018-12-08 09:19:08,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:19:08" (1/1) ... [2018-12-08 09:19:08,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:19:08" (1/1) ... [2018-12-08 09:19:08,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:19:08" (1/1) ... [2018-12-08 09:19:08,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:19:08" (1/1) ... [2018-12-08 09:19:08,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:19:08" (1/1) ... [2018-12-08 09:19:08,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:19:08" (1/1) ... [2018-12-08 09:19:08,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 09:19:08,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 09:19:08,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 09:19:08,563 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 09:19:08,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:19:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f705835-d205-4ce5-9c54-2e0e87ef1a38/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-08 09:19:08,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 09:19:08,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 09:19:08,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 09:19:08,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 09:19:08,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 09:19:08,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 09:19:08,750 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 09:19:08,750 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 09:19:08,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:19:08 BoogieIcfgContainer [2018-12-08 09:19:08,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 09:19:08,750 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 09:19:08,750 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 09:19:08,753 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 09:19:08,754 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 09:19:08,754 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 09:19:08" (1/3) ... [2018-12-08 09:19:08,755 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60ab8836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 09:19:08, skipping insertion in model container [2018-12-08 09:19:08,755 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 09:19:08,755 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:19:08" (2/3) ... [2018-12-08 09:19:08,755 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60ab8836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 09:19:08, skipping insertion in model container [2018-12-08 09:19:08,756 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 09:19:08,756 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:19:08" (3/3) ... [2018-12-08 09:19:08,757 INFO L375 chiAutomizerObserver]: Analyzing ICFG Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i [2018-12-08 09:19:08,801 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 09:19:08,801 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 09:19:08,801 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 09:19:08,802 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 09:19:08,802 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 09:19:08,802 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 09:19:08,802 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 09:19:08,802 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 09:19:08,802 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 09:19:08,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-12-08 09:19:08,827 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-08 09:19:08,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:19:08,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:19:08,831 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-08 09:19:08,831 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 09:19:08,832 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 09:19:08,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-12-08 09:19:08,833 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-08 09:19:08,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:19:08,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:19:08,833 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-08 09:19:08,833 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 09:19:08,838 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet22;havoc main_#t~nondet22;main_~y~0 := main_#t~nondet23;havoc main_#t~nondet23;subxy_#in~x, subxy_#in~y := main_~x~0, main_~y~0;havoc subxy_#res;havoc subxy_#t~malloc2.base, subxy_#t~malloc2.offset, subxy_#t~malloc3.base, subxy_#t~malloc3.offset, subxy_#t~malloc4.base, subxy_#t~malloc4.offset, subxy_#t~malloc5.base, subxy_#t~malloc5.offset, subxy_#t~mem6, subxy_#t~mem7, subxy_#t~mem8, subxy_#t~short9, subxy_#t~mem11, subxy_#t~post12, subxy_#t~mem13, subxy_#t~post14, subxy_#t~mem10, subxy_#t~mem17, subxy_#t~post18, subxy_#t~mem19, subxy_#t~post20, subxy_#t~mem15, subxy_#t~mem16, subxy_#t~mem21, subxy_~x, subxy_~y, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, subxy_~z~0.base, subxy_~z~0.offset, subxy_~i~0.base, subxy_~i~0.offset;subxy_~x := subxy_#in~x;subxy_~y := subxy_#in~y;call subxy_#t~malloc2.base, subxy_#t~malloc2.offset := #Ultimate.alloc(4);subxy_~x_ref~0.base, subxy_~x_ref~0.offset := subxy_#t~malloc2.base, subxy_#t~malloc2.offset;call subxy_#t~malloc3.base, subxy_#t~malloc3.offset := #Ultimate.alloc(4);subxy_~y_ref~0.base, subxy_~y_ref~0.offset := subxy_#t~malloc3.base, subxy_#t~malloc3.offset;call subxy_#t~malloc4.base, subxy_#t~malloc4.offset := #Ultimate.alloc(4);subxy_~z~0.base, subxy_~z~0.offset := subxy_#t~malloc4.base, subxy_#t~malloc4.offset;call subxy_#t~malloc5.base, subxy_#t~malloc5.offset := #Ultimate.alloc(4);subxy_~i~0.base, subxy_~i~0.offset := subxy_#t~malloc5.base, subxy_#t~malloc5.offset;call write~int(subxy_~x, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_~y, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);call write~int(0, subxy_~z~0.base, subxy_~z~0.offset, 4);call subxy_#t~mem6 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_#t~mem6, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~mem6;call subxy_#t~mem7 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem7 <= 0; 5#L556true assume !subxy_#t~short9;call subxy_#t~mem8 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem8 <= 0; 7#L556-2true assume !subxy_#t~short9;havoc subxy_#t~mem7;havoc subxy_#t~mem8;havoc subxy_#t~short9; 6#L559-3true [2018-12-08 09:19:08,838 INFO L796 eck$LassoCheckResult]: Loop: 6#L559-3true call subxy_#t~mem10 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); 3#L559-1true assume !!(subxy_#t~mem10 > 0);havoc subxy_#t~mem10;call subxy_#t~mem11 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);subxy_#t~post12 := subxy_#t~mem11;call write~int(subxy_#t~post12 - 1, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~post12;havoc subxy_#t~mem11;call subxy_#t~mem13 := read~int(subxy_~z~0.base, subxy_~z~0.offset, 4);subxy_#t~post14 := subxy_#t~mem13;call write~int(1 + subxy_#t~post14, subxy_~z~0.base, subxy_~z~0.offset, 4);havoc subxy_#t~post14;havoc subxy_#t~mem13; 6#L559-3true [2018-12-08 09:19:08,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:19:08,842 INFO L82 PathProgramCache]: Analyzing trace with hash 925673, now seen corresponding path program 1 times [2018-12-08 09:19:08,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:19:08,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:19:08,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:08,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:19:08,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:19:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:19:08,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:19:08,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1542, now seen corresponding path program 1 times [2018-12-08 09:19:08,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:19:08,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:19:08,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:08,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:19:08,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:19:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:19:08,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:19:08,974 INFO L82 PathProgramCache]: Analyzing trace with hash 889572334, now seen corresponding path program 1 times [2018-12-08 09:19:08,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:19:08,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:19:08,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:08,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:19:08,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:19:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:19:09,486 WARN L180 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 122 [2018-12-08 09:19:09,616 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-12-08 09:19:09,626 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:19:09,627 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:19:09,627 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:19:09,628 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:19:09,628 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:19:09,628 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:19:09,628 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:19:09,628 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:19:09,628 INFO L131 ssoRankerPreferences]: Filename of dumped script: Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i_Iteration1_Lasso [2018-12-08 09:19:09,628 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:19:09,629 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:19:09,646 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-08 09:19:09,652 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-08 09:19:09,653 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-08 09:19:09,655 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-08 09:19:09,656 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-08 09:19:09,658 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-08 09:19:09,972 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-12-08 09:19:10,037 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-08 09:19:10,038 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-08 09:19:10,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-08 09:19:10,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-08 09:19:10,041 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-08 09:19:10,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-08 09:19:10,043 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-08 09:19:10,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-08 09:19:10,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-08 09:19:10,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-08 09:19:10,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-08 09:19:10,048 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-08 09:19:10,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-08 09:19:10,051 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-08 09:19:10,052 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-08 09:19:10,053 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-08 09:19:10,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-08 09:19:10,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-08 09:19:10,056 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-08 09:19:10,058 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-08 09:19:10,059 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-08 09:19:10,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-08 09:19:10,358 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:19:10,360 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 09:19:10,362 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-08 09:19:10,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:19:10,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:19:10,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:19:10,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:19:10,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:19:10,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:19:10,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:19:10,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:19:10,366 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-08 09:19:10,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:19:10,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:19:10,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:19:10,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:19:10,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:19:10,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:19:10,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:19:10,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:19:10,367 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-08 09:19:10,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:19:10,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:19:10,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:19:10,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:19:10,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:19:10,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:19:10,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:19:10,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:19:10,369 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-08 09:19:10,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:19:10,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:19:10,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:19:10,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:19:10,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:19:10,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:19:10,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:19:10,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:19:10,370 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-08 09:19:10,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:19:10,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:19:10,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:19:10,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:19:10,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:19:10,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:19:10,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:19:10,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:19:10,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:19:10,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:19:10,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:19:10,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:19:10,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:19:10,373 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:19:10,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:19:10,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:19:10,376 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-08 09:19:10,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:19:10,377 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:19:10,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:19:10,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:19:10,378 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:19:10,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:19:10,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:19:10,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:19:10,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:19:10,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:19:10,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:19:10,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:19:10,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:19:10,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:19:10,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:19:10,403 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-08 09:19:10,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:19:10,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:19:10,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:19:10,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:19:10,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:19:10,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:19:10,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:19:10,407 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-08 09:19:10,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:19:10,407 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:19:10,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:19:10,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:19:10,408 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:19:10,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:19:10,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:19:10,412 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-08 09:19:10,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:19:10,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:19:10,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:19:10,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:19:10,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:19:10,414 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:19:10,422 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 09:19:10,428 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 09:19:10,428 INFO L444 ModelExtractionUtils]: 16 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 09:19:10,429 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 09:19:10,430 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 09:19:10,430 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 09:19:10,431 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_1 Supporting invariants [] [2018-12-08 09:19:10,527 INFO L297 tatePredicateManager]: 33 out of 36 supporting invariants were superfluous and have been removed [2018-12-08 09:19:10,535 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 09:19:10,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:19:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:19:10,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:19:10,585 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 14 treesize of output 17 [2018-12-08 09:19:10,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-12-08 09:19:10,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:10,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:10,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:10,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-12-08 09:19:10,599 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 09:19:10,602 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:19:10,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:19:10,621 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-08 09:19:10,621 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:22, output treesize:12 [2018-12-08 09:19:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:19:10,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:19:10,639 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-08 09:19:10,649 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-08 09:19:10,650 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2018-12-08 09:19:10,722 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 4 states. Result 32 states and 41 transitions. Complement of second has 9 states. [2018-12-08 09:19:10,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 09:19:10,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 09:19:10,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2018-12-08 09:19:10,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-08 09:19:10,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:19:10,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 6 letters. Loop has 2 letters. [2018-12-08 09:19:10,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:19:10,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 4 letters. Loop has 4 letters. [2018-12-08 09:19:10,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:19:10,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 41 transitions. [2018-12-08 09:19:10,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 09:19:10,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 12 states and 15 transitions. [2018-12-08 09:19:10,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-08 09:19:10,730 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-08 09:19:10,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2018-12-08 09:19:10,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:19:10,731 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-12-08 09:19:10,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2018-12-08 09:19:10,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-12-08 09:19:10,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-08 09:19:10,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-12-08 09:19:10,746 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-08 09:19:10,746 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-08 09:19:10,746 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 09:19:10,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-12-08 09:19:10,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 09:19:10,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:19:10,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:19:10,747 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-08 09:19:10,747 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 09:19:10,747 INFO L794 eck$LassoCheckResult]: Stem: 248#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 242#L-1 havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet22;havoc main_#t~nondet22;main_~y~0 := main_#t~nondet23;havoc main_#t~nondet23;subxy_#in~x, subxy_#in~y := main_~x~0, main_~y~0;havoc subxy_#res;havoc subxy_#t~malloc2.base, subxy_#t~malloc2.offset, subxy_#t~malloc3.base, subxy_#t~malloc3.offset, subxy_#t~malloc4.base, subxy_#t~malloc4.offset, subxy_#t~malloc5.base, subxy_#t~malloc5.offset, subxy_#t~mem6, subxy_#t~mem7, subxy_#t~mem8, subxy_#t~short9, subxy_#t~mem11, subxy_#t~post12, subxy_#t~mem13, subxy_#t~post14, subxy_#t~mem10, subxy_#t~mem17, subxy_#t~post18, subxy_#t~mem19, subxy_#t~post20, subxy_#t~mem15, subxy_#t~mem16, subxy_#t~mem21, subxy_~x, subxy_~y, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, subxy_~z~0.base, subxy_~z~0.offset, subxy_~i~0.base, subxy_~i~0.offset;subxy_~x := subxy_#in~x;subxy_~y := subxy_#in~y;call subxy_#t~malloc2.base, subxy_#t~malloc2.offset := #Ultimate.alloc(4);subxy_~x_ref~0.base, subxy_~x_ref~0.offset := subxy_#t~malloc2.base, subxy_#t~malloc2.offset;call subxy_#t~malloc3.base, subxy_#t~malloc3.offset := #Ultimate.alloc(4);subxy_~y_ref~0.base, subxy_~y_ref~0.offset := subxy_#t~malloc3.base, subxy_#t~malloc3.offset;call subxy_#t~malloc4.base, subxy_#t~malloc4.offset := #Ultimate.alloc(4);subxy_~z~0.base, subxy_~z~0.offset := subxy_#t~malloc4.base, subxy_#t~malloc4.offset;call subxy_#t~malloc5.base, subxy_#t~malloc5.offset := #Ultimate.alloc(4);subxy_~i~0.base, subxy_~i~0.offset := subxy_#t~malloc5.base, subxy_#t~malloc5.offset;call write~int(subxy_~x, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_~y, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);call write~int(0, subxy_~z~0.base, subxy_~z~0.offset, 4);call subxy_#t~mem6 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_#t~mem6, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~mem6;call subxy_#t~mem7 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem7 <= 0; 243#L556 assume !subxy_#t~short9;call subxy_#t~mem8 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem8 <= 0; 250#L556-2 assume !subxy_#t~short9;havoc subxy_#t~mem7;havoc subxy_#t~mem8;havoc subxy_#t~short9; 251#L559-3 call subxy_#t~mem10 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); 244#L559-1 assume !(subxy_#t~mem10 > 0);havoc subxy_#t~mem10; 245#L563-2 [2018-12-08 09:19:10,748 INFO L796 eck$LassoCheckResult]: Loop: 245#L563-2 call subxy_#t~mem15 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);call subxy_#t~mem16 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4); 249#L563 assume !!(subxy_#t~mem15 < subxy_#t~mem16);havoc subxy_#t~mem16;havoc subxy_#t~mem15;call subxy_#t~mem17 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);subxy_#t~post18 := subxy_#t~mem17;call write~int(1 + subxy_#t~post18, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~post18;havoc subxy_#t~mem17;call subxy_#t~mem19 := read~int(subxy_~z~0.base, subxy_~z~0.offset, 4);subxy_#t~post20 := subxy_#t~mem19;call write~int(subxy_#t~post20 - 1, subxy_~z~0.base, subxy_~z~0.offset, 4);havoc subxy_#t~post20;havoc subxy_#t~mem19; 245#L563-2 [2018-12-08 09:19:10,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:19:10,748 INFO L82 PathProgramCache]: Analyzing trace with hash 889572332, now seen corresponding path program 1 times [2018-12-08 09:19:10,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:19:10,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:19:10,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:10,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:19:10,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:19:10,836 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-08 09:19:10,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:19:10,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:19:10,838 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 09:19:10,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:19:10,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2018-12-08 09:19:10,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:19:10,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:19:10,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:10,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:19:10,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:19:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:19:10,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:19:10,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:19:10,893 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-12-08 09:19:10,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:19:10,940 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2018-12-08 09:19:10,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 09:19:10,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2018-12-08 09:19:10,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 09:19:10,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 11 states and 13 transitions. [2018-12-08 09:19:10,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-08 09:19:10,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-08 09:19:10,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2018-12-08 09:19:10,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:19:10,943 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-12-08 09:19:10,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2018-12-08 09:19:10,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-12-08 09:19:10,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-08 09:19:10,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-12-08 09:19:10,944 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-08 09:19:10,944 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-08 09:19:10,944 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 09:19:10,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2018-12-08 09:19:10,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 09:19:10,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:19:10,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:19:10,945 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-08 09:19:10,945 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 09:19:10,945 INFO L794 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 279#L-1 havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet22;havoc main_#t~nondet22;main_~y~0 := main_#t~nondet23;havoc main_#t~nondet23;subxy_#in~x, subxy_#in~y := main_~x~0, main_~y~0;havoc subxy_#res;havoc subxy_#t~malloc2.base, subxy_#t~malloc2.offset, subxy_#t~malloc3.base, subxy_#t~malloc3.offset, subxy_#t~malloc4.base, subxy_#t~malloc4.offset, subxy_#t~malloc5.base, subxy_#t~malloc5.offset, subxy_#t~mem6, subxy_#t~mem7, subxy_#t~mem8, subxy_#t~short9, subxy_#t~mem11, subxy_#t~post12, subxy_#t~mem13, subxy_#t~post14, subxy_#t~mem10, subxy_#t~mem17, subxy_#t~post18, subxy_#t~mem19, subxy_#t~post20, subxy_#t~mem15, subxy_#t~mem16, subxy_#t~mem21, subxy_~x, subxy_~y, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, subxy_~z~0.base, subxy_~z~0.offset, subxy_~i~0.base, subxy_~i~0.offset;subxy_~x := subxy_#in~x;subxy_~y := subxy_#in~y;call subxy_#t~malloc2.base, subxy_#t~malloc2.offset := #Ultimate.alloc(4);subxy_~x_ref~0.base, subxy_~x_ref~0.offset := subxy_#t~malloc2.base, subxy_#t~malloc2.offset;call subxy_#t~malloc3.base, subxy_#t~malloc3.offset := #Ultimate.alloc(4);subxy_~y_ref~0.base, subxy_~y_ref~0.offset := subxy_#t~malloc3.base, subxy_#t~malloc3.offset;call subxy_#t~malloc4.base, subxy_#t~malloc4.offset := #Ultimate.alloc(4);subxy_~z~0.base, subxy_~z~0.offset := subxy_#t~malloc4.base, subxy_#t~malloc4.offset;call subxy_#t~malloc5.base, subxy_#t~malloc5.offset := #Ultimate.alloc(4);subxy_~i~0.base, subxy_~i~0.offset := subxy_#t~malloc5.base, subxy_#t~malloc5.offset;call write~int(subxy_~x, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_~y, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);call write~int(0, subxy_~z~0.base, subxy_~z~0.offset, 4);call subxy_#t~mem6 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_#t~mem6, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~mem6;call subxy_#t~mem7 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem7 <= 0; 280#L556 assume !subxy_#t~short9;call subxy_#t~mem8 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem8 <= 0; 288#L556-2 assume !subxy_#t~short9;havoc subxy_#t~mem7;havoc subxy_#t~mem8;havoc subxy_#t~short9; 287#L559-3 call subxy_#t~mem10 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); 283#L559-1 assume !!(subxy_#t~mem10 > 0);havoc subxy_#t~mem10;call subxy_#t~mem11 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);subxy_#t~post12 := subxy_#t~mem11;call write~int(subxy_#t~post12 - 1, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~post12;havoc subxy_#t~mem11;call subxy_#t~mem13 := read~int(subxy_~z~0.base, subxy_~z~0.offset, 4);subxy_#t~post14 := subxy_#t~mem13;call write~int(1 + subxy_#t~post14, subxy_~z~0.base, subxy_~z~0.offset, 4);havoc subxy_#t~post14;havoc subxy_#t~mem13; 284#L559-3 call subxy_#t~mem10 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); 281#L559-1 assume !(subxy_#t~mem10 > 0);havoc subxy_#t~mem10; 282#L563-2 [2018-12-08 09:19:10,945 INFO L796 eck$LassoCheckResult]: Loop: 282#L563-2 call subxy_#t~mem15 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);call subxy_#t~mem16 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4); 286#L563 assume !!(subxy_#t~mem15 < subxy_#t~mem16);havoc subxy_#t~mem16;havoc subxy_#t~mem15;call subxy_#t~mem17 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);subxy_#t~post18 := subxy_#t~mem17;call write~int(1 + subxy_#t~post18, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~post18;havoc subxy_#t~mem17;call subxy_#t~mem19 := read~int(subxy_~z~0.base, subxy_~z~0.offset, 4);subxy_#t~post20 := subxy_#t~mem19;call write~int(subxy_#t~post20 - 1, subxy_~z~0.base, subxy_~z~0.offset, 4);havoc subxy_#t~post20;havoc subxy_#t~mem19; 282#L563-2 [2018-12-08 09:19:10,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:19:10,945 INFO L82 PathProgramCache]: Analyzing trace with hash 180521649, now seen corresponding path program 1 times [2018-12-08 09:19:10,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:19:10,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:19:10,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:10,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:19:10,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:19:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:19:10,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:19:10,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 2 times [2018-12-08 09:19:10,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:19:10,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:19:10,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:10,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:19:10,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:19:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:19:10,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:19:10,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1682613814, now seen corresponding path program 1 times [2018-12-08 09:19:10,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:19:10,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:19:10,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:10,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:19:10,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:19:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:19:11,691 WARN L180 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 139 [2018-12-08 09:19:11,852 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-12-08 09:19:11,854 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:19:11,854 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:19:11,854 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:19:11,854 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:19:11,854 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:19:11,855 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:19:11,855 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:19:11,855 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:19:11,855 INFO L131 ssoRankerPreferences]: Filename of dumped script: Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i_Iteration3_Lasso [2018-12-08 09:19:11,855 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:19:11,855 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:19:11,858 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-08 09:19:11,859 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-08 09:19:11,860 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-08 09:19:11,861 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-08 09:19:12,175 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2018-12-08 09:19:12,241 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-08 09:19:12,243 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-08 09:19:12,244 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-08 09:19:12,245 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-08 09:19:12,246 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-08 09:19:12,248 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-08 09:19:12,249 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-08 09:19:12,250 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-08 09:19:12,251 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-08 09:19:12,252 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-08 09:19:12,253 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-08 09:19:12,254 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-08 09:19:12,255 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-08 09:19:12,255 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-08 09:19:12,257 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-08 09:19:12,258 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-08 09:19:12,259 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-08 09:19:12,259 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-08 09:19:12,260 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-08 09:19:12,261 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-08 09:19:12,262 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-08 09:19:12,264 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-08 09:19:12,264 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-08 09:19:12,265 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-08 09:19:12,584 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:19:12,584 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 09:19:12,584 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-08 09:19:12,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:19:12,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:19:12,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:19:12,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:19:12,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:19:12,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:19:12,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:19:12,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:19:12,587 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-08 09:19:12,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:19:12,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:19:12,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:19:12,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:19:12,588 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:19:12,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:19:12,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:19:12,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:19:12,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:19:12,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:19:12,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:19:12,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:19:12,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:19:12,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:19:12,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:19:12,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:19:12,591 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-08 09:19:12,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:19:12,591 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:19:12,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:19:12,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:19:12,592 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:19:12,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:19:12,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:19:12,595 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-08 09:19:12,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:19:12,596 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:19:12,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:19:12,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:19:12,597 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:19:12,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:19:12,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:19:12,601 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-08 09:19:12,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:19:12,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:19:12,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:19:12,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:19:12,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:19:12,603 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:19:12,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:19:12,605 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-08 09:19:12,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:19:12,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:19:12,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:19:12,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:19:12,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:19:12,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:19:12,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:19:12,610 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-08 09:19:12,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:19:12,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:19:12,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:19:12,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:19:12,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:19:12,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:19:12,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:19:12,613 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-08 09:19:12,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:19:12,613 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:19:12,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:19:12,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:19:12,614 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:19:12,614 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:19:12,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:19:12,617 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-08 09:19:12,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:19:12,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:19:12,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:19:12,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:19:12,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:19:12,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:19:12,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:19:12,622 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-08 09:19:12,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:19:12,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:19:12,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:19:12,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:19:12,625 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:19:12,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:19:12,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:19:12,635 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-08 09:19:12,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:19:12,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:19:12,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:19:12,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:19:12,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:19:12,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:19:12,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:19:12,641 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-08 09:19:12,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:19:12,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:19:12,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:19:12,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:19:12,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:19:12,642 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:19:12,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:19:12,644 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-08 09:19:12,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:19:12,644 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:19:12,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:19:12,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:19:12,645 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:19:12,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:19:12,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:19:12,648 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-08 09:19:12,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:19:12,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:19:12,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:19:12,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:19:12,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:19:12,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:19:12,662 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 09:19:12,672 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 09:19:12,672 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-08 09:19:12,673 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 09:19:12,673 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 09:19:12,674 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 09:19:12,674 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_subxy_~y_ref~0.base) ULTIMATE.start_subxy_~y_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_subxy_~y_ref~0.base) ULTIMATE.start_subxy_~y_ref~0.offset)_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_2 Supporting invariants [] [2018-12-08 09:19:12,768 INFO L297 tatePredicateManager]: 34 out of 37 supporting invariants were superfluous and have been removed [2018-12-08 09:19:12,773 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 09:19:12,773 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 09:19:12,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:19:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:19:12,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:19:12,803 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 14 treesize of output 17 [2018-12-08 09:19:12,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-12-08 09:19:12,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:12,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:12,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:12,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-12-08 09:19:12,816 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 09:19:12,819 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:19:12,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:19:12,827 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-08 09:19:12,828 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:22, output treesize:12 [2018-12-08 09:19:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:19:12,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:19:12,847 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-08 09:19:12,847 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-08 09:19:12,847 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-12-08 09:19:12,873 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 12 states and 15 transitions. Complement of second has 5 states. [2018-12-08 09:19:12,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 09:19:12,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 09:19:12,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-12-08 09:19:12,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 8 letters. Loop has 2 letters. [2018-12-08 09:19:12,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:19:12,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 10 letters. Loop has 2 letters. [2018-12-08 09:19:12,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:19:12,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2018-12-08 09:19:12,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:19:12,874 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 15 transitions. [2018-12-08 09:19:12,874 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 09:19:12,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2018-12-08 09:19:12,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 09:19:12,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 09:19:12,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 09:19:12,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 09:19:12,875 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 09:19:12,875 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 09:19:12,875 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 09:19:12,875 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 09:19:12,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 09:19:12,875 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 09:19:12,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 09:19:12,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 09:19:12 BoogieIcfgContainer [2018-12-08 09:19:12,879 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 09:19:12,879 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 09:19:12,879 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 09:19:12,879 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 09:19:12,879 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:19:08" (3/4) ... [2018-12-08 09:19:12,882 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 09:19:12,882 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 09:19:12,882 INFO L168 Benchmark]: Toolchain (without parser) took 4609.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -110.6 MB). Peak memory consumption was 55.1 MB. Max. memory is 11.5 GB. [2018-12-08 09:19:12,883 INFO L168 Benchmark]: CDTParser took 0.16 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-08 09:19:12,883 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -149.4 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-08 09:19:12,883 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.09 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 09:19:12,883 INFO L168 Benchmark]: Boogie Preprocessor took 14.97 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-08 09:19:12,884 INFO L168 Benchmark]: RCFGBuilder took 187.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-08 09:19:12,884 INFO L168 Benchmark]: BuchiAutomizer took 4128.38 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 56.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 69.9 MB. Max. memory is 11.5 GB. [2018-12-08 09:19:12,884 INFO L168 Benchmark]: Witness Printer took 2.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:19:12,886 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 247.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -149.4 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.09 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.97 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 187.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4128.38 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 56.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 69.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[i][i] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] + -1 * unknown-#memory_int-unknown[i][i] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.0s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 3.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 21 SDtfs, 24 SDslu, 16 SDs, 0 SdLazy, 44 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital779 mio100 ax102 hnf100 lsp95 ukn31 mio100 lsp34 div100 bol100 ite100 ukn100 eq192 hnf87 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 2 VariablesLoop: 2 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...