./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fdec0d5d-ed46-46d3-a7fc-620b4d879e9a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fdec0d5d-ed46-46d3-a7fc-620b4d879e9a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fdec0d5d-ed46-46d3-a7fc-620b4d879e9a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fdec0d5d-ed46-46d3-a7fc-620b4d879e9a/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_fdec0d5d-ed46-46d3-a7fc-620b4d879e9a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fdec0d5d-ed46-46d3-a7fc-620b4d879e9a/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7ed84bee4308b8cf5be51a33ec471886cd45cc40 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 00:51:43,050 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:51:43,051 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:51:43,059 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:51:43,059 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:51:43,059 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:51:43,060 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:51:43,061 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:51:43,062 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:51:43,063 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:51:43,063 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:51:43,064 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:51:43,064 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:51:43,065 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:51:43,066 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:51:43,066 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:51:43,067 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:51:43,068 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:51:43,069 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:51:43,070 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:51:43,071 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:51:43,072 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:51:43,073 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:51:43,073 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:51:43,073 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:51:43,074 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:51:43,075 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:51:43,075 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:51:43,076 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:51:43,076 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:51:43,077 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:51:43,077 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:51:43,077 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:51:43,077 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:51:43,078 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:51:43,078 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:51:43,079 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fdec0d5d-ed46-46d3-a7fc-620b4d879e9a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 00:51:43,089 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:51:43,089 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:51:43,090 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:51:43,090 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:51:43,090 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 00:51:43,091 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 00:51:43,091 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 00:51:43,091 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 00:51:43,091 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 00:51:43,091 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 00:51:43,091 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 00:51:43,091 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:51:43,091 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 00:51:43,092 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:51:43,092 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:51:43,092 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 00:51:43,092 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 00:51:43,092 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 00:51:43,092 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:51:43,092 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 00:51:43,092 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:51:43,093 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 00:51:43,093 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:51:43,093 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:51:43,093 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 00:51:43,093 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:51:43,093 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 00:51:43,093 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 00:51:43,094 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 00:51:43,094 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_fdec0d5d-ed46-46d3-a7fc-620b4d879e9a/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7ed84bee4308b8cf5be51a33ec471886cd45cc40 [2018-11-23 00:51:43,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:51:43,124 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:51:43,126 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:51:43,127 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:51:43,127 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:51:43,127 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fdec0d5d-ed46-46d3-a7fc-620b4d879e9a/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i [2018-11-23 00:51:43,161 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fdec0d5d-ed46-46d3-a7fc-620b4d879e9a/bin-2019/uautomizer/data/9847705a2/7f46f6b25452467e8d8b503f2a5c8fcb/FLAG9e9ff2684 [2018-11-23 00:51:43,484 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:51:43,484 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fdec0d5d-ed46-46d3-a7fc-620b4d879e9a/sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i [2018-11-23 00:51:43,491 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fdec0d5d-ed46-46d3-a7fc-620b4d879e9a/bin-2019/uautomizer/data/9847705a2/7f46f6b25452467e8d8b503f2a5c8fcb/FLAG9e9ff2684 [2018-11-23 00:51:43,499 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fdec0d5d-ed46-46d3-a7fc-620b4d879e9a/bin-2019/uautomizer/data/9847705a2/7f46f6b25452467e8d8b503f2a5c8fcb [2018-11-23 00:51:43,502 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:51:43,503 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:51:43,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:51:43,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:51:43,506 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:51:43,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:51:43" (1/1) ... [2018-11-23 00:51:43,508 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1de2744e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:51:43, skipping insertion in model container [2018-11-23 00:51:43,508 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:51:43" (1/1) ... [2018-11-23 00:51:43,516 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:51:43,545 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:51:43,733 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:51:43,741 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:51:43,813 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:51:43,844 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:51:43,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:51:43 WrapperNode [2018-11-23 00:51:43,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:51:43,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:51:43,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:51:43,845 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:51:43,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:51:43" (1/1) ... [2018-11-23 00:51:43,862 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:51:43" (1/1) ... [2018-11-23 00:51:43,879 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:51:43,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:51:43,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:51:43,880 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:51:43,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:51:43" (1/1) ... [2018-11-23 00:51:43,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:51:43" (1/1) ... [2018-11-23 00:51:43,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:51:43" (1/1) ... [2018-11-23 00:51:43,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:51:43" (1/1) ... [2018-11-23 00:51:43,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:51:43" (1/1) ... [2018-11-23 00:51:43,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:51:43" (1/1) ... [2018-11-23 00:51:43,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:51:43" (1/1) ... [2018-11-23 00:51:43,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:51:43,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:51:43,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:51:43,898 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:51:43,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:51:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fdec0d5d-ed46-46d3-a7fc-620b4d879e9a/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 00:51:43,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 00:51:43,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 00:51:43,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 00:51:43,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 00:51:43,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:51:43,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:51:44,238 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:51:44,238 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 00:51:44,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:51:44 BoogieIcfgContainer [2018-11-23 00:51:44,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:51:44,239 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 00:51:44,239 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 00:51:44,242 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 00:51:44,243 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 00:51:44,243 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 12:51:43" (1/3) ... [2018-11-23 00:51:44,244 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40af65d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:51:44, skipping insertion in model container [2018-11-23 00:51:44,244 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 00:51:44,245 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:51:43" (2/3) ... [2018-11-23 00:51:44,245 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40af65d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:51:44, skipping insertion in model container [2018-11-23 00:51:44,245 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 00:51:44,245 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:51:44" (3/3) ... [2018-11-23 00:51:44,246 INFO L375 chiAutomizerObserver]: Analyzing ICFG Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i [2018-11-23 00:51:44,296 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:51:44,296 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 00:51:44,297 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 00:51:44,297 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 00:51:44,297 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:51:44,297 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:51:44,297 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 00:51:44,297 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:51:44,297 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 00:51:44,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-23 00:51:44,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:51:44,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:51:44,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:51:44,335 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:51:44,335 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 00:51:44,335 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 00:51:44,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-23 00:51:44,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:51:44,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:51:44,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:51:44,338 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:51:44,338 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 00:51:44,345 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 22#L553true assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 25#L553-2true call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 17#L558true assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;havoc main_#t~post12; 19#L558-2true call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 9#L563true assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 13#L563-2true call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3#L568true assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 5#L568-2true call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 24#L573true assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; 27#L573-2true call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 18#L578true assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post32;havoc main_#t~mem31; 21#L578-2true call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 11#L583true assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 16#L583-2true call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 4#L588true assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem41;havoc main_#t~post42; 6#L588-2true call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 26#L593true assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post47;havoc main_#t~mem46; 10#L598-4true [2018-11-23 00:51:44,345 INFO L796 eck$LassoCheckResult]: Loop: 10#L598-4true call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 20#L598true assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 8#L598-2true assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 10#L598-4true [2018-11-23 00:51:44,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:44,350 INFO L82 PathProgramCache]: Analyzing trace with hash 187436106, now seen corresponding path program 1 times [2018-11-23 00:51:44,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:44,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:44,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:44,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:51:44,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:51:44,550 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 00:51:44,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:51:44,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:51:44,554 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:51:44,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:44,554 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 1 times [2018-11-23 00:51:44,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:44,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:44,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:44,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:51:44,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:44,730 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-23 00:51:44,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:51:44,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:51:44,791 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 5 states. [2018-11-23 00:51:44,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:51:44,903 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2018-11-23 00:51:44,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:51:44,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 49 transitions. [2018-11-23 00:51:44,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:51:44,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 29 states and 41 transitions. [2018-11-23 00:51:44,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-23 00:51:44,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-23 00:51:44,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 41 transitions. [2018-11-23 00:51:44,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:51:44,913 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 41 transitions. [2018-11-23 00:51:44,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 41 transitions. [2018-11-23 00:51:44,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-11-23 00:51:44,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 00:51:44,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-11-23 00:51:44,932 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-11-23 00:51:44,932 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-11-23 00:51:44,932 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 00:51:44,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 34 transitions. [2018-11-23 00:51:44,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:51:44,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:51:44,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:51:44,934 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:51:44,934 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 00:51:44,935 INFO L794 eck$LassoCheckResult]: Stem: 94#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 91#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 92#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 93#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 76#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;havoc main_#t~post12; 77#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 82#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 95#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 78#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 79#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 87#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; 96#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 80#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post32;havoc main_#t~mem31; 81#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 88#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; 97#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 99#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem41;havoc main_#t~post42; 84#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 89#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post47;havoc main_#t~mem46; 90#L598-4 [2018-11-23 00:51:44,935 INFO L796 eck$LassoCheckResult]: Loop: 90#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 85#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 86#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 90#L598-4 [2018-11-23 00:51:44,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:44,935 INFO L82 PathProgramCache]: Analyzing trace with hash 189283148, now seen corresponding path program 1 times [2018-11-23 00:51:44,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:44,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:44,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:44,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:51:44,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:44,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:44,987 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 2 times [2018-11-23 00:51:44,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:44,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:44,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:44,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:51:44,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:45,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:45,017 INFO L82 PathProgramCache]: Analyzing trace with hash -357729952, now seen corresponding path program 1 times [2018-11-23 00:51:45,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:45,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:45,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:45,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:51:45,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:45,207 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-23 00:51:48,610 WARN L180 SmtUtils]: Spent 3.37 s on a formula simplification. DAG size of input: 185 DAG size of output: 166 [2018-11-23 00:51:48,710 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:51:48,711 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:51:48,711 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:51:48,711 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:51:48,711 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 00:51:48,711 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:51:48,711 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:51:48,711 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:51:48,711 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-23 00:51:48,712 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:51:48,712 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:51:48,727 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 00:51:48,731 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 00:51:48,732 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 00:51:48,733 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 00:51:48,734 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 00:51:48,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:48,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:48,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:48,741 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 00:51:48,743 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 00:51:48,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:48,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:48,747 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 00:51:48,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:48,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:48,752 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 00:51:48,753 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 00:51:48,754 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 00:51:48,755 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 00:51:48,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:48,758 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 00:51:48,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:48,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:48,761 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 00:51:48,762 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 00:51:48,763 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 00:51:48,764 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 00:51:48,765 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 00:51:48,766 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 00:51:48,767 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 00:51:48,768 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 00:51:48,769 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 00:51:48,771 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 00:51:48,772 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 00:51:48,773 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 00:51:48,775 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 00:51:48,776 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 00:51:48,777 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 00:51:48,778 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 00:51:48,779 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 00:51:48,781 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 00:51:48,782 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 00:51:48,783 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 00:51:48,785 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 00:51:48,786 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 00:51:48,787 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 00:51:49,078 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2018-11-23 00:51:49,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:49,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:49,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:49,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:49,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:49,147 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 00:51:49,148 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 00:51:49,149 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 00:51:49,152 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 00:51:49,153 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 00:51:49,154 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 00:51:49,499 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:51:49,502 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 00:51:49,503 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 00:51:49,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,508 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 00:51:49,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:49,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,512 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 00:51:49,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,515 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 00:51:49,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:49,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,519 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 00:51:49,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:49,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,523 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:51:49,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:51:49,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,526 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 00:51:49,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:49,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,530 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 00:51:49,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,532 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 00:51:49,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,534 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 00:51:49,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:51:49,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:51:49,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,538 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 00:51:49,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,540 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 00:51:49,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,542 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 00:51:49,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,544 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 00:51:49,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,546 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 00:51:49,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,548 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 00:51:49,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,549 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 00:51:49,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:51:49,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:51:49,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,552 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 00:51:49,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,554 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 00:51:49,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,556 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 00:51:49,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:49,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,560 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 00:51:49,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,562 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 00:51:49,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,564 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 00:51:49,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,566 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 00:51:49,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,568 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 00:51:49,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,569 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 00:51:49,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,571 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 00:51:49,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,573 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 00:51:49,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,575 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 00:51:49,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,577 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 00:51:49,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,579 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 00:51:49,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,580 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:51:49,580 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:51:49,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,582 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 00:51:49,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:49,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,586 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 00:51:49,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:51:49,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:51:49,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:49,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,592 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 00:51:49,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,594 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 00:51:49,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:49,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,597 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 00:51:49,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:49,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,600 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 00:51:49,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:49,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:49,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:49,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,602 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 00:51:49,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,603 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:51:49,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,604 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 00:51:49,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:51:49,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,608 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 00:51:49,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:51:49,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:51:49,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,615 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 00:51:49,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:51:49,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:51:49,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:49,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:49,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:49,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:49,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:49,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:49,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:51:49,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:51:49,633 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 00:51:49,639 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 00:51:49,639 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 00:51:49,641 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 00:51:49,642 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-23 00:51:49,642 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 00:51:49,643 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1 + 207 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 - 9 >= 0] [2018-11-23 00:51:49,767 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2018-11-23 00:51:49,776 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 00:51:49,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:51:49,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:51:49,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-11-23 00:51:49,844 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:49,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:49,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 41 [2018-11-23 00:51:49,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-11-23 00:51:49,865 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:49,866 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:49,867 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:49,868 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:49,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-11-23 00:51:49,869 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:51:49,875 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:49,881 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:49,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:49,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:49,896 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:13 [2018-11-23 00:51:49,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 00:51:49,910 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 00:51:49,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:51:49,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:49,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:49,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-11-23 00:51:49,932 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:49,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-11-23 00:51:49,940 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:49,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 7 [2018-11-23 00:51:49,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:51:49,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:49,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:49,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:20 [2018-11-23 00:51:49,964 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:49,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-11-23 00:51:49,967 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:49,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 7 [2018-11-23 00:51:49,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:51:49,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:49,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:49,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:20 [2018-11-23 00:51:49,991 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:49,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-11-23 00:51:49,997 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:49,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 7 [2018-11-23 00:51:49,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:51:49,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:50,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:50,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:20 [2018-11-23 00:51:50,018 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:50,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-11-23 00:51:50,021 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:50,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 7 [2018-11-23 00:51:50,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:51:50,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:50,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:50,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:20 [2018-11-23 00:51:50,047 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:50,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-11-23 00:51:50,049 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:50,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 7 [2018-11-23 00:51:50,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:51:50,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:50,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:50,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:20 [2018-11-23 00:51:50,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:50,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-11-23 00:51:50,074 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:50,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 7 [2018-11-23 00:51:50,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:51:50,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:50,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:50,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:20 [2018-11-23 00:51:50,100 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:50,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-11-23 00:51:50,103 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:50,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 7 [2018-11-23 00:51:50,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:51:50,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:50,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:50,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:20 [2018-11-23 00:51:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:51:50,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:51:50,160 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 00:51:50,162 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2018-11-23 00:51:50,163 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 11 Second operand 13 states. [2018-11-23 00:51:50,709 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 11. Second operand 13 states. Result 91 states and 129 transitions. Complement of second has 17 states. [2018-11-23 00:51:50,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-23 00:51:50,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 00:51:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 111 transitions. [2018-11-23 00:51:50,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 111 transitions. Stem has 19 letters. Loop has 3 letters. [2018-11-23 00:51:50,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:51:50,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 111 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-23 00:51:50,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:51:50,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 111 transitions. Stem has 19 letters. Loop has 6 letters. [2018-11-23 00:51:50,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:51:50,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 129 transitions. [2018-11-23 00:51:50,716 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 00:51:50,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 85 states and 119 transitions. [2018-11-23 00:51:50,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2018-11-23 00:51:50,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2018-11-23 00:51:50,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 119 transitions. [2018-11-23 00:51:50,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:51:50,718 INFO L705 BuchiCegarLoop]: Abstraction has 85 states and 119 transitions. [2018-11-23 00:51:50,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 119 transitions. [2018-11-23 00:51:50,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 40. [2018-11-23 00:51:50,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 00:51:50,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 57 transitions. [2018-11-23 00:51:50,720 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 57 transitions. [2018-11-23 00:51:50,720 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 57 transitions. [2018-11-23 00:51:50,720 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 00:51:50,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 57 transitions. [2018-11-23 00:51:50,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:51:50,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:51:50,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:51:50,721 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:51:50,721 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 00:51:50,721 INFO L794 eck$LassoCheckResult]: Stem: 498#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 494#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 495#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 496#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 478#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;havoc main_#t~post12; 479#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 499#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 500#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 480#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 481#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 490#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; 501#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 482#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post32;havoc main_#t~mem31; 483#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 491#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; 502#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 506#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem41;havoc main_#t~post42; 485#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 492#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post47;havoc main_#t~mem46; 493#L598-4 [2018-11-23 00:51:50,721 INFO L796 eck$LassoCheckResult]: Loop: 493#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 488#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 489#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 493#L598-4 [2018-11-23 00:51:50,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:50,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1777631050, now seen corresponding path program 1 times [2018-11-23 00:51:50,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:50,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:50,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:50,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:51:50,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:51:50,745 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 00:51:50,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:51:50,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:51:50,746 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:51:50,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:50,746 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 3 times [2018-11-23 00:51:50,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:50,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:50,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:50,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:51:50,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:50,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:51:50,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:51:50,868 INFO L87 Difference]: Start difference. First operand 40 states and 57 transitions. cyclomatic complexity: 18 Second operand 4 states. [2018-11-23 00:51:50,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:51:50,905 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2018-11-23 00:51:50,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:51:50,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 56 transitions. [2018-11-23 00:51:50,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:51:50,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 56 transitions. [2018-11-23 00:51:50,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-23 00:51:50,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-23 00:51:50,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 56 transitions. [2018-11-23 00:51:50,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:51:50,908 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 56 transitions. [2018-11-23 00:51:50,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 56 transitions. [2018-11-23 00:51:50,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 00:51:50,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 00:51:50,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2018-11-23 00:51:50,913 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 56 transitions. [2018-11-23 00:51:50,913 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 56 transitions. [2018-11-23 00:51:50,913 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 00:51:50,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 56 transitions. [2018-11-23 00:51:50,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:51:50,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:51:50,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:51:50,914 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:51:50,915 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 00:51:50,915 INFO L794 eck$LassoCheckResult]: Stem: 590#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 585#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 586#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 588#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 567#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 568#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 591#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 592#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 604#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 570#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 603#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; 593#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 602#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post32;havoc main_#t~mem31; 573#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 601#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; 600#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 599#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem41;havoc main_#t~post42; 578#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 598#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post47;havoc main_#t~mem46; 587#L598-4 [2018-11-23 00:51:50,915 INFO L796 eck$LassoCheckResult]: Loop: 587#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 580#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 581#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 587#L598-4 [2018-11-23 00:51:50,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:50,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1237472568, now seen corresponding path program 1 times [2018-11-23 00:51:50,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:50,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:50,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:50,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:51:50,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:51:50,956 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 00:51:50,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:51:50,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 00:51:50,956 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:51:50,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:50,957 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 4 times [2018-11-23 00:51:50,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:50,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:50,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:50,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:51:50,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:51,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 00:51:51,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:51:51,076 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. cyclomatic complexity: 17 Second operand 6 states. [2018-11-23 00:51:51,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:51:51,162 INFO L93 Difference]: Finished difference Result 66 states and 91 transitions. [2018-11-23 00:51:51,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 00:51:51,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 91 transitions. [2018-11-23 00:51:51,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:51:51,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 91 transitions. [2018-11-23 00:51:51,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2018-11-23 00:51:51,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2018-11-23 00:51:51,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 91 transitions. [2018-11-23 00:51:51,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:51:51,164 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 91 transitions. [2018-11-23 00:51:51,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 91 transitions. [2018-11-23 00:51:51,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 42. [2018-11-23 00:51:51,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 00:51:51,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2018-11-23 00:51:51,166 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 58 transitions. [2018-11-23 00:51:51,166 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 58 transitions. [2018-11-23 00:51:51,166 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 00:51:51,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 58 transitions. [2018-11-23 00:51:51,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:51:51,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:51:51,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:51:51,166 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:51:51,166 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 00:51:51,167 INFO L794 eck$LassoCheckResult]: Stem: 709#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 705#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 706#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 707#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 688#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 689#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 710#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 711#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 690#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 691#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 698#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; 712#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 692#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post32;havoc main_#t~mem31; 693#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 701#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; 713#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 716#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem41;havoc main_#t~post42; 695#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 717#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post47;havoc main_#t~mem46; 704#L598-4 [2018-11-23 00:51:51,167 INFO L796 eck$LassoCheckResult]: Loop: 704#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 699#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 700#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 704#L598-4 [2018-11-23 00:51:51,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:51,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1938537146, now seen corresponding path program 1 times [2018-11-23 00:51:51,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:51,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:51,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:51,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:51:51,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:51:51,215 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 00:51:51,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:51:51,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:51:51,215 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:51:51,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:51,216 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 5 times [2018-11-23 00:51:51,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:51,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:51,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:51,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:51:51,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:51,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:51:51,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:51:51,340 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. cyclomatic complexity: 17 Second operand 5 states. [2018-11-23 00:51:51,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:51:51,422 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2018-11-23 00:51:51,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 00:51:51,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 54 transitions. [2018-11-23 00:51:51,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:51:51,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 40 states and 52 transitions. [2018-11-23 00:51:51,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-23 00:51:51,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-23 00:51:51,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 52 transitions. [2018-11-23 00:51:51,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:51:51,424 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2018-11-23 00:51:51,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 52 transitions. [2018-11-23 00:51:51,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 00:51:51,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 00:51:51,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2018-11-23 00:51:51,426 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2018-11-23 00:51:51,427 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2018-11-23 00:51:51,427 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 00:51:51,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 52 transitions. [2018-11-23 00:51:51,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:51:51,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:51:51,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:51:51,429 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:51:51,429 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 00:51:51,429 INFO L794 eck$LassoCheckResult]: Stem: 805#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 801#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 802#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 803#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 784#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 785#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 792#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem14;havoc main_#t~post15; 806#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 786#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 787#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 818#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; 807#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 788#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post32;havoc main_#t~mem31; 789#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 797#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; 816#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 815#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem41;havoc main_#t~post42; 791#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 814#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post47;havoc main_#t~mem46; 800#L598-4 [2018-11-23 00:51:51,429 INFO L796 eck$LassoCheckResult]: Loop: 800#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 793#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 794#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 800#L598-4 [2018-11-23 00:51:51,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:51,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1351731132, now seen corresponding path program 1 times [2018-11-23 00:51:51,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:51,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:51,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:51,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:51:51,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:51:51,452 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 00:51:51,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:51:51,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:51:51,452 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:51:51,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:51,453 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 6 times [2018-11-23 00:51:51,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:51,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:51,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:51,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:51:51,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:51,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:51:51,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:51:51,571 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-23 00:51:51,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:51:51,638 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2018-11-23 00:51:51,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:51:51,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 66 transitions. [2018-11-23 00:51:51,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:51:51,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 66 transitions. [2018-11-23 00:51:51,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2018-11-23 00:51:51,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2018-11-23 00:51:51,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 66 transitions. [2018-11-23 00:51:51,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:51:51,640 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 66 transitions. [2018-11-23 00:51:51,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 66 transitions. [2018-11-23 00:51:51,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2018-11-23 00:51:51,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 00:51:51,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2018-11-23 00:51:51,641 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2018-11-23 00:51:51,641 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2018-11-23 00:51:51,642 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 00:51:51,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 51 transitions. [2018-11-23 00:51:51,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:51:51,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:51:51,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:51:51,643 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:51:51,643 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 00:51:51,643 INFO L794 eck$LassoCheckResult]: Stem: 905#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 900#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 901#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 903#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 885#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 886#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 913#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem14;havoc main_#t~post15; 914#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 923#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 922#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 907#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem24;havoc main_#t~post25; 908#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 889#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post32;havoc main_#t~mem31; 890#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 898#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; 910#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 924#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem41;havoc main_#t~post42; 894#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 899#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post47;havoc main_#t~mem46; 902#L598-4 [2018-11-23 00:51:51,643 INFO L796 eck$LassoCheckResult]: Loop: 902#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 896#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 897#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 902#L598-4 [2018-11-23 00:51:51,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:51,643 INFO L82 PathProgramCache]: Analyzing trace with hash -2031789502, now seen corresponding path program 1 times [2018-11-23 00:51:51,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:51,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:51,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:51,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:51:51,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:51:51,729 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 00:51:51,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:51:51,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 00:51:51,729 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:51:51,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:51,730 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 7 times [2018-11-23 00:51:51,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:51,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:51,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:51,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:51:51,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:51,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 00:51:51,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-23 00:51:51,853 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. cyclomatic complexity: 12 Second operand 10 states. [2018-11-23 00:51:51,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:51:51,955 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2018-11-23 00:51:51,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 00:51:51,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 84 transitions. [2018-11-23 00:51:51,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:51:51,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 84 transitions. [2018-11-23 00:51:51,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2018-11-23 00:51:51,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2018-11-23 00:51:51,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 84 transitions. [2018-11-23 00:51:51,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:51:51,957 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 84 transitions. [2018-11-23 00:51:51,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 84 transitions. [2018-11-23 00:51:51,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 44. [2018-11-23 00:51:51,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 00:51:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2018-11-23 00:51:51,961 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 57 transitions. [2018-11-23 00:51:51,961 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 57 transitions. [2018-11-23 00:51:51,961 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 00:51:51,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 57 transitions. [2018-11-23 00:51:51,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:51:51,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:51:51,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:51:51,962 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:51:51,962 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 00:51:51,962 INFO L794 eck$LassoCheckResult]: Stem: 1030#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1025#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1026#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 1028#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1009#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 1010#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1040#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem14;havoc main_#t~post15; 1036#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1037#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 1041#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1032#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem24;havoc main_#t~post25; 1033#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1013#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post32;havoc main_#t~mem31; 1014#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1022#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 1035#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1017#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 1018#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1043#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post47;havoc main_#t~mem46; 1027#L598-4 [2018-11-23 00:51:51,962 INFO L796 eck$LassoCheckResult]: Loop: 1027#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1020#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1021#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1027#L598-4 [2018-11-23 00:51:51,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:51,963 INFO L82 PathProgramCache]: Analyzing trace with hash -2033638466, now seen corresponding path program 1 times [2018-11-23 00:51:51,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:51,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:51,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:51,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:51:51,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:51:51,990 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 00:51:51,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:51:51,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:51:51,991 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:51:51,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:51,991 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 8 times [2018-11-23 00:51:51,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:51,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:51,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:51,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:51:51,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:52,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:51:52,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:51:52,093 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-23 00:51:52,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:51:52,133 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2018-11-23 00:51:52,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:51:52,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 63 transitions. [2018-11-23 00:51:52,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:51:52,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 63 transitions. [2018-11-23 00:51:52,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2018-11-23 00:51:52,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2018-11-23 00:51:52,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 63 transitions. [2018-11-23 00:51:52,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:51:52,135 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 63 transitions. [2018-11-23 00:51:52,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 63 transitions. [2018-11-23 00:51:52,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2018-11-23 00:51:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 00:51:52,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2018-11-23 00:51:52,138 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 57 transitions. [2018-11-23 00:51:52,138 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 57 transitions. [2018-11-23 00:51:52,138 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 00:51:52,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 57 transitions. [2018-11-23 00:51:52,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:51:52,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:51:52,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:51:52,139 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:51:52,139 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 00:51:52,139 INFO L794 eck$LassoCheckResult]: Stem: 1132#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1127#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1128#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 1130#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1112#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 1113#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1138#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem14;havoc main_#t~post15; 1137#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1114#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 1115#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1122#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem24;havoc main_#t~post25; 1134#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1116#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post32;havoc main_#t~mem31; 1117#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1125#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 1136#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1120#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 1121#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1126#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem44;havoc main_#t~post45; 1129#L598-4 [2018-11-23 00:51:52,139 INFO L796 eck$LassoCheckResult]: Loop: 1129#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1123#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1124#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1129#L598-4 [2018-11-23 00:51:52,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:52,139 INFO L82 PathProgramCache]: Analyzing trace with hash -2033638468, now seen corresponding path program 1 times [2018-11-23 00:51:52,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:52,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:52,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:52,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:51:52,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:51:52,172 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 00:51:52,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:51:52,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 00:51:52,173 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:51:52,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:52,173 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 9 times [2018-11-23 00:51:52,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:52,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:52,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:52,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:51:52,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:52,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 00:51:52,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:51:52,287 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. cyclomatic complexity: 14 Second operand 6 states. [2018-11-23 00:51:52,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:51:52,392 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-11-23 00:51:52,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 00:51:52,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 70 transitions. [2018-11-23 00:51:52,392 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 00:51:52,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 54 states and 62 transitions. [2018-11-23 00:51:52,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-23 00:51:52,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-23 00:51:52,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 62 transitions. [2018-11-23 00:51:52,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:51:52,393 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-11-23 00:51:52,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 62 transitions. [2018-11-23 00:51:52,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 44. [2018-11-23 00:51:52,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 00:51:52,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-11-23 00:51:52,396 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-11-23 00:51:52,396 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-11-23 00:51:52,396 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 00:51:52,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 50 transitions. [2018-11-23 00:51:52,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:51:52,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:51:52,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:51:52,397 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:51:52,397 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 00:51:52,397 INFO L794 eck$LassoCheckResult]: Stem: 1255#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1250#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1251#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 1253#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1233#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 1234#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1268#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem14;havoc main_#t~post15; 1263#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1264#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 1243#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1244#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem24;havoc main_#t~post25; 1274#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1273#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem29;havoc main_#t~post30; 1272#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1271#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 1270#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1269#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 1242#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1249#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem44;havoc main_#t~post45; 1252#L598-4 [2018-11-23 00:51:52,397 INFO L796 eck$LassoCheckResult]: Loop: 1252#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1245#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1246#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1252#L598-4 [2018-11-23 00:51:52,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:52,398 INFO L82 PathProgramCache]: Analyzing trace with hash 486321466, now seen corresponding path program 1 times [2018-11-23 00:51:52,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:52,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:52,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:52,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:51:52,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:52,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:52,417 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 10 times [2018-11-23 00:51:52,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:52,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:52,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:52,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:51:52,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:52,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:52,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1078171826, now seen corresponding path program 1 times [2018-11-23 00:51:52,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:52,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:52,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:52,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:51:52,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:52,575 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-23 00:51:54,960 WARN L180 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 177 DAG size of output: 163 [2018-11-23 00:51:55,028 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:51:55,029 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:51:55,029 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:51:55,029 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:51:55,029 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 00:51:55,029 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:51:55,029 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:51:55,029 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:51:55,029 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i_Iteration10_Lasso [2018-11-23 00:51:55,029 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:51:55,029 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:51:55,033 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 00:51:55,035 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 00:51:55,040 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 00:51:55,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 00:51:55,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 00:51:55,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 00:51:55,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 00:51:55,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:55,061 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 00:51:55,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:55,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:55,066 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 00:51:55,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:55,070 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 00:51:55,073 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 00:51:55,074 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 00:51:55,076 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 00:51:55,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:55,079 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 00:51:55,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:55,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:55,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:55,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:55,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:55,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:55,099 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 00:51:55,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:55,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:55,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:55,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:55,109 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 00:51:55,110 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 00:51:55,111 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 00:51:55,112 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 00:51:55,113 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 00:51:55,114 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 00:51:55,115 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 00:51:55,116 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 00:51:55,306 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2018-11-23 00:51:55,369 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 00:51:55,370 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 00:51:55,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 00:51:55,372 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 00:51:55,372 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 00:51:55,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 00:51:55,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 00:51:55,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 00:51:55,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 00:51:55,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 00:51:55,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 00:51:55,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 00:51:55,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 00:51:55,381 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 00:51:55,382 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 00:51:55,384 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 00:51:55,385 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 00:51:55,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:55,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:51:55,674 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:51:55,674 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 00:51:55,675 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 00:51:55,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,676 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 00:51:55,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:55,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,679 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 00:51:55,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:55,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:55,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:55,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,689 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 00:51:55,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:55,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:55,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,692 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 00:51:55,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:55,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:55,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:55,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:51:55,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:51:55,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:55,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:55,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,701 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 00:51:55,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,703 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 00:51:55,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:55,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,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 00:51:55,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:55,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,708 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 00:51:55,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:55,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,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 00:51:55,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:51:55,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:51:55,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,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 00:51:55,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,715 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 00:51:55,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,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 00:51:55,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,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 00:51:55,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:55,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,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 00:51:55,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:55,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,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 00:51:55,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:51:55,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:51:55,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,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 00:51:55,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:55,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,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 00:51:55,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,733 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 00:51:55,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:51:55,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:51:55,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:55,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:51:55,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:51:55,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:51:55,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,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 00:51:55,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,747 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:51:55,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:51:55,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:51:55,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:51:55,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:51:55,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:51:55,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:51:55,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:51:55,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:51:55,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:51:55,757 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 00:51:55,759 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 00:51:55,759 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 00:51:55,760 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 00:51:55,761 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-23 00:51:55,761 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 00:51:55,761 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 + 207 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 - 9 >= 0] [2018-11-23 00:51:55,982 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2018-11-23 00:51:55,987 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 00:51:56,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:51:56,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:51:56,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-11-23 00:51:56,034 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:56,035 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:56,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 41 [2018-11-23 00:51:56,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-11-23 00:51:56,049 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:56,050 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:56,051 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:56,053 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:56,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-11-23 00:51:56,054 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:51:56,060 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:56,065 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:56,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:56,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:56,078 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:13 [2018-11-23 00:51:56,102 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:56,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-23 00:51:56,105 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:56,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 00:51:56,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:51:56,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:56,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:56,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-11-23 00:51:56,126 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:56,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-23 00:51:56,128 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:56,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 00:51:56,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:51:56,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:56,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:56,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-11-23 00:51:56,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:56,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-23 00:51:56,150 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:56,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 00:51:56,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:51:56,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:56,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:56,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-11-23 00:51:56,169 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:56,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-23 00:51:56,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:56,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 00:51:56,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:51:56,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:56,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:56,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-11-23 00:51:56,199 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:56,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-23 00:51:56,202 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:56,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 00:51:56,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:51:56,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:56,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:56,209 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-11-23 00:51:56,227 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:56,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-23 00:51:56,230 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:56,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 00:51:56,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:51:56,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:56,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:56,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-11-23 00:51:56,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:56,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-23 00:51:56,269 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:51:56,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 00:51:56,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:51:56,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:56,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:51:56,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-11-23 00:51:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:51:56,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:51:56,347 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 00:51:56,348 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 3 loop predicates [2018-11-23 00:51:56,348 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 50 transitions. cyclomatic complexity: 7 Second operand 13 states. [2018-11-23 00:51:56,535 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 50 transitions. cyclomatic complexity: 7. Second operand 13 states. Result 63 states and 73 transitions. Complement of second has 17 states. [2018-11-23 00:51:56,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-23 00:51:56,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 00:51:56,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2018-11-23 00:51:56,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 51 transitions. Stem has 19 letters. Loop has 3 letters. [2018-11-23 00:51:56,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:51:56,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 51 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-23 00:51:56,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:51:56,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 51 transitions. Stem has 19 letters. Loop has 6 letters. [2018-11-23 00:51:56,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:51:56,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 73 transitions. [2018-11-23 00:51:56,537 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 00:51:56,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 51 states and 58 transitions. [2018-11-23 00:51:56,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-11-23 00:51:56,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2018-11-23 00:51:56,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 58 transitions. [2018-11-23 00:51:56,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:51:56,538 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-11-23 00:51:56,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 58 transitions. [2018-11-23 00:51:56,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2018-11-23 00:51:56,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 00:51:56,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-23 00:51:56,539 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-23 00:51:56,539 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-23 00:51:56,539 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 00:51:56,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 49 transitions. [2018-11-23 00:51:56,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:51:56,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:51:56,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:51:56,540 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:51:56,540 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 00:51:56,540 INFO L794 eck$LassoCheckResult]: Stem: 1651#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1646#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1647#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 1648#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1628#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 1629#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1661#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem14;havoc main_#t~post15; 1657#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1658#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 1638#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1639#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem24;havoc main_#t~post25; 1663#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1662#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem29;havoc main_#t~post30; 1642#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1643#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; 1656#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1670#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 1637#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1644#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem44;havoc main_#t~post45; 1645#L598-4 [2018-11-23 00:51:56,541 INFO L796 eck$LassoCheckResult]: Loop: 1645#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1640#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1641#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1645#L598-4 [2018-11-23 00:51:56,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:56,541 INFO L82 PathProgramCache]: Analyzing trace with hash 488168508, now seen corresponding path program 1 times [2018-11-23 00:51:56,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:56,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:56,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:56,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:51:56,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:51:56,585 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 00:51:56,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:51:56,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:51:56,585 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:51:56,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:56,585 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 11 times [2018-11-23 00:51:56,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:56,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:56,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:56,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:51:56,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:56,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:51:56,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:51:56,730 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-23 00:51:56,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:51:56,810 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-23 00:51:56,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 00:51:56,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 52 transitions. [2018-11-23 00:51:56,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:51:56,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 33 states and 37 transitions. [2018-11-23 00:51:56,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-23 00:51:56,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-23 00:51:56,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 37 transitions. [2018-11-23 00:51:56,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:51:56,814 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 00:51:56,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 37 transitions. [2018-11-23 00:51:56,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-11-23 00:51:56,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 00:51:56,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-11-23 00:51:56,815 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-23 00:51:56,815 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-23 00:51:56,815 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 00:51:56,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 33 transitions. [2018-11-23 00:51:56,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:51:56,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:51:56,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:51:56,816 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:51:56,816 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 00:51:56,816 INFO L794 eck$LassoCheckResult]: Stem: 1749#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1746#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1747#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 1748#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1731#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;havoc main_#t~post12; 1732#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1737#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 1750#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1733#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 1734#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1742#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem24;havoc main_#t~post25; 1751#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1760#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post32;havoc main_#t~mem31; 1759#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1758#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; 1757#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1756#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem41;havoc main_#t~post42; 1755#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1754#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post47;havoc main_#t~mem46; 1745#L598-4 [2018-11-23 00:51:56,816 INFO L796 eck$LassoCheckResult]: Loop: 1745#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1740#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1741#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1745#L598-4 [2018-11-23 00:51:56,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:56,817 INFO L82 PathProgramCache]: Analyzing trace with hash -490775222, now seen corresponding path program 1 times [2018-11-23 00:51:56,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:56,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:56,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:56,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:51:56,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:51:56,856 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 00:51:56,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:51:56,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:51:56,856 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:51:56,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:56,857 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 12 times [2018-11-23 00:51:56,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:56,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:56,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:56,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:51:56,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:56,968 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-23 00:51:56,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:51:56,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:51:56,998 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. cyclomatic complexity: 4 Second operand 5 states. [2018-11-23 00:51:57,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:51:57,037 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 00:51:57,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:51:57,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 23 transitions. [2018-11-23 00:51:57,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:51:57,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 23 transitions. [2018-11-23 00:51:57,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-23 00:51:57,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-23 00:51:57,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2018-11-23 00:51:57,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:51:57,038 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-23 00:51:57,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2018-11-23 00:51:57,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 00:51:57,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 00:51:57,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-23 00:51:57,040 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-23 00:51:57,040 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-23 00:51:57,040 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 00:51:57,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 23 transitions. [2018-11-23 00:51:57,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:51:57,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:51:57,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:51:57,040 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:51:57,041 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 00:51:57,041 INFO L794 eck$LassoCheckResult]: Stem: 1813#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1810#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1811#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 1812#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1795#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;havoc main_#t~post12; 1796#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1801#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem16;havoc main_#t~post17; 1814#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1797#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 1798#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1806#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; 1815#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1799#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post32;havoc main_#t~mem31; 1800#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1807#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; 1816#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1802#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem41;havoc main_#t~post42; 1803#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1808#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem44;havoc main_#t~post45; 1809#L598-4 [2018-11-23 00:51:57,041 INFO L796 eck$LassoCheckResult]: Loop: 1809#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1804#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1805#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1809#L598-4 [2018-11-23 00:51:57,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:57,041 INFO L82 PathProgramCache]: Analyzing trace with hash 189283146, now seen corresponding path program 1 times [2018-11-23 00:51:57,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:57,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:57,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:57,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:51:57,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:51:57,078 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 00:51:57,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:51:57,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:51:57,078 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:51:57,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:51:57,079 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 13 times [2018-11-23 00:51:57,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:51:57,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:51:57,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:57,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:51:57,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:51:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:51:57,190 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-23 00:51:57,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:51:57,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:51:57,220 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. cyclomatic complexity: 2 Second operand 5 states. [2018-11-23 00:51:57,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:51:57,257 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2018-11-23 00:51:57,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:51:57,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 18 transitions. [2018-11-23 00:51:57,257 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 00:51:57,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2018-11-23 00:51:57,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 00:51:57,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 00:51:57,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 00:51:57,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:51:57,257 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 00:51:57,257 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 00:51:57,257 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 00:51:57,257 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 00:51:57,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 00:51:57,258 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 00:51:57,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 00:51:57,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 12:51:57 BoogieIcfgContainer [2018-11-23 00:51:57,262 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 00:51:57,262 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:51:57,262 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:51:57,262 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:51:57,263 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:51:44" (3/4) ... [2018-11-23 00:51:57,265 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 00:51:57,265 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:51:57,266 INFO L168 Benchmark]: Toolchain (without parser) took 13763.30 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 367.5 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -190.4 MB). Peak memory consumption was 177.1 MB. Max. memory is 11.5 GB. [2018-11-23 00:51:57,266 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:51:57,266 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -176.6 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:51:57,267 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.09 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 00:51:57,267 INFO L168 Benchmark]: Boogie Preprocessor took 17.80 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-23 00:51:57,267 INFO L168 Benchmark]: RCFGBuilder took 341.29 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: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:51:57,268 INFO L168 Benchmark]: BuchiAutomizer took 13022.80 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 210.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -49.0 MB). Peak memory consumption was 161.8 MB. Max. memory is 11.5 GB. [2018-11-23 00:51:57,268 INFO L168 Benchmark]: Witness Printer took 3.13 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:51:57,270 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 341.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -176.6 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.80 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 341.29 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: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13022.80 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 210.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -49.0 MB). Peak memory consumption was 161.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.13 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (11 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z][z] + 207 and consists of 14 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y][y] + 207 and consists of 14 locations. 11 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.9s and 14 iterations. TraceHistogramMax:1. Analysis of lassos took 10.5s. Construction of modules took 1.0s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 13. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 131 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 44 states and ocurred in iteration 7. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 229 SDtfs, 302 SDslu, 312 SDs, 0 SdLazy, 2093 SolverSat, 180 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU11 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital350 mio100 ax105 hnf100 lsp90 ukn57 mio100 lsp36 div100 bol100 ite100 ukn100 eq188 hnf88 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...