./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-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_eaf783c4-7317-4d68-8d90-b5c9378eb6bd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_eaf783c4-7317-4d68-8d90-b5c9378eb6bd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_eaf783c4-7317-4d68-8d90-b5c9378eb6bd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_eaf783c4-7317-4d68-8d90-b5c9378eb6bd/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_eaf783c4-7317-4d68-8d90-b5c9378eb6bd/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_eaf783c4-7317-4d68-8d90-b5c9378eb6bd/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 cb5770b8d32c05b82025135c2b222cf31b0a4100 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 06:35:27,869 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 06:35:27,870 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 06:35:27,875 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 06:35:27,876 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 06:35:27,876 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 06:35:27,877 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 06:35:27,878 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 06:35:27,879 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 06:35:27,879 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 06:35:27,880 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 06:35:27,880 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 06:35:27,880 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 06:35:27,881 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 06:35:27,881 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 06:35:27,882 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 06:35:27,882 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 06:35:27,883 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 06:35:27,884 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 06:35:27,885 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 06:35:27,885 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 06:35:27,886 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 06:35:27,887 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 06:35:27,887 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 06:35:27,887 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 06:35:27,888 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 06:35:27,888 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 06:35:27,889 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 06:35:27,889 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 06:35:27,890 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 06:35:27,890 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 06:35:27,890 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 06:35:27,890 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 06:35:27,891 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 06:35:27,891 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 06:35:27,891 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 06:35:27,892 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_eaf783c4-7317-4d68-8d90-b5c9378eb6bd/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 06:35:27,899 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 06:35:27,900 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 06:35:27,900 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 06:35:27,900 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 06:35:27,900 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 06:35:27,900 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 06:35:27,901 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 06:35:27,901 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 06:35:27,901 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 06:35:27,901 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 06:35:27,901 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 06:35:27,901 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 06:35:27,901 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 06:35:27,901 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 06:35:27,901 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 06:35:27,901 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 06:35:27,901 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 06:35:27,901 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 06:35:27,902 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 06:35:27,902 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 06:35:27,902 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 06:35:27,902 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 06:35:27,902 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 06:35:27,902 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 06:35:27,902 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 06:35:27,902 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 06:35:27,902 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 06:35:27,902 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 06:35:27,903 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 06:35:27,903 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_eaf783c4-7317-4d68-8d90-b5c9378eb6bd/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 -> cb5770b8d32c05b82025135c2b222cf31b0a4100 [2018-12-09 06:35:27,919 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 06:35:27,926 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 06:35:27,928 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 06:35:27,929 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 06:35:27,929 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 06:35:27,929 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_eaf783c4-7317-4d68-8d90-b5c9378eb6bd/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i [2018-12-09 06:35:27,963 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eaf783c4-7317-4d68-8d90-b5c9378eb6bd/bin-2019/uautomizer/data/72d3aa3a4/7b16fc25b0dc48b0859ef0a25f2a5dc8/FLAG31ecb4ec7 [2018-12-09 06:35:28,373 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 06:35:28,374 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_eaf783c4-7317-4d68-8d90-b5c9378eb6bd/sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i [2018-12-09 06:35:28,380 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eaf783c4-7317-4d68-8d90-b5c9378eb6bd/bin-2019/uautomizer/data/72d3aa3a4/7b16fc25b0dc48b0859ef0a25f2a5dc8/FLAG31ecb4ec7 [2018-12-09 06:35:28,388 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_eaf783c4-7317-4d68-8d90-b5c9378eb6bd/bin-2019/uautomizer/data/72d3aa3a4/7b16fc25b0dc48b0859ef0a25f2a5dc8 [2018-12-09 06:35:28,389 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 06:35:28,390 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 06:35:28,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 06:35:28,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 06:35:28,393 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 06:35:28,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:35:28" (1/1) ... [2018-12-09 06:35:28,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ceaa519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:35:28, skipping insertion in model container [2018-12-09 06:35:28,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:35:28" (1/1) ... [2018-12-09 06:35:28,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 06:35:28,416 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 06:35:28,555 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 06:35:28,561 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 06:35:28,622 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 06:35:28,641 INFO L195 MainTranslator]: Completed translation [2018-12-09 06:35:28,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:35:28 WrapperNode [2018-12-09 06:35:28,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 06:35:28,642 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 06:35:28,642 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 06:35:28,643 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 06:35:28,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:35:28" (1/1) ... [2018-12-09 06:35:28,655 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:35:28" (1/1) ... [2018-12-09 06:35:28,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 06:35:28,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 06:35:28,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 06:35:28,670 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 06:35:28,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:35:28" (1/1) ... [2018-12-09 06:35:28,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:35:28" (1/1) ... [2018-12-09 06:35:28,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:35:28" (1/1) ... [2018-12-09 06:35:28,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:35:28" (1/1) ... [2018-12-09 06:35:28,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:35:28" (1/1) ... [2018-12-09 06:35:28,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:35:28" (1/1) ... [2018-12-09 06:35:28,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:35:28" (1/1) ... [2018-12-09 06:35:28,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 06:35:28,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 06:35:28,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 06:35:28,687 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 06:35:28,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:35:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaf783c4-7317-4d68-8d90-b5c9378eb6bd/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-09 06:35:28,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 06:35:28,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 06:35:28,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 06:35:28,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 06:35:28,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 06:35:28,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 06:35:28,924 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 06:35:28,925 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-12-09 06:35:28,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:35:28 BoogieIcfgContainer [2018-12-09 06:35:28,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 06:35:28,925 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 06:35:28,926 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 06:35:28,928 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 06:35:28,928 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 06:35:28,928 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 06:35:28" (1/3) ... [2018-12-09 06:35:28,929 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78344146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 06:35:28, skipping insertion in model container [2018-12-09 06:35:28,929 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 06:35:28,929 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:35:28" (2/3) ... [2018-12-09 06:35:28,930 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78344146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 06:35:28, skipping insertion in model container [2018-12-09 06:35:28,930 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 06:35:28,930 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:35:28" (3/3) ... [2018-12-09 06:35:28,931 INFO L375 chiAutomizerObserver]: Analyzing ICFG HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i [2018-12-09 06:35:28,961 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 06:35:28,961 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 06:35:28,961 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 06:35:28,961 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 06:35:28,962 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 06:35:28,962 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 06:35:28,962 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 06:35:28,962 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 06:35:28,962 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 06:35:28,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-12-09 06:35:28,982 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-09 06:35:28,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:35:28,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:35:28,987 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 06:35:28,987 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 06:35:28,987 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 06:35:28,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-12-09 06:35:28,988 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-09 06:35:28,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:35:28,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:35:28,989 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 06:35:28,989 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 06:35:28,993 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#L-1true havoc main_#res;havoc main_#t~nondet21; 8#L578true assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 3#L558true assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 23#L562-2true [2018-12-09 06:35:28,993 INFO L796 eck$LassoCheckResult]: Loop: 23#L562-2true call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 18#L562true assume !!(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9;call f_#t~mem10 := read~int(f_~z~0.base, f_~z~0.offset, 4);call write~int(2 * f_#t~mem10, f_~z~0.base, f_~z~0.offset, 4);havoc f_#t~mem10; 23#L562-2true [2018-12-09 06:35:28,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:35:28,997 INFO L82 PathProgramCache]: Analyzing trace with hash 925608, now seen corresponding path program 1 times [2018-12-09 06:35:28,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:35:28,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:35:29,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:29,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:35:29,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:35:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:35:29,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:35:29,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1446, now seen corresponding path program 1 times [2018-12-09 06:35:29,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:35:29,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:35:29,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:29,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:35:29,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:35:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:35:29,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:35:29,110 INFO L82 PathProgramCache]: Analyzing trace with hash 889509773, now seen corresponding path program 1 times [2018-12-09 06:35:29,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:35:29,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:35:29,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:29,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:35:29,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:35:29,236 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-09 06:35:29,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:35:29,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 06:35:29,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 06:35:29,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 06:35:29,289 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2018-12-09 06:35:29,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:35:29,383 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2018-12-09 06:35:29,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 06:35:29,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2018-12-09 06:35:29,387 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 06:35:29,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 29 states and 38 transitions. [2018-12-09 06:35:29,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-12-09 06:35:29,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-12-09 06:35:29,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2018-12-09 06:35:29,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 06:35:29,394 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-12-09 06:35:29,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2018-12-09 06:35:29,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-12-09 06:35:29,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-09 06:35:29,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-12-09 06:35:29,419 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-09 06:35:29,419 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-09 06:35:29,419 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 06:35:29,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-12-09 06:35:29,419 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 06:35:29,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:35:29,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:35:29,420 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 06:35:29,420 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 06:35:29,420 INFO L794 eck$LassoCheckResult]: Stem: 93#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 92#L-1 havoc main_#res;havoc main_#t~nondet21; 85#L578 assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 78#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 79#L562-2 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 94#L562 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9; 81#L567-2 [2018-12-09 06:35:29,420 INFO L796 eck$LassoCheckResult]: Loop: 81#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 89#L566 assume !f_#t~short13; 90#L566-2 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 86#L567 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem19;havoc f_#t~mem20; 81#L567-2 [2018-12-09 06:35:29,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:35:29,421 INFO L82 PathProgramCache]: Analyzing trace with hash 889509771, now seen corresponding path program 1 times [2018-12-09 06:35:29,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:35:29,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:35:29,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:29,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:35:29,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:35:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:35:29,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:35:29,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1759853, now seen corresponding path program 1 times [2018-12-09 06:35:29,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:35:29,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:35:29,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:29,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:35:29,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:35:29,468 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-09 06:35:29,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:35:29,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:35:29,468 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 06:35:29,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:35:29,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:35:29,469 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-09 06:35:29,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:35:29,483 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-12-09 06:35:29,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:35:29,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2018-12-09 06:35:29,484 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 06:35:29,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 22 transitions. [2018-12-09 06:35:29,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-09 06:35:29,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-12-09 06:35:29,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2018-12-09 06:35:29,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 06:35:29,485 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-12-09 06:35:29,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2018-12-09 06:35:29,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-09 06:35:29,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-09 06:35:29,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-12-09 06:35:29,486 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-12-09 06:35:29,486 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-12-09 06:35:29,486 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 06:35:29,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-12-09 06:35:29,487 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 06:35:29,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:35:29,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:35:29,487 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 06:35:29,487 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 06:35:29,487 INFO L794 eck$LassoCheckResult]: Stem: 139#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 137#L-1 havoc main_#res;havoc main_#t~nondet21; 131#L578 assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 124#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 125#L562-2 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 140#L562 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9; 127#L567-2 [2018-12-09 06:35:29,487 INFO L796 eck$LassoCheckResult]: Loop: 127#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 135#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 136#L566-2 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 132#L567 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem19;havoc f_#t~mem20; 127#L567-2 [2018-12-09 06:35:29,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:35:29,487 INFO L82 PathProgramCache]: Analyzing trace with hash 889509771, now seen corresponding path program 2 times [2018-12-09 06:35:29,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:35:29,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:35:29,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:29,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:35:29,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:35:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:35:29,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:35:29,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1757931, now seen corresponding path program 1 times [2018-12-09 06:35:29,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:35:29,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:35:29,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:29,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:35:29,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:35:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:35:29,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:35:29,528 INFO L82 PathProgramCache]: Analyzing trace with hash -260778635, now seen corresponding path program 1 times [2018-12-09 06:35:29,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:35:29,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:35:29,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:29,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:35:29,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:35:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:35:30,191 WARN L180 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 126 [2018-12-09 06:35:30,446 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2018-12-09 06:35:30,455 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 06:35:30,455 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 06:35:30,456 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 06:35:30,456 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 06:35:30,456 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 06:35:30,456 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 06:35:30,456 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 06:35:30,456 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 06:35:30,456 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i_Iteration3_Lasso [2018-12-09 06:35:30,456 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 06:35:30,456 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 06:35:30,471 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-09 06:35:30,475 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-09 06:35:30,477 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-09 06:35:30,478 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-09 06:35:30,479 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-09 06:35:30,480 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-09 06:35:30,482 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-09 06:35:30,483 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-09 06:35:30,485 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-09 06:35:30,486 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-09 06:35:30,487 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-09 06:35:30,489 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-09 06:35:30,490 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-09 06:35:30,491 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-09 06:35:30,498 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-09 06:35:30,499 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-09 06:35:30,500 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-09 06:35:30,502 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-09 06:35:30,503 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-09 06:35:30,504 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-09 06:35:30,505 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-09 06:35:30,506 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-09 06:35:30,986 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 95 [2018-12-09 06:35:31,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:35:31,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:35:31,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:35:31,430 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 06:35:31,433 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 06:35:31,434 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-09 06:35:31,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:35:31,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:35:31,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:35:31,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,439 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-09 06:35:31,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:35:31,441 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:31,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,443 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-09 06:35:31,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:35:31,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:35:31,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:35:31,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,445 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-09 06:35:31,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:35:31,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:35:31,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:35:31,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,446 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-09 06:35:31,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:35:31,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:35:31,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:35:31,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:35:31,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,449 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:35:31,449 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:31,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,451 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-09 06:35:31,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:35:31,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:35:31,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:35:31,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,452 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-09 06:35:31,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,453 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:35:31,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:31,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,455 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-09 06:35:31,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:35:31,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:35:31,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:35:31,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,457 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-09 06:35:31,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:35:31,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:35:31,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:35:31,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,458 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-09 06:35:31,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:35:31,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:31,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,461 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-09 06:35:31,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:35:31,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:35:31,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:35:31,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,462 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-09 06:35:31,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:35:31,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:35:31,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:35:31,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,463 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-09 06:35:31,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:35:31,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:31,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,466 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-09 06:35:31,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:35:31,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:35:31,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:35:31,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,467 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-09 06:35:31,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:35:31,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:35:31,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:35:31,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,469 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-09 06:35:31,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:35:31,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:35:31,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:35:31,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,470 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-09 06:35:31,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:35:31,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:31,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,473 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-09 06:35:31,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:35:31,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:35:31,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:35:31,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,474 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-09 06:35:31,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:35:31,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:35:31,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:35:31,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,475 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-09 06:35:31,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:35:31,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:35:31,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:35:31,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,477 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-09 06:35:31,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:35:31,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:31,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,482 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-09 06:35:31,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,483 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:35:31,483 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:31,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,487 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-09 06:35:31,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:35:31,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:31,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,489 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-09 06:35:31,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,489 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:35:31,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,490 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:35:31,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:31,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,494 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-09 06:35:31,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:35:31,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:31,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,506 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-09 06:35:31,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,506 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:35:31,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,507 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:35:31,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:31,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,510 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-09 06:35:31,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,510 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:35:31,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,511 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:35:31,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:31,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,514 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-09 06:35:31,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,515 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:35:31,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:31,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,517 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-09 06:35:31,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:35:31,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:31,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,521 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-09 06:35:31,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,521 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:35:31,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,522 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:35:31,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:31,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,525 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-09 06:35:31,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:35:31,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:31,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,528 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-09 06:35:31,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,528 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:35:31,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,529 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:35:31,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:31,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:31,531 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-09 06:35:31,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:31,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:31,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:31,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:31,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:35:31,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:31,538 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 06:35:31,545 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 06:35:31,545 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-09 06:35:31,546 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 06:35:31,547 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-09 06:35:31,547 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 06:35:31,548 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_f_~d_ref~0.base) ULTIMATE.start_f_~d_ref~0.offset)_1 - 1 >= 0] [2018-12-09 06:35:31,727 INFO L297 tatePredicateManager]: 60 out of 64 supporting invariants were superfluous and have been removed [2018-12-09 06:35:31,736 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 06:35:31,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:35:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:35:31,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:35:31,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:31,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-12-09 06:35:31,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:31,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:31,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-12-09 06:35:31,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:31,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:31,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:31,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 64 [2018-12-09 06:35:31,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:31,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:31,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:31,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:31,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:31,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:31,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-09 06:35:31,928 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:31,952 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:31,981 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:32,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:32,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 132 [2018-12-09 06:35:32,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 06:35:32,089 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:32,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 79 [2018-12-09 06:35:32,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 06:35:32,138 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:32,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2018-12-09 06:35:32,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 06:35:32,179 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:32,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 65 [2018-12-09 06:35:32,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 06:35:32,206 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:32,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 77 [2018-12-09 06:35:32,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 06:35:32,236 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:32,251 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:32,258 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:32,264 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:32,271 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:32,277 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:32,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-12-09 06:35:32,301 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 10 variables, input treesize:312, output treesize:83 [2018-12-09 06:35:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:35:32,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:35:32,382 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-09 06:35:32,384 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-09 06:35:32,385 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-12-09 06:35:32,826 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 34 states and 40 transitions. Complement of second has 10 states. [2018-12-09 06:35:32,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-09 06:35:32,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 06:35:32,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2018-12-09 06:35:32,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-09 06:35:32,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:35:32,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-09 06:35:32,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:35:32,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 6 letters. Loop has 8 letters. [2018-12-09 06:35:32,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:35:32,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2018-12-09 06:35:32,830 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 06:35:32,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 39 transitions. [2018-12-09 06:35:32,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-12-09 06:35:32,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-12-09 06:35:32,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2018-12-09 06:35:32,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 06:35:32,831 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-12-09 06:35:32,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2018-12-09 06:35:32,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-12-09 06:35:32,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-09 06:35:32,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-12-09 06:35:32,832 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-12-09 06:35:32,832 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-12-09 06:35:32,832 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 06:35:32,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2018-12-09 06:35:32,832 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 06:35:32,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:35:32,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:35:32,833 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 06:35:32,833 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 06:35:32,833 INFO L794 eck$LassoCheckResult]: Stem: 520#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 517#L-1 havoc main_#res;havoc main_#t~nondet21; 506#L578 assume !(0 != main_#t~nondet21);havoc main_#t~nondet21;f_#in~d := 2;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 503#L558-1 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 504#L562-5 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 505#L562-3 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9; 511#L567-5 [2018-12-09 06:35:32,833 INFO L796 eck$LassoCheckResult]: Loop: 511#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 523#L566-5 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 524#L566-7 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 519#L567-3 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem19;havoc f_#t~mem20; 511#L567-5 [2018-12-09 06:35:32,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:35:32,833 INFO L82 PathProgramCache]: Analyzing trace with hash 890987403, now seen corresponding path program 1 times [2018-12-09 06:35:32,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:35:32,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:35:32,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:32,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:35:32,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:35:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:35:32,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:35:32,854 INFO L82 PathProgramCache]: Analyzing trace with hash 3235563, now seen corresponding path program 1 times [2018-12-09 06:35:32,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:35:32,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:35:32,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:32,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:35:32,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:35:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:35:32,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:35:32,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1434718859, now seen corresponding path program 1 times [2018-12-09 06:35:32,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:35:32,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:35:32,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:32,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:35:32,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:35:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:35:33,528 WARN L180 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 126 [2018-12-09 06:35:33,729 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2018-12-09 06:35:33,732 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 06:35:33,732 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 06:35:33,732 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 06:35:33,732 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 06:35:33,732 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 06:35:33,732 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 06:35:33,732 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 06:35:33,732 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 06:35:33,732 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i_Iteration4_Lasso [2018-12-09 06:35:33,732 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 06:35:33,733 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 06:35:33,735 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-09 06:35:33,736 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-09 06:35:33,737 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-09 06:35:33,738 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-09 06:35:33,739 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-09 06:35:33,740 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-09 06:35:33,744 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-09 06:35:33,745 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-09 06:35:33,748 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-09 06:35:33,750 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-09 06:35:33,751 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-09 06:35:33,756 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-09 06:35:33,757 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-09 06:35:33,759 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-09 06:35:33,760 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-09 06:35:34,255 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 94 [2018-12-09 06:35:34,344 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-09 06:35:34,345 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-09 06:35:34,346 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-09 06:35:34,347 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-09 06:35:34,348 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-09 06:35:34,349 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-09 06:35:34,349 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-09 06:35:34,351 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-09 06:35:34,352 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-09 06:35:34,353 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-09 06:35:34,682 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 06:35:34,683 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 06:35:34,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:35:34,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:34,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:35:34,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:34,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:34,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:34,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:35:34,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:35:34,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:34,686 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-09 06:35:34,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:34,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:35:34,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:34,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:34,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:34,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:35:34,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:35:34,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:34,687 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-09 06:35:34,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:34,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:35:34,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:34,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:34,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:34,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:35:34,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:35:34,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:34,688 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-09 06:35:34,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:34,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:34,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:34,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:34,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:35:34,689 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:34,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:34,690 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-09 06:35:34,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:34,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:35:34,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:34,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:34,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:34,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:35:34,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:35:34,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:34,691 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-09 06:35:34,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:34,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:34,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:34,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:34,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:35:34,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:34,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:34,694 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-09 06:35:34,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:34,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:35:34,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:34,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:34,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:34,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:35:34,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:35:34,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:34,696 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-09 06:35:34,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:34,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:35:34,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:34,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:34,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:34,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:35:34,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:35:34,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:34,698 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-09 06:35:34,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:34,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:34,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:34,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:34,699 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:35:34,699 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:34,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:34,700 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-09 06:35:34,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:34,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:35:34,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:34,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:34,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:34,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:35:34,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:35:34,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:34,702 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-09 06:35:34,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:34,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:34,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:34,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:34,703 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:35:34,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:34,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:34,704 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-09 06:35:34,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:34,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:35:34,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:34,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:34,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:34,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:35:34,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:35:34,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:34,705 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-09 06:35:34,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:34,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:35:34,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:34,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:34,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:34,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:35:34,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:35:34,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:34,707 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-09 06:35:34,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:34,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:34,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:34,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:34,709 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:35:34,709 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:34,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:34,710 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-09 06:35:34,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:34,710 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:35:34,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:34,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:34,711 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:35:34,711 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:34,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:34,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:35:34,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:34,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:34,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:34,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:34,715 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:35:34,715 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:34,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:34,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:35:34,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:34,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:34,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:34,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:34,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:35:34,719 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:34,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:34,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:35:34,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:34,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:34,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:34,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:34,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:35:34,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:34,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:34,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:35:34,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:34,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:34,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:34,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:34,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:35:34,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:34,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:34,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:35:34,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:34,739 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:35:34,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:34,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:34,740 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:35:34,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:34,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:35:34,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:35:34,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:35:34,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:35:34,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:35:34,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:35:34,745 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:35:34,745 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:35:34,754 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 06:35:34,762 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 06:35:34,762 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-09 06:35:34,763 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 06:35:34,764 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-09 06:35:34,764 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 06:35:34,764 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_2 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_f_~d_ref~0.base) ULTIMATE.start_f_~d_ref~0.offset)_2 - 2 >= 0] [2018-12-09 06:35:34,927 INFO L297 tatePredicateManager]: 55 out of 59 supporting invariants were superfluous and have been removed [2018-12-09 06:35:34,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 06:35:34,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:35:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:35:34,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:35:35,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:35,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-12-09 06:35:35,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:35,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:35,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-12-09 06:35:35,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:35,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:35,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:35,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 64 [2018-12-09 06:35:35,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:35,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:35,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:35,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:35,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:35,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:35,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-09 06:35:35,106 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:35,130 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:35,157 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:35,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:35,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 132 [2018-12-09 06:35:35,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 06:35:35,237 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:35,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 79 [2018-12-09 06:35:35,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 06:35:35,258 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:35,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2018-12-09 06:35:35,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 06:35:35,290 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:35,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 65 [2018-12-09 06:35:35,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 06:35:35,324 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:35,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 77 [2018-12-09 06:35:35,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 06:35:35,358 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:35,372 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:35,377 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:35,382 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:35,388 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:35,393 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:35,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-12-09 06:35:35,415 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 10 variables, input treesize:312, output treesize:83 [2018-12-09 06:35:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:35:35,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:35:35,494 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-09 06:35:35,494 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-09 06:35:35,494 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-12-09 06:35:35,589 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 37 states and 44 transitions. Complement of second has 10 states. [2018-12-09 06:35:35,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-09 06:35:35,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 06:35:35,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-12-09 06:35:35,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-09 06:35:35,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:35:35,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-09 06:35:35,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:35:35,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2018-12-09 06:35:35,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:35:35,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2018-12-09 06:35:35,591 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 06:35:35,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 43 transitions. [2018-12-09 06:35:35,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-09 06:35:35,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-09 06:35:35,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 43 transitions. [2018-12-09 06:35:35,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 06:35:35,592 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-12-09 06:35:35,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 43 transitions. [2018-12-09 06:35:35,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-12-09 06:35:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-09 06:35:35,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-12-09 06:35:35,593 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-12-09 06:35:35,593 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-12-09 06:35:35,593 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 06:35:35,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2018-12-09 06:35:35,594 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 06:35:35,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:35:35,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:35:35,594 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:35:35,594 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 06:35:35,594 INFO L794 eck$LassoCheckResult]: Stem: 887#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 886#L-1 havoc main_#res;havoc main_#t~nondet21; 872#L578 assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 865#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 866#L562-2 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 891#L562 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9; 892#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 878#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 879#L566-2 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 873#L567 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 867#L568 [2018-12-09 06:35:35,594 INFO L796 eck$LassoCheckResult]: Loop: 867#L568 call f_#t~mem15 := read~int(f_~x~0.base, f_~x~0.offset, 4);call f_#t~mem16 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem15 - f_#t~mem16, f_~x~0.base, f_~x~0.offset, 4);havoc f_#t~mem15;havoc f_#t~mem16;call write~int(f_#t~nondet17, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~nondet17;call f_#t~mem18 := read~int(f_~z~0.base, f_~z~0.offset, 4);call write~int(f_#t~mem18 - 1, f_~z~0.base, f_~z~0.offset, 4);havoc f_#t~mem18; 868#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 882#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 897#L566-2 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 896#L567 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 867#L568 [2018-12-09 06:35:35,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:35:35,594 INFO L82 PathProgramCache]: Analyzing trace with hash -260778639, now seen corresponding path program 1 times [2018-12-09 06:35:35,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:35:35,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:35:35,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:35,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:35:35,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:35:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:35:35,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:35:35,607 INFO L82 PathProgramCache]: Analyzing trace with hash 69174960, now seen corresponding path program 1 times [2018-12-09 06:35:35,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:35:35,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:35:35,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:35,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:35:35,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:35:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:35:35,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:35:35,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1938200384, now seen corresponding path program 1 times [2018-12-09 06:35:35,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:35:35,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:35:35,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:35,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:35:35,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:35:35,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:35:35,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:35:35,742 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaf783c4-7317-4d68-8d90-b5c9378eb6bd/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 06:35:35,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:35:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:35:35,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:35:35,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:35,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-12-09 06:35:35,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:35,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:35,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-12-09 06:35:35,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:35,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:35,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:35,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:35,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2018-12-09 06:35:35,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:35,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:35,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:35,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:35,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:35,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:35,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-09 06:35:35,890 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:35,913 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:35,934 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:35,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:35,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 132 [2018-12-09 06:35:35,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 06:35:35,998 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:36,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 79 [2018-12-09 06:35:36,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 06:35:36,019 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:36,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2018-12-09 06:35:36,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 06:35:36,037 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:36,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 65 [2018-12-09 06:35:36,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 06:35:36,056 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:36,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 77 [2018-12-09 06:35:36,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 06:35:36,084 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:36,098 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:36,103 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:36,109 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:36,114 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:36,120 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:36,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 06:35:36,136 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:305, output treesize:76 [2018-12-09 06:35:36,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:36,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 149 [2018-12-09 06:35:36,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:36,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2018-12-09 06:35:36,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:36,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 107 [2018-12-09 06:35:36,289 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-12-09 06:35:36,290 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:36,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:36,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 104 [2018-12-09 06:35:36,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:36,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-09 06:35:36,320 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:36,336 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:36,341 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:36,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:36,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-12-09 06:35:36,364 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:237, output treesize:61 [2018-12-09 06:35:36,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:35:36,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 06:35:36,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2018-12-09 06:35:36,503 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2018-12-09 06:35:36,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 06:35:36,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-09 06:35:36,540 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 11 Second operand 9 states. [2018-12-09 06:35:37,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:35:37,108 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-12-09 06:35:37,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 06:35:37,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 68 transitions. [2018-12-09 06:35:37,109 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 06:35:37,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 45 states and 50 transitions. [2018-12-09 06:35:37,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-09 06:35:37,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-12-09 06:35:37,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 50 transitions. [2018-12-09 06:35:37,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 06:35:37,110 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-12-09 06:35:37,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 50 transitions. [2018-12-09 06:35:37,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2018-12-09 06:35:37,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 06:35:37,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-12-09 06:35:37,111 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-12-09 06:35:37,111 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-12-09 06:35:37,111 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 06:35:37,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 44 transitions. [2018-12-09 06:35:37,112 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 06:35:37,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:35:37,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:35:37,112 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:35:37,112 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 06:35:37,112 INFO L794 eck$LassoCheckResult]: Stem: 1057#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1056#L-1 havoc main_#res;havoc main_#t~nondet21; 1038#L578 assume !(0 != main_#t~nondet21);havoc main_#t~nondet21;f_#in~d := 2;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 1035#L558-1 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 1036#L562-5 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 1037#L562-3 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9; 1065#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1060#L566-5 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1063#L566-7 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 1051#L567-3 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem19;havoc f_#t~mem20; 1052#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1061#L566-5 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1064#L566-7 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 1050#L567-3 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 1042#L568-1 [2018-12-09 06:35:37,112 INFO L796 eck$LassoCheckResult]: Loop: 1042#L568-1 call f_#t~mem15 := read~int(f_~x~0.base, f_~x~0.offset, 4);call f_#t~mem16 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem15 - f_#t~mem16, f_~x~0.base, f_~x~0.offset, 4);havoc f_#t~mem15;havoc f_#t~mem16;call write~int(f_#t~nondet17, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~nondet17;call f_#t~mem18 := read~int(f_~z~0.base, f_~z~0.offset, 4);call write~int(f_#t~mem18 - 1, f_~z~0.base, f_~z~0.offset, 4);havoc f_#t~mem18; 1043#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1059#L566-5 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1062#L566-7 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 1066#L567-3 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 1042#L568-1 [2018-12-09 06:35:37,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:35:37,112 INFO L82 PathProgramCache]: Analyzing trace with hash 122778203, now seen corresponding path program 1 times [2018-12-09 06:35:37,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:35:37,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:35:37,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:37,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:35:37,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:35:37,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:35:37,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 06:35:37,173 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaf783c4-7317-4d68-8d90-b5c9378eb6bd/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 06:35:37,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:35:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:35:37,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:35:37,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:37,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-12-09 06:35:37,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:37,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:37,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-12-09 06:35:37,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:37,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:37,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:37,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:37,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2018-12-09 06:35:37,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:37,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:37,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:37,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:37,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:37,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:37,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-09 06:35:37,317 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:37,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:37,378 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:37,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:37,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 132 [2018-12-09 06:35:37,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 06:35:37,461 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:37,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 79 [2018-12-09 06:35:37,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 06:35:37,482 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:37,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2018-12-09 06:35:37,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 06:35:37,499 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:37,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 65 [2018-12-09 06:35:37,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 06:35:37,520 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:37,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 77 [2018-12-09 06:35:37,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 06:35:37,544 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:37,556 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:37,562 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:37,567 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:37,572 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:37,577 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:37,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-12-09 06:35:37,593 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 9 variables, input treesize:305, output treesize:76 [2018-12-09 06:35:37,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:37,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 108 [2018-12-09 06:35:37,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 06:35:37,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-12-09 06:35:37,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 06:35:37,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 06:35:37,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-12-09 06:35:37,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:99, output treesize:84 [2018-12-09 06:35:37,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:35:37,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 06:35:37,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-12-09 06:35:37,697 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 06:35:37,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:35:37,697 INFO L82 PathProgramCache]: Analyzing trace with hash 114981600, now seen corresponding path program 1 times [2018-12-09 06:35:37,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:35:37,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:35:37,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:37,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:35:37,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:35:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:35:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:35:37,826 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2018-12-09 06:35:37,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 06:35:37,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 06:35:37,871 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-12-09 06:35:37,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:35:37,950 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2018-12-09 06:35:37,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 06:35:37,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 24 transitions. [2018-12-09 06:35:37,951 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 06:35:37,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2018-12-09 06:35:37,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 06:35:37,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 06:35:37,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 06:35:37,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 06:35:37,951 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 06:35:37,952 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 06:35:37,952 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 06:35:37,952 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 06:35:37,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 06:35:37,952 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 06:35:37,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 06:35:37,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 06:35:37 BoogieIcfgContainer [2018-12-09 06:35:37,956 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 06:35:37,956 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 06:35:37,956 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 06:35:37,957 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 06:35:37,957 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:35:28" (3/4) ... [2018-12-09 06:35:37,959 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 06:35:37,959 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 06:35:37,960 INFO L168 Benchmark]: Toolchain (without parser) took 9570.14 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 357.6 MB). Free memory was 957.1 MB in the beginning and 1.2 GB in the end (delta: -257.1 MB). Peak memory consumption was 100.4 MB. Max. memory is 11.5 GB. [2018-12-09 06:35:37,960 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 06:35:37,960 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -157.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-12-09 06:35:37,961 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.11 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-09 06:35:37,961 INFO L168 Benchmark]: Boogie Preprocessor took 17.15 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-09 06:35:37,961 INFO L168 Benchmark]: RCFGBuilder took 238.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2018-12-09 06:35:37,961 INFO L168 Benchmark]: BuchiAutomizer took 9030.70 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -132.5 MB). Peak memory consumption was 94.6 MB. Max. memory is 11.5 GB. [2018-12-09 06:35:37,962 INFO L168 Benchmark]: Witness Printer took 2.89 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 06:35:37,963 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 251.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -157.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 238.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9030.70 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -132.5 MB). Peak memory consumption was 94.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.89 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.0s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.3s. Construction of modules took 0.9s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 23 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 89 SDtfs, 105 SDslu, 145 SDs, 0 SdLazy, 243 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital545 mio100 ax103 hnf100 lsp93 ukn44 mio100 lsp33 div100 bol100 ite100 ukn100 eq199 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms 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...