./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_95a298e6-fcf1-44bf-aa0e-dd69398c4d62/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_95a298e6-fcf1-44bf-aa0e-dd69398c4d62/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_95a298e6-fcf1-44bf-aa0e-dd69398c4d62/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_95a298e6-fcf1-44bf-aa0e-dd69398c4d62/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_95a298e6-fcf1-44bf-aa0e-dd69398c4d62/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_95a298e6-fcf1-44bf-aa0e-dd69398c4d62/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-aa41828 [2018-11-23 13:50:06,953 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:50:06,954 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:50:06,960 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:50:06,960 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:50:06,961 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:50:06,962 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:50:06,962 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:50:06,963 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:50:06,964 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:50:06,964 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:50:06,964 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:50:06,965 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:50:06,965 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:50:06,966 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:50:06,967 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:50:06,967 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:50:06,968 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:50:06,969 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:50:06,970 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:50:06,971 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:50:06,971 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:50:06,972 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:50:06,972 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:50:06,972 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:50:06,973 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:50:06,974 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:50:06,974 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:50:06,974 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:50:06,975 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:50:06,975 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:50:06,976 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:50:06,976 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:50:06,976 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:50:06,977 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:50:06,977 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:50:06,978 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_95a298e6-fcf1-44bf-aa0e-dd69398c4d62/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 13:50:06,986 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:50:06,987 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:50:06,988 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:50:06,988 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:50:06,988 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:50:06,988 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 13:50:06,988 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 13:50:06,988 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 13:50:06,989 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 13:50:06,989 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 13:50:06,989 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 13:50:06,989 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:50:06,989 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 13:50:06,989 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:50:06,989 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:50:06,989 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 13:50:06,990 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 13:50:06,990 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 13:50:06,990 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:50:06,990 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 13:50:06,990 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:50:06,990 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 13:50:06,990 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:50:06,991 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:50:06,991 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 13:50:06,991 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:50:06,991 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:50:06,991 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 13:50:06,992 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 13:50:06,992 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_95a298e6-fcf1-44bf-aa0e-dd69398c4d62/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-11-23 13:50:07,016 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:50:07,025 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:50:07,028 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:50:07,029 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:50:07,029 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:50:07,030 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_95a298e6-fcf1-44bf-aa0e-dd69398c4d62/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i [2018-11-23 13:50:07,074 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_95a298e6-fcf1-44bf-aa0e-dd69398c4d62/bin-2019/uautomizer/data/e397829d3/dc30d51212ed49acb3177d6de80366fd/FLAG47090417e [2018-11-23 13:50:07,516 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:50:07,517 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_95a298e6-fcf1-44bf-aa0e-dd69398c4d62/sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i [2018-11-23 13:50:07,525 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_95a298e6-fcf1-44bf-aa0e-dd69398c4d62/bin-2019/uautomizer/data/e397829d3/dc30d51212ed49acb3177d6de80366fd/FLAG47090417e [2018-11-23 13:50:07,534 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_95a298e6-fcf1-44bf-aa0e-dd69398c4d62/bin-2019/uautomizer/data/e397829d3/dc30d51212ed49acb3177d6de80366fd [2018-11-23 13:50:07,536 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:50:07,537 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:50:07,538 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:50:07,538 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:50:07,541 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:50:07,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:50:07" (1/1) ... [2018-11-23 13:50:07,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7917cefa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:07, skipping insertion in model container [2018-11-23 13:50:07,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:50:07" (1/1) ... [2018-11-23 13:50:07,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:50:07,578 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:50:07,766 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:50:07,774 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:50:07,849 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:50:07,872 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:50:07,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:07 WrapperNode [2018-11-23 13:50:07,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:50:07,873 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:50:07,873 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:50:07,873 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:50:07,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:07" (1/1) ... [2018-11-23 13:50:07,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:07" (1/1) ... [2018-11-23 13:50:07,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:50:07,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:50:07,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:50:07,906 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:50:07,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:07" (1/1) ... [2018-11-23 13:50:07,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:07" (1/1) ... [2018-11-23 13:50:07,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:07" (1/1) ... [2018-11-23 13:50:07,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:07" (1/1) ... [2018-11-23 13:50:07,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:07" (1/1) ... [2018-11-23 13:50:07,921 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:07" (1/1) ... [2018-11-23 13:50:07,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:07" (1/1) ... [2018-11-23 13:50:07,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:50:07,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:50:07,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:50:07,924 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:50:07,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95a298e6-fcf1-44bf-aa0e-dd69398c4d62/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-11-23 13:50:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:50:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:50:07,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:50:07,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:50:07,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:50:07,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:50:08,226 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:50:08,226 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-23 13:50:08,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:50:08 BoogieIcfgContainer [2018-11-23 13:50:08,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:50:08,227 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 13:50:08,227 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 13:50:08,230 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 13:50:08,230 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:50:08,230 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 01:50:07" (1/3) ... [2018-11-23 13:50:08,231 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ab5b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:50:08, skipping insertion in model container [2018-11-23 13:50:08,231 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:50:08,232 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:07" (2/3) ... [2018-11-23 13:50:08,232 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ab5b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:50:08, skipping insertion in model container [2018-11-23 13:50:08,232 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:50:08,232 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:50:08" (3/3) ... [2018-11-23 13:50:08,233 INFO L375 chiAutomizerObserver]: Analyzing ICFG HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i [2018-11-23 13:50:08,273 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:50:08,273 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 13:50:08,274 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 13:50:08,274 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 13:50:08,274 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:50:08,274 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:50:08,274 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 13:50:08,274 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:50:08,274 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 13:50:08,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-23 13:50:08,298 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 13:50:08,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:50:08,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:50:08,302 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 13:50:08,302 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 13:50:08,302 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 13:50:08,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-23 13:50:08,304 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 13:50:08,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:50:08,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:50:08,304 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 13:50:08,304 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 13:50:08,309 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-11-23 13:50:08,309 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~mem9;havoc f_#t~mem8;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-11-23 13:50:08,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:50:08,313 INFO L82 PathProgramCache]: Analyzing trace with hash 925608, now seen corresponding path program 1 times [2018-11-23 13:50:08,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:50:08,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:50:08,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:08,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:50:08,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:08,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:50:08,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1446, now seen corresponding path program 1 times [2018-11-23 13:50:08,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:50:08,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:50:08,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:08,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:50:08,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:08,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:50:08,456 INFO L82 PathProgramCache]: Analyzing trace with hash 889509773, now seen corresponding path program 1 times [2018-11-23 13:50:08,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:50:08,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:50:08,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:08,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:50:08,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:08,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:50:08,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:50:08,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:50:08,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:50:08,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:50:08,743 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2018-11-23 13:50:08,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:50:08,822 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2018-11-23 13:50:08,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:50:08,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2018-11-23 13:50:08,825 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 13:50:08,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 29 states and 38 transitions. [2018-11-23 13:50:08,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-23 13:50:08,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-23 13:50:08,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2018-11-23 13:50:08,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:50:08,830 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-11-23 13:50:08,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2018-11-23 13:50:08,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-11-23 13:50:08,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:50:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-11-23 13:50:08,856 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-23 13:50:08,856 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-23 13:50:08,856 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 13:50:08,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-11-23 13:50:08,857 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 13:50:08,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:50:08,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:50:08,858 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 13:50:08,858 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:50:08,858 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~mem9;havoc f_#t~mem8; 81#L567-2 [2018-11-23 13:50:08,858 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~mem11;havoc f_#t~mem12;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~mem20;havoc f_#t~mem19; 81#L567-2 [2018-11-23 13:50:08,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:50:08,859 INFO L82 PathProgramCache]: Analyzing trace with hash 889509771, now seen corresponding path program 1 times [2018-11-23 13:50:08,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:50:08,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:50:08,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:08,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:50:08,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:08,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:50:08,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1759853, now seen corresponding path program 1 times [2018-11-23 13:50:08,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:50:08,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:50:08,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:08,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:50:08,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:08,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:50:08,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:50:08,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:50:08,921 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 13:50:08,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:50:08,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:50:08,922 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-23 13:50:08,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:50:08,940 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-23 13:50:08,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:50:08,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2018-11-23 13:50:08,942 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 13:50:08,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 22 transitions. [2018-11-23 13:50:08,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-23 13:50:08,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-23 13:50:08,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2018-11-23 13:50:08,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:50:08,943 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-23 13:50:08,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2018-11-23 13:50:08,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 13:50:08,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:50:08,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-11-23 13:50:08,945 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-23 13:50:08,945 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-23 13:50:08,945 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 13:50:08,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-11-23 13:50:08,946 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 13:50:08,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:50:08,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:50:08,946 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 13:50:08,946 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:50:08,946 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~mem9;havoc f_#t~mem8; 127#L567-2 [2018-11-23 13:50:08,947 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~mem11;havoc f_#t~mem12;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~mem20;havoc f_#t~mem19; 127#L567-2 [2018-11-23 13:50:08,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:50:08,947 INFO L82 PathProgramCache]: Analyzing trace with hash 889509771, now seen corresponding path program 2 times [2018-11-23 13:50:08,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:50:08,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:50:08,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:08,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:50:08,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:08,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:50:08,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1757931, now seen corresponding path program 1 times [2018-11-23 13:50:08,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:50:08,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:50:08,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:08,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:50:08,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:08,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:08,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:50:08,986 INFO L82 PathProgramCache]: Analyzing trace with hash -260778635, now seen corresponding path program 1 times [2018-11-23 13:50:08,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:50:08,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:50:08,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:08,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:50:08,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:09,727 WARN L180 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 126 [2018-11-23 13:50:09,976 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2018-11-23 13:50:09,987 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:50:09,987 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:50:09,988 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:50:09,988 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:50:09,988 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:50:09,988 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:50:09,988 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:50:09,988 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:50:09,988 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-23 13:50:09,989 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:50:09,989 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:50:10,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:10,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:10,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:10,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:10,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:10,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:10,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:10,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:10,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:10,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:10,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:10,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:10,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:10,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:10,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:10,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:10,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:10,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:10,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:10,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:10,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:10,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:10,522 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 95 [2018-11-23 13:50:10,644 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2018-11-23 13:50:10,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:10,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:10,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:10,997 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:50:11,001 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:50:11,002 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-11-23 13:50:11,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:50:11,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:50:11,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:50:11,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,008 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-11-23 13:50:11,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,010 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:50:11,010 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:11,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,012 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-11-23 13:50:11,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:50:11,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:50:11,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:50:11,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,014 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-11-23 13:50:11,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:50:11,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:50:11,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:50:11,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,016 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-11-23 13:50:11,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:50:11,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:50:11,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:50:11,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,018 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-11-23 13:50:11,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,020 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:50:11,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:11,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,022 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-11-23 13:50:11,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:50:11,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:50:11,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:50:11,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,024 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-11-23 13:50:11,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:50:11,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:11,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,029 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-11-23 13:50:11,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:50:11,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:50:11,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:50:11,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,031 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-11-23 13:50:11,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:50:11,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:50:11,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:50:11,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,033 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-11-23 13:50:11,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,035 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:50:11,035 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:11,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,037 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-11-23 13:50:11,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:50:11,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:50:11,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:50:11,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,039 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-11-23 13:50:11,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:50:11,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:50:11,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:50:11,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,043 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-11-23 13:50:11,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,045 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:50:11,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:11,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,047 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-11-23 13:50:11,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:50:11,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:50:11,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:50:11,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,052 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-11-23 13:50:11,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:50:11,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:50:11,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:50:11,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,055 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-11-23 13:50:11,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:50:11,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:50:11,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:50:11,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,060 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-11-23 13:50:11,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,061 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:50:11,061 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:11,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,063 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-11-23 13:50:11,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:50:11,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:50:11,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:50:11,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,067 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-11-23 13:50:11,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:50:11,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:50:11,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:50:11,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,069 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-11-23 13:50:11,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:50:11,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:50:11,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:50:11,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,071 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-11-23 13:50:11,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:50:11,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:11,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,079 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-11-23 13:50:11,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:50:11,083 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:11,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,089 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-11-23 13:50:11,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,090 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:50:11,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:11,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,094 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-11-23 13:50:11,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,095 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:50:11,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,096 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:50:11,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:11,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,102 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-11-23 13:50:11,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:50:11,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:11,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,121 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-11-23 13:50:11,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,122 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:50:11,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,123 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:50:11,123 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:11,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,127 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-11-23 13:50:11,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,129 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:50:11,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,130 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:50:11,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:11,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,135 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-11-23 13:50:11,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,139 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:50:11,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:11,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,143 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-11-23 13:50:11,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,145 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:50:11,145 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:11,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,151 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-11-23 13:50:11,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,152 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:50:11,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,153 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:50:11,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:11,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,156 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-11-23 13:50:11,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,158 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:50:11,158 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:11,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,161 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-11-23 13:50:11,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,161 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:50:11,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,162 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:50:11,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:11,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:11,166 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-11-23 13:50:11,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:11,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:11,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:11,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:11,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:50:11,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:11,178 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:50:11,188 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 13:50:11,188 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 13:50:11,190 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:50:11,191 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-23 13:50:11,191 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:50:11,192 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-11-23 13:50:11,374 INFO L297 tatePredicateManager]: 60 out of 64 supporting invariants were superfluous and have been removed [2018-11-23 13:50:11,382 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:50:11,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:50:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:11,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:11,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:11,491 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-11-23 13:50:11,514 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:11,515 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:11,516 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-11-23 13:50:11,540 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:11,542 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:11,544 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:11,545 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-11-23 13:50:11,571 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:11,573 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:11,574 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:11,576 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:11,578 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:11,579 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:11,580 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-11-23 13:50:11,581 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:11,605 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:11,628 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:11,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:11,701 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-11-23 13:50:11,704 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-11-23 13:50:11,705 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:11,719 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-11-23 13:50:11,722 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-11-23 13:50:11,722 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:11,752 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-11-23 13:50:11,755 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-11-23 13:50:11,755 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:11,774 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-11-23 13:50:11,777 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-11-23 13:50:11,777 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:11,801 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-11-23 13:50:11,808 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-11-23 13:50:11,808 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:11,822 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:11,827 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:11,833 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:11,839 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:11,845 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:11,865 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-11-23 13:50:11,865 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 10 variables, input treesize:312, output treesize:83 [2018-11-23 13:50:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:11,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:50:11,974 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-11-23 13:50:11,974 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-23 13:50:13,003 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-11-23 13:50:13,003 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-11-23 13:50:13,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:50:13,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2018-11-23 13:50:13,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-23 13:50:13,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:50:13,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-23 13:50:13,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:50:13,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-23 13:50:13,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:50:13,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2018-11-23 13:50:13,008 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 13:50:13,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 39 transitions. [2018-11-23 13:50:13,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-23 13:50:13,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-23 13:50:13,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2018-11-23 13:50:13,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:50:13,009 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-23 13:50:13,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2018-11-23 13:50:13,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-11-23 13:50:13,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:50:13,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-11-23 13:50:13,011 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-23 13:50:13,011 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-23 13:50:13,011 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 13:50:13,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2018-11-23 13:50:13,012 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 13:50:13,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:50:13,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:50:13,012 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 13:50:13,012 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:50:13,013 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~mem9;havoc f_#t~mem8; 511#L567-5 [2018-11-23 13:50:13,013 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~mem11;havoc f_#t~mem12;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~mem20;havoc f_#t~mem19; 511#L567-5 [2018-11-23 13:50:13,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:50:13,013 INFO L82 PathProgramCache]: Analyzing trace with hash 890987403, now seen corresponding path program 1 times [2018-11-23 13:50:13,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:50:13,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:50:13,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:13,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:50:13,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:13,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:50:13,033 INFO L82 PathProgramCache]: Analyzing trace with hash 3235563, now seen corresponding path program 1 times [2018-11-23 13:50:13,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:50:13,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:50:13,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:13,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:50:13,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:13,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:50:13,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1434718859, now seen corresponding path program 1 times [2018-11-23 13:50:13,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:50:13,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:50:13,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:13,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:50:13,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:13,672 WARN L180 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 126 [2018-11-23 13:50:13,855 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2018-11-23 13:50:13,858 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:50:13,858 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:50:13,858 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:50:13,858 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:50:13,858 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:50:13,858 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:50:13,858 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:50:13,858 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:50:13,858 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-23 13:50:13,858 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:50:13,858 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:50:13,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:13,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:13,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:13,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:13,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:13,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:13,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:13,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:13,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:13,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:13,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:13,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:13,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:13,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:13,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:14,288 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 94 [2018-11-23 13:50:14,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:14,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:14,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:14,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:14,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:14,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:14,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:14,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:14,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:14,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:50:14,704 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:50:14,705 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:50:14,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-11-23 13:50:14,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:14,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:50:14,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:14,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:14,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:14,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:50:14,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:50:14,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:14,711 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-11-23 13:50:14,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:14,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:50:14,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:14,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:14,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:14,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:50:14,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:50:14,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:14,713 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-11-23 13:50:14,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:14,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:50:14,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:14,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:14,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:14,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:50:14,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:50:14,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:14,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-11-23 13:50:14,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:14,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:14,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:14,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:14,715 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:50:14,715 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:14,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:14,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-11-23 13:50:14,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:14,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:50:14,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:14,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:14,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:14,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:50:14,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:50:14,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:14,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:50:14,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:14,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:14,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:14,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:14,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:50:14,719 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:14,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:14,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:50:14,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:14,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:50:14,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:14,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:14,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:14,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:50:14,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:50:14,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:14,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:50:14,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:14,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:50:14,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:14,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:14,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:14,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:50:14,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:50:14,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:14,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:50:14,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:14,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:14,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:14,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:14,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:50:14,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:14,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:14,726 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-11-23 13:50:14,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:14,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:50:14,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:14,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:14,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:14,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:50:14,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:50:14,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:14,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:50:14,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:14,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:14,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:14,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:14,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:50:14,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:14,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:14,731 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-11-23 13:50:14,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:14,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:50:14,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:14,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:14,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:14,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:50:14,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:50:14,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:14,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:50:14,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:14,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:50:14,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:14,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:14,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:14,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:50:14,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:50:14,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:14,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:50:14,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:14,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:14,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:14,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:14,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:50:14,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:14,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:14,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:50:14,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:14,737 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:50:14,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:14,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:14,738 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:50:14,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:14,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:14,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:50:14,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:14,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:14,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:14,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:14,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:50:14,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:14,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:14,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-11-23 13:50:14,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:14,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:14,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:14,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:14,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:50:14,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:14,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:14,746 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-11-23 13:50:14,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:14,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:14,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:14,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:14,747 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:50:14,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:14,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:14,748 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-11-23 13:50:14,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:14,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:14,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:14,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:14,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:50:14,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:14,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:14,761 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-11-23 13:50:14,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:14,762 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:50:14,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:14,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:14,763 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:50:14,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:14,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:50:14,766 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-11-23 13:50:14,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:50:14,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:50:14,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:50:14,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:50:14,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:50:14,767 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:50:14,775 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:50:14,784 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 13:50:14,785 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 13:50:14,785 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:50:14,786 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-23 13:50:14,786 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:50:14,786 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-11-23 13:50:14,979 INFO L297 tatePredicateManager]: 55 out of 59 supporting invariants were superfluous and have been removed [2018-11-23 13:50:14,985 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:50:15,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:50:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:15,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:15,081 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:15,081 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-11-23 13:50:15,103 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:15,105 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:15,105 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-11-23 13:50:15,136 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:15,139 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:15,141 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:15,143 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-11-23 13:50:15,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:15,180 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:15,182 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:15,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:15,186 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:15,188 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:15,189 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-11-23 13:50:15,189 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:15,218 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:15,246 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:15,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:15,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11-23 13:50:15,369 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-11-23 13:50:15,369 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:15,399 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-11-23 13:50:15,403 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-11-23 13:50:15,403 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:15,424 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-11-23 13:50:15,427 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-11-23 13:50:15,427 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:15,461 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-11-23 13:50:15,464 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-11-23 13:50:15,464 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:15,495 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-11-23 13:50:15,497 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-11-23 13:50:15,497 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:15,511 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:15,518 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:15,523 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:15,529 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:15,534 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:15,555 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-11-23 13:50:15,555 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 10 variables, input treesize:312, output treesize:83 [2018-11-23 13:50:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:15,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:15,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:50:15,643 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-11-23 13:50:15,643 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-23 13:50:15,760 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-11-23 13:50:15,760 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-11-23 13:50:15,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:50:15,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-23 13:50:15,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-23 13:50:15,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:50:15,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-23 13:50:15,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:50:15,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-23 13:50:15,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:50:15,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2018-11-23 13:50:15,762 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 13:50:15,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 43 transitions. [2018-11-23 13:50:15,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-23 13:50:15,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-23 13:50:15,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 43 transitions. [2018-11-23 13:50:15,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:50:15,763 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 13:50:15,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 43 transitions. [2018-11-23 13:50:15,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-23 13:50:15,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:50:15,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-11-23 13:50:15,765 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-23 13:50:15,765 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-23 13:50:15,765 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 13:50:15,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2018-11-23 13:50:15,765 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 13:50:15,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:50:15,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:50:15,766 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:50:15,766 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 13:50:15,766 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~mem9;havoc f_#t~mem8; 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~mem11;havoc f_#t~mem12;havoc f_#t~short13; 873#L567 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 867#L568 [2018-11-23 13:50:15,766 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~mem16;havoc f_#t~mem15;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~mem11;havoc f_#t~mem12;havoc f_#t~short13; 896#L567 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 867#L568 [2018-11-23 13:50:15,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:50:15,766 INFO L82 PathProgramCache]: Analyzing trace with hash -260778639, now seen corresponding path program 1 times [2018-11-23 13:50:15,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:50:15,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:50:15,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:15,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:50:15,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:15,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:50:15,784 INFO L82 PathProgramCache]: Analyzing trace with hash 69174960, now seen corresponding path program 1 times [2018-11-23 13:50:15,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:50:15,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:50:15,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:15,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:50:15,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:15,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:50:15,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1938200384, now seen corresponding path program 1 times [2018-11-23 13:50:15,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:50:15,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:50:15,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:15,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:50:15,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:16,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:50:16,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:50:16,008 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95a298e6-fcf1-44bf-aa0e-dd69398c4d62/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-11-23 13:50:16,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:50:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:16,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:16,088 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:16,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11-23 13:50:16,109 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:16,111 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:16,112 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-11-23 13:50:16,132 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:16,134 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:16,136 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:16,137 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:16,138 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-11-23 13:50:16,161 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:16,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:16,165 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:16,167 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:16,168 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:16,170 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:16,171 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-11-23 13:50:16,171 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:16,200 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:16,229 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:16,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:16,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11-23 13:50:16,297 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-11-23 13:50:16,297 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:16,311 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-11-23 13:50:16,313 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-11-23 13:50:16,314 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:16,327 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-11-23 13:50:16,330 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-11-23 13:50:16,330 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:16,353 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-11-23 13:50:16,356 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-11-23 13:50:16,357 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:16,387 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-11-23 13:50:16,390 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-11-23 13:50:16,391 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:16,409 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:16,416 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:16,423 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:16,429 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:16,435 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:16,454 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-11-23 13:50:16,454 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:305, output treesize:76 [2018-11-23 13:50:16,525 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:16,534 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-11-23 13:50:16,592 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:16,593 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-11-23 13:50:16,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:16,625 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-11-23 13:50:16,629 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-11-23 13:50:16,629 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:16,656 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:16,658 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-11-23 13:50:16,661 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:16,661 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-11-23 13:50:16,661 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:16,677 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:16,684 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:16,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:16,711 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-11-23 13:50:16,711 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:237, output treesize:61 [2018-11-23 13:50:16,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:50:16,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:50:16,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2018-11-23 13:50:16,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:50:16,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:50:16,874 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 11 Second operand 9 states. [2018-11-23 13:50:17,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:50:17,415 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-11-23 13:50:17,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:50:17,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 68 transitions. [2018-11-23 13:50:17,417 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 13:50:17,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 45 states and 50 transitions. [2018-11-23 13:50:17,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-23 13:50:17,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-23 13:50:17,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 50 transitions. [2018-11-23 13:50:17,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:50:17,417 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-11-23 13:50:17,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 50 transitions. [2018-11-23 13:50:17,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2018-11-23 13:50:17,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:50:17,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-23 13:50:17,419 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-23 13:50:17,419 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-23 13:50:17,419 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 13:50:17,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 44 transitions. [2018-11-23 13:50:17,419 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 13:50:17,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:50:17,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:50:17,420 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:50:17,420 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 13:50:17,420 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~mem9;havoc f_#t~mem8; 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~mem11;havoc f_#t~mem12;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~mem20;havoc f_#t~mem19; 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~mem11;havoc f_#t~mem12;havoc f_#t~short13; 1050#L567-3 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 1042#L568-1 [2018-11-23 13:50:17,420 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~mem16;havoc f_#t~mem15;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~mem11;havoc f_#t~mem12;havoc f_#t~short13; 1066#L567-3 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 1042#L568-1 [2018-11-23 13:50:17,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:50:17,420 INFO L82 PathProgramCache]: Analyzing trace with hash 122778203, now seen corresponding path program 1 times [2018-11-23 13:50:17,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:50:17,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:50:17,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:17,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:50:17,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:17,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:50:17,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:50:17,496 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95a298e6-fcf1-44bf-aa0e-dd69398c4d62/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-11-23 13:50:17,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:50:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:50:17,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:50:17,568 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:17,568 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-11-23 13:50:17,596 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:17,598 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:17,599 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-11-23 13:50:17,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:17,628 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:17,630 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:17,632 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:17,632 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-11-23 13:50:17,658 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:17,660 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:17,661 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:17,663 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:17,665 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:17,672 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:17,673 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-11-23 13:50:17,674 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:17,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:17,724 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:17,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:17,792 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-11-23 13:50:17,795 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-11-23 13:50:17,795 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:17,809 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-11-23 13:50:17,812 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-11-23 13:50:17,812 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:17,828 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-11-23 13:50:17,832 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-11-23 13:50:17,832 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:17,852 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-11-23 13:50:17,855 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-11-23 13:50:17,856 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:17,881 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-11-23 13:50:17,883 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-11-23 13:50:17,884 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:17,898 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:17,905 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:17,912 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:17,919 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:17,926 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:17,946 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-11-23 13:50:17,947 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 9 variables, input treesize:305, output treesize:76 [2018-11-23 13:50:17,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:17,988 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-11-23 13:50:17,993 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:50:17,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-11-23 13:50:17,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:50:18,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:50:18,034 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-11-23 13:50:18,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:99, output treesize:84 [2018-11-23 13:50:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:50:18,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:50:18,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-23 13:50:18,069 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:50:18,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:50:18,070 INFO L82 PathProgramCache]: Analyzing trace with hash 114981600, now seen corresponding path program 1 times [2018-11-23 13:50:18,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:50:18,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:50:18,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:18,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:50:18,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:50:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:50:18,247 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2018-11-23 13:50:18,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:50:18,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:50:18,303 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-11-23 13:50:18,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:50:18,361 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2018-11-23 13:50:18,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:50:18,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 24 transitions. [2018-11-23 13:50:18,362 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 13:50:18,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2018-11-23 13:50:18,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 13:50:18,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 13:50:18,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 13:50:18,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:50:18,362 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:50:18,362 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:50:18,362 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:50:18,363 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 13:50:18,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:50:18,363 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 13:50:18,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 13:50:18,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 01:50:18 BoogieIcfgContainer [2018-11-23 13:50:18,367 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 13:50:18,368 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:50:18,368 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:50:18,368 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:50:18,368 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:50:08" (3/4) ... [2018-11-23 13:50:18,370 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 13:50:18,370 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:50:18,371 INFO L168 Benchmark]: Toolchain (without parser) took 10834.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.6 MB). Free memory was 957.6 MB in the beginning and 855.8 MB in the end (delta: 101.9 MB). Peak memory consumption was 308.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:50:18,371 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:50:18,371 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -159.7 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. [2018-11-23 13:50:18,371 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.22 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:50:18,372 INFO L168 Benchmark]: Boogie Preprocessor took 17.63 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-11-23 13:50:18,372 INFO L168 Benchmark]: RCFGBuilder took 303.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2018-11-23 13:50:18,372 INFO L168 Benchmark]: BuchiAutomizer took 10139.98 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.1 GB in the beginning and 855.8 MB in the end (delta: 230.6 MB). Peak memory consumption was 308.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:50:18,372 INFO L168 Benchmark]: Witness Printer took 2.68 ms. Allocated memory is still 1.2 GB. Free memory is still 855.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:50:18,377 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 335.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -159.7 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.22 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.63 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 303.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10139.98 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.1 GB in the beginning and 855.8 MB in the end (delta: 230.6 MB). Peak memory consumption was 308.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.68 ms. Allocated memory is still 1.2 GB. Free memory is still 855.8 MB. 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 10.1s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.8s. Construction of modules took 1.5s. 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, 1.5s 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: 6ms 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...