./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_78018999-6e03-4597-bded-ccdf5de8e6a7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_78018999-6e03-4597-bded-ccdf5de8e6a7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_78018999-6e03-4597-bded-ccdf5de8e6a7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_78018999-6e03-4597-bded-ccdf5de8e6a7/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_78018999-6e03-4597-bded-ccdf5de8e6a7/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_78018999-6e03-4597-bded-ccdf5de8e6a7/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 18b42b65120149c30866fbc5b5479df029781f63 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 10:24:19,461 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:24:19,462 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:24:19,468 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:24:19,468 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:24:19,468 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:24:19,469 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:24:19,470 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:24:19,471 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:24:19,472 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:24:19,472 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:24:19,472 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:24:19,473 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:24:19,474 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:24:19,474 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:24:19,475 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:24:19,475 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:24:19,477 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:24:19,478 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:24:19,479 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:24:19,480 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:24:19,480 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:24:19,482 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:24:19,482 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:24:19,482 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:24:19,483 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:24:19,484 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:24:19,484 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:24:19,485 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:24:19,485 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:24:19,486 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:24:19,486 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:24:19,486 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:24:19,486 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:24:19,487 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:24:19,487 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:24:19,488 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_78018999-6e03-4597-bded-ccdf5de8e6a7/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 10:24:19,498 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:24:19,498 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:24:19,499 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:24:19,499 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:24:19,499 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 10:24:19,500 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 10:24:19,500 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 10:24:19,500 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 10:24:19,500 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 10:24:19,500 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 10:24:19,500 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 10:24:19,500 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:24:19,501 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 10:24:19,501 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:24:19,501 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:24:19,501 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 10:24:19,501 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 10:24:19,501 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 10:24:19,501 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:24:19,501 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 10:24:19,502 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:24:19,502 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 10:24:19,502 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:24:19,502 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:24:19,502 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 10:24:19,502 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:24:19,502 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 10:24:19,503 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 10:24:19,503 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 10:24:19,503 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_78018999-6e03-4597-bded-ccdf5de8e6a7/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 -> 18b42b65120149c30866fbc5b5479df029781f63 [2018-11-18 10:24:19,526 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:24:19,535 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:24:19,537 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:24:19,538 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:24:19,538 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:24:19,539 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_78018999-6e03-4597-bded-ccdf5de8e6a7/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B_true-termination.c.i [2018-11-18 10:24:19,579 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_78018999-6e03-4597-bded-ccdf5de8e6a7/bin-2019/uautomizer/data/7e0266fa4/59545a67df014bde81b9ac6471dcca77/FLAG142b0969c [2018-11-18 10:24:19,994 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:24:19,994 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_78018999-6e03-4597-bded-ccdf5de8e6a7/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B_true-termination.c.i [2018-11-18 10:24:19,999 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_78018999-6e03-4597-bded-ccdf5de8e6a7/bin-2019/uautomizer/data/7e0266fa4/59545a67df014bde81b9ac6471dcca77/FLAG142b0969c [2018-11-18 10:24:20,008 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_78018999-6e03-4597-bded-ccdf5de8e6a7/bin-2019/uautomizer/data/7e0266fa4/59545a67df014bde81b9ac6471dcca77 [2018-11-18 10:24:20,010 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:24:20,011 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:24:20,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:24:20,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:24:20,014 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:24:20,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:24:20" (1/1) ... [2018-11-18 10:24:20,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5927f13b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:24:20, skipping insertion in model container [2018-11-18 10:24:20,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:24:20" (1/1) ... [2018-11-18 10:24:20,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:24:20,034 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:24:20,138 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:24:20,145 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:24:20,154 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:24:20,163 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:24:20,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:24:20 WrapperNode [2018-11-18 10:24:20,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:24:20,164 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:24:20,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:24:20,164 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:24:20,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:24:20" (1/1) ... [2018-11-18 10:24:20,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:24:20" (1/1) ... [2018-11-18 10:24:20,185 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:24:20,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:24:20,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:24:20,185 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:24:20,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:24:20" (1/1) ... [2018-11-18 10:24:20,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:24:20" (1/1) ... [2018-11-18 10:24:20,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:24:20" (1/1) ... [2018-11-18 10:24:20,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:24:20" (1/1) ... [2018-11-18 10:24:20,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:24:20" (1/1) ... [2018-11-18 10:24:20,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:24:20" (1/1) ... [2018-11-18 10:24:20,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:24:20" (1/1) ... [2018-11-18 10:24:20,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:24:20,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:24:20,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:24:20,232 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:24:20,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:24:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78018999-6e03-4597-bded-ccdf5de8e6a7/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-18 10:24:20,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 10:24:20,269 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2018-11-18 10:24:20,269 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2018-11-18 10:24:20,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 10:24:20,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:24:20,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:24:20,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 10:24:20,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 10:24:20,399 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:24:20,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:24:20 BoogieIcfgContainer [2018-11-18 10:24:20,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:24:20,400 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 10:24:20,400 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 10:24:20,402 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 10:24:20,403 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:24:20,403 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 10:24:20" (1/3) ... [2018-11-18 10:24:20,404 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@299bdd7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:24:20, skipping insertion in model container [2018-11-18 10:24:20,404 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:24:20,404 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:24:20" (2/3) ... [2018-11-18 10:24:20,404 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@299bdd7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:24:20, skipping insertion in model container [2018-11-18 10:24:20,404 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:24:20,404 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:24:20" (3/3) ... [2018-11-18 10:24:20,405 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11B_true-termination.c.i [2018-11-18 10:24:20,435 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 10:24:20,436 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 10:24:20,436 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 10:24:20,436 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 10:24:20,436 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:24:20,436 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:24:20,436 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 10:24:20,437 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:24:20,437 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 10:24:20,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-18 10:24:20,467 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-18 10:24:20,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:24:20,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:24:20,471 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 10:24:20,471 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:24:20,472 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 10:24:20,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-18 10:24:20,473 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-18 10:24:20,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:24:20,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:24:20,474 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 10:24:20,474 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:24:20,480 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 18#L28-4true [2018-11-18 10:24:20,481 INFO L796 eck$LassoCheckResult]: Loop: 18#L28-4true assume true; 5#L28-1true call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 3#L28-2true assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 13#L33true call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 4#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 8#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 17#recFINALtrue assume true; 14#recEXITtrue >#40#return; 11#L33-1true assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 6#L33-3true call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret11;havoc main_#t~ite12;havoc main_#t~mem13; 18#L28-4true [2018-11-18 10:24:20,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:24:20,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2018-11-18 10:24:20,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:24:20,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:24:20,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:24:20,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:24:20,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:24:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:24:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:24:20,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:24:20,560 INFO L82 PathProgramCache]: Analyzing trace with hash -907438563, now seen corresponding path program 1 times [2018-11-18 10:24:20,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:24:20,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:24:20,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:24:20,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:24:20,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:24:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:24:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:24:20,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:24:20,603 INFO L82 PathProgramCache]: Analyzing trace with hash 839127135, now seen corresponding path program 1 times [2018-11-18 10:24:20,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:24:20,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:24:20,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:24:20,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:24:20,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:24:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:24:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:24:21,019 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-11-18 10:24:21,130 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:24:21,131 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:24:21,131 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:24:21,131 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:24:21,131 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:24:21,131 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:24:21,131 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:24:21,131 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:24:21,131 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11B_true-termination.c.i_Iteration1_Lasso [2018-11-18 10:24:21,132 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:24:21,132 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:24:21,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:24:21,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:24:21,155 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-18 10:24:21,156 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-18 10:24:21,157 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-18 10:24:21,159 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-18 10:24:21,166 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-18 10:24:21,169 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-18 10:24:21,174 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-18 10:24:21,320 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-18 10:24:21,518 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:24:21,521 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:24:21,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:21,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:21,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:21,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:21,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:21,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:21,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:21,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:21,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:21,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:21,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:21,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:21,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:21,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:21,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:24:21,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:24:21,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:21,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:21,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:21,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:21,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:21,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:21,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:21,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:21,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:21,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:21,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:21,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:21,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:21,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:21,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:21,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:21,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:21,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:21,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:21,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:21,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:21,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:21,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:21,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:21,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:24:21,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:24:21,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:21,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:21,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:21,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:21,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:21,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:21,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:21,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:21,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:21,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:21,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:21,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:21,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:21,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:21,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:21,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:24:21,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:24:21,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:21,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:24:21,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:21,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:21,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:21,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:21,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:21,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:21,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:21,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:21,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:21,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:21,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:21,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:21,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:21,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:24:21,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:24:21,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:21,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:24:21,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:21,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:21,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:21,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:21,576 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:24:21,576 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:24:21,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:21,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:21,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:21,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:21,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:21,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:21,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:24:21,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:24:21,603 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:24:21,610 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 10:24:21,610 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 10:24:21,612 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:24:21,613 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:24:21,614 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:24:21,614 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1 Supporting invariants [] [2018-11-18 10:24:21,623 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 10:24:21,627 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 10:24:21,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:24:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:24:21,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:24:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:24:21,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:24:21,722 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:24:21,723 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:24:21,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 10:24:21,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:24:21,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-18 10:24:21,734 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 16 treesize of output 10 [2018-11-18 10:24:21,735 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 10:24:21,754 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:24:21,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:24:21,757 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:40, output treesize:7 [2018-11-18 10:24:21,782 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-18 10:24:21,791 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-18 10:24:21,792 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 7 states. [2018-11-18 10:24:21,877 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 7 states. Result 68 states and 81 transitions. Complement of second has 18 states. [2018-11-18 10:24:21,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-18 10:24:21,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 10:24:21,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 25 transitions. [2018-11-18 10:24:21,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-18 10:24:21,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:24:21,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-18 10:24:21,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:24:21,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 2 letters. Loop has 20 letters. [2018-11-18 10:24:21,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:24:21,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 81 transitions. [2018-11-18 10:24:21,885 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-18 10:24:21,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 50 states and 61 transitions. [2018-11-18 10:24:21,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-18 10:24:21,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-18 10:24:21,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 61 transitions. [2018-11-18 10:24:21,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:24:21,890 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 61 transitions. [2018-11-18 10:24:21,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 61 transitions. [2018-11-18 10:24:21,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-18 10:24:21,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 10:24:21,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2018-11-18 10:24:21,909 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 60 transitions. [2018-11-18 10:24:21,909 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 60 transitions. [2018-11-18 10:24:21,910 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 10:24:21,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 60 transitions. [2018-11-18 10:24:21,911 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-18 10:24:21,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:24:21,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:24:21,912 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:24:21,912 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:24:21,912 INFO L794 eck$LassoCheckResult]: Stem: 204#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 200#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 201#L28-4 assume true; 192#L28-1 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 180#L28-2 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 181#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 207#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 228#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 185#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 184#recENTRY [2018-11-18 10:24:21,912 INFO L796 eck$LassoCheckResult]: Loop: 184#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 187#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 186#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 184#recENTRY [2018-11-18 10:24:21,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:24:21,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1504241142, now seen corresponding path program 1 times [2018-11-18 10:24:21,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:24:21,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:24:21,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:24:21,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:24:21,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:24:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:24:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:24:21,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:24:21,940 INFO L82 PathProgramCache]: Analyzing trace with hash 29952, now seen corresponding path program 1 times [2018-11-18 10:24:21,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:24:21,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:24:21,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:24:21,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:24:21,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:24:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:24:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:24:21,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:24:21,951 INFO L82 PathProgramCache]: Analyzing trace with hash 840905303, now seen corresponding path program 2 times [2018-11-18 10:24:21,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:24:21,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:24:21,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:24:21,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:24:21,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:24:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:24:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:24:22,419 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2018-11-18 10:24:22,731 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 106 [2018-11-18 10:24:22,794 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:24:22,794 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:24:22,794 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:24:22,794 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:24:22,794 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:24:22,794 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:24:22,794 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:24:22,794 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:24:22,794 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11B_true-termination.c.i_Iteration2_Lasso [2018-11-18 10:24:22,794 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:24:22,794 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:24:22,798 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-18 10:24:22,799 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-18 10:24:22,800 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-18 10:24:22,801 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-18 10:24:22,802 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-18 10:24:22,803 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-18 10:24:22,805 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-18 10:24:22,806 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-18 10:24:22,808 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-18 10:24:22,809 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-18 10:24:22,810 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-18 10:24:22,811 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-18 10:24:22,812 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-18 10:24:22,813 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-18 10:24:22,814 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-18 10:24:22,815 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-18 10:24:22,816 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-18 10:24:22,817 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-18 10:24:22,818 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-18 10:24:22,819 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-18 10:24:22,820 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-18 10:24:22,821 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-18 10:24:22,930 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-18 10:24:22,931 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-18 10:24:22,932 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-18 10:24:22,933 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-18 10:24:22,934 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-18 10:24:22,935 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-18 10:24:22,936 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-18 10:24:22,937 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-18 10:24:22,938 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-18 10:24:22,939 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-18 10:24:22,939 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-18 10:24:23,105 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:24:23,106 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:24:23,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:23,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:23,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:23,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:23,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:23,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:23,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:23,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:23,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:23,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:23,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:23,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:23,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:23,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:23,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:23,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:23,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:23,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:23,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:23,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:23,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:23,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:23,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:23,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:23,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:23,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:24:23,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:24:23,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:23,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:23,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:23,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:23,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:23,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:23,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:23,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:23,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:23,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:23,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:23,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:23,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:24:23,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:23,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:23,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:23,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:23,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:23,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:23,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:23,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:23,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:23,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:23,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:23,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:24:23,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:23,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:23,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:23,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:23,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:23,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:23,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:23,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:23,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:23,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:23,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:23,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:23,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:23,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:23,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:23,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:23,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:23,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:23,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:23,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:24:23,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:23,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:23,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:23,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:23,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:24:23,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:24:23,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:23,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:23,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:23,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:23,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:23,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,143 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:24:23,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:24:23,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:23,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:24:23,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:24:23,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:24:23,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,152 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:24:23,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,152 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:24:23,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:24:23,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:23,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:24:23,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:24:23,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:23,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,158 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:24:23,158 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:24:23,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,160 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-18 10:24:23,160 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 10:24:23,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:23,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,169 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:24:23,169 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:24:23,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:23,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,173 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:24:23,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:24:23,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:23,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:24:23,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:24:23,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:23,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:23,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:23,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:23,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:23,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:23,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:24:23,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:24:23,195 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:24:23,205 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 10:24:23,205 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 10:24:23,206 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:24:23,207 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2018-11-18 10:24:23,207 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:24:23,207 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select old(#memory_int) rec_#in~op.base) 0)_1) = 2*v_rep(select (select old(#memory_int) rec_#in~op.base) 0)_1 + 3 Supporting invariants [1*v_rep(select (select old(#memory_int) rec_#in~op.base) 0)_1 + 1 >= 0, -1*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1 + 1*v_rep(select (select old(#memory_int) rec_#in~op.base) 0)_1 >= 0] [2018-11-18 10:24:23,238 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2018-11-18 10:24:23,247 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 10:24:23,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:24:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:24:23,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:24:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:24:23,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:24:23,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 19 [2018-11-18 10:24:23,303 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 19 treesize of output 15 [2018-11-18 10:24:23,304 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 10:24:23,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 10:24:23,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 10:24:23,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:22 [2018-11-18 10:24:23,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-11-18 10:24:23,351 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 33 treesize of output 32 [2018-11-18 10:24:23,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:24:23,371 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:24:23,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2018-11-18 10:24:23,381 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 10:24:23,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 10:24:23,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-18 10:24:23,408 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:42, output treesize:68 [2018-11-18 10:24:23,434 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-18 10:24:23,434 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 10:24:23,434 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-11-18 10:24:23,502 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 134 states and 171 transitions. Complement of second has 18 states. [2018-11-18 10:24:23,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 10:24:23,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:24:23,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2018-11-18 10:24:23,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-18 10:24:23,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:24:23,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-18 10:24:23,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:24:23,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-18 10:24:23,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:24:23,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 171 transitions. [2018-11-18 10:24:23,510 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 10:24:23,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 116 states and 153 transitions. [2018-11-18 10:24:23,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2018-11-18 10:24:23,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2018-11-18 10:24:23,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 153 transitions. [2018-11-18 10:24:23,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:24:23,513 INFO L705 BuchiCegarLoop]: Abstraction has 116 states and 153 transitions. [2018-11-18 10:24:23,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 153 transitions. [2018-11-18 10:24:23,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2018-11-18 10:24:23,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-18 10:24:23,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 141 transitions. [2018-11-18 10:24:23,523 INFO L728 BuchiCegarLoop]: Abstraction has 110 states and 141 transitions. [2018-11-18 10:24:23,523 INFO L608 BuchiCegarLoop]: Abstraction has 110 states and 141 transitions. [2018-11-18 10:24:23,523 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 10:24:23,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 141 transitions. [2018-11-18 10:24:23,525 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 10:24:23,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:24:23,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:24:23,525 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:24:23,525 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:24:23,525 INFO L794 eck$LassoCheckResult]: Stem: 484#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 478#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 479#L28-4 assume true; 504#L28-1 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 532#L28-2 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 533#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 557#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 561#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 559#recFINAL assume true; 556#recEXIT >#40#return; 555#L33-1 assume !(main_#t~ret11 <= -1);main_#t~ite12 := 1; 554#L33-3 [2018-11-18 10:24:23,525 INFO L796 eck$LassoCheckResult]: Loop: 554#L33-3 call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret11;havoc main_#t~ite12;havoc main_#t~mem13; 553#L28-4 assume true; 552#L28-1 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 551#L28-2 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 528#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 550#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 546#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 547#recFINAL assume true; 527#recEXIT >#40#return; 529#L33-1 assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 554#L33-3 [2018-11-18 10:24:23,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:24:23,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1828183936, now seen corresponding path program 1 times [2018-11-18 10:24:23,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:24:23,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:24:23,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:24:23,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:24:23,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:24:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:24:23,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:24:23,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:24:23,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:24:23,588 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:24:23,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:24:23,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1954069541, now seen corresponding path program 2 times [2018-11-18 10:24:23,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:24:23,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:24:23,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:24:23,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:24:23,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:24:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:24:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:24:23,822 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2018-11-18 10:24:23,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:24:23,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:24:23,868 INFO L87 Difference]: Start difference. First operand 110 states and 141 transitions. cyclomatic complexity: 41 Second operand 5 states. [2018-11-18 10:24:23,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:24:23,886 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2018-11-18 10:24:23,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:24:23,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 128 transitions. [2018-11-18 10:24:23,889 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-18 10:24:23,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 97 states and 122 transitions. [2018-11-18 10:24:23,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-11-18 10:24:23,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-11-18 10:24:23,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 122 transitions. [2018-11-18 10:24:23,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:24:23,890 INFO L705 BuchiCegarLoop]: Abstraction has 97 states and 122 transitions. [2018-11-18 10:24:23,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 122 transitions. [2018-11-18 10:24:23,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-11-18 10:24:23,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-18 10:24:23,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 120 transitions. [2018-11-18 10:24:23,896 INFO L728 BuchiCegarLoop]: Abstraction has 95 states and 120 transitions. [2018-11-18 10:24:23,896 INFO L608 BuchiCegarLoop]: Abstraction has 95 states and 120 transitions. [2018-11-18 10:24:23,896 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 10:24:23,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 120 transitions. [2018-11-18 10:24:23,897 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 10:24:23,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:24:23,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:24:23,900 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:24:23,900 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:24:23,901 INFO L794 eck$LassoCheckResult]: Stem: 707#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 700#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 701#L28-4 assume true; 740#L28-1 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 739#L28-2 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 736#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 738#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 737#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 705#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 734#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 735#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 774#recFINAL assume true; 770#recEXIT >#38#return; 767#L19-1 #res := #t~ret5;havoc #t~ret5; 765#recFINAL assume true; 761#recEXIT >#40#return; 708#L33-1 assume !(main_#t~ret11 <= -1);main_#t~ite12 := 1; 696#L33-3 [2018-11-18 10:24:23,901 INFO L796 eck$LassoCheckResult]: Loop: 696#L33-3 call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret11;havoc main_#t~ite12;havoc main_#t~mem13; 697#L28-4 assume true; 728#L28-1 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 775#L28-2 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 718#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 719#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 768#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 724#recFINAL assume true; 726#recEXIT >#40#return; 759#L33-1 assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 696#L33-3 [2018-11-18 10:24:23,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:24:23,901 INFO L82 PathProgramCache]: Analyzing trace with hash -905419584, now seen corresponding path program 1 times [2018-11-18 10:24:23,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:24:23,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:24:23,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:24:23,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:24:23,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:24:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:24:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:24:23,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:24:23,958 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78018999-6e03-4597-bded-ccdf5de8e6a7/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-18 10:24:23,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:24:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:24:24,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:24:24,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 13 [2018-11-18 10:24:24,023 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-18 10:24:24,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:24:24,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:24:24,027 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-18 10:24:24,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-18 10:24:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 10:24:24,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:24:24,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2018-11-18 10:24:24,045 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:24:24,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:24:24,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1954069541, now seen corresponding path program 3 times [2018-11-18 10:24:24,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:24:24,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:24:24,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:24:24,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:24:24,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:24:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:24:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:24:24,272 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2018-11-18 10:24:24,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 10:24:24,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:24:24,300 INFO L87 Difference]: Start difference. First operand 95 states and 120 transitions. cyclomatic complexity: 33 Second operand 9 states. [2018-11-18 10:24:24,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:24:24,342 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2018-11-18 10:24:24,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 10:24:24,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 100 transitions. [2018-11-18 10:24:24,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 10:24:24,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 55 states and 66 transitions. [2018-11-18 10:24:24,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 10:24:24,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 10:24:24,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 66 transitions. [2018-11-18 10:24:24,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:24:24,347 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 66 transitions. [2018-11-18 10:24:24,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 66 transitions. [2018-11-18 10:24:24,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-11-18 10:24:24,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-18 10:24:24,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2018-11-18 10:24:24,352 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2018-11-18 10:24:24,352 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2018-11-18 10:24:24,352 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 10:24:24,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 63 transitions. [2018-11-18 10:24:24,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 10:24:24,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:24:24,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:24:24,354 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:24:24,354 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:24:24,354 INFO L794 eck$LassoCheckResult]: Stem: 939#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 934#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 935#L28-4 assume true; 947#L28-1 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 954#L28-2 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 952#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 953#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 959#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 926#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 925#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 927#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 933#recFINAL assume true; 946#recEXIT >#38#return; 960#L19-1 #res := #t~ret5;havoc #t~ret5; 958#recFINAL assume true; 956#recEXIT >#40#return; 940#L33-1 assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 931#L33-3 call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret11;havoc main_#t~ite12;havoc main_#t~mem13; 932#L28-4 assume true; 929#L28-1 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 918#L28-2 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 919#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 922#recENTRY [2018-11-18 10:24:24,354 INFO L796 eck$LassoCheckResult]: Loop: 922#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 923#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 924#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 922#recENTRY [2018-11-18 10:24:24,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:24:24,354 INFO L82 PathProgramCache]: Analyzing trace with hash 627976083, now seen corresponding path program 1 times [2018-11-18 10:24:24,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:24:24,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:24:24,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:24:24,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:24:24,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:24:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:24:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:24:24,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:24:24,380 INFO L82 PathProgramCache]: Analyzing trace with hash 29952, now seen corresponding path program 2 times [2018-11-18 10:24:24,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:24:24,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:24:24,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:24:24,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:24:24,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:24:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:24:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:24:24,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:24:24,387 INFO L82 PathProgramCache]: Analyzing trace with hash -842052562, now seen corresponding path program 2 times [2018-11-18 10:24:24,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:24:24,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:24:24,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:24:24,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:24:24,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:24:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:24:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:24:24,775 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2018-11-18 10:24:25,586 WARN L180 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 178 [2018-11-18 10:24:25,763 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-11-18 10:24:25,918 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-11-18 10:24:26,009 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:24:26,009 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:24:26,009 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:24:26,009 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:24:26,009 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:24:26,009 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:24:26,009 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:24:26,009 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:24:26,009 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11B_true-termination.c.i_Iteration5_Lasso [2018-11-18 10:24:26,009 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:24:26,009 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:24:26,012 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-18 10:24:26,020 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-18 10:24:26,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:24:26,030 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-18 10:24:26,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:24:26,034 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-18 10:24:26,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:24:26,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:24:26,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:24:26,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:24:26,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:24:26,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:24:26,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:24:26,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:24:26,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:24:26,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:24:26,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:24:26,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:24:26,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:24:26,156 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-18 10:24:26,157 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-18 10:24:26,158 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-18 10:24:26,160 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-18 10:24:26,161 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-18 10:24:26,162 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-18 10:24:26,163 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-18 10:24:26,163 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-18 10:24:26,164 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-18 10:24:26,165 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-18 10:24:26,166 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-18 10:24:26,166 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-18 10:24:26,167 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-18 10:24:26,168 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-18 10:24:26,326 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:24:26,326 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:24:26,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:26,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:26,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:26,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:26,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:26,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:26,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:26,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:26,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:26,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:26,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:26,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:26,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:26,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:26,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:26,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:26,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:26,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:26,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:26,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:26,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:26,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:26,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:26,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:26,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:26,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:26,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:26,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:26,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:26,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:26,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:26,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:26,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:26,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:26,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:26,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:26,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:26,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:26,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:26,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:26,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:26,338 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:24:26,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:24:26,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:26,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:26,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:26,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:26,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:26,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:26,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:26,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:26,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:26,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:26,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:26,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:26,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:26,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:26,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:26,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:26,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:26,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:26,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:26,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:26,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:26,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:26,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:26,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:26,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:26,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:26,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:26,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:26,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:26,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:26,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:26,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:26,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:26,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:26,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:26,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:26,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:26,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:26,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:26,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:26,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:26,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:26,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:26,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:26,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:26,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:26,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:26,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:26,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:26,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:26,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:26,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:26,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:26,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:26,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:26,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:26,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:26,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:26,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:26,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:26,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:24:26,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:24:26,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:26,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:26,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:26,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:26,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:26,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:26,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:26,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:26,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:26,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:26,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:26,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:26,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:26,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:26,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:26,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:26,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:26,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:26,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:26,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:26,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:26,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:24:26,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:26,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:26,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:26,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:24:26,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:24:26,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:26,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:26,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:26,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:26,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:26,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:26,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:24:26,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:24:26,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:26,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:26,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:26,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:26,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:26,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:26,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:24:26,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:24:26,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:26,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:26,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:26,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:26,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:26,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:26,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:24:26,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:24:26,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:26,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:24:26,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:26,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:26,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:26,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:26,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:24:26,370 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:24:26,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:26,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:26,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:26,372 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:24:26,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:26,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:26,372 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:24:26,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:24:26,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:26,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:26,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:26,382 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:24:26,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:26,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:26,383 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:24:26,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:24:26,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:26,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:24:26,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:26,385 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:24:26,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:26,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:26,385 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:24:26,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:24:26,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:26,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:26,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:26,388 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:24:26,388 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:24:26,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:26,389 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-18 10:24:26,389 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 10:24:26,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:26,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:26,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:26,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:26,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:26,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:26,398 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:24:26,399 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:24:26,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:24:26,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 10:24:26,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:24:26,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:24:26,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:24:26,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:24:26,414 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:24:26,414 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:24:26,417 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:24:26,420 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 10:24:26,421 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 10:24:26,421 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:24:26,421 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:24:26,422 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:24:26,422 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2 + 1 Supporting invariants [] [2018-11-18 10:24:26,427 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-18 10:24:26,428 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 10:24:26,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:24:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:24:26,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:24:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:24:26,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:24:26,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-18 10:24:26,530 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 37 treesize of output 36 [2018-11-18 10:24:26,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:24:26,548 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:24:26,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-18 10:24:26,553 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 10:24:26,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 10:24:26,574 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 2 xjuncts. [2018-11-18 10:24:26,574 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-18 10:24:26,589 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-18 10:24:26,589 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 10:24:26,589 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-11-18 10:24:26,627 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 82 states and 100 transitions. Complement of second has 16 states. [2018-11-18 10:24:26,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 10:24:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:24:26,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-11-18 10:24:26,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-18 10:24:26,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:24:26,627 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:24:26,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:24:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:24:26,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:24:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:24:26,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:24:26,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-18 10:24:26,719 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 37 treesize of output 36 [2018-11-18 10:24:26,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:24:26,736 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:24:26,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-18 10:24:26,741 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 10:24:26,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 10:24:26,762 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 2 xjuncts. [2018-11-18 10:24:26,763 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-18 10:24:26,776 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-18 10:24:26,776 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 10:24:26,776 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-11-18 10:24:26,814 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 82 states and 100 transitions. Complement of second has 16 states. [2018-11-18 10:24:26,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 10:24:26,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:24:26,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-11-18 10:24:26,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-18 10:24:26,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:24:26,815 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:24:26,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:24:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:24:26,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:24:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:24:26,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:24:26,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-18 10:24:26,894 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:24:26,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-18 10:24:26,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 10:24:26,942 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 33 treesize of output 32 [2018-11-18 10:24:26,942 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 10:24:26,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 10:24:26,966 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 2 xjuncts. [2018-11-18 10:24:26,966 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-18 10:24:26,992 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-18 10:24:26,992 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 10:24:26,992 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-11-18 10:24:27,044 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 79 states and 91 transitions. Complement of second has 17 states. [2018-11-18 10:24:27,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 10:24:27,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:24:27,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-18 10:24:27,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-18 10:24:27,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:24:27,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 25 letters. Loop has 3 letters. [2018-11-18 10:24:27,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:24:27,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 6 letters. [2018-11-18 10:24:27,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:24:27,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 91 transitions. [2018-11-18 10:24:27,049 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 10:24:27,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 0 states and 0 transitions. [2018-11-18 10:24:27,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 10:24:27,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 10:24:27,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 10:24:27,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:24:27,049 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:24:27,049 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:24:27,049 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:24:27,049 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 10:24:27,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 10:24:27,050 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 10:24:27,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 10:24:27,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 10:24:27 BoogieIcfgContainer [2018-11-18 10:24:27,055 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 10:24:27,055 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:24:27,055 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:24:27,056 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:24:27,056 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:24:20" (3/4) ... [2018-11-18 10:24:27,059 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 10:24:27,059 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:24:27,059 INFO L168 Benchmark]: Toolchain (without parser) took 7049.01 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 221.2 MB). Free memory was 961.9 MB in the beginning and 1.2 GB in the end (delta: -238.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:24:27,060 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:24:27,060 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.09 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 10:24:27,061 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.22 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:24:27,061 INFO L168 Benchmark]: Boogie Preprocessor took 46.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -187.8 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-18 10:24:27,061 INFO L168 Benchmark]: RCFGBuilder took 167.93 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-18 10:24:27,062 INFO L168 Benchmark]: BuchiAutomizer took 6654.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 84.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -83.6 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:24:27,062 INFO L168 Benchmark]: Witness Printer took 3.46 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:24:27,064 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 152.09 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.22 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -187.8 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 167.93 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6654.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 84.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -83.6 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.46 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[qq][qq] and consists of 9 locations. One deterministic module has affine ranking function 2 * \old(unknown-#memory_int-unknown)[op][0] + 3 and consists of 6 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.6s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.2s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 110 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 86 SDtfs, 64 SDslu, 151 SDs, 0 SdLazy, 215 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital357 mio100 ax100 hnf100 lsp97 ukn42 mio100 lsp29 div100 bol100 ite100 ukn100 eq176 hnf89 smp95 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 1 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...