./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrpbrk-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_13b34db1-2a22-4f7e-aaaf-e92803809092/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_13b34db1-2a22-4f7e-aaaf-e92803809092/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_13b34db1-2a22-4f7e-aaaf-e92803809092/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_13b34db1-2a22-4f7e-aaaf-e92803809092/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrpbrk-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_13b34db1-2a22-4f7e-aaaf-e92803809092/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_13b34db1-2a22-4f7e-aaaf-e92803809092/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 c10d45b5c95e322c3a9476f6a89ce233987fcc3d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:11:28,481 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:11:28,482 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:11:28,491 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:11:28,491 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:11:28,492 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:11:28,493 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:11:28,494 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:11:28,496 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:11:28,497 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:11:28,497 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:11:28,498 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:11:28,498 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:11:28,500 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:11:28,501 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:11:28,501 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:11:28,502 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:11:28,504 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:11:28,505 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:11:28,506 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:11:28,507 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:11:28,508 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:11:28,510 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:11:28,510 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:11:28,510 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:11:28,512 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:11:28,512 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:11:28,513 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:11:28,514 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:11:28,514 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:11:28,515 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:11:28,516 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:11:28,516 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:11:28,516 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:11:28,517 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:11:28,517 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:11:28,518 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_13b34db1-2a22-4f7e-aaaf-e92803809092/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:11:28,530 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:11:28,530 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:11:28,532 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:11:28,532 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:11:28,533 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:11:28,533 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:11:28,533 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:11:28,533 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:11:28,533 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:11:28,533 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:11:28,533 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:11:28,534 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:11:28,534 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:11:28,534 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:11:28,534 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:11:28,534 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:11:28,534 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:11:28,534 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:11:28,535 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:11:28,535 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:11:28,535 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:11:28,535 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:11:28,535 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:11:28,535 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:11:28,535 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:11:28,536 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:11:28,536 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:11:28,536 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:11:28,537 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_13b34db1-2a22-4f7e-aaaf-e92803809092/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 -> c10d45b5c95e322c3a9476f6a89ce233987fcc3d [2018-10-27 06:11:28,574 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:11:28,588 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:11:28,591 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:11:28,592 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:11:28,592 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:11:28,593 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_13b34db1-2a22-4f7e-aaaf-e92803809092/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrpbrk-alloca_true-termination.c.i [2018-10-27 06:11:28,647 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_13b34db1-2a22-4f7e-aaaf-e92803809092/bin-2019/uautomizer/data/4681b0cac/f831189940894a3b8d295e2376ccac31/FLAG0e95c6d2b [2018-10-27 06:11:29,062 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:11:29,062 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_13b34db1-2a22-4f7e-aaaf-e92803809092/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrpbrk-alloca_true-termination.c.i [2018-10-27 06:11:29,076 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_13b34db1-2a22-4f7e-aaaf-e92803809092/bin-2019/uautomizer/data/4681b0cac/f831189940894a3b8d295e2376ccac31/FLAG0e95c6d2b [2018-10-27 06:11:29,088 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_13b34db1-2a22-4f7e-aaaf-e92803809092/bin-2019/uautomizer/data/4681b0cac/f831189940894a3b8d295e2376ccac31 [2018-10-27 06:11:29,093 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:11:29,094 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:11:29,095 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:29,095 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:11:29,098 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:11:29,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:29" (1/1) ... [2018-10-27 06:11:29,101 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f4e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:29, skipping insertion in model container [2018-10-27 06:11:29,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:29" (1/1) ... [2018-10-27 06:11:29,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:11:29,150 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:11:29,362 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:29,371 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:11:29,406 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:29,439 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:11:29,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:29 WrapperNode [2018-10-27 06:11:29,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:29,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:29,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:11:29,440 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:11:29,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:29" (1/1) ... [2018-10-27 06:11:29,459 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:29" (1/1) ... [2018-10-27 06:11:29,540 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:29,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:11:29,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:11:29,540 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:11:29,546 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:29" (1/1) ... [2018-10-27 06:11:29,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:29" (1/1) ... [2018-10-27 06:11:29,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:29" (1/1) ... [2018-10-27 06:11:29,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:29" (1/1) ... [2018-10-27 06:11:29,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:29" (1/1) ... [2018-10-27 06:11:29,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:29" (1/1) ... [2018-10-27 06:11:29,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:29" (1/1) ... [2018-10-27 06:11:29,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:11:29,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:11:29,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:11:29,580 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:11:29,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13b34db1-2a22-4f7e-aaaf-e92803809092/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-10-27 06:11:29,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:11:29,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:11:29,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:11:29,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:11:30,090 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:11:30,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:30 BoogieIcfgContainer [2018-10-27 06:11:30,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:11:30,091 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:11:30,091 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:11:30,095 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:11:30,096 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:30,096 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:11:29" (1/3) ... [2018-10-27 06:11:30,097 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@206ecc4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:11:30, skipping insertion in model container [2018-10-27 06:11:30,097 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:30,097 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:29" (2/3) ... [2018-10-27 06:11:30,097 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@206ecc4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:11:30, skipping insertion in model container [2018-10-27 06:11:30,097 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:30,098 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:30" (3/3) ... [2018-10-27 06:11:30,099 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca_true-termination.c.i [2018-10-27 06:11:30,147 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:11:30,148 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:11:30,148 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:11:30,148 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:11:30,148 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:11:30,148 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:11:30,148 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:11:30,148 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:11:30,149 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:11:30,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-10-27 06:11:30,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-10-27 06:11:30,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:30,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:30,191 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:30,191 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:11:30,191 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:11:30,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-10-27 06:11:30,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-10-27 06:11:30,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:30,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:30,193 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:30,194 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:11:30,201 INFO L793 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 15#L562true assume !(main_~length1~0 < 1); 22#L562-2true assume !(main_~length2~0 < 1); 11#L565-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 25#L570true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L570 5#L570-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L570-1 21#L571true assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 6#L553-6true [2018-10-27 06:11:30,201 INFO L795 eck$LassoCheckResult]: Loop: 6#L553-6true assume true; 16#L552-1true cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 19#L552-2true SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L552-2 24#L552-3true cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 3#L552-4true assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 4#L553-5true assume !true; 6#L553-6true [2018-10-27 06:11:30,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:30,207 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-10-27 06:11:30,209 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:30,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:30,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:30,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:30,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:30,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:30,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1540280279, now seen corresponding path program 1 times [2018-10-27 06:11:30,356 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:30,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:30,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:30,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:30,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:30,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:30,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:30,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-27 06:11:30,397 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:11:30,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 06:11:30,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 06:11:30,408 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-10-27 06:11:30,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:30,414 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-10-27 06:11:30,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 06:11:30,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 27 transitions. [2018-10-27 06:11:30,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-10-27 06:11:30,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 18 states and 21 transitions. [2018-10-27 06:11:30,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-10-27 06:11:30,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-10-27 06:11:30,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-10-27 06:11:30,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:11:30,424 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-10-27 06:11:30,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-10-27 06:11:30,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-27 06:11:30,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-27 06:11:30,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-10-27 06:11:30,444 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-10-27 06:11:30,444 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-10-27 06:11:30,445 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:11:30,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2018-10-27 06:11:30,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-10-27 06:11:30,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:30,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:30,446 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:30,446 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:30,446 INFO L793 eck$LassoCheckResult]: Stem: 66#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 62#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 63#L562 assume !(main_~length1~0 < 1); 68#L562-2 assume !(main_~length2~0 < 1); 64#L565-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 65#L570 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L570 57#L570-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L570-1 58#L571 assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 59#L553-6 [2018-10-27 06:11:30,447 INFO L795 eck$LassoCheckResult]: Loop: 59#L553-6 assume true; 60#L552-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 69#L552-2 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L552-2 71#L552-3 cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 54#L552-4 assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 55#L553-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 56#L553-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L553-1 67#L553-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 70#L553-3 assume !(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 59#L553-6 [2018-10-27 06:11:30,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:30,447 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 2 times [2018-10-27 06:11:30,447 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:30,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:30,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:30,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:30,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:30,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:30,483 INFO L82 PathProgramCache]: Analyzing trace with hash -941209857, now seen corresponding path program 1 times [2018-10-27 06:11:30,483 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:30,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:30,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:30,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:30,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:30,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:30,502 INFO L82 PathProgramCache]: Analyzing trace with hash -843635947, now seen corresponding path program 1 times [2018-10-27 06:11:30,502 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:30,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:30,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:30,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:30,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:30,813 WARN L179 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-27 06:11:31,546 WARN L179 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-10-27 06:11:31,648 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2018-10-27 06:11:31,660 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:31,661 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:31,661 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:31,661 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:31,661 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:11:31,661 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:31,661 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:31,661 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:31,662 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-termination.c.i_Iteration2_Lasso [2018-10-27 06:11:31,662 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:31,662 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:31,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:31,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:31,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:31,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:31,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:31,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:31,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:31,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-10-27 06:11:31,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-10-27 06:11:31,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:31,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:31,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:32,272 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2018-10-27 06:11:32,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:32,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:32,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:32,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:32,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:32,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:32,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:32,607 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-10-27 06:11:32,964 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:32,969 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:11:32,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:32,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:32,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:32,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:32,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:32,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:32,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:32,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:32,976 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:32,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:32,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:32,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:32,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:32,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:32,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:32,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:32,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:32,980 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:32,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:32,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:32,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:32,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:32,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:32,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:32,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:32,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:32,982 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:32,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:32,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:32,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:32,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:32,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:32,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:32,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:32,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:32,987 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:32,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:32,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:32,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:32,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:32,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:32,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:32,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:32,992 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:32,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:32,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:32,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:32,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:32,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:32,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:32,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:32,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:32,994 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:32,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:32,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:32,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:32,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:32,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:32,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:32,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:32,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:32,997 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:32,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-10-27 06:11:32,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:32,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:32,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:32,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:33,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:33,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:33,010 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:33,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-10-27 06:11:33,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:33,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:33,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:33,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:33,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:33,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:33,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:33,013 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:33,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:33,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:33,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:33,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:33,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:33,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:33,019 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:33,022 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:33,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:33,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:33,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:33,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:33,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:33,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:33,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:33,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:33,026 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:33,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:33,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:33,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:33,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:33,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:33,031 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:33,031 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:33,034 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:33,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:33,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:33,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:33,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:33,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:33,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:33,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:33,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:33,040 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:33,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:33,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:33,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:33,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:33,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:33,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:33,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:33,111 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:11:33,139 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:11:33,139 INFO L444 ModelExtractionUtils]: 51 out of 55 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:11:33,141 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:11:33,142 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:11:33,143 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:11:33,144 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1, ULTIMATE.start_cstrpbrk_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 - 1*ULTIMATE.start_cstrpbrk_~s1.offset Supporting invariants [] [2018-10-27 06:11:33,217 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-10-27 06:11:33,223 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:11:33,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:33,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:33,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:33,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:33,481 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-10-27 06:11:33,481 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-10-27 06:11:33,564 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 29 states and 34 transitions. Complement of second has 7 states. [2018-10-27 06:11:33,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:33,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:11:33,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-10-27 06:11:33,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 8 letters. Loop has 9 letters. [2018-10-27 06:11:33,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:33,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 17 letters. Loop has 9 letters. [2018-10-27 06:11:33,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:33,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 8 letters. Loop has 18 letters. [2018-10-27 06:11:33,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:33,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2018-10-27 06:11:33,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:11:33,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 29 transitions. [2018-10-27 06:11:33,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-10-27 06:11:33,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-10-27 06:11:33,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions. [2018-10-27 06:11:33,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:33,572 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-10-27 06:11:33,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions. [2018-10-27 06:11:33,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-27 06:11:33,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-27 06:11:33,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-10-27 06:11:33,574 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-10-27 06:11:33,574 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-10-27 06:11:33,574 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:11:33,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2018-10-27 06:11:33,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:11:33,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:33,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:33,578 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:33,578 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:11:33,578 INFO L793 eck$LassoCheckResult]: Stem: 237#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 233#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 234#L562 assume !(main_~length1~0 < 1); 240#L562-2 assume !(main_~length2~0 < 1); 235#L565-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 236#L570 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L570 226#L570-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L570-1 227#L571 assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 228#L553-6 assume true; 229#L552-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 241#L552-2 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L552-2 244#L552-3 cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 220#L552-4 assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 221#L553-5 [2018-10-27 06:11:33,579 INFO L795 eck$LassoCheckResult]: Loop: 221#L553-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 224#L553-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L553-1 238#L553-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 242#L553-3 assume !!(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 231#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 221#L553-5 [2018-10-27 06:11:33,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:33,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1016364753, now seen corresponding path program 1 times [2018-10-27 06:11:33,579 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:33,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:33,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:33,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:33,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:33,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:33,635 INFO L82 PathProgramCache]: Analyzing trace with hash 62061768, now seen corresponding path program 1 times [2018-10-27 06:11:33,636 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:33,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:33,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:33,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:33,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:33,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:33,643 INFO L82 PathProgramCache]: Analyzing trace with hash -382910472, now seen corresponding path program 1 times [2018-10-27 06:11:33,643 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:33,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:33,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:33,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:33,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:34,102 WARN L179 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 111 [2018-10-27 06:11:34,234 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-10-27 06:11:34,235 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:34,235 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:34,235 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:34,236 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:34,236 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:11:34,236 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:34,236 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:34,236 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:34,236 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-termination.c.i_Iteration3_Lasso [2018-10-27 06:11:34,236 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:34,236 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:34,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,512 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2018-10-27 06:11:34,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:35,108 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:35,108 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:11:35,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:35,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:35,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:35,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:35,111 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:35,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:35,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:35,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:35,116 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:35,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:35,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:35,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:35,118 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:35,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:35,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:35,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:35,126 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:35,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:35,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:35,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:35,128 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:35,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:35,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:35,131 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:35,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,132 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:11:35,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,135 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:11:35,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:35,148 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:35,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:35,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:35,155 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:35,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:35,157 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:35,158 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:35,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,164 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:35,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:35,168 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:35,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:35,170 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:35,178 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:35,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:35,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:35,185 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:35,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,186 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:11:35,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,188 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:11:35,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:35,197 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:35,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:35,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:35,204 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:35,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,205 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:35,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:35,207 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:35,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,211 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:11:35,211 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-10-27 06:11:35,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,222 INFO L402 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2018-10-27 06:11:35,222 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-10-27 06:11:35,267 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:35,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,270 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:35,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:35,294 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:11:35,307 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:11:35,308 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-10-27 06:11:35,308 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:11:35,308 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:11:35,309 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:11:35,309 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2018-10-27 06:11:35,516 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-10-27 06:11:35,518 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:11:35,518 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:11:35,518 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:11:35,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:35,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:35,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:35,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:35,682 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-10-27 06:11:35,682 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 29 transitions. cyclomatic complexity: 6 Second operand 6 states. [2018-10-27 06:11:35,783 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 29 transitions. cyclomatic complexity: 6. Second operand 6 states. Result 63 states and 71 transitions. Complement of second has 9 states. [2018-10-27 06:11:35,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:35,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:11:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2018-10-27 06:11:35,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 13 letters. Loop has 5 letters. [2018-10-27 06:11:35,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:35,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 18 letters. Loop has 5 letters. [2018-10-27 06:11:35,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:35,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 13 letters. Loop has 10 letters. [2018-10-27 06:11:35,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:35,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 71 transitions. [2018-10-27 06:11:35,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:11:35,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 42 states and 48 transitions. [2018-10-27 06:11:35,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-10-27 06:11:35,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-10-27 06:11:35,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 48 transitions. [2018-10-27 06:11:35,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:35,788 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-10-27 06:11:35,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 48 transitions. [2018-10-27 06:11:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2018-10-27 06:11:35,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-27 06:11:35,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-10-27 06:11:35,791 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-10-27 06:11:35,791 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-10-27 06:11:35,791 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:11:35,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 40 transitions. [2018-10-27 06:11:35,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:11:35,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:35,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:35,793 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:35,793 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:11:35,793 INFO L793 eck$LassoCheckResult]: Stem: 477#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 473#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 474#L562 assume !(main_~length1~0 < 1); 480#L562-2 assume !(main_~length2~0 < 1); 475#L565-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 476#L570 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L570 465#L570-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L570-1 466#L571 assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 467#L553-6 assume true; 468#L552-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 483#L552-2 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L552-2 485#L552-3 cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 486#L552-4 assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 492#L553-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 491#L553-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L553-1 489#L553-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 484#L553-3 assume !(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 469#L553-6 assume true; 470#L552-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 488#L552-2 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L552-2 487#L552-3 cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 459#L552-4 assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 460#L553-5 [2018-10-27 06:11:35,793 INFO L795 eck$LassoCheckResult]: Loop: 460#L553-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 463#L553-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L553-1 478#L553-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 481#L553-3 assume !!(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 471#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 460#L553-5 [2018-10-27 06:11:35,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:35,793 INFO L82 PathProgramCache]: Analyzing trace with hash 190697767, now seen corresponding path program 2 times [2018-10-27 06:11:35,793 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:35,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:35,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:35,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:35,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:35,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:35,843 INFO L82 PathProgramCache]: Analyzing trace with hash 62061768, now seen corresponding path program 2 times [2018-10-27 06:11:35,843 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:35,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:35,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:35,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:35,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:35,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:35,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1881666402, now seen corresponding path program 1 times [2018-10-27 06:11:35,852 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:35,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:35,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:35,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:35,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:36,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:36,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:36,981 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13b34db1-2a22-4f7e-aaaf-e92803809092/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-10-27 06:11:37,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:37,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:37,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-10-27 06:11:37,066 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 11 treesize of output 10 [2018-10-27 06:11:37,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:11:37,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:11:37,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:11:37,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2018-10-27 06:11:40,221 WARN L179 SmtUtils]: Spent 933.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 06:11:42,819 WARN L179 SmtUtils]: Spent 1.46 s on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 06:11:47,815 WARN L179 SmtUtils]: Spent 3.14 s on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 06:11:47,830 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 25 treesize of output 19 [2018-10-27 06:11:47,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-10-27 06:11:47,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:11:47,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:11:47,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:11:47,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-10-27 06:11:47,843 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:47,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:47,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 20 [2018-10-27 06:11:47,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 06:11:47,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=327, Unknown=4, NotChecked=0, Total=380 [2018-10-27 06:11:47,911 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. cyclomatic complexity: 8 Second operand 20 states. [2018-10-27 06:11:53,412 WARN L179 SmtUtils]: Spent 5.23 s on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-10-27 06:11:54,208 WARN L179 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2018-10-27 06:12:12,278 WARN L179 SmtUtils]: Spent 18.03 s on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2018-10-27 06:12:36,337 WARN L179 SmtUtils]: Spent 24.04 s on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2018-10-27 06:12:36,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:36,439 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-10-27 06:12:36,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-27 06:12:36,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 82 transitions. [2018-10-27 06:12:36,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:12:36,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 59 states and 65 transitions. [2018-10-27 06:12:36,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-10-27 06:12:36,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-10-27 06:12:36,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 65 transitions. [2018-10-27 06:12:36,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:12:36,445 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-10-27 06:12:36,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 65 transitions. [2018-10-27 06:12:36,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2018-10-27 06:12:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-27 06:12:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-10-27 06:12:36,450 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-10-27 06:12:36,450 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-10-27 06:12:36,450 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:12:36,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 47 transitions. [2018-10-27 06:12:36,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:12:36,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:36,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:36,452 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:36,452 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:12:36,452 INFO L793 eck$LassoCheckResult]: Stem: 721#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 717#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 718#L562 assume !(main_~length1~0 < 1); 724#L562-2 assume !(main_~length2~0 < 1); 719#L565-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 720#L570 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L570 709#L570-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L570-1 710#L571 assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 711#L553-6 assume true; 712#L552-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 725#L552-2 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L552-2 729#L552-3 cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 707#L552-4 assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 708#L553-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 736#L553-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L553-1 727#L553-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 728#L553-3 assume !!(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 716#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 704#L553-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 705#L553-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L553-1 723#L553-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 733#L553-3 assume !(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 713#L553-6 assume true; 714#L552-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 732#L552-2 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L552-2 730#L552-3 cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 706#L552-4 assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 702#L553-5 [2018-10-27 06:12:36,452 INFO L795 eck$LassoCheckResult]: Loop: 702#L553-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 703#L553-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L553-1 722#L553-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 726#L553-3 assume !!(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 715#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 702#L553-5 [2018-10-27 06:12:36,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:36,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1623299104, now seen corresponding path program 2 times [2018-10-27 06:12:36,452 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:36,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:36,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:36,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:36,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:36,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:36,484 INFO L82 PathProgramCache]: Analyzing trace with hash 62061768, now seen corresponding path program 3 times [2018-10-27 06:12:36,485 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:36,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:36,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:36,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:36,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:36,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:36,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1313350729, now seen corresponding path program 3 times [2018-10-27 06:12:36,492 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:36,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:36,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:36,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:36,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:37,232 WARN L179 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 170 [2018-10-27 06:12:37,396 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-10-27 06:12:37,398 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:12:37,398 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:12:37,398 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:12:37,398 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:12:37,398 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:12:37,398 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:37,398 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:12:37,398 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:12:37,398 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-termination.c.i_Iteration5_Lasso [2018-10-27 06:12:37,398 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:12:37,398 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:12:37,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:37,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:37,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:37,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-10-27 06:12:37,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-10-27 06:12:37,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-10-27 06:12:37,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-10-27 06:12:37,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:37,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:37,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:37,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:37,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:37,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:37,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:37,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:37,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:37,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:37,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:37,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:37,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:37,901 WARN L179 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 111 [2018-10-27 06:12:38,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:38,875 WARN L179 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-10-27 06:12:38,975 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:12:38,975 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:12:38,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:38,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:38,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:38,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:38,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:38,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:38,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:38,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:38,977 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:38,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:38,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:38,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:38,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:38,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:38,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:38,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:38,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:38,986 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:38,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:38,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:38,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:38,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:38,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:38,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:38,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:38,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:38,988 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:38,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-10-27 06:12:38,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:38,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:38,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:38,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:38,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:38,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:38,990 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:38,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-10-27 06:12:38,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:38,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:38,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:38,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:38,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:38,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:38,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:38,998 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:39,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-10-27 06:12:39,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:39,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:39,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:39,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:39,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:39,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:39,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:39,005 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:39,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-10-27 06:12:39,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:39,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:39,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:39,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:39,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:39,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:39,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:39,006 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:39,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:39,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:39,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:39,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:39,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:39,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:39,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:39,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:39,008 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:39,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:39,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:39,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:39,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:39,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:39,009 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:39,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:39,010 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:39,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-10-27 06:12:39,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:39,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:39,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:39,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:39,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:39,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:39,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:39,012 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:39,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:39,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:39,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:39,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:39,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:39,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:39,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:39,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:39,014 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:39,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:39,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:39,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:39,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:39,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:39,027 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:39,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:39,028 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:39,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:39,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:39,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:39,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:39,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:39,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:39,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:39,031 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:39,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:39,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:39,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:39,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:39,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:39,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:39,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:39,033 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:39,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:39,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:39,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:39,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:39,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:39,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:39,034 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:39,035 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:39,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:39,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:39,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:39,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:39,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:39,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:39,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:39,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:39,037 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:39,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:39,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:39,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:39,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:39,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:39,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:39,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:39,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:39,039 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:39,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:39,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:39,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:39,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:39,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:39,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:39,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:39,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:39,049 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:39,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:39,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:39,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:39,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:39,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:39,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:39,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:39,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:39,050 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:39,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:39,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:39,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:39,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:39,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:39,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:39,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:39,095 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:12:39,127 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:12:39,128 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:12:39,128 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:12:39,129 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:12:39,129 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:12:39,129 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2018-10-27 06:12:39,298 INFO L297 tatePredicateManager]: 31 out of 32 supporting invariants were superfluous and have been removed [2018-10-27 06:12:39,299 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:12:39,299 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:12:39,299 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:12:39,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:39,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:39,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:39,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:39,424 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-10-27 06:12:39,425 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-10-27 06:12:39,492 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 60 states and 67 transitions. Complement of second has 9 states. [2018-10-27 06:12:39,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:12:39,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:12:39,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2018-10-27 06:12:39,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 27 letters. Loop has 5 letters. [2018-10-27 06:12:39,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:39,493 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:12:39,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:39,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:39,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:39,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:39,636 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 3 loop predicates [2018-10-27 06:12:39,636 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-10-27 06:12:39,858 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 61 states and 68 transitions. Complement of second has 11 states. [2018-10-27 06:12:39,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 3 non-accepting loop states 1 accepting loop states [2018-10-27 06:12:39,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:12:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2018-10-27 06:12:39,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 27 letters. Loop has 5 letters. [2018-10-27 06:12:39,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:39,859 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:12:39,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:39,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:39,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:39,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:39,966 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-10-27 06:12:39,966 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-10-27 06:12:40,038 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 66 states and 74 transitions. Complement of second has 8 states. [2018-10-27 06:12:40,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:12:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:12:40,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2018-10-27 06:12:40,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 27 letters. Loop has 5 letters. [2018-10-27 06:12:40,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:40,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 32 letters. Loop has 5 letters. [2018-10-27 06:12:40,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:40,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 27 letters. Loop has 10 letters. [2018-10-27 06:12:40,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:40,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 74 transitions. [2018-10-27 06:12:40,043 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:12:40,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2018-10-27 06:12:40,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:12:40,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:12:40,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:12:40,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:40,044 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:40,044 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:40,044 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:40,044 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:12:40,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:12:40,044 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:12:40,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:12:40,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:12:40 BoogieIcfgContainer [2018-10-27 06:12:40,050 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:12:40,050 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:12:40,050 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:12:40,050 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:12:40,051 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:30" (3/4) ... [2018-10-27 06:12:40,054 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:12:40,054 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:12:40,055 INFO L168 Benchmark]: Toolchain (without parser) took 70961.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.9 MB). Free memory was 958.0 MB in the beginning and 961.4 MB in the end (delta: -3.3 MB). Peak memory consumption was 210.6 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:40,055 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:12:40,056 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.04 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 936.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:40,056 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 936.6 MB in the beginning and 1.2 GB in the end (delta: -214.3 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:40,057 INFO L168 Benchmark]: Boogie Preprocessor took 39.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:40,057 INFO L168 Benchmark]: RCFGBuilder took 511.04 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:40,058 INFO L168 Benchmark]: BuchiAutomizer took 69958.56 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 961.4 MB in the end (delta: 160.7 MB). Peak memory consumption was 223.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:40,058 INFO L168 Benchmark]: Witness Printer took 4.02 ms. Allocated memory is still 1.2 GB. Free memory is still 961.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:12:40,061 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.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.04 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 936.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 99.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 936.6 MB in the beginning and 1.2 GB in the end (delta: -214.3 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 511.04 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 69958.56 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 961.4 MB in the end (delta: 160.7 MB). Peak memory consumption was 223.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.02 ms. Allocated memory is still 1.2 GB. Free memory is still 961.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * 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-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * s1 and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * scanp and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * scanp and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 69.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 19.8s. Construction of modules took 0.4s. Büchi inclusion checks took 49.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 24 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: 0/0 HoareTripleCheckerStatistics: 146 SDtfs, 193 SDslu, 343 SDs, 0 SdLazy, 345 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital233 mio100 ax107 hnf99 lsp89 ukn98 mio100 lsp40 div100 bol100 ite100 ukn100 eq188 hnf87 smp91 dnf236 smp90 tf100 neg97 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 56ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 56 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...