./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_11e94800-4eb1-40c7-9c3c-cb85761550e3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_11e94800-4eb1-40c7-9c3c-cb85761550e3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_11e94800-4eb1-40c7-9c3c-cb85761550e3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_11e94800-4eb1-40c7-9c3c-cb85761550e3/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_11e94800-4eb1-40c7-9c3c-cb85761550e3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_11e94800-4eb1-40c7-9c3c-cb85761550e3/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 32bit --witnessprinter.graph.data.programhash 37ce12f320cb92b62d01decbfb4f63ee1143a42a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 07:39:05,528 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:39:05,530 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:39:05,537 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:39:05,537 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:39:05,538 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:39:05,539 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:39:05,540 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:39:05,541 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:39:05,542 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:39:05,542 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:39:05,542 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:39:05,543 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:39:05,543 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:39:05,544 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:39:05,544 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:39:05,545 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:39:05,546 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:39:05,547 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:39:05,548 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:39:05,549 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:39:05,549 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:39:05,551 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:39:05,551 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:39:05,551 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:39:05,552 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:39:05,552 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:39:05,553 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:39:05,554 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:39:05,554 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:39:05,554 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:39:05,555 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:39:05,555 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:39:05,555 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:39:05,556 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:39:05,556 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:39:05,557 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_11e94800-4eb1-40c7-9c3c-cb85761550e3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 07:39:05,565 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:39:05,565 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:39:05,566 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:39:05,566 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:39:05,566 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 07:39:05,566 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 07:39:05,566 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 07:39:05,567 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 07:39:05,567 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 07:39:05,567 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 07:39:05,567 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 07:39:05,567 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:39:05,567 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 07:39:05,567 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 07:39:05,568 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:39:05,568 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 07:39:05,568 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:39:05,568 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 07:39:05,568 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 07:39:05,568 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 07:39:05,568 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 07:39:05,569 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:39:05,569 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 07:39:05,569 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:39:05,569 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 07:39:05,569 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:39:05,569 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 07:39:05,569 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 07:39:05,569 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:39:05,570 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 07:39:05,570 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 07:39:05,570 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 07:39:05,570 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_11e94800-4eb1-40c7-9c3c-cb85761550e3/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 37ce12f320cb92b62d01decbfb4f63ee1143a42a [2018-11-23 07:39:05,593 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:39:05,600 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:39:05,602 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:39:05,603 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:39:05,603 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:39:05,604 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_11e94800-4eb1-40c7-9c3c-cb85761550e3/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-11-23 07:39:05,640 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_11e94800-4eb1-40c7-9c3c-cb85761550e3/bin-2019/uautomizer/data/18ebbcc9c/b94284cf58784344a1e290f9abf19d24/FLAG04ff71695 [2018-11-23 07:39:06,082 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:39:06,082 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_11e94800-4eb1-40c7-9c3c-cb85761550e3/sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-11-23 07:39:06,090 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_11e94800-4eb1-40c7-9c3c-cb85761550e3/bin-2019/uautomizer/data/18ebbcc9c/b94284cf58784344a1e290f9abf19d24/FLAG04ff71695 [2018-11-23 07:39:06,100 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_11e94800-4eb1-40c7-9c3c-cb85761550e3/bin-2019/uautomizer/data/18ebbcc9c/b94284cf58784344a1e290f9abf19d24 [2018-11-23 07:39:06,102 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:39:06,103 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:39:06,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:39:06,104 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:39:06,106 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:39:06,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:39:06" (1/1) ... [2018-11-23 07:39:06,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7928f009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:39:06, skipping insertion in model container [2018-11-23 07:39:06,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:39:06" (1/1) ... [2018-11-23 07:39:06,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:39:06,144 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:39:06,334 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:39:06,340 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:39:06,409 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:39:06,431 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:39:06,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:39:06 WrapperNode [2018-11-23 07:39:06,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:39:06,432 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:39:06,433 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:39:06,433 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:39:06,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:39:06" (1/1) ... [2018-11-23 07:39:06,448 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:39:06" (1/1) ... [2018-11-23 07:39:06,463 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:39:06,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:39:06,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:39:06,463 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:39:06,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:39:06" (1/1) ... [2018-11-23 07:39:06,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:39:06" (1/1) ... [2018-11-23 07:39:06,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:39:06" (1/1) ... [2018-11-23 07:39:06,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:39:06" (1/1) ... [2018-11-23 07:39:06,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:39:06" (1/1) ... [2018-11-23 07:39:06,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:39:06" (1/1) ... [2018-11-23 07:39:06,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:39:06" (1/1) ... [2018-11-23 07:39:06,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:39:06,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:39:06,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:39:06,478 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:39:06,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:39:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11e94800-4eb1-40c7-9c3c-cb85761550e3/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:39:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 07:39:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 07:39:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 07:39:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 07:39:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:39:06,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:39:06,666 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:39:06,666 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 07:39:06,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:39:06 BoogieIcfgContainer [2018-11-23 07:39:06,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:39:06,667 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 07:39:06,667 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 07:39:06,670 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 07:39:06,670 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:39:06,670 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 07:39:06" (1/3) ... [2018-11-23 07:39:06,671 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f5c321f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 07:39:06, skipping insertion in model container [2018-11-23 07:39:06,671 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:39:06,672 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:39:06" (2/3) ... [2018-11-23 07:39:06,672 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f5c321f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 07:39:06, skipping insertion in model container [2018-11-23 07:39:06,672 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:39:06,672 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:39:06" (3/3) ... [2018-11-23 07:39:06,673 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-11-23 07:39:06,712 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 07:39:06,713 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 07:39:06,713 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 07:39:06,713 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 07:39:06,713 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 07:39:06,713 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 07:39:06,713 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 07:39:06,713 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 07:39:06,713 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 07:39:06,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-23 07:39:06,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 07:39:06,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:39:06,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:39:06,741 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 07:39:06,741 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 07:39:06,741 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 07:39:06,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-23 07:39:06,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 07:39:06,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:39:06,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:39:06,743 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 07:39:06,743 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 07:39:06,750 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true 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; 7#L555true assume !(main_~length1~0 < 1); 11#L555-2true assume !(main_~length2~0 < 1); 4#L558-1true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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; 12#L546-4true [2018-11-23 07:39:06,750 INFO L796 eck$LassoCheckResult]: Loop: 12#L546-4true cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 8#L545-1true assume !!(0 != cstrpbrk_~c~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; 9#L546-3true assume !true; 12#L546-4true [2018-11-23 07:39:06,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:39:06,755 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-23 07:39:06,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:39:06,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:39:06,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:06,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:39:06,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:39:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:39:06,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:39:06,858 INFO L82 PathProgramCache]: Analyzing trace with hash 49828, now seen corresponding path program 1 times [2018-11-23 07:39:06,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:39:06,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:39:06,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:06,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:39:06,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:06,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:06,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:39:06,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-23 07:39:06,881 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 07:39:06,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 07:39:06,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 07:39:06,893 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-11-23 07:39:06,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:39:06,898 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-11-23 07:39:06,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 07:39:06,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-11-23 07:39:06,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 07:39:06,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2018-11-23 07:39:06,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 07:39:06,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 07:39:06,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-11-23 07:39:06,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:39:06,906 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 07:39:06,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-11-23 07:39:06,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-23 07:39:06,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 07:39:06,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-23 07:39:06,925 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 07:39:06,925 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 07:39:06,925 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 07:39:06,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-23 07:39:06,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 07:39:06,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:39:06,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:39:06,926 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 07:39:06,926 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 07:39:06,927 INFO L794 eck$LassoCheckResult]: Stem: 46#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#L-1 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; 39#L555 assume !(main_~length1~0 < 1); 40#L555-2 assume !(main_~length2~0 < 1); 41#L558-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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; 42#L546-4 [2018-11-23 07:39:06,927 INFO L796 eck$LassoCheckResult]: Loop: 42#L546-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 43#L545-1 assume !!(0 != cstrpbrk_~c~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; 45#L546-3 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, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 47#L546-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 42#L546-4 [2018-11-23 07:39:06,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:39:06,927 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-23 07:39:06,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:39:06,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:39:06,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:06,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:39:06,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:39:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:39:06,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:39:06,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1544297, now seen corresponding path program 1 times [2018-11-23 07:39:06,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:39:06,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:39:06,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:06,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:39:06,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:39:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:39:06,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:39:06,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1298350894, now seen corresponding path program 1 times [2018-11-23 07:39:06,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:39:06,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:39:06,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:06,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:39:06,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:39:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:39:07,316 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2018-11-23 07:39:07,392 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:39:07,393 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:39:07,393 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:39:07,393 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:39:07,393 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:39:07,394 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:39:07,394 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:39:07,394 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:39:07,394 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-23 07:39:07,394 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:39:07,394 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:39:07,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:07,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:07,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:07,620 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2018-11-23 07:39:07,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:07,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:07,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:07,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:07,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:07,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-11-23 07:39:07,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:07,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-11-23 07:39:07,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:07,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:07,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:07,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:07,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-11-23 07:39:07,981 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:39:07,984 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:39:07,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-11-23 07:39:07,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:07,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:39:07,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:07,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:07,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:07,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:39:07,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:39:07,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:07,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-11-23 07:39:07,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:07,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:39:07,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:07,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:07,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:07,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:39:07,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:39:07,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:07,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:07,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:07,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:39:07,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:07,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:07,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:07,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:39:07,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:39:07,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:07,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:07,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:07,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:07,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:07,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:08,001 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:39:08,001 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:39:08,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:08,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:08,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:08,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:08,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:08,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:08,007 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:39:08,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:39:08,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:08,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:08,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:08,020 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 07:39:08,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:08,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:08,022 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:39:08,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:39:08,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:08,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-11-23 07:39:08,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:08,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:08,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:08,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:08,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:39:08,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:39:08,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:08,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:08,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:08,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:08,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:08,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:08,039 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:39:08,039 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:39:08,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:08,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:08,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:08,044 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 07:39:08,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:08,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:08,046 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:39:08,046 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:39:08,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:08,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:08,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:08,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:39:08,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:08,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:08,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:08,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:39:08,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:39:08,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:08,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:08,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:08,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:08,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:08,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:08,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:39:08,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:39:08,098 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:39:08,125 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 07:39:08,125 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 07:39:08,127 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:39:08,128 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 07:39:08,128 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:39:08,129 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1) = -1*ULTIMATE.start_cstrpbrk_~s1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 Supporting invariants [] [2018-11-23 07:39:08,167 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 07:39:08,173 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 07:39:08,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:39:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:08,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:39:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:08,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:39:08,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:08,257 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 07:39:08,258 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-23 07:39:08,309 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 16 states and 20 transitions. Complement of second has 4 states. [2018-11-23 07:39:08,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 07:39:08,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 07:39:08,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-23 07:39:08,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-23 07:39:08,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:39:08,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-23 07:39:08,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:39:08,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-23 07:39:08,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:39:08,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2018-11-23 07:39:08,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 07:39:08,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 19 transitions. [2018-11-23 07:39:08,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 07:39:08,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 07:39:08,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-11-23 07:39:08,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:39:08,317 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-23 07:39:08,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-11-23 07:39:08,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-11-23 07:39:08,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 07:39:08,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-11-23 07:39:08,319 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-23 07:39:08,319 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-23 07:39:08,319 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 07:39:08,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-11-23 07:39:08,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 07:39:08,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:39:08,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:39:08,320 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:39:08,320 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 07:39:08,320 INFO L794 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 152#L-1 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; 153#L555 assume !(main_~length1~0 < 1); 154#L555-2 assume !(main_~length2~0 < 1); 155#L558-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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; 156#L546-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 157#L545-1 assume !!(0 != cstrpbrk_~c~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; 161#L546-3 [2018-11-23 07:39:08,321 INFO L796 eck$LassoCheckResult]: Loop: 161#L546-3 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, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 164#L546-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 160#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 161#L546-3 [2018-11-23 07:39:08,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:39:08,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2018-11-23 07:39:08,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:39:08,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:39:08,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:08,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:39:08,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:39:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:39:08,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:39:08,340 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 1 times [2018-11-23 07:39:08,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:39:08,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:39:08,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:08,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:39:08,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:39:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:39:08,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:39:08,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1594172151, now seen corresponding path program 1 times [2018-11-23 07:39:08,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:39:08,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:39:08,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:08,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:39:08,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:39:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:39:08,571 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2018-11-23 07:39:08,652 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:39:08,652 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:39:08,652 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:39:08,653 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:39:08,653 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:39:08,653 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:39:08,653 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:39:08,653 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:39:08,653 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-23 07:39:08,653 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:39:08,653 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:39:08,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:08,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:08,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:08,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:08,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:08,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:08,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:08,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:08,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:08,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:08,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:08,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:08,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:08,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:08,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:08,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:09,123 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:39:09,124 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:39:09,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:09,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:09,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:39:09,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:09,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:09,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:09,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:39:09,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:39:09,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:09,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:09,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:09,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:39:09,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:09,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:09,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:09,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:39:09,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:39:09,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:09,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-11-23 07:39:09,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:09,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:39:09,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:09,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:09,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:09,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:39:09,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:39:09,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:09,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:09,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:09,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:39:09,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:09,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:09,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:09,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:39:09,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:39:09,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:09,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-11-23 07:39:09,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:09,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:09,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:09,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:09,129 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:39:09,129 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:39:09,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:09,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:09,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:09,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:39:09,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:09,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:09,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:09,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:39:09,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:39:09,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:09,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:09,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:09,133 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 07:39:09,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:09,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:09,133 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:39:09,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:39:09,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:09,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:09,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:09,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:09,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:09,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:09,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:39:09,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:39:09,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:09,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:09,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:09,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:09,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:09,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:09,143 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:39:09,143 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:39:09,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:09,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:09,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:09,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:09,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:09,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:09,147 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:39:09,147 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:39:09,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:09,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:09,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:09,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:09,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:09,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:09,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:39:09,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:39:09,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:09,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:09,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:09,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:09,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:09,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:09,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:39:09,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:39:09,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:09,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:09,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:09,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:09,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:09,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:09,162 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:39:09,162 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:39:09,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:09,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:09,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:09,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:09,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:09,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:09,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:39:09,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:39:09,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:09,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:09,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:09,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:09,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:09,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:09,172 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:39:09,172 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:39:09,185 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:39:09,197 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 07:39:09,197 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 07:39:09,198 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:39:09,199 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 07:39:09,200 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:39:09,200 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_2, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_2 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2018-11-23 07:39:09,235 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-23 07:39:09,237 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 07:39:09,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:39:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:09,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:39:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:09,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:39:09,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:09,296 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 07:39:09,296 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-23 07:39:09,321 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 31 states and 38 transitions. Complement of second has 6 states. [2018-11-23 07:39:09,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 07:39:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 07:39:09,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-23 07:39:09,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 07:39:09,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:39:09,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-23 07:39:09,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:39:09,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-23 07:39:09,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:39:09,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2018-11-23 07:39:09,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 07:39:09,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 27 transitions. [2018-11-23 07:39:09,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 07:39:09,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-23 07:39:09,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2018-11-23 07:39:09,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:39:09,326 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-11-23 07:39:09,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2018-11-23 07:39:09,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-11-23 07:39:09,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 07:39:09,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-11-23 07:39:09,328 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-23 07:39:09,328 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-23 07:39:09,328 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 07:39:09,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-11-23 07:39:09,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 07:39:09,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:39:09,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:39:09,329 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:39:09,329 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 07:39:09,329 INFO L794 eck$LassoCheckResult]: Stem: 320#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 308#L-1 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; 309#L555 assume !(main_~length1~0 < 1); 310#L555-2 assume !(main_~length2~0 < 1); 311#L558-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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; 312#L546-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 313#L545-1 assume !!(0 != cstrpbrk_~c~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; 319#L546-3 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, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 322#L546-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 314#L546-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 315#L545-1 assume !!(0 != cstrpbrk_~c~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; 317#L546-3 [2018-11-23 07:39:09,329 INFO L796 eck$LassoCheckResult]: Loop: 317#L546-3 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, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 321#L546-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 316#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 317#L546-3 [2018-11-23 07:39:09,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:39:09,329 INFO L82 PathProgramCache]: Analyzing trace with hash -2120273357, now seen corresponding path program 2 times [2018-11-23 07:39:09,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:39:09,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:39:09,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:09,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:39:09,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:39:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:39:09,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:39:09,346 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 2 times [2018-11-23 07:39:09,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:39:09,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:39:09,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:09,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:39:09,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:39:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:39:09,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:39:09,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1020472847, now seen corresponding path program 1 times [2018-11-23 07:39:09,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:39:09,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:39:09,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:09,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:39:09,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:09,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:09,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:39:09,401 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11e94800-4eb1-40c7-9c3c-cb85761550e3/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:39:09,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:39:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:09,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:39:09,449 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-11-23 07:39:09,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-23 07:39:09,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:39:09,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-11-23 07:39:09,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-23 07:39:09,481 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 07:39:09,497 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:39:09,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:39:09,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-11-23 07:39:09,505 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2018-11-23 07:39:14,331 WARN L180 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-23 07:39:15,865 WARN L180 SmtUtils]: Spent 754.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-23 07:39:15,879 INFO L478 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-11-23 07:39:15,882 INFO L478 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-11-23 07:39:15,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:39:15,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:39:15,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:39:15,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-11-23 07:39:15,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:15,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:39:15,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-11-23 07:39:15,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 07:39:15,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=101, Unknown=3, NotChecked=0, Total=132 [2018-11-23 07:39:15,939 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 12 states. [2018-11-23 07:39:18,067 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-11-23 07:39:21,674 WARN L180 SmtUtils]: Spent 3.59 s on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2018-11-23 07:39:21,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:39:21,710 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-11-23 07:39:21,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 07:39:21,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2018-11-23 07:39:21,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 07:39:21,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 28 transitions. [2018-11-23 07:39:21,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 07:39:21,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 07:39:21,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2018-11-23 07:39:21,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:39:21,712 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-23 07:39:21,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2018-11-23 07:39:21,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-11-23 07:39:21,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 07:39:21,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-11-23 07:39:21,713 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-23 07:39:21,713 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-23 07:39:21,713 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 07:39:21,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-11-23 07:39:21,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 07:39:21,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:39:21,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:39:21,713 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:39:21,713 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 07:39:21,713 INFO L794 eck$LassoCheckResult]: Stem: 431#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 419#L-1 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; 420#L555 assume !(main_~length1~0 < 1); 421#L555-2 assume !(main_~length2~0 < 1); 422#L558-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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; 423#L546-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 424#L545-1 assume !!(0 != cstrpbrk_~c~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; 434#L546-3 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, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 433#L546-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 429#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 430#L546-3 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, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 435#L546-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 425#L546-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 426#L545-1 assume !!(0 != cstrpbrk_~c~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; 428#L546-3 [2018-11-23 07:39:21,714 INFO L796 eck$LassoCheckResult]: Loop: 428#L546-3 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, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 432#L546-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 427#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 428#L546-3 [2018-11-23 07:39:21,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:39:21,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1095399647, now seen corresponding path program 2 times [2018-11-23 07:39:21,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:39:21,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:39:21,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:21,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:39:21,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:39:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:39:21,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:39:21,728 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 3 times [2018-11-23 07:39:21,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:39:21,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:39:21,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:21,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:39:21,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:39:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:39:21,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:39:21,732 INFO L82 PathProgramCache]: Analyzing trace with hash -110602269, now seen corresponding path program 3 times [2018-11-23 07:39:21,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:39:21,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:39:21,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:21,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:39:21,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:39:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:39:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:39:22,185 WARN L180 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 156 [2018-11-23 07:39:22,288 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:39:22,288 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:39:22,288 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:39:22,288 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:39:22,288 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:39:22,288 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:39:22,288 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:39:22,288 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:39:22,288 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-23 07:39:22,288 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:39:22,288 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:39:22,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:22,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:22,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:22,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:22,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:22,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:22,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:22,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:22,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:22,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:22,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:22,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:22,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:22,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:22,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:22,585 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2018-11-23 07:39:22,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:22,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:39:23,191 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-11-23 07:39:23,237 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:39:23,237 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:39:23,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:23,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:23,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:39:23,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:23,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:23,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:23,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:39:23,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:39:23,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:23,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:23,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:23,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:39:23,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:23,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:23,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:23,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:39:23,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:39:23,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:23,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:23,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:23,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:39:23,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:23,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:23,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:23,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:39:23,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:39:23,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:23,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:23,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:23,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:39:23,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:23,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:23,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:23,250 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:39:23,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:39:23,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:23,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:23,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:23,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:23,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:23,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:23,251 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:39:23,251 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:39:23,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:23,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:23,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:23,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:39:23,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:23,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:23,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:23,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:39:23,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:39:23,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:23,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:23,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:23,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:39:23,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:23,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:23,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:23,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:39:23,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:39:23,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:23,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:23,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:23,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:39:23,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:23,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:23,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:23,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:39:23,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:39:23,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:23,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:23,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:23,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:39:23,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:23,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:23,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:23,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:39:23,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:39:23,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:23,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:23,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:23,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:23,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:23,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:23,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:39:23,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:39:23,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:23,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:23,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:23,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:23,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:23,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:23,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:39:23,260 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:39:23,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:23,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:23,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:23,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:39:23,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:23,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:23,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:23,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:39:23,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:39:23,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:23,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:23,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:23,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:39:23,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:23,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:23,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:23,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:39:23,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:39:23,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:23,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:23,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:23,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:39:23,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:23,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:23,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:23,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:39:23,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:39:23,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:23,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:23,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:23,266 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 07:39:23,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:23,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:23,267 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:39:23,267 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:39:23,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:23,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:23,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:23,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:23,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:23,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:23,273 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:39:23,273 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:39:23,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:23,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:23,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:23,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:23,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:23,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:23,277 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:39:23,277 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:39:23,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:23,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:23,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:23,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:23,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:23,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:23,279 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:39:23,279 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:39:23,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:39:23,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:39:23,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:39:23,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:39:23,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:39:23,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:39:23,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:39:23,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:39:23,305 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:39:23,317 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 07:39:23,317 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 07:39:23,318 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:39:23,318 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 07:39:23,319 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:39:23,319 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~s2.base)_1, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s2.base)_1 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2018-11-23 07:39:23,409 INFO L297 tatePredicateManager]: 33 out of 34 supporting invariants were superfluous and have been removed [2018-11-23 07:39:23,411 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 07:39:23,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:39:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:23,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:39:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:23,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:39:23,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:23,458 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 07:39:23,458 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-23 07:39:23,475 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 28 states and 35 transitions. Complement of second has 5 states. [2018-11-23 07:39:23,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 07:39:23,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 07:39:23,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-11-23 07:39:23,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 07:39:23,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:39:23,476 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 07:39:23,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:39:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:23,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:39:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:23,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:39:23,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:23,533 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 07:39:23,533 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-23 07:39:23,555 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 29 states and 36 transitions. Complement of second has 5 states. [2018-11-23 07:39:23,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 07:39:23,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 07:39:23,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-23 07:39:23,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 07:39:23,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:39:23,557 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 07:39:23,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:39:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:23,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:39:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:23,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:39:23,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:23,602 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 07:39:23,602 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-23 07:39:23,618 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 24 states and 29 transitions. Complement of second has 4 states. [2018-11-23 07:39:23,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 07:39:23,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 07:39:23,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2018-11-23 07:39:23,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 07:39:23,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:39:23,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-23 07:39:23,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:39:23,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-23 07:39:23,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:39:23,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2018-11-23 07:39:23,620 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 07:39:23,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2018-11-23 07:39:23,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 07:39:23,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 07:39:23,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 07:39:23,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:39:23,621 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:39:23,621 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:39:23,621 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:39:23,621 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 07:39:23,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 07:39:23,621 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 07:39:23,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 07:39:23,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 07:39:23 BoogieIcfgContainer [2018-11-23 07:39:23,625 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 07:39:23,625 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:39:23,625 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:39:23,626 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:39:23,626 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:39:06" (3/4) ... [2018-11-23 07:39:23,628 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 07:39:23,628 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:39:23,629 INFO L168 Benchmark]: Toolchain (without parser) took 17526.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.7 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -102.4 MB). Peak memory consumption was 106.3 MB. Max. memory is 11.5 GB. [2018-11-23 07:39:23,629 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:39:23,629 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -163.5 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-23 07:39:23,630 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:39:23,630 INFO L168 Benchmark]: Boogie Preprocessor took 15.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:39:23,630 INFO L168 Benchmark]: RCFGBuilder took 188.58 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-23 07:39:23,630 INFO L168 Benchmark]: BuchiAutomizer took 16958.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.6 MB). Peak memory consumption was 116.3 MB. Max. memory is 11.5 GB. [2018-11-23 07:39:23,631 INFO L168 Benchmark]: Witness Printer took 2.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:39:23,632 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 328.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -163.5 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 188.58 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16958.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.6 MB). Peak memory consumption was 116.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * 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 #length * 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 -1 * s1 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * scanp and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s2] + -1 * scanp and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 10.6s. Construction of modules took 0.0s. Büchi inclusion checks took 6.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 89 SDtfs, 82 SDslu, 73 SDs, 0 SdLazy, 118 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital221 mio100 ax100 hnf99 lsp96 ukn80 mio100 lsp42 div100 bol100 ite100 ukn100 eq191 hnf87 smp97 dnf232 smp90 tf100 neg97 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...