./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_98742aa6-7aeb-44e3-b962-5a0d2138f116/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_98742aa6-7aeb-44e3-b962-5a0d2138f116/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_98742aa6-7aeb-44e3-b962-5a0d2138f116/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_98742aa6-7aeb-44e3-b962-5a0d2138f116/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_98742aa6-7aeb-44e3-b962-5a0d2138f116/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_98742aa6-7aeb-44e3-b962-5a0d2138f116/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cb5770b8d32c05b82025135c2b222cf31b0a4100 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 13:29:35,132 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:29:35,133 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:29:35,139 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:29:35,139 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:29:35,140 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:29:35,141 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:29:35,142 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:29:35,143 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:29:35,143 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:29:35,144 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:29:35,144 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:29:35,145 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:29:35,146 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:29:35,146 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:29:35,147 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:29:35,147 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:29:35,149 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:29:35,150 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:29:35,151 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:29:35,152 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:29:35,152 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:29:35,153 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:29:35,153 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:29:35,154 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:29:35,154 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:29:35,155 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:29:35,155 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:29:35,156 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:29:35,157 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:29:35,157 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:29:35,157 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:29:35,157 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:29:35,157 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:29:35,158 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:29:35,159 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:29:35,159 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_98742aa6-7aeb-44e3-b962-5a0d2138f116/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 13:29:35,168 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:29:35,168 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:29:35,169 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 13:29:35,169 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 13:29:35,169 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 13:29:35,169 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 13:29:35,170 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 13:29:35,170 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 13:29:35,170 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 13:29:35,170 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 13:29:35,170 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 13:29:35,170 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:29:35,170 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 13:29:35,170 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:29:35,171 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:29:35,171 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 13:29:35,171 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 13:29:35,171 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 13:29:35,171 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:29:35,171 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 13:29:35,171 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 13:29:35,172 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:29:35,172 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:29:35,172 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 13:29:35,172 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:29:35,172 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 13:29:35,172 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 13:29:35,173 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 13:29:35,173 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_98742aa6-7aeb-44e3-b962-5a0d2138f116/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb5770b8d32c05b82025135c2b222cf31b0a4100 [2018-11-10 13:29:35,196 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:29:35,205 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:29:35,208 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:29:35,209 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:29:35,209 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:29:35,209 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_98742aa6-7aeb-44e3-b962-5a0d2138f116/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i [2018-11-10 13:29:35,249 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_98742aa6-7aeb-44e3-b962-5a0d2138f116/bin-2019/uautomizer/data/3286a865f/57b1aed176ce4a4ca77c4d9b8334b62e/FLAG1b16b19f0 [2018-11-10 13:29:35,703 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:29:35,704 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_98742aa6-7aeb-44e3-b962-5a0d2138f116/sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i [2018-11-10 13:29:35,714 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_98742aa6-7aeb-44e3-b962-5a0d2138f116/bin-2019/uautomizer/data/3286a865f/57b1aed176ce4a4ca77c4d9b8334b62e/FLAG1b16b19f0 [2018-11-10 13:29:35,724 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_98742aa6-7aeb-44e3-b962-5a0d2138f116/bin-2019/uautomizer/data/3286a865f/57b1aed176ce4a4ca77c4d9b8334b62e [2018-11-10 13:29:35,727 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:29:35,728 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:29:35,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:29:35,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:29:35,731 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:29:35,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:29:35" (1/1) ... [2018-11-10 13:29:35,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39aa02f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:29:35, skipping insertion in model container [2018-11-10 13:29:35,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:29:35" (1/1) ... [2018-11-10 13:29:35,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:29:35,768 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:29:35,952 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:29:35,960 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:29:35,988 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:29:36,011 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:29:36,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:29:36 WrapperNode [2018-11-10 13:29:36,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:29:36,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:29:36,013 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:29:36,013 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:29:36,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:29:36" (1/1) ... [2018-11-10 13:29:36,071 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:29:36" (1/1) ... [2018-11-10 13:29:36,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:29:36,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:29:36,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:29:36,092 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:29:36,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:29:36" (1/1) ... [2018-11-10 13:29:36,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:29:36" (1/1) ... [2018-11-10 13:29:36,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:29:36" (1/1) ... [2018-11-10 13:29:36,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:29:36" (1/1) ... [2018-11-10 13:29:36,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:29:36" (1/1) ... [2018-11-10 13:29:36,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:29:36" (1/1) ... [2018-11-10 13:29:36,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:29:36" (1/1) ... [2018-11-10 13:29:36,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:29:36,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:29:36,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:29:36,112 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:29:36,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:29:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98742aa6-7aeb-44e3-b962-5a0d2138f116/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-10 13:29:36,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 13:29:36,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 13:29:36,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:29:36,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:29:36,524 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:29:36,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:29:36 BoogieIcfgContainer [2018-11-10 13:29:36,525 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:29:36,525 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 13:29:36,525 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 13:29:36,528 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 13:29:36,529 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:29:36,529 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 01:29:35" (1/3) ... [2018-11-10 13:29:36,530 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@289d1487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:29:36, skipping insertion in model container [2018-11-10 13:29:36,530 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:29:36,530 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:29:36" (2/3) ... [2018-11-10 13:29:36,530 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@289d1487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:29:36, skipping insertion in model container [2018-11-10 13:29:36,530 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:29:36,530 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:29:36" (3/3) ... [2018-11-10 13:29:36,532 INFO L375 chiAutomizerObserver]: Analyzing ICFG HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i [2018-11-10 13:29:36,576 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 13:29:36,576 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 13:29:36,576 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 13:29:36,577 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 13:29:36,577 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:29:36,577 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:29:36,577 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 13:29:36,577 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:29:36,577 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 13:29:36,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states. [2018-11-10 13:29:36,605 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 56 [2018-11-10 13:29:36,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:29:36,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:29:36,610 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:29:36,610 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:29:36,610 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 13:29:36,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states. [2018-11-10 13:29:36,613 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 56 [2018-11-10 13:29:36,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:29:36,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:29:36,614 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:29:36,614 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:29:36,620 INFO L793 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet21; 25#L578true assume !(main_#t~nondet21 != 0);havoc main_#t~nondet21;assume { :begin_inline_f } true;f_#in~d := 2;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset; 35#L553-2true SUMMARY for call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4); srcloc: L553-2 36#L553-3true SUMMARY for call write~int(1, f_~x~0.base, f_~x~0.offset, 4); srcloc: L553-3 44#L554-1true SUMMARY for call write~int(1, f_~y~0.base, f_~y~0.offset, 4); srcloc: L554-1 11#L555-1true SUMMARY for call write~int(1, f_~k~0.base, f_~k~0.offset, 4); srcloc: L555-1 30#L556-1true SUMMARY for call write~int(1, f_~z~0.base, f_~z~0.offset, 4); srcloc: L556-1 42#L557-1true SUMMARY for call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); srcloc: L557-1 57#L558-1true assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 45#L562-9true [2018-11-10 13:29:36,620 INFO L795 eck$LassoCheckResult]: Loop: 45#L562-9true assume true; 58#L562-5true SUMMARY for call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4); srcloc: L562-5 63#L562-6true SUMMARY for call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); srcloc: L562-6 67#L562-7true assume !!(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9; 20#L563-3true SUMMARY for call f_#t~mem10 := read~int(f_~z~0.base, f_~z~0.offset, 4); srcloc: L563-3 22#L563-4true SUMMARY for call write~int(2 * f_#t~mem10, f_~z~0.base, f_~z~0.offset, 4); srcloc: L563-4 4#L563-5true havoc f_#t~mem10; 45#L562-9true [2018-11-10 13:29:36,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:29:36,625 INFO L82 PathProgramCache]: Analyzing trace with hash 534094155, now seen corresponding path program 1 times [2018-11-10 13:29:36,627 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:29:36,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:29:36,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:36,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:29:36,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:36,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:29:36,761 INFO L82 PathProgramCache]: Analyzing trace with hash -350861566, now seen corresponding path program 1 times [2018-11-10 13:29:36,761 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:29:36,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:29:36,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:36,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:29:36,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:36,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:29:36,780 INFO L82 PathProgramCache]: Analyzing trace with hash -437223816, now seen corresponding path program 1 times [2018-11-10 13:29:36,780 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:29:36,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:29:36,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:36,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:29:36,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:29:36,989 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-10 13:29:36,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:29:36,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 13:29:37,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 13:29:37,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:29:37,039 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 9 states. [2018-11-10 13:29:37,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:29:37,272 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2018-11-10 13:29:37,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 13:29:37,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 120 transitions. [2018-11-10 13:29:37,276 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 13:29:37,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 95 states and 104 transitions. [2018-11-10 13:29:37,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2018-11-10 13:29:37,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2018-11-10 13:29:37,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 104 transitions. [2018-11-10 13:29:37,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:29:37,283 INFO L705 BuchiCegarLoop]: Abstraction has 95 states and 104 transitions. [2018-11-10 13:29:37,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 104 transitions. [2018-11-10 13:29:37,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 67. [2018-11-10 13:29:37,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-10 13:29:37,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-11-10 13:29:37,306 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-11-10 13:29:37,306 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-11-10 13:29:37,306 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 13:29:37,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 72 transitions. [2018-11-10 13:29:37,307 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 13:29:37,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:29:37,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:29:37,308 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:29:37,308 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:29:37,308 INFO L793 eck$LassoCheckResult]: Stem: 242#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 225#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet21; 226#L578 assume !(main_#t~nondet21 != 0);havoc main_#t~nondet21;assume { :begin_inline_f } true;f_#in~d := 2;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset; 233#L553-2 SUMMARY for call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4); srcloc: L553-2 244#L553-3 SUMMARY for call write~int(1, f_~x~0.base, f_~x~0.offset, 4); srcloc: L553-3 245#L554-1 SUMMARY for call write~int(1, f_~y~0.base, f_~y~0.offset, 4); srcloc: L554-1 220#L555-1 SUMMARY for call write~int(1, f_~k~0.base, f_~k~0.offset, 4); srcloc: L555-1 221#L556-1 SUMMARY for call write~int(1, f_~z~0.base, f_~z~0.offset, 4); srcloc: L556-1 240#L557-1 SUMMARY for call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); srcloc: L557-1 250#L558-1 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 254#L562-9 assume true; 255#L562-5 SUMMARY for call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4); srcloc: L562-5 263#L562-6 SUMMARY for call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); srcloc: L562-6 266#L562-7 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9; 227#L567-5 [2018-11-10 13:29:37,309 INFO L795 eck$LassoCheckResult]: Loop: 227#L567-5 assume true; 228#L566-9 SUMMARY for call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4); srcloc: L566-9 262#L566-10 f_#t~short13 := f_#t~mem11 > 0; 265#L566-11 assume !f_#t~short13; 253#L566-15 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~short13;havoc f_#t~mem12; 222#L567-3 assume !(f_#t~nondet14 != 0);havoc f_#t~nondet14; 223#L573-4 SUMMARY for call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4); srcloc: L573-4 256#L573-5 SUMMARY for call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4); srcloc: L573-5 260#L573-6 SUMMARY for call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4); srcloc: L573-6 264#L573-7 havoc f_#t~mem20;havoc f_#t~mem19; 227#L567-5 [2018-11-10 13:29:37,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:29:37,309 INFO L82 PathProgramCache]: Analyzing trace with hash 241902512, now seen corresponding path program 1 times [2018-11-10 13:29:37,309 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:29:37,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:29:37,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:37,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:29:37,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:37,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:29:37,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1694944539, now seen corresponding path program 1 times [2018-11-10 13:29:37,352 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:29:37,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:29:37,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:37,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:29:37,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:29:37,378 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-10 13:29:37,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:29:37,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:29:37,379 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 13:29:37,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:29:37,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:29:37,379 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-10 13:29:37,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:29:37,399 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-10 13:29:37,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:29:37,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 72 transitions. [2018-11-10 13:29:37,400 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 13:29:37,400 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 67 states and 70 transitions. [2018-11-10 13:29:37,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2018-11-10 13:29:37,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2018-11-10 13:29:37,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 70 transitions. [2018-11-10 13:29:37,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:29:37,401 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-11-10 13:29:37,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 70 transitions. [2018-11-10 13:29:37,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-10 13:29:37,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-10 13:29:37,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-11-10 13:29:37,403 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-11-10 13:29:37,403 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-11-10 13:29:37,403 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 13:29:37,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 70 transitions. [2018-11-10 13:29:37,404 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 13:29:37,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:29:37,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:29:37,405 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:29:37,405 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:29:37,405 INFO L793 eck$LassoCheckResult]: Stem: 384#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 364#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet21; 365#L578 assume !(main_#t~nondet21 != 0);havoc main_#t~nondet21;assume { :begin_inline_f } true;f_#in~d := 2;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset; 375#L553-2 SUMMARY for call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4); srcloc: L553-2 386#L553-3 SUMMARY for call write~int(1, f_~x~0.base, f_~x~0.offset, 4); srcloc: L553-3 387#L554-1 SUMMARY for call write~int(1, f_~y~0.base, f_~y~0.offset, 4); srcloc: L554-1 362#L555-1 SUMMARY for call write~int(1, f_~k~0.base, f_~k~0.offset, 4); srcloc: L555-1 363#L556-1 SUMMARY for call write~int(1, f_~z~0.base, f_~z~0.offset, 4); srcloc: L556-1 382#L557-1 SUMMARY for call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); srcloc: L557-1 392#L558-1 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 394#L562-9 assume true; 395#L562-5 SUMMARY for call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4); srcloc: L562-5 404#L562-6 SUMMARY for call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); srcloc: L562-6 407#L562-7 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9; 369#L567-5 [2018-11-10 13:29:37,405 INFO L795 eck$LassoCheckResult]: Loop: 369#L567-5 assume true; 370#L566-9 SUMMARY for call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4); srcloc: L566-9 405#L566-10 f_#t~short13 := f_#t~mem11 > 0; 408#L566-11 assume f_#t~short13; 410#L566-12 SUMMARY for call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4); srcloc: L566-12 396#L566-13 f_#t~short13 := f_#t~mem12 > 0; 397#L566-15 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~short13;havoc f_#t~mem12; 366#L567-3 assume !(f_#t~nondet14 != 0);havoc f_#t~nondet14; 367#L573-4 SUMMARY for call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4); srcloc: L573-4 398#L573-5 SUMMARY for call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4); srcloc: L573-5 402#L573-6 SUMMARY for call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4); srcloc: L573-6 406#L573-7 havoc f_#t~mem20;havoc f_#t~mem19; 369#L567-5 [2018-11-10 13:29:37,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:29:37,406 INFO L82 PathProgramCache]: Analyzing trace with hash 241902512, now seen corresponding path program 2 times [2018-11-10 13:29:37,406 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:29:37,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:29:37,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:37,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:29:37,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:37,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:29:37,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1785837784, now seen corresponding path program 1 times [2018-11-10 13:29:37,442 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:29:37,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:29:37,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:37,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:29:37,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:37,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:29:37,458 INFO L82 PathProgramCache]: Analyzing trace with hash 634506759, now seen corresponding path program 1 times [2018-11-10 13:29:37,458 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:29:37,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:29:37,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:37,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:29:37,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:37,641 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-11-10 13:29:38,247 WARN L179 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 144 [2018-11-10 13:29:38,556 WARN L179 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2018-11-10 13:29:38,569 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:29:38,570 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:29:38,570 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:29:38,570 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:29:38,571 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:29:38,571 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:29:38,571 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:29:38,571 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:29:38,571 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-10 13:29:38,571 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:29:38,571 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:29:38,589 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-10 13:29:38,593 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-10 13:29:38,595 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-10 13:29:38,599 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-10 13:29:38,601 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-10 13:29:38,603 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-10 13:29:38,606 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-10 13:29:38,613 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-10 13:29:38,615 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-10 13:29:38,618 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-10 13:29:38,619 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-10 13:29:38,621 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-10 13:29:38,623 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-10 13:29:38,624 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-10 13:29:38,625 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-10 13:29:38,628 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-10 13:29:38,629 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-10 13:29:39,217 WARN L179 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 135 [2018-11-10 13:29:39,335 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 97 [2018-11-10 13:29:39,335 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-10 13:29:39,336 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-10 13:29:39,338 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-10 13:29:39,339 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-10 13:29:39,340 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-10 13:29:39,341 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-10 13:29:39,343 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-10 13:29:39,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:29:39,869 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:29:39,872 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:29:39,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:39,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:39,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:29:39,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:39,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:39,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:39,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:29:39,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:29:39,878 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:39,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:39,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:39,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:29:39,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:39,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:39,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:39,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:29:39,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:29:39,880 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:39,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:39,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:39,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:39,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:39,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:39,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:39,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:39,883 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:39,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:39,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:39,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:29:39,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:39,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:39,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:39,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:29:39,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:29:39,886 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:39,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:39,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:39,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:29:39,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:39,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:39,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:39,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:29:39,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:29:39,890 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:39,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:39,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:39,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:29:39,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:39,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:39,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:39,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:29:39,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:29:39,892 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:39,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:39,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:39,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:39,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:39,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:39,895 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:39,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:39,897 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:39,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:39,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:39,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:39,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:39,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:39,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:39,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:39,902 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:39,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:39,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:39,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:39,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:39,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:39,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:39,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:39,906 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:39,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:39,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:39,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:29:39,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:39,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:39,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:39,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:29:39,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:29:39,908 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:39,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:39,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:39,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:39,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:39,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:39,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:39,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:39,911 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:39,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:39,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:39,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:29:39,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:39,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:39,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:39,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:29:39,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:29:39,914 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:39,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:39,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:39,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:29:39,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:39,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:39,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:39,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:29:39,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:29:39,915 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:39,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:39,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:39,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:29:39,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:39,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:39,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:39,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:29:39,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:29:39,918 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:39,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:39,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:39,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:39,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:39,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:39,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:39,920 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:39,922 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:39,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:39,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:39,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:29:39,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:39,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:39,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:39,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:29:39,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:29:39,924 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:39,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:39,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:39,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:39,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:39,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:39,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:39,926 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:39,928 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:39,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:39,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:39,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:39,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:39,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:39,930 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:39,930 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:39,938 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:39,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:39,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:39,940 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 13:29:39,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:39,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:39,941 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:29:39,941 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:39,946 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:39,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:39,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:39,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:39,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:39,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:39,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:39,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:39,950 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:39,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:39,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:39,950 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 13:29:39,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:39,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:39,952 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:29:39,952 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:39,960 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:39,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:39,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:39,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:39,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:39,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:39,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:39,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:39,965 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:39,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:39,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:39,966 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 13:29:39,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:39,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:39,967 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:29:39,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:39,971 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:39,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:39,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:39,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:39,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:39,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:39,973 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:39,973 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:39,976 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:39,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:39,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:39,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:39,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:39,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:39,982 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:39,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:39,986 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:39,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:39,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:39,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:39,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:39,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:39,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:39,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:40,005 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:29:40,014 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 13:29:40,014 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 13:29:40,016 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:29:40,017 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-10 13:29:40,017 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:29:40,018 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_f_~d_ref~0.base) ULTIMATE.start_f_~d_ref~0.offset)_1 - 2 >= 0] [2018-11-10 13:29:40,164 INFO L297 tatePredicateManager]: 55 out of 59 supporting invariants were superfluous and have been removed [2018-11-10 13:29:40,172 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:29:40,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:29:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:29:40,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:29:40,244 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:40,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-11-10 13:29:40,291 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:40,292 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:40,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-11-10 13:29:40,332 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:40,332 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:40,333 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:40,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 64 [2018-11-10 13:29:40,356 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:40,356 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:40,357 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:40,357 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:40,358 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:40,358 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:40,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-11-10 13:29:40,360 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:40,368 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:40,377 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:40,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:40,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:40,398 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:61, output treesize:51 [2018-11-10 13:29:40,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 13:29:40,428 INFO L477 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-10 13:29:40,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:40,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:40,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:40,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:55 [2018-11-10 13:29:40,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-10 13:29:40,479 INFO L477 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-10 13:29:40,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:40,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:40,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 13:29:40,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:62 [2018-11-10 13:29:40,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-11-10 13:29:40,545 INFO L477 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-10 13:29:40,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:40,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:40,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-10 13:29:40,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:73, output treesize:69 [2018-11-10 13:29:40,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 54 [2018-11-10 13:29:40,634 INFO L477 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-10 13:29:40,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:40,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:40,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-11-10 13:29:40,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:80, output treesize:76 [2018-11-10 13:29:40,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 77 [2018-11-10 13:29:40,727 INFO L477 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-10 13:29:40,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:40,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:40,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-11-10 13:29:40,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:87, output treesize:83 [2018-11-10 13:29:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:29:40,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:29:40,933 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:40,936 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:40,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 56 [2018-11-10 13:29:40,944 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:40,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-11-10 13:29:40,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 13:29:40,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:40,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:40,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:34 [2018-11-10 13:29:41,007 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-10 13:29:41,009 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 7 loop predicates [2018-11-10 13:29:41,011 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 70 transitions. cyclomatic complexity: 5 Second operand 15 states. [2018-11-10 13:29:41,734 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 70 transitions. cyclomatic complexity: 5. Second operand 15 states. Result 98 states and 103 transitions. Complement of second has 21 states. [2018-11-10 13:29:41,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 7 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 13:29:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-10 13:29:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2018-11-10 13:29:41,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 64 transitions. Stem has 14 letters. Loop has 12 letters. [2018-11-10 13:29:41,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:29:41,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 64 transitions. Stem has 26 letters. Loop has 12 letters. [2018-11-10 13:29:41,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:29:41,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 64 transitions. Stem has 14 letters. Loop has 24 letters. [2018-11-10 13:29:41,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:29:41,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 103 transitions. [2018-11-10 13:29:41,738 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 13:29:41,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 92 states and 97 transitions. [2018-11-10 13:29:41,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2018-11-10 13:29:41,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2018-11-10 13:29:41,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 97 transitions. [2018-11-10 13:29:41,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:29:41,740 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 97 transitions. [2018-11-10 13:29:41,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 97 transitions. [2018-11-10 13:29:41,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-11-10 13:29:41,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-10 13:29:41,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-11-10 13:29:41,744 INFO L728 BuchiCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-11-10 13:29:41,744 INFO L608 BuchiCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-11-10 13:29:41,745 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 13:29:41,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 93 transitions. [2018-11-10 13:29:41,745 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 13:29:41,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:29:41,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:29:41,746 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:29:41,746 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:29:41,746 INFO L793 eck$LassoCheckResult]: Stem: 937#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 917#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet21; 918#L578 assume main_#t~nondet21 != 0;havoc main_#t~nondet21;assume { :begin_inline_f } true;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset; 928#L553 SUMMARY for call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4); srcloc: L553 936#L553-1 SUMMARY for call write~int(1, f_~x~0.base, f_~x~0.offset, 4); srcloc: L553-1 938#L554 SUMMARY for call write~int(1, f_~y~0.base, f_~y~0.offset, 4); srcloc: L554 908#L555 SUMMARY for call write~int(1, f_~k~0.base, f_~k~0.offset, 4); srcloc: L555 909#L556 SUMMARY for call write~int(1, f_~z~0.base, f_~z~0.offset, 4); srcloc: L556 933#L557 SUMMARY for call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); srcloc: L557 943#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 957#L562-4 assume true; 958#L562 SUMMARY for call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4); srcloc: L562 977#L562-1 SUMMARY for call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); srcloc: L562-1 980#L562-2 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9; 925#L567-2 [2018-11-10 13:29:41,746 INFO L795 eck$LassoCheckResult]: Loop: 925#L567-2 assume true; 906#L566 SUMMARY for call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4); srcloc: L566 907#L566-1 f_#t~short13 := f_#t~mem11 > 0; 910#L566-2 assume f_#t~short13; 974#L566-3 SUMMARY for call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4); srcloc: L566-3 975#L566-4 f_#t~short13 := f_#t~mem12 > 0; 978#L566-6 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~short13;havoc f_#t~mem12; 929#L567 assume !(f_#t~nondet14 != 0);havoc f_#t~nondet14; 930#L573 SUMMARY for call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4); srcloc: L573 976#L573-1 SUMMARY for call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4); srcloc: L573-1 979#L573-2 SUMMARY for call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4); srcloc: L573-2 981#L573-3 havoc f_#t~mem20;havoc f_#t~mem19; 925#L567-2 [2018-11-10 13:29:41,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:29:41,746 INFO L82 PathProgramCache]: Analyzing trace with hash -160134480, now seen corresponding path program 1 times [2018-11-10 13:29:41,746 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:29:41,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:29:41,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:41,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:29:41,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:41,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:29:41,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1383800792, now seen corresponding path program 1 times [2018-11-10 13:29:41,770 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:29:41,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:29:41,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:41,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:29:41,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:41,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:29:41,779 INFO L82 PathProgramCache]: Analyzing trace with hash -402514937, now seen corresponding path program 1 times [2018-11-10 13:29:41,780 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:29:41,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:29:41,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:41,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:29:41,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:42,424 WARN L179 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 138 [2018-11-10 13:29:42,613 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-11-10 13:29:42,615 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:29:42,615 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:29:42,615 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:29:42,615 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:29:42,615 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:29:42,616 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:29:42,616 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:29:42,616 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:29:42,616 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-10 13:29:42,616 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:29:42,616 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:29:42,618 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-10 13:29:42,620 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-10 13:29:42,621 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-10 13:29:42,622 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-10 13:29:42,623 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-10 13:29:42,624 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-10 13:29:42,625 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-10 13:29:42,626 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-10 13:29:42,627 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-10 13:29:42,628 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-10 13:29:42,629 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-10 13:29:42,630 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-10 13:29:42,631 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-10 13:29:42,632 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-10 13:29:42,633 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-10 13:29:42,634 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-10 13:29:42,635 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-10 13:29:42,636 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-10 13:29:42,637 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-10 13:29:42,638 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-10 13:29:43,156 WARN L179 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 137 [2018-11-10 13:29:43,274 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 97 [2018-11-10 13:29:43,275 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-10 13:29:43,276 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-10 13:29:43,277 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-10 13:29:43,755 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:29:43,755 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:29:43,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:43,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:29:43,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:29:43,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:29:43,761 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:29:43,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,762 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:43,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:43,763 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:43,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:29:43,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:29:43,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:29:43,764 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:29:43,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:43,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:43,767 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:43,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:29:43,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:29:43,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:29:43,768 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:43,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:29:43,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:29:43,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:29:43,770 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:29:43,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,771 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:43,771 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:43,773 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:43,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:29:43,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:29:43,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:29:43,774 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:43,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:29:43,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:29:43,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:29:43,776 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:29:43,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:29:43,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:29:43,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:29:43,777 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:29:43,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:43,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:43,780 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:29:43,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:29:43,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:29:43,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:29:43,782 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:29:43,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:29:43,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:29:43,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:29:43,784 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:43,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:29:43,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:29:43,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:29:43,785 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:43,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,786 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:43,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:43,790 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:29:43,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:29:43,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:29:43,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:29:43,792 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:29:43,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:29:43,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:29:43,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:29:43,793 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:29:43,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:29:43,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:29:43,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:29:43,795 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:43,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:29:43,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:29:43,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:29:43,797 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:43,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:43,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:43,805 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:43,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:43,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:43,807 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:43,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,808 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 13:29:43,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,809 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:29:43,809 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:43,813 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:29:43,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,815 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:43,815 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:43,820 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:43,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:43,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:43,833 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:29:43,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,833 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 13:29:43,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,834 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:29:43,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:43,837 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:29:43,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:43,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:43,842 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:29:43,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,844 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 13:29:43,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,844 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:29:43,845 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:43,847 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:43,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:43,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:43,861 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:43,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:43,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:43,867 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:43,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,868 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:43,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:43,870 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:43,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:43,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:43,874 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:43,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,875 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:43,876 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:43,877 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:43,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:43,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:43,882 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:43,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,883 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 13:29:43,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,884 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:29:43,884 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:43,886 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:43,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:43,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:43,890 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:43,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,891 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:43,891 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:43,893 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:43,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:43,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:43,917 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:43,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:43,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:43,920 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:29:43,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 13:29:43,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:29:43,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:29:43,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:29:43,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:29:43,922 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:29:43,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:29:43,928 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:29:43,936 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 13:29:43,936 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 13:29:43,936 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:29:43,937 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-10 13:29:43,937 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:29:43,937 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_2 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_f_~d_ref~0.base) ULTIMATE.start_f_~d_ref~0.offset)_2 - 1 >= 0] [2018-11-10 13:29:44,126 INFO L297 tatePredicateManager]: 55 out of 59 supporting invariants were superfluous and have been removed [2018-11-10 13:29:44,131 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:29:44,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:29:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:29:44,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:29:44,180 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:44,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-11-10 13:29:44,201 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:44,202 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:44,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-11-10 13:29:44,226 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:44,227 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:44,228 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:44,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 64 [2018-11-10 13:29:44,283 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:44,284 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:44,285 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:44,286 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:44,287 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:44,288 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:44,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-11-10 13:29:44,289 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:44,299 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:44,308 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:44,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:44,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:44,328 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:61, output treesize:51 [2018-11-10 13:29:44,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 13:29:44,352 INFO L477 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-10 13:29:44,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:44,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:44,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:44,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:55 [2018-11-10 13:29:44,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-10 13:29:44,410 INFO L477 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-10 13:29:44,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:44,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:44,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 13:29:44,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:62 [2018-11-10 13:29:44,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-11-10 13:29:44,462 INFO L477 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-10 13:29:44,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:44,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:44,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-10 13:29:44,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:73, output treesize:69 [2018-11-10 13:29:44,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 54 [2018-11-10 13:29:44,524 INFO L477 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-10 13:29:44,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:44,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:44,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-11-10 13:29:44,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:80, output treesize:76 [2018-11-10 13:29:44,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 77 [2018-11-10 13:29:44,596 INFO L477 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-10 13:29:44,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:44,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:44,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-11-10 13:29:44,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:87, output treesize:83 [2018-11-10 13:29:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:29:44,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:29:44,871 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:44,873 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:44,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 56 [2018-11-10 13:29:44,876 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:44,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-11-10 13:29:44,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 13:29:44,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:44,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:44,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:34 [2018-11-10 13:29:44,914 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-10 13:29:44,914 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 7 loop predicates [2018-11-10 13:29:44,914 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 88 states and 93 transitions. cyclomatic complexity: 8 Second operand 15 states. [2018-11-10 13:29:45,562 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 88 states and 93 transitions. cyclomatic complexity: 8. Second operand 15 states. Result 142 states and 149 transitions. Complement of second has 21 states. [2018-11-10 13:29:45,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 7 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 13:29:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-10 13:29:45,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 95 transitions. [2018-11-10 13:29:45,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 95 transitions. Stem has 14 letters. Loop has 12 letters. [2018-11-10 13:29:45,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:29:45,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 95 transitions. Stem has 26 letters. Loop has 12 letters. [2018-11-10 13:29:45,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:29:45,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 95 transitions. Stem has 14 letters. Loop has 24 letters. [2018-11-10 13:29:45,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:29:45,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 149 transitions. [2018-11-10 13:29:45,566 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 13:29:45,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 136 states and 143 transitions. [2018-11-10 13:29:45,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2018-11-10 13:29:45,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2018-11-10 13:29:45,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 143 transitions. [2018-11-10 13:29:45,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:29:45,568 INFO L705 BuchiCegarLoop]: Abstraction has 136 states and 143 transitions. [2018-11-10 13:29:45,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 143 transitions. [2018-11-10 13:29:45,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 109. [2018-11-10 13:29:45,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-10 13:29:45,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-11-10 13:29:45,572 INFO L728 BuchiCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-11-10 13:29:45,572 INFO L608 BuchiCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-11-10 13:29:45,572 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 13:29:45,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 116 transitions. [2018-11-10 13:29:45,572 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-10 13:29:45,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:29:45,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:29:45,573 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, 1, 1, 1] [2018-11-10 13:29:45,573 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:29:45,573 INFO L793 eck$LassoCheckResult]: Stem: 1556#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1530#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet21; 1531#L578 assume !(main_#t~nondet21 != 0);havoc main_#t~nondet21;assume { :begin_inline_f } true;f_#in~d := 2;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset; 1544#L553-2 SUMMARY for call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4); srcloc: L553-2 1558#L553-3 SUMMARY for call write~int(1, f_~x~0.base, f_~x~0.offset, 4); srcloc: L553-3 1559#L554-1 SUMMARY for call write~int(1, f_~y~0.base, f_~y~0.offset, 4); srcloc: L554-1 1528#L555-1 SUMMARY for call write~int(1, f_~k~0.base, f_~k~0.offset, 4); srcloc: L555-1 1529#L556-1 SUMMARY for call write~int(1, f_~z~0.base, f_~z~0.offset, 4); srcloc: L556-1 1553#L557-1 SUMMARY for call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); srcloc: L557-1 1564#L558-1 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 1566#L562-9 assume true; 1567#L562-5 SUMMARY for call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4); srcloc: L562-5 1581#L562-6 SUMMARY for call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); srcloc: L562-6 1586#L562-7 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9; 1590#L567-5 assume true; 1537#L566-9 SUMMARY for call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4); srcloc: L566-9 1582#L566-10 f_#t~short13 := f_#t~mem11 > 0; 1587#L566-11 assume f_#t~short13; 1591#L566-12 SUMMARY for call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4); srcloc: L566-12 1568#L566-13 f_#t~short13 := f_#t~mem12 > 0; 1569#L566-15 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~short13;havoc f_#t~mem12; 1532#L567-3 assume f_#t~nondet14 != 0;havoc f_#t~nondet14; 1533#L568-1 [2018-11-10 13:29:45,573 INFO L795 eck$LassoCheckResult]: Loop: 1533#L568-1 SUMMARY for call f_#t~mem15 := read~int(f_~x~0.base, f_~x~0.offset, 4); srcloc: L568-1 1563#L569-3 SUMMARY for call f_#t~mem16 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4); srcloc: L569-3 1589#L569-4 SUMMARY for call write~int(f_#t~mem15 - f_#t~mem16, f_~x~0.base, f_~x~0.offset, 4); srcloc: L569-4 1565#L569-5 havoc f_#t~mem16;havoc f_#t~mem15; 1517#L570-2 SUMMARY for call write~int(f_#t~nondet17, f_~y~0.base, f_~y~0.offset, 4); srcloc: L570-2 1518#L570-3 havoc f_#t~nondet17; 1519#L571-3 SUMMARY for call f_#t~mem18 := read~int(f_~z~0.base, f_~z~0.offset, 4); srcloc: L571-3 1543#L571-4 SUMMARY for call write~int(f_#t~mem18 - 1, f_~z~0.base, f_~z~0.offset, 4); srcloc: L571-4 1550#L571-5 havoc f_#t~mem18; 1552#L567-5 assume true; 1623#L566-9 SUMMARY for call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4); srcloc: L566-9 1622#L566-10 f_#t~short13 := f_#t~mem11 > 0; 1621#L566-11 assume f_#t~short13; 1620#L566-12 SUMMARY for call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4); srcloc: L566-12 1619#L566-13 f_#t~short13 := f_#t~mem12 > 0; 1618#L566-15 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~short13;havoc f_#t~mem12; 1617#L567-3 assume f_#t~nondet14 != 0;havoc f_#t~nondet14; 1533#L568-1 [2018-11-10 13:29:45,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:29:45,573 INFO L82 PathProgramCache]: Analyzing trace with hash 674060345, now seen corresponding path program 1 times [2018-11-10 13:29:45,573 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:29:45,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:29:45,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:45,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:29:45,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:45,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:29:45,595 INFO L82 PathProgramCache]: Analyzing trace with hash -272416078, now seen corresponding path program 1 times [2018-11-10 13:29:45,595 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:29:45,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:29:45,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:45,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:29:45,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:45,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:29:45,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1394974342, now seen corresponding path program 1 times [2018-11-10 13:29:45,609 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:29:45,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:29:45,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:45,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:29:45,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:29:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:29:46,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:29:46,289 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98742aa6-7aeb-44e3-b962-5a0d2138f116/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:29:46,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:29:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:29:46,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:29:46,350 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:46,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-11-10 13:29:46,369 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:46,370 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:46,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-11-10 13:29:46,389 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:46,390 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:46,391 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:46,393 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:46,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2018-11-10 13:29:46,419 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:46,420 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:46,421 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:46,422 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:46,423 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:46,424 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:46,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-11-10 13:29:46,425 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:46,434 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:46,444 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:46,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:46,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:46,463 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:54, output treesize:44 [2018-11-10 13:29:46,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 13:29:46,496 INFO L477 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-10 13:29:46,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:46,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:46,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:46,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:48 [2018-11-10 13:29:46,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-10 13:29:46,544 INFO L477 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-10 13:29:46,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:46,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:46,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:46,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2018-11-10 13:29:46,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-11-10 13:29:46,609 INFO L477 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-10 13:29:46,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:46,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:46,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:46,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:66, output treesize:62 [2018-11-10 13:29:46,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 54 [2018-11-10 13:29:46,679 INFO L477 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-10 13:29:46,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:46,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:46,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 13:29:46,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:69 [2018-11-10 13:29:46,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 77 [2018-11-10 13:29:46,764 INFO L477 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-10 13:29:46,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:46,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:46,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 13:29:46,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:76 [2018-11-10 13:29:46,966 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:46,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 108 [2018-11-10 13:29:46,975 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:46,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2018-11-10 13:29:46,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:46,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:47,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-10 13:29:47,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:105, output treesize:82 [2018-11-10 13:29:47,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 88 [2018-11-10 13:29:47,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-10 13:29:47,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:47,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:47,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-10 13:29:47,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:93, output treesize:59 [2018-11-10 13:29:47,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 67 [2018-11-10 13:29:47,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-10 13:29:47,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:47,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:47,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-10 13:29:47,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:72, output treesize:40 [2018-11-10 13:29:47,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2018-11-10 13:29:47,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 13:29:47,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:47,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-10 13:29:47,256 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:47,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 13:29:47,260 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:47,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:47,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:47,266 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:47, output treesize:5 [2018-11-10 13:29:47,305 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:29:47,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 13:29:47,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 31 [2018-11-10 13:29:47,464 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2018-11-10 13:29:47,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-10 13:29:47,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=848, Unknown=0, NotChecked=0, Total=930 [2018-11-10 13:29:47,498 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. cyclomatic complexity: 11 Second operand 31 states. [2018-11-10 13:29:48,055 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 55 [2018-11-10 13:29:48,236 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 59 [2018-11-10 13:29:48,449 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 61 [2018-11-10 13:29:48,654 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 61 [2018-11-10 13:29:48,879 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 72 [2018-11-10 13:29:50,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:29:50,227 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2018-11-10 13:29:50,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-10 13:29:50,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 135 transitions. [2018-11-10 13:29:50,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-10 13:29:50,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 56 states and 59 transitions. [2018-11-10 13:29:50,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-11-10 13:29:50,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-11-10 13:29:50,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 59 transitions. [2018-11-10 13:29:50,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:29:50,229 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-11-10 13:29:50,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 59 transitions. [2018-11-10 13:29:50,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-10 13:29:50,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 13:29:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-11-10 13:29:50,231 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-11-10 13:29:50,231 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-11-10 13:29:50,231 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 13:29:50,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 59 transitions. [2018-11-10 13:29:50,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-10 13:29:50,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:29:50,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:29:50,232 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, 1, 1, 1] [2018-11-10 13:29:50,232 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:29:50,232 INFO L793 eck$LassoCheckResult]: Stem: 1984#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1963#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet21; 1964#L578 assume main_#t~nondet21 != 0;havoc main_#t~nondet21;assume { :begin_inline_f } true;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset; 1972#L553 SUMMARY for call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4); srcloc: L553 1981#L553-1 SUMMARY for call write~int(1, f_~x~0.base, f_~x~0.offset, 4); srcloc: L553-1 1978#L554 SUMMARY for call write~int(1, f_~y~0.base, f_~y~0.offset, 4); srcloc: L554 1959#L555 SUMMARY for call write~int(1, f_~k~0.base, f_~k~0.offset, 4); srcloc: L555 1960#L556 SUMMARY for call write~int(1, f_~z~0.base, f_~z~0.offset, 4); srcloc: L556 1953#L557 SUMMARY for call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); srcloc: L557 1954#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 1969#L562-4 assume true; 1970#L562 SUMMARY for call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4); srcloc: L562 1990#L562-1 SUMMARY for call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); srcloc: L562-1 1993#L562-2 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9; 1997#L567-2 assume true; 1955#L566 SUMMARY for call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4); srcloc: L566 1956#L566-1 f_#t~short13 := f_#t~mem11 > 0; 1961#L566-2 assume f_#t~short13; 1979#L566-3 SUMMARY for call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4); srcloc: L566-3 1982#L566-4 f_#t~short13 := f_#t~mem12 > 0; 1988#L566-6 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~short13;havoc f_#t~mem12; 1973#L567 assume f_#t~nondet14 != 0;havoc f_#t~nondet14; 1951#L568 [2018-11-10 13:29:50,232 INFO L795 eck$LassoCheckResult]: Loop: 1951#L568 SUMMARY for call f_#t~mem15 := read~int(f_~x~0.base, f_~x~0.offset, 4); srcloc: L568 1952#L569 SUMMARY for call f_#t~mem16 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4); srcloc: L569 1966#L569-1 SUMMARY for call write~int(f_#t~mem15 - f_#t~mem16, f_~x~0.base, f_~x~0.offset, 4); srcloc: L569-1 1971#L569-2 havoc f_#t~mem16;havoc f_#t~mem15; 1965#L570 SUMMARY for call write~int(f_#t~nondet17, f_~y~0.base, f_~y~0.offset, 4); srcloc: L570 1949#L570-1 havoc f_#t~nondet17; 1950#L571 SUMMARY for call f_#t~mem18 := read~int(f_~z~0.base, f_~z~0.offset, 4); srcloc: L571 1996#L571-1 SUMMARY for call write~int(f_#t~mem18 - 1, f_~z~0.base, f_~z~0.offset, 4); srcloc: L571-1 1967#L571-2 havoc f_#t~mem18; 1968#L567-2 assume true; 2004#L566 SUMMARY for call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4); srcloc: L566 2003#L566-1 f_#t~short13 := f_#t~mem11 > 0; 2002#L566-2 assume f_#t~short13; 2001#L566-3 SUMMARY for call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4); srcloc: L566-3 2000#L566-4 f_#t~short13 := f_#t~mem12 > 0; 1999#L566-6 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~short13;havoc f_#t~mem12; 1998#L567 assume f_#t~nondet14 != 0;havoc f_#t~nondet14; 1951#L568 [2018-11-10 13:29:50,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:29:50,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1856624953, now seen corresponding path program 1 times [2018-11-10 13:29:50,233 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:29:50,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:29:50,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:50,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:29:50,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:50,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:29:50,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1680838246, now seen corresponding path program 1 times [2018-11-10 13:29:50,250 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:29:50,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:29:50,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:50,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:29:50,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:50,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:29:50,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1522774994, now seen corresponding path program 1 times [2018-11-10 13:29:50,259 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:29:50,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:29:50,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:50,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:29:50,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:29:50,947 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:29:50,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:29:50,948 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98742aa6-7aeb-44e3-b962-5a0d2138f116/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:29:50,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:29:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:29:50,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:29:50,998 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:50,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-11-10 13:29:51,013 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:51,014 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:51,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-11-10 13:29:51,035 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:51,036 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:51,037 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:51,038 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:51,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2018-11-10 13:29:51,061 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:51,061 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:51,062 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:51,063 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:51,063 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:51,064 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:51,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-11-10 13:29:51,064 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,072 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,078 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,094 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:54, output treesize:44 [2018-11-10 13:29:51,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 13:29:51,123 INFO L477 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-10 13:29:51,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:48 [2018-11-10 13:29:51,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-10 13:29:51,168 INFO L477 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-10 13:29:51,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2018-11-10 13:29:51,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-11-10 13:29:51,222 INFO L477 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-10 13:29:51,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:66, output treesize:62 [2018-11-10 13:29:51,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 54 [2018-11-10 13:29:51,289 INFO L477 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-10 13:29:51,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 13:29:51,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:69 [2018-11-10 13:29:51,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 77 [2018-11-10 13:29:51,374 INFO L477 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-10 13:29:51,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 13:29:51,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:76 [2018-11-10 13:29:51,591 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:51,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 108 [2018-11-10 13:29:51,600 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:29:51,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2018-11-10 13:29:51,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-10 13:29:51,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:105, output treesize:82 [2018-11-10 13:29:51,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 88 [2018-11-10 13:29:51,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-10 13:29:51,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-10 13:29:51,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:93, output treesize:59 [2018-11-10 13:29:51,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 67 [2018-11-10 13:29:51,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-10 13:29:51,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-10 13:29:51,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:72, output treesize:40 [2018-11-10 13:29:51,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2018-11-10 13:29:51,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 13:29:51,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 13:29:51,867 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-10 13:29:51,871 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:29:51,875 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:47, output treesize:3 [2018-11-10 13:29:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:29:51,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 13:29:51,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 30 [2018-11-10 13:29:52,035 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2018-11-10 13:29:52,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-10 13:29:52,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=791, Unknown=0, NotChecked=0, Total=870 [2018-11-10 13:29:52,079 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. cyclomatic complexity: 5 Second operand 30 states. [2018-11-10 13:30:23,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:23,315 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-10 13:30:23,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-10 13:30:23,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 78 transitions. [2018-11-10 13:30:23,316 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 13:30:23,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 0 states and 0 transitions. [2018-11-10 13:30:23,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 13:30:23,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 13:30:23,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 13:30:23,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:30:23,316 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:30:23,316 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:30:23,316 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:30:23,316 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 13:30:23,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 13:30:23,317 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 13:30:23,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 13:30:23,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 01:30:23 BoogieIcfgContainer [2018-11-10 13:30:23,322 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 13:30:23,322 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:30:23,322 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:30:23,323 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:30:23,323 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:29:36" (3/4) ... [2018-11-10 13:30:23,325 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 13:30:23,325 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:30:23,326 INFO L168 Benchmark]: Toolchain (without parser) took 47598.62 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 388.0 MB). Free memory was 957.6 MB in the beginning and 1.3 GB in the end (delta: -387.0 MB). Peak memory consumption was 967.3 kB. Max. memory is 11.5 GB. [2018-11-10 13:30:23,326 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:30:23,327 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.78 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 930.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 13:30:23,327 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 930.8 MB in the beginning and 1.1 GB in the end (delta: -199.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:30:23,327 INFO L168 Benchmark]: Boogie Preprocessor took 19.91 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:30:23,327 INFO L168 Benchmark]: RCFGBuilder took 412.99 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: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. [2018-11-10 13:30:23,327 INFO L168 Benchmark]: BuchiAutomizer took 46797.05 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 254.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -256.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:30:23,328 INFO L168 Benchmark]: Witness Printer took 3.04 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:30:23,329 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 283.78 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 930.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 930.8 MB in the beginning and 1.1 GB in the end (delta: -199.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.91 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 412.99 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: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 46797.05 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 254.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -256.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.04 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 14 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 14 locations. 4 modules have a trivial ranking function, the largest among these consists of 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 46.7s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 9.4s. Construction of modules took 30.3s. Büchi inclusion checks took 6.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 59 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 109 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 259 SDtfs, 1542 SDslu, 1178 SDs, 0 SdLazy, 1536 SolverSat, 378 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 30.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital538 mio100 ax103 hnf100 lsp93 ukn60 mio100 lsp33 div100 bol100 ite100 ukn100 eq203 hnf87 smp95 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...