./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11D_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_4ad89128-7304-46ab-84f7-911ef2716e64/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4ad89128-7304-46ab-84f7-911ef2716e64/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4ad89128-7304-46ab-84f7-911ef2716e64/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4ad89128-7304-46ab-84f7-911ef2716e64/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11D_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4ad89128-7304-46ab-84f7-911ef2716e64/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4ad89128-7304-46ab-84f7-911ef2716e64/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 570a3560ecb7b29b974852ea58d8cc903e7c487d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 13:55:39,345 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:55:39,347 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:55:39,354 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:55:39,354 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:55:39,354 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:55:39,355 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:55:39,356 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:55:39,357 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:55:39,358 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:55:39,358 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:55:39,359 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:55:39,359 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:55:39,360 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:55:39,360 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:55:39,361 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:55:39,361 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:55:39,362 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:55:39,363 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:55:39,364 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:55:39,364 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:55:39,365 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:55:39,366 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:55:39,366 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:55:39,366 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:55:39,367 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:55:39,367 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:55:39,368 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:55:39,368 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:55:39,369 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:55:39,369 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:55:39,370 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:55:39,370 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:55:39,370 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:55:39,371 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:55:39,371 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:55:39,372 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4ad89128-7304-46ab-84f7-911ef2716e64/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 13:55:39,383 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:55:39,383 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:55:39,384 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 13:55:39,384 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 13:55:39,384 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 13:55:39,384 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 13:55:39,384 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 13:55:39,384 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 13:55:39,384 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 13:55:39,385 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 13:55:39,385 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 13:55:39,385 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:55:39,385 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 13:55:39,385 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:55:39,385 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:55:39,385 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 13:55:39,386 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 13:55:39,386 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 13:55:39,386 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:55:39,386 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 13:55:39,386 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:55:39,386 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 13:55:39,386 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:55:39,386 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:55:39,387 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 13:55:39,387 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:55:39,387 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 13:55:39,387 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 13:55:39,388 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 13:55:39,388 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_4ad89128-7304-46ab-84f7-911ef2716e64/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 -> 570a3560ecb7b29b974852ea58d8cc903e7c487d [2018-11-18 13:55:39,410 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:55:39,419 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:55:39,426 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:55:39,427 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:55:39,428 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:55:39,428 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4ad89128-7304-46ab-84f7-911ef2716e64/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11D_true-termination.c.i [2018-11-18 13:55:39,467 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4ad89128-7304-46ab-84f7-911ef2716e64/bin-2019/uautomizer/data/8a176483b/9d7e03b09f184aeaa2b128e46b006ad1/FLAG4ce1db49f [2018-11-18 13:55:39,863 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:55:39,863 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4ad89128-7304-46ab-84f7-911ef2716e64/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11D_true-termination.c.i [2018-11-18 13:55:39,867 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4ad89128-7304-46ab-84f7-911ef2716e64/bin-2019/uautomizer/data/8a176483b/9d7e03b09f184aeaa2b128e46b006ad1/FLAG4ce1db49f [2018-11-18 13:55:39,875 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4ad89128-7304-46ab-84f7-911ef2716e64/bin-2019/uautomizer/data/8a176483b/9d7e03b09f184aeaa2b128e46b006ad1 [2018-11-18 13:55:39,878 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:55:39,879 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:55:39,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:55:39,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:55:39,883 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:55:39,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:55:39" (1/1) ... [2018-11-18 13:55:39,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e2923f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:55:39, skipping insertion in model container [2018-11-18 13:55:39,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:55:39" (1/1) ... [2018-11-18 13:55:39,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:55:39,907 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:55:40,030 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:55:40,038 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:55:40,053 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:55:40,065 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:55:40,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:55:40 WrapperNode [2018-11-18 13:55:40,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:55:40,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:55:40,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:55:40,066 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:55:40,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:55:40" (1/1) ... [2018-11-18 13:55:40,080 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:55:40" (1/1) ... [2018-11-18 13:55:40,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:55:40,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:55:40,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:55:40,094 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:55:40,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:55:40" (1/1) ... [2018-11-18 13:55:40,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:55:40" (1/1) ... [2018-11-18 13:55:40,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:55:40" (1/1) ... [2018-11-18 13:55:40,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:55:40" (1/1) ... [2018-11-18 13:55:40,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:55:40" (1/1) ... [2018-11-18 13:55:40,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:55:40" (1/1) ... [2018-11-18 13:55:40,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:55:40" (1/1) ... [2018-11-18 13:55:40,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:55:40,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:55:40,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:55:40,145 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:55:40,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:55:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ad89128-7304-46ab-84f7-911ef2716e64/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 13:55:40,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 13:55:40,187 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2018-11-18 13:55:40,187 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2018-11-18 13:55:40,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 13:55:40,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:55:40,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:55:40,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 13:55:40,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 13:55:40,309 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:55:40,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:55:40 BoogieIcfgContainer [2018-11-18 13:55:40,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:55:40,310 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 13:55:40,310 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 13:55:40,313 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 13:55:40,313 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:55:40,313 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 01:55:39" (1/3) ... [2018-11-18 13:55:40,314 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48e4c9f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:55:40, skipping insertion in model container [2018-11-18 13:55:40,314 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:55:40,314 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:55:40" (2/3) ... [2018-11-18 13:55:40,315 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48e4c9f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:55:40, skipping insertion in model container [2018-11-18 13:55:40,315 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:55:40,315 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:55:40" (3/3) ... [2018-11-18 13:55:40,316 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11D_true-termination.c.i [2018-11-18 13:55:40,355 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 13:55:40,355 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 13:55:40,355 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 13:55:40,355 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 13:55:40,355 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:55:40,356 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:55:40,356 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 13:55:40,356 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:55:40,356 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 13:55:40,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 13:55:40,385 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 13:55:40,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:55:40,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:55:40,390 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 13:55:40,390 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:55:40,390 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 13:55:40,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 13:55:40,392 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 13:55:40,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:55:40,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:55:40,393 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 13:55:40,393 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:55:40,399 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, 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; 3#L30-4true [2018-11-18 13:55:40,400 INFO L796 eck$LassoCheckResult]: Loop: 3#L30-4true assume true; 10#L30-1true call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 8#L30-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~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 17#L34true assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 7#L38true call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 6#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 13#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;#res := ~r~0; 18#recFINALtrue assume true; 15#recEXITtrue >#45#return; 5#L38-1true assume !(-1 == main_#t~ret12);main_#t~ite13 := 1; 20#L38-3true call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem14;havoc main_#t~ite13; 3#L30-4true [2018-11-18 13:55:40,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:55:40,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2018-11-18 13:55:40,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:55:40,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:55:40,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:55:40,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:55:40,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:55:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:55:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:55:40,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:55:40,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1057388751, now seen corresponding path program 1 times [2018-11-18 13:55:40,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:55:40,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:55:40,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:55:40,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:55:40,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:55:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:55:40,602 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 13:55:40,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:55:40,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 13:55:40,606 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:55:40,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 13:55:40,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:55:40,618 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 7 states. [2018-11-18 13:55:40,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:55:40,700 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-11-18 13:55:40,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 13:55:40,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2018-11-18 13:55:40,707 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 13:55:40,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 20 transitions. [2018-11-18 13:55:40,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-18 13:55:40,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-18 13:55:40,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2018-11-18 13:55:40,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:55:40,717 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-18 13:55:40,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2018-11-18 13:55:40,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-18 13:55:40,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 13:55:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-18 13:55:40,747 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-18 13:55:40,747 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-18 13:55:40,747 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 13:55:40,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-11-18 13:55:40,748 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 13:55:40,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:55:40,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:55:40,749 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 13:55:40,749 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:55:40,749 INFO L794 eck$LassoCheckResult]: Stem: 67#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 65#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~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, 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; 53#L30-4 [2018-11-18 13:55:40,750 INFO L796 eck$LassoCheckResult]: Loop: 53#L30-4 assume true; 54#L30-1 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 61#L30-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~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 62#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 56#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 55#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 58#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; 57#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 55#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 58#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;#res := ~r~0; 66#recFINAL assume true; 68#recEXIT >#43#return; 63#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; 64#recFINAL assume true; 69#recEXIT >#45#return; 59#L38-1 assume !(-1 == main_#t~ret12);main_#t~ite13 := 1; 60#L38-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem14;havoc main_#t~ite13; 53#L30-4 [2018-11-18 13:55:40,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:55:40,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2018-11-18 13:55:40,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:55:40,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:55:40,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:55:40,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:55:40,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:55:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:55:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:55:40,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:55:40,762 INFO L82 PathProgramCache]: Analyzing trace with hash -263422331, now seen corresponding path program 1 times [2018-11-18 13:55:40,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:55:40,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:55:40,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:55:40,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:55:40,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:55:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:55:40,906 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 13:55:40,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:55:40,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ad89128-7304-46ab-84f7-911ef2716e64/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 13:55:40,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:55:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:55:40,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:55:41,007 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 25 treesize of output 35 [2018-11-18 13:55:41,014 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:55:41,020 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 21 treesize of output 33 [2018-11-18 13:55:41,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 13:55:41,046 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 22 treesize of output 21 [2018-11-18 13:55:41,047 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:55:41,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:55:41,092 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 13:55:41,092 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:25, output treesize:31 [2018-11-18 13:55:41,153 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 13:55:41,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:55:41,158 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 13:55:41,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-18 13:55:41,164 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:55:41,166 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:55:41,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:55:41,167 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:51, output treesize:5 [2018-11-18 13:55:41,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:55:41,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:55:41,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-11-18 13:55:41,208 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:55:41,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 13:55:41,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-18 13:55:41,209 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 12 states. [2018-11-18 13:55:41,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:55:41,321 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-11-18 13:55:41,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 13:55:41,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2018-11-18 13:55:41,323 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 13:55:41,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2018-11-18 13:55:41,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-18 13:55:41,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-18 13:55:41,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-11-18 13:55:41,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:55:41,325 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-18 13:55:41,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-11-18 13:55:41,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-11-18 13:55:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 13:55:41,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-18 13:55:41,327 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-18 13:55:41,327 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-18 13:55:41,327 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 13:55:41,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-11-18 13:55:41,328 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 13:55:41,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:55:41,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:55:41,328 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 13:55:41,328 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:55:41,328 INFO L794 eck$LassoCheckResult]: Stem: 171#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 169#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~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, 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; 157#L30-4 [2018-11-18 13:55:41,328 INFO L796 eck$LassoCheckResult]: Loop: 157#L30-4 assume true; 158#L30-1 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 165#L30-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~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 166#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 160#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 159#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 162#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; 161#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 159#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 162#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;#res := ~r~0; 170#recFINAL assume true; 172#recEXIT >#43#return; 167#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; 168#recFINAL assume true; 173#recEXIT >#45#return; 163#L38-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 164#L38-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem14;havoc main_#t~ite13; 157#L30-4 [2018-11-18 13:55:41,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:55:41,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 3 times [2018-11-18 13:55:41,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:55:41,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:55:41,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:55:41,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:55:41,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:55:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:55:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:55:41,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:55:41,335 INFO L82 PathProgramCache]: Analyzing trace with hash -263422393, now seen corresponding path program 1 times [2018-11-18 13:55:41,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:55:41,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:55:41,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:55:41,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:55:41,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:55:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:55:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:55:41,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:55:41,378 INFO L82 PathProgramCache]: Analyzing trace with hash 778196421, now seen corresponding path program 1 times [2018-11-18 13:55:41,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:55:41,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:55:41,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:55:41,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:55:41,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:55:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:55:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:55:41,680 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2018-11-18 13:55:42,099 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2018-11-18 13:55:42,259 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:55:42,260 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:55:42,260 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:55:42,260 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:55:42,260 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:55:42,260 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:55:42,261 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:55:42,261 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:55:42,261 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11D_true-termination.c.i_Iteration3_Lasso [2018-11-18 13:55:42,261 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:55:42,261 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:55:42,273 INFO 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 13:55:42,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:55:42,279 INFO 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 13:55:42,280 INFO 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 13:55:42,423 INFO 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 13:55:42,424 INFO 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 13:55:42,426 INFO 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 13:55:42,427 INFO 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 13:55:42,429 INFO 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 13:55:42,431 INFO 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 13:55:42,432 INFO 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 13:55:42,572 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:55:42,575 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:55:42,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:55:42,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:42,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:42,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:42,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:42,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:42,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:42,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:42,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:42,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:42,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:42,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:42,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:42,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:42,583 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:55:42,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:55:42,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:42,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:42,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:42,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:42,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:42,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:42,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:42,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:42,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:42,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:42,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:42,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:42,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:42,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:42,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:42,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:55:42,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:55:42,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:42,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:42,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:42,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:42,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:42,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:42,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:55:42,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:55:42,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:42,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:42,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:42,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:42,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:42,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:42,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:42,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:42,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:42,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:42,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:42,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:42,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:42,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:42,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:42,620 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:55:42,620 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:55:42,631 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:55:42,637 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:55:42,637 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 13:55:42,639 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:55:42,640 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 13:55:42,640 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:55:42,641 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 13:55:42,649 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 13:55:42,654 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 13:55:42,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:55:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:55:42,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:55:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:55:42,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:55:42,704 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:55:42,704 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:55:42,705 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 13:55:42,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:55:42,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-11-18 13:55:42,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:55:42,717 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:55:42,724 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:55:42,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:55:42,728 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:36, output treesize:15 [2018-11-18 13:55:42,741 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 22 treesize of output 16 [2018-11-18 13:55:42,743 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 13:55:42,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:55:42,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:55:42,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:55:42,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2018-11-18 13:55:42,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 13:55:42,781 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-18 13:55:42,781 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 8 states. [2018-11-18 13:55:42,852 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand 8 states. Result 48 states and 55 transitions. Complement of second has 18 states. [2018-11-18 13:55:42,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-18 13:55:42,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 13:55:42,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 17 transitions. [2018-11-18 13:55:42,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 17 transitions. Stem has 2 letters. Loop has 17 letters. [2018-11-18 13:55:42,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:55:42,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 17 transitions. Stem has 19 letters. Loop has 17 letters. [2018-11-18 13:55:42,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:55:42,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 17 transitions. Stem has 2 letters. Loop has 34 letters. [2018-11-18 13:55:42,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:55:42,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 55 transitions. [2018-11-18 13:55:42,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 13:55:42,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 34 states and 39 transitions. [2018-11-18 13:55:42,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 13:55:42,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 13:55:42,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 39 transitions. [2018-11-18 13:55:42,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:55:42,861 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-18 13:55:42,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 39 transitions. [2018-11-18 13:55:42,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2018-11-18 13:55:42,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 13:55:42,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-18 13:55:42,863 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-18 13:55:42,863 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-18 13:55:42,863 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 13:55:42,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2018-11-18 13:55:42,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 13:55:42,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:55:42,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:55:42,864 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:55:42,864 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 13:55:42,864 INFO L794 eck$LassoCheckResult]: Stem: 359#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 358#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~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, 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; 336#L30-4 assume true; 338#L30-1 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 352#L30-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~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 353#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 345#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 342#recENTRY [2018-11-18 13:55:42,864 INFO L796 eck$LassoCheckResult]: Loop: 342#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 344#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; 343#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 342#recENTRY [2018-11-18 13:55:42,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:55:42,866 INFO L82 PathProgramCache]: Analyzing trace with hash 552623682, now seen corresponding path program 1 times [2018-11-18 13:55:42,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:55:42,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:55:42,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:55:42,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:55:42,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:55:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:55:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:55:42,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:55:42,879 INFO L82 PathProgramCache]: Analyzing trace with hash 29957, now seen corresponding path program 1 times [2018-11-18 13:55:42,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:55:42,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:55:42,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:55:42,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:55:42,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:55:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:55:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:55:42,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:55:42,889 INFO L82 PathProgramCache]: Analyzing trace with hash 602465060, now seen corresponding path program 1 times [2018-11-18 13:55:42,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:55:42,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:55:42,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:55:42,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:55:42,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:55:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:55:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:55:43,173 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-11-18 13:55:43,299 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:55:43,300 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:55:43,300 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:55:43,300 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:55:43,300 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:55:43,300 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:55:43,300 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:55:43,300 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:55:43,300 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11D_true-termination.c.i_Iteration4_Lasso [2018-11-18 13:55:43,300 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:55:43,300 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:55:43,303 INFO 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 13:55:43,304 INFO 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 13:55:43,305 INFO 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 13:55:43,306 INFO 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 13:55:43,307 INFO 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 13:55:43,308 INFO 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 13:55:43,309 INFO 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 13:55:43,310 INFO 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 13:55:43,311 INFO 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 13:55:43,312 INFO 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 13:55:43,313 INFO 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 13:55:43,314 INFO 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 13:55:43,328 INFO 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 13:55:43,329 INFO 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 13:55:43,330 INFO 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 13:55:43,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:55:43,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:55:43,342 INFO 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 13:55:43,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:55:43,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:55:43,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:55:43,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:55:43,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:55:43,350 INFO 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 13:55:43,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:55:43,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:55:43,354 INFO 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 13:55:43,355 INFO 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 13:55:43,356 INFO 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 13:55:43,357 INFO 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 13:55:43,358 INFO 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 13:55:43,360 INFO 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 13:55:43,422 INFO 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 13:55:43,423 INFO 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 13:55:43,424 INFO 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 13:55:43,609 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:55:43,609 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:55:43,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:55:43,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,619 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:55:43,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:55:43,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,628 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,648 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:55:43,648 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:55:43,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:43,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:43,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:43,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:43,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:55:43,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:55:43,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:43,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:55:43,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:43,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:43,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:43,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:43,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:55:43,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:55:43,687 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:55:43,690 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:55:43,690 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 13:55:43,690 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:55:43,691 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 13:55:43,691 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:55:43,692 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1 + 1 Supporting invariants [] [2018-11-18 13:55:43,700 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-18 13:55:43,705 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 13:55:43,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:55:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:55:43,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:55:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:55:43,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:55:43,798 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 13:55:43,812 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 13:55:43,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:55:43,835 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:55:43,839 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 13:55:43,841 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 13:55:43,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:55:43,861 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 13:55:43,861 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-18 13:55:43,876 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 13:55:43,876 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 13:55:43,876 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 33 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-18 13:55:43,922 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 33 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 61 states and 70 transitions. Complement of second has 14 states. [2018-11-18 13:55:43,923 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 13:55:43,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 13:55:43,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-18 13:55:43,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-18 13:55:43,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:55:43,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-18 13:55:43,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:55:43,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-18 13:55:43,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:55:43,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 70 transitions. [2018-11-18 13:55:43,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 13:55:43,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 42 states and 50 transitions. [2018-11-18 13:55:43,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-18 13:55:43,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-18 13:55:43,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 50 transitions. [2018-11-18 13:55:43,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:55:43,927 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-11-18 13:55:43,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 50 transitions. [2018-11-18 13:55:43,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-18 13:55:43,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 13:55:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-11-18 13:55:43,930 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-11-18 13:55:43,930 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-11-18 13:55:43,930 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 13:55:43,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 50 transitions. [2018-11-18 13:55:43,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 13:55:43,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:55:43,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:55:43,932 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:55:43,932 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 13:55:43,932 INFO L794 eck$LassoCheckResult]: Stem: 524#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 523#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~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, 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; 495#L30-4 assume true; 496#L30-1 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 514#L30-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~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 515#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 510#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 511#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 533#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; 517#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 518#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 521#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;#res := ~r~0; 522#recFINAL assume true; 525#recEXIT >#43#return; 526#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; 530#recFINAL assume true; 528#recEXIT >#45#return; 500#L38-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 501#L38-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem14;havoc main_#t~ite13; 497#L30-4 assume true; 499#L30-1 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 512#L30-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~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 513#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 503#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 502#recENTRY [2018-11-18 13:55:43,932 INFO L796 eck$LassoCheckResult]: Loop: 502#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 505#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; 504#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 502#recENTRY [2018-11-18 13:55:43,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:55:43,932 INFO L82 PathProgramCache]: Analyzing trace with hash -608018816, now seen corresponding path program 2 times [2018-11-18 13:55:43,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:55:43,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:55:43,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:55:43,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:55:43,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:55:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:55:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:55:43,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:55:43,967 INFO L82 PathProgramCache]: Analyzing trace with hash 29957, now seen corresponding path program 2 times [2018-11-18 13:55:43,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:55:43,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:55:43,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:55:43,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:55:43,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:55:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:55:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:55:43,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:55:43,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1611460058, now seen corresponding path program 3 times [2018-11-18 13:55:43,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:55:43,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:55:43,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:55:43,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:55:43,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:55:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:55:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:55:44,379 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-11-18 13:55:45,191 WARN L180 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 192 [2018-11-18 13:55:45,350 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-11-18 13:55:45,598 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2018-11-18 13:55:45,715 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2018-11-18 13:55:45,717 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:55:45,717 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:55:45,717 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:55:45,717 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:55:45,717 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:55:45,717 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:55:45,718 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:55:45,718 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:55:45,718 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11D_true-termination.c.i_Iteration5_Lasso [2018-11-18 13:55:45,718 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:55:45,718 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:55:45,721 INFO 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 13:55:45,723 INFO 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 13:55:45,724 INFO 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 13:55:45,725 INFO 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 13:55:45,726 INFO 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 13:55:45,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:55:45,728 INFO 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 13:55:45,729 INFO 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 13:55:45,730 INFO 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 13:55:45,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:55:45,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:55:45,827 INFO 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 13:55:45,828 INFO 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 13:55:45,829 INFO 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 13:55:45,830 INFO 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 13:55:45,832 INFO 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 13:55:45,833 INFO 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 13:55:45,834 INFO 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 13:55:45,835 INFO 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 13:55:45,836 INFO 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 13:55:45,837 INFO 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 13:55:45,838 INFO 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 13:55:45,839 INFO 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 13:55:45,840 INFO 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 13:55:45,841 INFO 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 13:55:45,842 INFO 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 13:55:45,843 INFO 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 13:55:45,844 INFO 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 13:55:45,844 INFO 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 13:55:45,845 INFO 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 13:55:45,846 INFO 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 13:55:45,847 INFO 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 13:55:45,848 INFO 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 13:55:45,849 INFO 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 13:55:45,850 INFO 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 13:55:45,987 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:55:45,987 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:55:45,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:45,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:45,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:45,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:45,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:45,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:45,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:45,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:45,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:45,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:45,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:45,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:45,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:45,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:45,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:45,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:45,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:45,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:45,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:45,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:45,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:45,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:45,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:45,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:45,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:45,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:45,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:45,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:45,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:45,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:45,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:45,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:45,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:45,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:45,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:45,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:45,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:45,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:45,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:45,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:45,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:45,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:45,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:45,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:45,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:45,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:45,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:45,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:45,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:45,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:45,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:45,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:45,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:45,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:45,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:45,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:45,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:45,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:45,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:45,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:46,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:46,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:46,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:46,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:46,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:46,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:46,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:46,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:46,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:46,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:46,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:46,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:46,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:46,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:46,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:55:46,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:46,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:46,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:46,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:55:46,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:55:46,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:46,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:46,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:46,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:46,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:46,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:46,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:55:46,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:55:46,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:46,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:46,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:46,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:46,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:46,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:46,007 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:55:46,007 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:55:46,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:46,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:46,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:46,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:46,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:46,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:46,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:55:46,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:55:46,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:55:46,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:55:46,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:55:46,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:55:46,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:55:46,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:55:46,016 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:55:46,016 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:55:46,021 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:55:46,023 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:55:46,023 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 13:55:46,023 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:55:46,024 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 13:55:46,024 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:55:46,024 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 13:55:46,044 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-18 13:55:46,046 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 13:55:46,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:55:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:55:46,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:55:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:55:46,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:55:46,140 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 13:55:46,144 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 13:55:46,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:55:46,165 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:55:46,170 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 13:55:46,171 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 13:55:46,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:55:46,194 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 13:55:46,195 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-18 13:55:46,209 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 13:55:46,209 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 13:55:46,209 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-18 13:55:46,255 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 49 states and 57 transitions. Complement of second has 14 states. [2018-11-18 13:55:46,256 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 13:55:46,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 13:55:46,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-18 13:55:46,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 24 letters. Loop has 3 letters. [2018-11-18 13:55:46,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:55:46,257 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 13:55:46,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:55:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:55:46,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:55:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:55:46,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:55:46,328 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 13:55:46,331 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 13:55:46,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:55:46,351 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:55:46,356 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 13:55:46,357 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 13:55:46,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:55:46,386 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 13:55:46,387 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-18 13:55:46,401 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 13:55:46,402 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 13:55:46,402 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-18 13:55:46,443 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 49 states and 57 transitions. Complement of second has 14 states. [2018-11-18 13:55:46,444 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 13:55:46,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 13:55:46,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-18 13:55:46,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 24 letters. Loop has 3 letters. [2018-11-18 13:55:46,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:55:46,445 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 13:55:46,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:55:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:55:46,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:55:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:55:46,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:55:46,524 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 13:55:46,527 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 13:55:46,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:55:46,553 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:55:46,558 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 13:55:46,559 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 13:55:46,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:55:46,588 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 13:55:46,589 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-18 13:55:46,604 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 13:55:46,604 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 13:55:46,604 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-18 13:55:46,652 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 64 states and 73 transitions. Complement of second has 15 states. [2018-11-18 13:55:46,652 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 13:55:46,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 13:55:46,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-11-18 13:55:46,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 24 letters. Loop has 3 letters. [2018-11-18 13:55:46,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:55:46,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 27 letters. Loop has 3 letters. [2018-11-18 13:55:46,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:55:46,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 24 letters. Loop has 6 letters. [2018-11-18 13:55:46,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:55:46,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 73 transitions. [2018-11-18 13:55:46,655 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:55:46,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 0 states and 0 transitions. [2018-11-18 13:55:46,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 13:55:46,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 13:55:46,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 13:55:46,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:55:46,656 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:55:46,656 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:55:46,656 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:55:46,656 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 13:55:46,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 13:55:46,656 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:55:46,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 13:55:46,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 01:55:46 BoogieIcfgContainer [2018-11-18 13:55:46,661 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 13:55:46,661 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:55:46,661 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:55:46,661 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:55:46,661 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:55:40" (3/4) ... [2018-11-18 13:55:46,664 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 13:55:46,664 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:55:46,664 INFO L168 Benchmark]: Toolchain (without parser) took 6786.06 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 326.1 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -152.3 MB). Peak memory consumption was 173.8 MB. Max. memory is 11.5 GB. [2018-11-18 13:55:46,665 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:55:46,665 INFO L168 Benchmark]: CACSL2BoogieTranslator took 185.51 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:55:46,665 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.76 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:55:46,666 INFO L168 Benchmark]: Boogie Preprocessor took 51.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -196.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:55:46,666 INFO L168 Benchmark]: RCFGBuilder took 164.88 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: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-18 13:55:46,666 INFO L168 Benchmark]: BuchiAutomizer took 6350.22 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 181.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.6 MB). Peak memory consumption was 194.0 MB. Max. memory is 11.5 GB. [2018-11-18 13:55:46,666 INFO L168 Benchmark]: Witness Printer took 3.06 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:55:46,668 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 185.51 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 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 27.76 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -196.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 164.88 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: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6350.22 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 181.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.6 MB). Peak memory consumption was 194.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.06 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 * unknown-#memory_int-unknown[op][op] + 1 and consists of 5 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 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 4.9s. Construction of modules took 0.2s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 42 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 85 SDtfs, 59 SDslu, 146 SDs, 0 SdLazy, 236 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital378 mio100 ax100 hnf100 lsp97 ukn39 mio100 lsp30 div100 bol100 ite100 ukn100 eq163 hnf90 smp96 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 3ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...